硬判决译码 meaning in Chinese
hard decision decoding
Examples
- Hard decision decoding
硬判决译码 - Since soft - decision decoding needs much more computation , it is so complex as to be infeasible in many applications
但是软判决译码比硬判决译码要进行更多的译码计算，复杂度较高，从而限制了它的应用范围。 - 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
第五章首先介绍软判决的基本原理，然后分析软信息提取及解映射的过程，最后给出了软判决译码和硬判决译码的性能仿真结果。 - The viterbi decoder with hard decision designed by the paper , is aimed at ( 3 , 1 , 9 ) convolutional coding . the data rate is 9 . 6kbps . the data rate received by the rake receiver is spreaded by 127 - bit spread sequences , added pilot signals and modulated by qpsk
该课题所设计viterbi译码是针对( 3 , 1 , 9 )卷积码的硬判决译码,数据速率为9 . 6kbps ; rake接收机所接收的数据是扩频因子为127 、加入导频且经qpsk调制的扩频信号,使用verilg硬件描述语言在xilinx公司的ise环境下在用现场可编程门阵列( fpga )来实现viterbi译码器和rake接=收机的功能。 - Based on tanner graph , the representation and construction of ldpc codes are addressed , and the two decoding algorithm for ldpc codes , i . e , bit - flipping algorithm and sum - product algorithm , are discussed . from two aspects - minimum distance and the failure of independence assumption , the impacts of cycles to the performance of ldpc codes are analyzed . 2
基于tanner图模型，详细介绍了ldpc码的表示和构造；介绍了ldpc码的硬判决译码(比特翻转算法)和软判决迭代译码(和积算法) ；从最小距离和独立性假设失效两个方面分析了环的存在对ldpc码译码性能的影响； 2