An Investigaton of the Interaction Between Codes and Decoding Machines

编码与解码机交互作用的研究

• 批准号: 9415685
• 负责人: Oliver Collins
• 金额: $ 7.59万
• 依托单位: Johns Hopkins University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1995
• 资助国家: 美国
• 起止时间: 1995-03-15 至 1996-02-29
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9415685&HistoricalAwards=false
• 关键词: Investigaton; Interaction; Between; Codes; Decoding

ABSTRACT: NCR-9415685, Johns Hopkins University, "An Investigation of the Interaction Between Codes and Decoding Machines", PI-Collins: The essential concept of this research is to study decoding, itself, as a communications problem. Electronics has advanced to the stage where many chips, each containing tens or even hundreds of thousands of gates, can advantageously be exchanged for a decrease in antenna aperture in a satellite terminal or for a lower transmitter power in a remote buoy or cellular telephone. These latter applications are well able to use extremely powerful coding because of the asymmetry of cost in the two directions of communication. In the case of cellular telephones, for example, power savings are much more important in the link from the mobile unit than in the link to the mobile unit. A sophisticated decoder in the base station drawing power from the AC mains can save battery power in the mobile transmitter. Similarly, a large scale environmental data collection network need incorporate only simple and cheap encoders in the transmitters; a single decoder in a satellite or ground station can service all of these encoders. Unfortunately, exploiting even a small fraction of the processing power of a single piece of silicon is hard, let alone that of a module containing many chips. The difficulty is providing sufficient internal communication among the different parts of the decoding machine. Today, wiring connectivity rather than gate count limits the sophistication of signal processing. This research presents bounds on the amount of information which has to flow in and out of the different sections of a decoding engine when it is partitioned into separate parts. At the moment, these bounds are confined to the Viterbi decoding of shift register based codes. This research will extend these bounds to other codes and decoding algorithms and, more importantly, explore codes (both convolutional and general finite state machine based) which allow decoding with minimum information flow. The same techniques used in analyzing decoder information flow will also be applied to other situations where partitioning is important, e.g., very large circuit switches. Dissecting decoder information flow may result in a new generation of codes of great practical use and will certainly yield insights into the ultimate limits of the type of codes in use today.*****************************************************************************Aubrey M. BushProgram Director, Acting Deputy Divison DirectorDivision of Networking and Communications Research and InfrastructureNational Science Foundation

摘要：NCR-9415685，约翰霍普金斯大学，“代码和解码机器之间的相互作用的调查”，PI-柯林斯：这项研究的基本概念是研究解码，本身，作为一个通信问题。电子学已经发展到这样一个阶段，其中许多芯片（每个芯片包含数万或甚至数十万个门）可以有利地交换以减小卫星终端中的天线孔径或降低远程浮标或蜂窝电话中的发射机功率。由于在通信的两个方向上成本的不对称性，这些后一种应用能够很好地使用极其强大的编码。例如，在蜂窝电话的情况下，功率节省在来自移动的单元的链路中比在到移动的单元的链路中重要得多。基站中的复杂解码器从AC电源汲取电力可以节省移动的发射机中的电池电力。类似地，大规模的环境数据收集网络只需要在发射机中包含简单而廉价的编码器;卫星或地面站中的单个解码器可以为所有这些编码器提供服务。不幸的是，利用一块硅片的一小部分处理能力都很困难，更不用说包含许多芯片的模块了。困难在于在解码机的不同部分之间提供足够的内部通信。 今天，布线连接性而不是门数限制了信号处理的复杂性。 这项研究提出了边界上的信息量，它必须流入和流出的解码引擎的不同部分时，它被分割成单独的部分。目前，这些界限仅限于基于移位寄存器的代码的维特比解码。这项研究将这些界限扩展到其他代码和解码算法，更重要的是，探索代码（基于卷积和一般有限状态机），允许最小的信息流解码。在分析解码器信息流中使用的相同技术也将被应用于其中划分是重要的其他情况，例如，非常大的电路开关。剖析解码器信息流可能会产生新一代具有很大实际用途的代码，并且肯定会深入了解当今使用的代码类型的极限。奥布里M.布什计划主任，代理副主任网络和通信研究和网络结构部国家科学基金会