RIA: TWO NEW CODING IDEAS

这个项目是探索两个简单而强大的编码 想法. 第一种是从外层空间到外层空间的分阶段电力转移， 一个内码，可以找到使用网格和传统的 卷积编码系统 这项新技术不仅 提高了级联编码系统在其性能方面的性能， 通常的操作方式，即，非常低的解码错误率，但是 还将其应用扩展到要求不太严格的 解码器复杂度和短时间的未压缩图像或语音 延迟很重要。 基于卫星的移动的电话或数据 服务可以立即受益于这些技术。 第二个想法是一种方法， Reed-Solomon码字集合的成员。 效果是 减少所需的冗余量，即，增加 在代码的速率中。 对这项技术的最大需求 来自符号大小以某种方式规定的系统 通过通道，例如，具有256元的8位里德所罗门码 p. p.m.在光子计数光信道上。 即使这个符号 尺寸不受限制，即，更大的里德所罗门码可以 使用时，编码器和解码器的复杂性都以 新方法的每个信息位的操作似乎是 对于相同的性能增益，

This project is exploring two simple and powerful coding ideas. The first involves staged power transfer from an outer to an inner code and can find use on both trellis and conventional convolutionally coded systems. This new technique not only improves the performance of concatenated coding systems in their usual operating regime, i.e., very low decoded error rates, but also extends their use to the less stringent requirements of uncompressed images or speech where decoder complexity and short delays are important. Satellite based mobile telephone or data service could benefit immediately from these techniques. The second idea is a method of sharing parity checks among the members of a set of Reed-Solomon codewords. The effect is a decrease in the amount of reduncancy required, i.e., an increase in the rate of the code. The greatest need for this technique comes from systems where the symbol size is in some way dictated by the channel, e.g., an 8 bit Reed Solomon code with 256-ary p.p.m. on a photon counting optical channel. Even if the symbol size is not constrained, i.e., larger Reed Solomon codes could be used, both the encoder and decoder complexity measured in operations per information bit of the new method appear to be lower for the same performance gain.