Breadth-first trellis decoding with adaptive effort
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 38 (1) , 3-12
- https://doi.org/10.1109/26.46522
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A nonsorting VLSI structure for implementing the (M, L) algorithmIEEE Journal on Selected Areas in Communications, 1988
- On the performance evaluation of trellis codesIEEE Transactions on Information Theory, 1987
- A Multiprocessor Architecture for the (M, L)-Algorithm Suitable for VLSI ImplementationIEEE Transactions on Communications, 1986
- Digital Phase ModulationPublished by Springer Nature ,1986
- VLSI Structures for Viterbi Receivers: Part I--General Theory and ApplicationsIEEE Journal on Selected Areas in Communications, 1986
- Sequential Coding Algorithms: A Survey and Cost AnalysisIEEE Transactions on Communications, 1984
- Low Complexity Decoders for Constant Envelope Digital ModulationsIEEE Transactions on Communications, 1983
- Channel coding with multilevel/phase signalsIEEE Transactions on Information Theory, 1982
- A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratiosIEEE Transactions on Information Theory, 1977
- Variable-length codes and the Fano metricIEEE Transactions on Information Theory, 1972