会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • SETS OF RATE-COMPATIBLE UNIVERSAL TURBO CODES NEARLY OPTIMIZED OVER VARIOUS RATES AND INTERLEAVER SIZES
    • 通过各种速率和交叉尺寸优化的通用普通涡轮编码设置
    • US20110131465A1
    • 2011-06-02
    • US13025378
    • 2011-02-11
    • Mustafa ErozA. Roger Hammons, JR.
    • Mustafa ErozA. Roger Hammons, JR.
    • H03M13/05G06F11/10
    • H03M13/2957H03M13/258H03M13/6312H03M13/6381H04L1/005H04L1/0066H04L1/0069
    • A method and apparatus for Turbo encoding uses a set of rate-compatible Turbo Codes optimized at high code rates and derived from a universal constituent code. The Turbo Codes have rate-compatible puncturing patterns. The method comprises: encoding a signal at a first and second encoder using a best rate 1/2 constituent code universal with higher code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for each information bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing patterns; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern. In a variation, the best rate 1/2 constituent code represents a concatenation of polynomials 1+D2+D3 (octal 13) and 1+D+D3 (octal 15), D a data bit. A Turbo Encoder is provided which has hardware to implement the method.
    • 用于Turbo编码的方法和装置使用一组以高码率优化并由通用组成码导出的速率兼容Turbo码。 Turbo码具有速率兼容的穿孔模式。 该方法包括:使用具有较高码率的通用的最佳速率1/2构成码对第一和第二编码器处的信号进行编码,第一编码器和第二编码器分别为每个信息比特产生相应的多个奇偶校验位; 在每个编码器处以更高速率的最佳穿孔模式对相应的多个奇偶校验位进行穿孔; 以及在每个编码器处以较低速率的最佳打孔图案对相应的多个奇偶校验位进行穿孔。 在一个变型中,最佳速率1/2分量代码表示多项式1 + D2 + D3(八进制13)和1 + D + D3(八进制15),D是数据比特的级联。 提供了一种具有执行该方法的硬件的Turbo编码器。
    • 3. 发明申请
    • METHOD FOR A GENERAL NEAR OPTIMAL TURBO CODE TRELLIS TERMINATION
    • 一般接近最佳涡轮代码TRELLIS终止的方法
    • US20120233519A1
    • 2012-09-13
    • US13475572
    • 2012-05-18
    • Mustafa ErozA. Roger Hammons, JR.
    • Mustafa ErozA. Roger Hammons, JR.
    • H03M13/29G06F11/10
    • H03M13/6362H03M13/2903H03M13/2993H03M13/2996H03M13/4123
    • A method of terminating two or more constituent encoders of a turbo encoder employing a turbo code, comprising the steps of: generating tail input bits at each of two or more constituent encoders, including deriving the tail input bits from each of the two or more constituent encoders separately from a contents of shift registers within each of the two or more constituent encoders, after an encoding of information bits by the two or more constituent encoders; puncturing one or more tail output bits such that 1/R output tail bits are transmitted for each of a plurality of trellis branches, wherein R is a turbo code rate employed by the turbo encoder during an information bit transmission. In yet another variation, the step of puncturing the tail output bits further comprises the step of: transmitting, during trellis termination, the tail output bits, only if they are sent from an output branch of one of the two or more constituent encoders that are used during information bit transmission.
    • 一种终止采用turbo码的turbo编码器的两个或多个组成编码器的方法,包括以下步骤:在两个或更多个组成编码器中的每一个处生成尾部输入位,包括从两个或更多个成分中的每一个导出尾部输入位 在两个或多个组成编码器对信息比特进行编码之后,与两个或更多个组成编码器中的每一个中的移位寄存器的内容分开编码; 对一个或多个尾部输出位进行穿孔,使得对于多个网格分支中的每一个发送1 / R个输出尾比特,其中R是在信息比特传输期间由turbo编码器采用的turbo码率。 在另一个实施例中,打孔尾部输出位的步骤还包括以下步骤:在网格终止期间,仅在从两个或更多个组成编码器之一的输出分支发送尾部输出位时发送尾部输出位, 在信息位传输期间使用。
    • 4. 发明申请
    • SETS OF RATE-COMPATIBLE UNIVERSAL TURBO CODES NEARLY OPTIMIZED OVER VARIOUS RATES AND INTERLEAVER SIZES
    • 通过各种速率和交叉尺寸优化的通用普通涡轮编码设置
    • US20090217141A1
    • 2009-08-27
    • US12435237
    • 2009-05-04
    • Mustafa ErozA. Roger Hammons, JR.
    • Mustafa ErozA. Roger Hammons, JR.
    • H03M13/27G06F11/10
    • H03M13/2957H03M13/258H03M13/6312H03M13/6381H04L1/005H04L1/0066H04L1/0069
    • A method and apparatus for Turbo encoding uses a set of rate-compatible Turbo Codes optimized at high code rates and derived from a universal constituent code. The Turbo Codes have rate-compatible puncturing patterns.The method comprises: encoding a signal at a first and second encoder using a best rate 1/2 constituent code universal with higher code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for each information bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing patterns; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern. In a variation, the best rate 1/2 constituent code represents a concatenation of polynomials 1+D2+D3 (octal 13) and 1+D+D3 (octal 15), D a data bit. A Turbo Encoder is provided which has hardware to implement the method.
    • 用于Turbo编码的方法和装置使用一组以高码率优化并由通用组成码导出的速率兼容Turbo码。 Turbo码具有速率兼容的穿孔模式。 该方法包括:使用具有较高码率的通用最佳速率1/2构成码在第一和第二编码器处对信号进行编码,第一编码器和第二编码器为每个信息比特产生相应的多个奇偶校验位; 在每个编码器处以更高速率的最佳穿孔模式对相应的多个奇偶校验位进行穿孔; 以及在每个编码器处以较低速率的最佳打孔图案对相应的多个奇偶校验位进行穿孔。 在一个变型中,最佳速率1/2分量代码表示多项式1 + D2 + D3(八进制13)和1 + D + D3(八进制15),D是数据比特的级联。 提供了一种具有执行该方法的硬件的Turbo编码器。
    • 5. 发明申请
    • Systems and Methods for a Rateless Round Robin Protocol for Adaptive Error Control
    • 用于自适应错误控制的无人循环协议的系统和方法
    • US20100281331A1
    • 2010-11-04
    • US12770307
    • 2010-04-29
    • A. Roger Hammons, JR.
    • A. Roger Hammons, JR.
    • G06F11/08G06F5/00G06F3/00
    • H04L1/1812H04L1/1829H04L1/1874
    • Systems and methods implementing a protocol that provides reliable transport over a point-to-point link characterized by deep and sustained fades. Such a communications link may be a free space optical channel or may be a radio frequency point-to-point channel. Data frames are processed through a circular data buffer that operates in a round robin fashion at a transmission node. The coding and forward error correction processes allow for continued operation in spite of possible signal fades due to atmospheric turbulence or other causes. At a receive node, incoming data is also saved in a circular buffer. A re-acknowledgment list is maintained at the receive node for tracking recently received and decoded data. This allows for a new acknowledgment to be sent in the event that a previously sent acknowledgment failed to reach the transmission node.
    • 实施协议的系统和方法,其提供以深而持续的衰落为特征的点对点链路的可靠传输。 这样的通信链路可以是自由空间光信道,或者可以是射频点对点信道。 通过循环数据缓冲器来处理数据帧,循环数据缓冲器在传输节点处以循环方式工作。 尽管由于大气湍流或其他原因,尽管可能的信号衰减,编码和前向纠错处理允许继续操作。 在接收节点,传入数据也保存在循环缓冲区中。 在接收节点处保持重新确认列表,用于跟踪最近接收和解码的数据。 这允许在先前发送的确认未能到达传输节点的情况下发送新的确认。
    • 6. 发明申请
    • System and Method for Topology Optimization of Directional Network
    • 定向网络拓扑优化的系统与方法
    • US20120155330A1
    • 2012-06-21
    • US13329790
    • 2011-12-19
    • A. Roger Hammons, JR.
    • A. Roger Hammons, JR.
    • H04L12/28
    • H04W40/248H04W16/28H04W72/046
    • The present invention includes a system and method by which a network of directional, wireless nodes that are not fixed in space can be optimized by optimizing each node individually. The network does not have a central control node, so each node is responsible for optimizing its surrounding topology. This is accomplished by synthesizing incoming information from neighboring nodes and determining which nodes will provide the best connections based on specific utilities each node is attempting to optimize. Neighboring nodes then exchange messages to request, accept, or reject directional connections between them based on their preferred optimizations. The overall directional network topology is achieved by consensus driven by local preferences.
    • 本发明包括可以通过单独优化每个节点来优化在空间中不固定的定向无线节点的网络的系统和方法。 网络没有中央控制节点,因此每个节点负责优化其周围拓扑。 这是通过合成来自相邻节点的传入信息并且基于每个节点尝试优化的特定实用来确定哪些节点将提供最佳连接来实现的。 然后,相邻节点根据其优选优化来交换消息以请求,接受或拒绝它们之间的定向连接。 整体定向网络拓扑通过局部偏好驱动的共识来实现。
    • 8. 发明申请
    • System and Method for Frame Synchronization
    • 帧同步系统和方法
    • US20100260208A1
    • 2010-10-14
    • US12759329
    • 2010-04-13
    • A. Roger Hammons, JR.Frederic M. Davidson
    • A. Roger Hammons, JR.Frederic M. Davidson
    • H04J3/06
    • H04L7/042H04L7/0008
    • A system and method for calculating and applying a metric that is calculated over a binary interval that corresponds in length to a preamble. The value of the metric reflects the likelihood that the interval is the preamble. A lower value for the metric suggests that the interval is more likely to be the preamble. In an embodiment, the metric is calculated beginning at an initial location in the bitstream, and then recalculated beginning at each of several successive locations in the bitstream. This results in a set of calculated metrics. The start of the preamble is considered likely to be the initial location of the interval that corresponds to the metric having the lowest value.
    • 一种用于计算和应用在长度上对应于前导码的二进制间隔上计算的度量的系统和方法。 度量的值反映了间隔是前导码的可能性。 该度量的较低值表明间隔更有可能是前导码。 在一个实施例中,从比特流中的初始位置开始计算度量,然后从位流中的几个连续位置中的每一个开始重新计算。 这导致一组计算的指标。 认为前导码的开始可能是对应于具有最低值的度量的间隔的初始位置。