Robustly good trellis codes
IEEE Transactions on Communications（1996）
摘要
The relationship between the distance properties of trellis codes and the computational effort and error performance of sequential decoding is studied and optimum distance profile (ODP) and optimum free distance (OFD) trellis codes are constructed for 8-PSK and 16 QAM modulation. A comparison of the performance of both the ODP and the OFD trellis codes reveals that neither class of codes results in the best trade-off between error performance and computational effort when sequential decoding is used. A new algorithm is then proposed to construct robustly good trellis codes for use with sequential decoding. New trellis codes with asymptotic coding gains up to 6.66 dB are obtained using this algorithm, and the new codes achieve nearly the same free distances as the OFD codes and nearly the same distance profiles as the ODP codes.
更多查看译文
关键词
asymptotic coding gains,16 qam,robustly good trellis codes,computational complexity,phase shift keying,sequential decoding,quadrature amplitude modulation,optimum distance profile,optimum free distance,8-psk,computational effort,trellis coded modulation,distance properties,error performance,convolutional codes,euclidean distance,viterbi algorithm,coding gain,hardware,decision trees,robustness,decoding
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要