摘要: The least storage and node computation required by a breadth-first tree or trellis decoder that corrects t errors over the binary symmetric channels is calculated. Breadth-first decoders work with code paths of same length, without backtracking. Viterbi algorithm an exhaustive this type; other schemes look at subset paths. For random codes, theorems about asymptotic number their depth are proved. concrete convolutional worst case for error sequences measured. In both cases optimal has simple dependence on t. M algorithms proposed G.J. Foschini (ibid., vol.IT-23, p.605-9, Sept. 1977) S.J. Simmons (PhD. diss., Queens Univ., Kingston, Ont., Canada) optimal, nearly so; they all far more efficient than algorithm. >
sci-hub.se 参考文章(5)
J. Anderson, C.-W. Ho, Architecture and Construction of a Hardware Sequential Encoder for Speech IEEE Transactions on Communications. ,vol. 25, pp. 703- 707 ,(1977) , 10.1109/TCOM.1977.1093894
J.B. Anderson, K. Balachandran, Decision depths of convolutional codes IEEE Transactions on Information Theory. ,vol. 35, pp. 455- 459 ,(1989) , 10.1109/18.32141
G. Foschini, A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratios IEEE Transactions on Information Theory. ,vol. 23, pp. 605- 609 ,(1977) , 10.1109/TIT.1977.1055770
J. Anderson, F. Jelinek, A 2-cycle algorithm for source coding with a fidelity criterion IEEE Transactions on Information Theory. ,vol. 19, pp. 77- 92 ,(1973) , 10.1109/TIT.1973.1054934
J. Anderson, S. Mohan, Sequential Coding Algorithms: A Survey and Cost Analysis IEEE Transactions on Communications. ,vol. 32, pp. 169- 176 ,(1984) , 10.1109/TCOM.1984.1096023