| 1. | Fast a soft - decision decoding for binary block codes
算法的快速软判决译码 |
| 2. | Soft decision decoding
软判决译码 |
| 3. | An algorithm for soft - decision decoding ( 15 , 11 ) rs is presented , which refers to the chase algorithm
本文利用chase算法的思想，将软判决译码应用到rs ( 15 ， 11 )码上，降低了译码的复杂度。 |
| 4. | Since soft - decision decoding needs much more computation , it is so complex as to be infeasible in many applications
但是软判决译码比硬判决译码要进行更多的译码计算，复杂度较高，从而限制了它的应用范围。 |
| 5. | Evaluate the bit - error bound of serially concatenated codes ( scc ) , and present the design guidelines and iterative decoding algorithms of scc
推导了串行级连码的误比特率限，介绍了串行级连码的设计准则以及软判决译码算法。 |
| 6. | Chapter five discusses de - mapping and soft information extraction in dvb - t receiver and gives the performance comparison of soft decision decoding and hard decision decoding
第五章首先介绍软判决的基本原理，然后分析软信息提取及解映射的过程，最后给出了软判决译码和硬判决译码的性能仿真结果。 |
| 7. | So the new algorithm can be applied . based on the new algorithm mentioned above , two methods of soft decision decoding on rs - complex rotary codes , sdd i and sdd ii , are proposed according to the character of encoding and decoding of the codes
通过计算机模拟仿真，发现sdd软判决译码算法和sdd软判决译码算法的复杂度都不大于gf ( 2 ~ m )上多元码字的软判决译码算法，尤其是sdd算法的复杂度总体上还小于多元码字的软判决译码算法。 |
| 8. | A new algorithm of soft decision decoding for the codes over gf ( 2m ) is proposed on the basis of word - by - word decoding algorithm . the new algorithm improves the decoding performance by 2 ~ 3db , and the number of tries sequences is far less than the number of tries sequences of the existing algorithm over gf ( 2m )
根据构造的rs -复转码的编译码特点，结合本论文所提出的gf ( 2 ~ m )上多元码字的软判决译码算法，讨论并设计实现了rs -复转码的两种软判决译码算法，即sdd软判决译码算法和sdd软判决译码算法。 |
| 9. | The principles of soft decoding and message passing are discussed . based on normal graph , the update formulas for message passing are derived and further the optimality of message passing algorithm for cycle - free graphs is proved . finally , the issues affecting message passing in graphs with cycles are analyzed
介绍了软判决译码和消息传递的基本思想；基于normal图，推导了消息传递算法的迭代公式，论述了无环图上消息传递算法的最优性，并分析了影响有环图上消息传递的因素； 3 |
