专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06693983B1 Method and system for detection of short digital radio messages 失效
标题翻译：用于检测短数字无线电信息的方法和系统
公开(公告)号：US06693983B1
公开(公告)日：2004-02-17
申请号：US09412229
申请日：1999-10-05
申请人： Michael L. Moher , Stewart N. Crozier , Paul Guinand
发明人： Michael L. Moher , Stewart N. Crozier , Paul Guinand
IPC分类号： H04L2706
CPC分类号： H04L27/2331 , H04L7/042 , H04L7/10 , H04L27/0014 , H04L27/3854 , H04L2027/003
摘要： Digital signals transmitted on an RF carrier modulated in phase and amplitude and subject to noise constitute separate bursts each comprising information symbols of data and a pair of separated unique words. The signals are subjected to processing which involves reception of the signals and an initial conversion to approximate baseband and then analog to digital sampling. Quadrature and in phase samples are then stored in a buffer. The buffered samples are subjected to coarse timing, coarse frequency synchronization, a first phase correction, fine timing, further phase and amplitude correction and finally to fine frequency correction and subsequent reliability estimation.
摘要翻译：以相位和幅度调制并受到噪声的RF载波上传输的数字信号构成了分别包含数据信息符号和一对分离的唯一字的突发。对信号进行处理，该处理涉及信号的接收和初始转换以近似基带，然后进行模拟到数字采样。然后将正交和同相样品存储在缓冲液中。缓冲样本经受粗略定时，粗略频率同步，第一相位校正，精细定时，进一步的相位和幅度校正，最后进行精细的频率校正和随后的可靠性估计。

2. 发明授权

US06857087B2 High-performance low-memory interleaver banks for turbo-codes 有权
标题翻译：用于turbo码的高性能低内存交织器组
公开(公告)号：US06857087B2
公开(公告)日：2005-02-15
申请号：US10165122
申请日：2002-06-07
申请人： Stewart N. Crozier , Paul Guinand
发明人： Stewart N. Crozier , Paul Guinand
IPC分类号： H03M13/27 , H03M13/29 , G06F29/00 , H03M13/00
CPC分类号： H03M13/2789 , H03M13/275 , H03M13/276 , H03M13/2771 , H03M13/2957
摘要： An interleaver for interleaving a set of K ordered elements is disclosed herein. The disclosed interleaver can be expressed as a single permutation that corresponds to two local dithering operations and a global permutation operation. The single permutation can be represented as a small collection of short vectors, and can be calculated recursively, allowing the interleaver to be both stored and implemented using a smaller amount of memory than conventionally possible.
摘要翻译：本文公开了用于交织一组K个有序元素的交织器。所公开的交织器可以表示为对应于两个局部抖动操作和全局置换操作的单个置换。单个排列可以表示为小矢量的小集合，并且可以递归地计算，从而允许使用比传统可能的更少量的存储器来存储和实现交织器。

3. 发明授权

US06339834B1 Interleaving with golden section increments 有权
标题翻译：以黄金分段增量交错
公开(公告)号：US06339834B1
公开(公告)日：2002-01-15
申请号：US09320934
申请日：1999-05-27
申请人： Stewart N. Crozier , Andrew Hunt , John Lodge , Paul Guinand
发明人： Stewart N. Crozier , Andrew Hunt , John Lodge , Paul Guinand
IPC分类号： H03M1327
CPC分类号： H03M13/275 , H03M13/276 , H03M13/2771
摘要： Interleavers based on golden-section increments are disclosed for use with Turbo and Turbo-like error-correcting codes. The interleavers have a tendency to maximally spread the error-bursts generated by an error-burst channel or decoder, independent of the error-burst length. The code block size uniquely defines a golden section increment without having to perform a time consuming search for the best increment value. The disclosed embodiments include golden relative prime interleavers, golden vector interleavers and dithered golden vector interleavers. Also disclosed are methods to reduce the size of memory required for storing the interleaving indexes.
摘要翻译：公开了基于黄金分段增量的交织器，用于与Turbo和Turbo类似的纠错码。交织器具有最大限度地扩展由错误突发信道或解码器产生的错误突发的倾向，与错误突发长度无关。码块大小唯一地定义了黄金段增量，而不必对最佳增量值执行耗时的搜索。所公开的实施例包括黄金相关素数交织器，黄金矢量交织器和抖动的黄金矢量交织器。还公开了减少存储交织索引所需的存储器大小的方法。

4. 发明授权

US06510536B1 Reduced-complexity max-log-APP decoders and related turbo decoders 失效
标题翻译：降低复杂度的max-log-APP解码器和相关的turbo解码器
公开(公告)号：US06510536B1
公开(公告)日：2003-01-21
申请号：US09324429
申请日：1999-06-01
申请人： Stewart N. Crozier , Ken Gracie , Andrew Hunt , John Lodge , Paul Guinand
发明人： Stewart N. Crozier , Ken Gracie , Andrew Hunt , John Lodge , Paul Guinand
IPC分类号： H03M1341
CPC分类号： H03M13/3905 , H03M13/275 , H03M13/2771 , H03M13/2957
摘要： Methods of reduced-complexity max-log-APP processing are disclosed for use with Turbo and Turbo-like decoders. The invented methods of decoding are derived from max-log-APP processing and significantly lower the processing required for decoding convolutional codes by eliminating a portion of the calculations conventionally associated with max-log-APP processing. The disclosed embodiments provide simplified methods of metric combining based on determining the bits of an MLSE sequence with different alternative approaches. Also disclosed is an early stopping method that uses the reduced-complexity max-log-APP decoder to reduce the average number of decoding operations required by an iterative Turbo decoder.
摘要翻译：公开了与Turbo和Turbo样解码器一起使用的降低复杂度的max-log-APP处理的方法。本发明的解码方法是从max-log-APP处理得出的，并且通过消除常规与max-log-APP处理相关联的一部分计算，显着地降低了对卷积码进行解码所需的处理。所公开的实施例提供了基于使用不同的替代方法确定MLSE序列的位的度量组合的简化方法。还公开了一种早期停止方法，其使用降低复杂度的max-log-APP解码器来减少迭代Turbo解码器所需的解码操作的平均数量。

5. 发明授权

US06530059B1 Tail-biting turbo-code encoder and associated decoder 失效
标题翻译：尾部涡轮编码器和相关解码器
公开(公告)号：US06530059B1
公开(公告)日：2003-03-04
申请号：US09324812
申请日：1999-06-01
申请人： Stewart N. Crozier , Andrew Hunt , John Lodge , Paul Guinand
发明人： Stewart N. Crozier , Andrew Hunt , John Lodge , Paul Guinand
IPC分类号： H03M1303
CPC分类号： H03M13/3905 , H03M13/275 , H03M13/2771 , H03M13/2957
摘要： A method of creating tail-biting recursive systematic convolutional and turbo codes, and the associated encoders, are described herein. According to the method, symbols from the set of data to be transmitted are used to preset the starting state of the encoder, and are replaced in a systematic set by an equivalent number of tail-biting symbols that force the ending state of the encoder to be the same as the starting state. The presetting of the starting state allows for simpler calculations in choosing the tail-biting symbols, and allows a message to be transmitted with a reduced number of symbols The reduction in the number of symbols used for overhead in this invention provides an increase in the data transmission rate.
摘要翻译：本文描述了一种创建尾巴递归系统卷积和turbo码的方法以及相关联的编码器。根据该方法，使用要发送的数据集合中的符号来预设编码器的开始状态，并且通过等效数量的尾随符号在系统集合中替换，这些符号迫使编码器的结束状态与起始状态相同。启动状态的预设允许在选择尾部符号时进行更简单的计算，并且允许以减少的符号数发送消息。本发明中用于开销的符号数量的减少提供了数据的增加传输速率。

6. 发明授权

US07203893B2 Soft input decoding for linear codes 有权
标题翻译：用于线性码的软输入解码
公开(公告)号：US07203893B2
公开(公告)日：2007-04-10
申请号：US10834115
申请日：2004-04-29
申请人： Ron Kerr , John Lodge , Paul Guinand
发明人： Ron Kerr , John Lodge , Paul Guinand
IPC分类号： H03M13/45
CPC分类号： H03M13/45 , H03M13/05 , H03M13/1191 , H03M13/13 , H03M13/134 , H03M13/19 , H03M13/3776 , H03M13/3784 , H03M13/3944 , H03M13/458 , H03M13/616 , H04L1/005
摘要： A method of decoding soft input information related to a transmitted word of a linear block code (n, k) and providing hard or soft output information is disclosed. The method comprises the steps of forming a reliability vector from the input information, identifying (n−k) linearly independent least reliable symbols and k most reliable symbols, converting a parity check matrix of the linear block code to a pseudo-systematic form with respect to the least reliable symbols, calculating extrinsic information and composite information for the most reliable symbols using the soft input information and the pseudo-systematic parity check matrix, and calculating extrinsic information for the least reliable systems using composite information for the most reliable symbols.
摘要翻译：公开了一种解码与线性块码（n，k）的发送字相关的软输入信息并提供硬或软输出信息的方法。该方法包括以下步骤：从输入信息形成可靠性向量，识别（nk）线性独立的最不可靠符号和k个最可靠的符号，将线性块码的奇偶校验矩阵转换为伪系统形式相对于使用软输入信息和伪系统奇偶校验矩阵计算外部信息和最可靠符号的复合信息，以及使用用于最可靠符号的复合信息来计算最不可靠系统的外在信息。

7. 发明申请

US20100290506A1 SPREADING CODE ACQUISITION FOR DIRECT SEQUENCE SPREAD SPECTRUM SIGNALS 失效
标题翻译：直接序列传播光谱信号的传播代码获取
公开(公告)号：US20100290506A1
公开(公告)日：2010-11-18
申请号：US12779575
申请日：2010-05-13
申请人： Ron Kerr , Paul Guinand , John Lodge
发明人： Ron Kerr , Paul Guinand , John Lodge
IPC分类号： H04B1/707
CPC分类号： H04B1/7075 , H04J13/0074
摘要： The invention relates to a method and apparatus for acquiring a complex spreading code of a direct sequence spread spectrum signal (DSSS) by acquiring a state of a spreading code generator capable of generating the complex spreading code. A sequence of bipolar differential product values, which sign is independent on data transmitted by the DSSS signal, is obtained by combining in-phase and quadrature samples of the DSSS signal for adjacent chip intervals. This sequence is provided to a linear block decoder for obtaining a codeword of a linear block code, which is defined by a structure of the spreading generator and the differential product operation. The codeword is used to compute the state of the spreading code generator.
摘要翻译：本发明涉及通过获取能够生成复扩展码的扩展码发生器的状态来获取直接序列扩频信号（DSSS）的复扩展码的方法和装置。通过组合相邻码片间隔的DSSS信号的同相和正交样本，获得符号与DSSS信号发送的数据无关的双极差分积值序列。该序列被提供给线性块解码器，用于获得由扩展发生器的结构和差分乘积运算定义的线性块码的码字。码字用于计算扩展码发生器的状态。

8. 发明授权

US08300675B2 Spreading code acquisition for direct sequence spread spectrum signals 失效
标题翻译：直接序列扩频信号的扩展码采集
公开(公告)号：US08300675B2
公开(公告)日：2012-10-30
申请号：US12779575
申请日：2010-05-13
申请人： Ron Kerr , Paul Guinand , John Lodge
发明人： Ron Kerr , Paul Guinand , John Lodge
IPC分类号： H04B1/00
CPC分类号： H04B1/7075 , H04J13/0074
摘要： The invention relates to a method and apparatus for acquiring a complex spreading code of a direct sequence spread spectrum signal (DSSS) by acquiring a state of a spreading code generator capable of generating the complex spreading code. A sequence of bipolar differential product values, which sign is independent on data transmitted by the DSSS signal, is obtained by combining in-phase and quadrature samples of the DSSS signal for adjacent chip intervals. This sequence is provided to a linear block decoder for obtaining a codeword of a linear block code, which is defined by a structure of the spreading generator and the differential product operation. The codeword is used to compute the state of the spreading code generator.
摘要翻译：本发明涉及通过获取能够生成复扩展码的扩展码发生器的状态来获取直接序列扩频信号（DSSS）的复扩展码的方法和装置。通过组合相邻码片间隔的DSSS信号的同相和正交样本，获得符号与DSSS信号发送的数据无关的双极差分积值序列。该序列被提供给线性块解码器，用于获得由扩展发生器的结构和差分乘积运算定义的线性块码的码字。码字用于计算扩展码发生器的状态。

9. 发明授权

US06718508B2 High-performance error-correcting codes with skew mapping 有权
标题翻译：具有偏斜映射的高性能纠错码
公开(公告)号：US06718508B2
公开(公告)日：2004-04-06
申请号：US09864253
申请日：2001-05-25
申请人： John Lodge , Andrew Hunt , Paul Guinand
发明人： John Lodge , Andrew Hunt , Paul Guinand
IPC分类号： H03M1300
CPC分类号： H03M13/2742 , H03M13/2721
摘要： A method for generating new forward error correction codes, called skew codes, for the reliable transmission of data in noisy channels is disclosed. The method involves adding additional sets of parity equations across the third dimension of a cubic array of bits. The parity equations are applied to the cubic array such that the rectangular patterns of one square array do not match up with a rectangular pattern in another square array. By selecting skew mapping parameters of the parity equations from a set of quadratic residues of prime numbers according to specific design rules, the resulting codes are well suited to low-complexity high-speed iterative decoding, and have error correction performance and error detection capability, particularly for applications requiring high code rates. An improved decoding method for decoding skew codes and any code that is defined by a set of sum-to-identity parity equations initially decoded using an algorithm that provides confidence values on all the symbols at every symbol time is also disclosed. Generally, the improved decoding method will make hard decisions based upon the soft decisions passed from the failed iterative decoding system to provide a valid code word, through manipulation of the parity check matrix and reduction of its columns and rows.
摘要翻译：公开了一种用于产生用于在噪声信道中可靠地传输数据的新的前向纠错码（称为偏移码）的方法。该方法包括在立方体位数列的第三维上添加额外的奇偶校验方程组。将奇偶校验方程式应用于立方体阵列，使得一个正方形阵列的矩形图案与另一个正方形阵列中的矩形图案不匹配。通过根据具体设计规则从素数的二次残差集中选择奇偶校验方程的偏斜映射参数，所得到的代码非常适合于低复杂度的高速迭代解码，并具有纠错性能和错误检测能力，特别适用于需要高码率的应用。还公开了一种用于对偏斜码进行解码的改进的解码方法，以及由使用在每个符号时刻在所有符号上提供置信度的算法最初解码的一对和 - 一致奇偶校验方程组所定义的任何代码。通常，改进的解码方法将基于从故障迭代解码系统传递的软判决来做出硬判决，以通过操纵奇偶校验矩阵和减少其列和行来提供有效的代码字。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式