公开(公告)号：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解码器所需的解码操作的平均数量。

公开(公告)号：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码的方法以及相关联的编码器。 根据该方法，使用要发送的数据集合中的符号来预设编码器的开始状态，并且通过等效数量的尾随符号在系统集合中替换，这些符号迫使编码器的结束状态 与起始状态相同。 启动状态的预设允许在选择尾部符号时进行更简单的计算，并且允许以减少的符号数发送消息。本发明中用于开销的符号数量的减少提供了数据的增加 传输速率。

公开(公告)号：US06460161B1

公开(公告)日：2002-10-01

申请号：US09324428

申请日：1999-06-01

申请人： Stewart N. Crozier ,  Andrew Hunt

发明人： Stewart N. Crozier ,  Andrew Hunt

IPC分类号： H03M1341

CPC分类号： H03M13/3905 ,  H03M13/275 ,  H03M13/2771 ,  H03M13/2957

摘要： A simplified method of history handling for the Viterbi decoding of convolutional codes is described herein. The state number, or one or more of the most-significant bits of the state number, is loaded into the corresponding state history. Each state number represents the sequence of data bits that, in convolutional encoding, would give rise to the corresponding state. The most recent data bit provides the least significant bit of the state number. This invention reduces the processing requirements associated with the handling of the history, and is especially useful for decoder implementations using general-purpose processors.

摘要翻译： 本文描述了用于卷积码维特比解码的历史处理的简化方法。 状态号或状态号的一个或多个最高有效位被加载到相应的状态历史中。 每个状态数表示在卷积编码中将产生相应状态的数据比特序列。 最新的数据位提供状态数的最低有效位。 本发明减少了与历史的处理相关联的处理要求，并且对于使用通用处理器的解码器实现特别有用。

公开(公告)号：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类似的纠错码。 交织器具有最大限度地扩展由错误突发信道或解码器产生的错误突发的倾向，与错误突发长度无关。 码块大小唯一地定义了黄金段增量，而不必对最佳增量值执行耗时的搜索。 所公开的实施例包括黄金相关素数交织器，黄金矢量交织器和抖动的黄金矢量交织器。 还公开了减少存储交织索引所需的存储器大小的方法。

公开(公告)号：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载波上传输的数字信号构成了分别包含数据信息符号和一对分离的唯一字的突发。 对信号进行处理，该处理涉及信号的接收和初始转换以近似基带，然后进行模拟到数字采样。 然后将正交和同相样品存储在缓冲液中。 缓冲样本经受粗略定时，粗略频率同步，第一相位校正，精细定时，进一步的相位和幅度校正，最后进行精细的频率校正和随后的可靠性估计。

公开(公告)号：US5579342A

公开(公告)日：1996-11-26

申请号：US300189

申请日：1994-09-22

申请人： Stewart N. Crozier

发明人： Stewart N. Crozier

IPC分类号： H03F1/32 ,  H04L27/12 ,  H04K1/02

CPC分类号： H03F1/3241 ,  H04L27/12

摘要： A system for transmitting FM signals comprised of apparatus for receiving an input data signal, apparatus for precompensating the received data signal, apparatus for applying the precompensated data signal to a constant envelope modulator to provide a modulated signal, apparatus for applying the modulated signal to a power efficient non-linear amplifier and transmitting a signal resulting therefrom, apparatus for receiving the transmitted signal in an I-Q receiver, and apparatus for filtering the received transmitted signal for the precompensation, to obtain an output data signal representative of the input data signal.

摘要翻译： 一种用于发送FM信号的系统，包括用于接收输入数据信号的装置，用于预补偿所接收数据信号的装置，用于将预补偿数据信号施加到恒包络调制器以提供调制信号的装置，用于将调制信号施加到 功率有效的非线性放大器，并且发送由其产生的信号，用于在IQ接收机中接收发送信号的装置，以及用于对接收的用于预补偿的发送信号进行滤波的装置，以获得表示输入数据信号的输出数据信号。

公开(公告)号：US20070288834A1

公开(公告)日：2007-12-13

申请号：US11753924

申请日：2007-05-25

申请人： Stewart N. Crozier ,  Kenneth Gracie ,  Ron Kerr

发明人： Stewart N. Crozier ,  Kenneth Gracie ,  Ron Kerr

IPC分类号： H03M13/03

CPC分类号： H03M13/2792 ,  H03M13/2771 ,  H03M13/2957 ,  H03M13/6362

摘要： The invention relates to an encoding system and method for generating concatenated codes which utilize interleaving and data puncturing. The method includes selecting first and second puncture location sets defining desired puncture locations in non-interleaved and interleaved data sequences, respectively. A puncture-constrained interleaver is provided, which permutes the first puncture location set into the second puncture location set, so as to provide desired regular puncture patterns for all constituent codes. In a preferred embodiment, the puncture-constrained interleaving alters a symbol location relative to a puncture mask so as to satisfy a pre-defined spread or distance constraint.

摘要翻译： 本发明涉及一种编码系统和方法，用于产生利用交织和数据穿孔的级联码。 该方法包括分别在非交错和交织的数据序列中选择定义所需穿孔位置的第一和第二穿孔位置集合。 提供穿刺约束交织器，其将设置的第一穿刺位置置换成第二穿孔位置集合，以便为所有构成码提供期望的定期穿刺模式。 在优选实施例中，穿刺限制交织相对于穿孔掩码改变符号位置，以便满足预定义的扩展或距离约束。

公开(公告)号：US06728927B2

公开(公告)日：2004-04-27

申请号：US09864396

申请日：2001-05-25

申请人： Stewart N. Crozier

发明人： Stewart N. Crozier

IPC分类号： H03M1303

CPC分类号： H03M13/2742 ,  H03M13/2721

摘要： A system and method are provided for designing high-spread, high-distance interleavers for turbo-codes. The first approach is called high-spread random interleaving, and is based on a new and more effective definition of interleaver spread. The second approach is called dithered-diagonal interleaving. Both methods can be used to design interleaves of arbitrary length. The second approach can actually achieve the theoretical maximum spread for many specific block sizes, and at the same time include significant dither for the elimination of low-weight codewords. Both design methods are easy to implement and require very little processing. Also provided is a method for modifying any interleaver to improve the distance spectrum for a specific turbo-code. It is shown that, for a block size of only 512 data bits and for a code rate of ⅓, the flares in the packet error rate (PER) and bit error rate (BER) curves can be kept below 10−8 and 10−10, respectively.

摘要翻译： 提供了一种用于设计用于turbo码的高扩展高距离交织器的系统和方法。 第一种方法被称为高分布随机交织，并且基于交织器扩展的新的和更有效的定义。 第二种方法称为抖动对角线交织。 这两种方法都可用于设计任意长度的交错。 第二种方法实际上可以实现许多特定块大小的理论最大扩展，并且同时包括用于消除低权重码字的显着抖动。 两种设计方法都易于实现，需要很少的处理。 还提供了一种用于修改任何交织器以改进特定turbo码的距离频谱的方法。 显示出，对于只有512个数据位的块大小，对于码率为1/3，分组错误率（PER）和误码率（BER）曲线中的闪烁可以保持在10 <-8以下 >和10 <-10>。

公开(公告)号：US07827472B2

公开(公告)日：2010-11-02

申请号：US11753924

申请日：2007-05-25

申请人： Stewart N. Crozier ,  Kenneth Gracie ,  Ron Kerr

发明人： Stewart N. Crozier ,  Kenneth Gracie ,  Ron Kerr

IPC分类号： H03M13/03 ,  G06F11/00

CPC分类号： H03M13/2792 ,  H03M13/2771 ,  H03M13/2957 ,  H03M13/6362

摘要： The invention relates to an encoding system and method for generating concatenated codes which utilize interleaving and data puncturing. The method includes selecting first and second puncture location sets defining desired puncture locations in non-interleaved and interleaved data sequences, respectively. A puncture-constrained interleaver is provided, which permutes the first puncture location set into the second puncture location set, so as to provide desired regular puncture patterns for all constituent codes. In a preferred embodiment, the puncture-constrained interleaving alters a symbol location relative to a puncture mask so as to satisfy a pre-defined spread or distance constraint.

摘要翻译： 本发明涉及一种用于产生利用交织和数据穿孔的级联代码的编码系统和方法。 该方法包括分别在非交错和交织的数据序列中选择定义所需穿孔位置的第一和第二穿孔位置集合。 提供穿刺约束交织器，其将设置的第一穿刺位置置换成第二穿孔位置集合，以便为所有构成码提供期望的定期穿刺模式。 在优选实施例中，穿刺限制交织相对于穿孔掩码改变符号位置，以便满足预定义的扩展或距离约束。

公开(公告)号：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个有序元素的交织器。 所公开的交织器可以表示为对应于两个局部抖动操作和全局置换操作的单个置换。 单个排列可以表示为小矢量的小集合，并且可以递归地计算，从而允许使用比传统可能的更少量​​的存储器来存储和实现交织器。