Implementation and Applications of Practical Codes on Curves

曲线实用代码的实现与应用

• 批准号: 9805080
• 负责人: Richard Blahut
• 金额: $ 20.68万
• 依托单位: University of Illinois at Urbana-Champaign
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1998
• 资助国家: 美国
• 起止时间: 1998-07-01 至 2001-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9805080&HistoricalAwards=false
• 关键词: Implementation; Applications; Practical; Codes; Curves

The objective of this program is to design an efficient VLSI implementation for certain algebraic geometry codes, to fabricate a chip, and to identify applications where these codes would be competitive. The codes to be considered are Hermitian codes and other codes similar in structure. The advantage of these codes is that, for a given symbol size, they are longer than Reed- Solomon codes and can therefore take better advantage of the law of large numbers to give much greater error correction capability. A number of decoding algorithms for these codes exist, including those developed by the co-PIs. We will combine the best elements of these algorithms into an explicit computational algorithm that is well suited to VLSI implementation. The goal is to produce a chip that uses parallel processing, regular and simple structures, simple logic, and a minimal number of iterations. We will verify the logic design using a VHDL simulation. We will also identify systems where these codes would be appropriate and test the performance of the decoder in channel simulations appropriate to those applications.

该计划的目标是为某些代数几何代码设计一个高效的VLSI实现，制造芯片，并确定这些代码具有竞争力的应用。要考虑的码是厄密码和其他结构类似的码。这些代码的优点是，对于给定的符号大小，它们比里德-所罗门码长，因此可以更好地利用大数定律来提供更大的纠错能力。这些代码存在许多解码算法，包括那些由合作伙伴开发的算法。我们将把这些算法的最佳元素结合到一个非常适合VLSI实现的显式计算算法中。目标是生产一种使用并行处理、规则和简单结构、简单逻辑和最小迭代次数的芯片。我们将使用VHDL仿真验证逻辑设计。我们还将确定适合这些代码的系统，并在适合这些应用的信道模拟中测试解码器的性能。