Construction of Time-Varyng Convolutional Codes

时变卷积码的构造

• 批准号: 9714720
• 负责人: Lance Perez
• 金额: $ 1.77万
• 依托单位: University of Nebraska-Lincoln
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1997
• 资助国家: 美国
• 起止时间: 1997-09-01 至 1998-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9714720&HistoricalAwards=false
• 关键词: Construction; Time; Varyng; Convolutional; Codes

With the discovery of turbo codes in 1993, near-capacity performance on the AWGN channel was realized for the first time since Shannon published his landmark paper in 1948. It has recently been shown by the PI and others that turbo codes are a particular implementation of time-varying convolutional codes; this differs significantly from the practice of the last 30 years, in which time-invariant convolutional codes have been emphasized. The propose work is a preliminary study of methods for constructing classes of time-varying convolutional encoders and decoders. In particular, the goal is to find or construct time-varying codes with a sparse distance spectrum and long block length, as opposed to the traditional goal of maximizing free distance.

随着1993年turbo码的发现，自Shannon于1948年发表具有里程碑意义的论文以来，AWGN信道的近容量性能首次实现。最近PI和其他人已经证明涡轮码是时变卷积码的一种特殊实现；这与过去30年的实践有很大的不同，在过去的30年里，强调的是时不变卷积码。本文提出的工作是对构造时变卷积编码器和解码器类的方法的初步研究。特别是，目标是寻找或构建具有稀疏距离频谱和长块长度的时变代码，而不是传统的最大化自由距离的目标。