Breadth-First Trellis Decoding with Adaptive Effort

IEEE Transactions on Communications

Volumn 38, Issue 1, 1990, Pages 3-12

  Simmons, Stanley J ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL--PARALLEL PROCESSING; DIGITAL COMMUNICATION SYSTEMS; MATHEMATICAL STATISTICS--MONTE CARLO METHODS; SIGNAL INTERFERENCE; SIGNAL PROCESSING;

AWGN CHANNEL; BREADTH-FIRST TRELLIS DECODING; INTERSYMBOL INTERFERENCE; MONTE CARLO SIMULATION; VITERBI ALGORITHM;

CODES, SYMBOLIC;

EID: 0025257948     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.46522     Document Type: Article

References (18)

1. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
2. G. D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268–278, Mar. 1973.
3. J. B. Anderson and S. Mohan, “Sequential coding algorithms: A survey and cost analysis,” IEEE Trans. Commun., vol. COM-32, pp. 169–176, Feb. 1984.
4. F. L. Vermeulen, “Low complexity decoders for channels with intersymbol interference,” Ph.D. dissertation, Inform. Syst. Lab., Stanford Univ., CA, May 1975.
5. G. J. Foschini, “A reduced-state variant of maximum likelihood sequence detection attaining optimal performance for high signal to noise ratios,” IEEE Huns. Inform. Theory, vol. IT-23, pp. 605–609, Sept. 1977.
6. S. J. Simmons and P. H. Wittke, “Low complexity decoders for constant envelope digital modulations,” IEEE Trans. Commun., vol. COM-31, pp. 1273–1280, Dec. 1983.
7. K. R. Matis and J. W. Modestino, “Reduced-search soft-decision trellis decoding of linear block codes,” IEEE Hans. Inform. Theory, vol. IT-28, pp. 349–355, Mar. 1982.
8. J. L. Massey, “Variable-length codes and the Fano metric,” IEEE Huns. Inform. Theory, vol. IT-18, pp. 196–198, Jan. 1972.
9. J. K. Omura and M. K. Simon, “Modulation/demodulation techniques for satellite communications: Part IV,” Jet Prop. Lab., California Inst. Technol., Pasadena, CA, Nov. 1981.
10. E. Zehavi and J. K. Wolf, “On the performance evaluation of trellis codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 196–202, Mar. 1987.
11. S. Lin and D. J. Costello, Jr., Error Control Coding. Englewood Cliffs, N.J.: Prentice-Hall, 1983.
12. G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Huns. Inform. Theory, vol. IT-28, pp. 55–67, Jan. 1982.
13. J.-E. Porath and T. Aulin, “New results on trellis coding with an extended set of channel symbols,” Tech. Rep., Div. Inform. Theory, Chalmers Univ. of Technol., Goteborg, Sweden, June 1985.
14. S. J. Simmons, “A reduced-computation trellis decoder with inherent parallelism,” Ph.D. dissertation, ' Univ., Kingston, Ont., July 1986.
15. J. B. Anderson, T. Aulin, and C.-E. Sundberg, Digital Phase Modulation. New York: Plenum, 1986.
16. P. G. Gulak and E. Shwedyk, “VLSI structures for Viterbi receivers,” IEEE J. Select. Areas Commun., vol. SAC-4, pp. 142–154, Jan. 1986.
17. S. Mohan and A. K. Sood, “A multi-processor architecture for the (M, L)-algorithm suitable for VLSI implementation,” IEEE Huns. Commun., vol. COM-34, pp. 1218–1224, Dec. 1986.
18. S. J. Simmons, “A non-sorting VLSI structure for implementing the (M,L) algorithm,” IEEE J. Select. Areas Commun., vol. 6, Apr. 1988.