Abstract
We describe the systolic-array implementation of a block-oriented algorithm known as staged decoding, applicable to a class of signal-space codes and lattices obtained through “generalized concatenation”. By exploiting the trellis representation of block codes and the algebraic formulation of Viterbi Algorithm, we derive a very efficient symbol-level pipelined architecture of the staged processor. In order to show the range of applicability of our architecture, we consider the implementation of a staged decoder for the 8-PSK block-coded modulation (BCM) scheme with block length 8 and rate 1 bit/dimension. We obtain a decoding rate of more than 700 Mbit/s with an associated hardware complexity of less than 30 Kgates with 1μ CMOS technology.
Similar content being viewed by others
References
S.Y. Kung,VLSI Array Processors, Englewood Cliffs, NJ: Prentice-Hall, 1988.
H.T. Kung, “Why Systolic Architectures?”Computer, Vol. 15, pp. 37–46, Jan. 1982.
E. Biglieri and A. Spalvieri, “Generalized Concatenation: A Tutorial,” in E. Biglieri and M. Luise, eds.:Coded Modulation and Bandwidth-Efficient Transmission, Elsevier, pp. 27–39, 1992.
H. Imai and S. Hirakawa, “A New Multilevel Coding Method Using Error Correcting Codes,”IEEE Trans. Inform. Th., Vol. IT-23, pp. 371–377, 1977.
V.V. Ginzburg, “Mnogomerniye signaly dlya nepreryvnogo kanala,” (in Russian),Problemy Peredachi Informatsii, pp. 28–46, January–March 1984. English Translation: “Multidimensional Signals for a Continuous Channel,”Problems of Information Transmission, Vol. 23, No. 4, pp. 20–34, January–March 1984.
C.E. Shannon, “A Mathematical Theory of Communication,”Bell Sys. Tech. Journal, Vol. 27, pp. 379–423, 623–656, 1948.
G. Ungerboeck, “Channel Coding with Multilevel/Phase Signals,”IEEE Trans. Inform. Th., Vol. IT-28, pp. 56–67, 1982.
T. Kasami et al., “A Concatenated Coded Modulation Scheme for Error Control,”IEEE Trans. on Commun., Vol. 38, 1990.
A. Gersho, “On the Structure of Vector Quantizers,”IEEE Trans. Inform. Theory, Vol. IT-28, pp. 157–166, 1982.
J.H. Conway and N.J. Sloane, “Fast Quantizing and Decoding Algorithms for Lattice Quantizers and Codes,”IEEE Trans. Inform. Theory, Vol. IT-28, pp. 227–149, 1982.
G.D. Forney, Jr., “Coset codes—Part II: Binary lattices and related codes,”IEEE Trans. Inform. Theory, Vol. 34, pp. 1152–1187, 1988.
E. Biglieri, “Parallel Demodulation of Multidimensional Signals,”IEEE Trans. on Commun., Vol. 40, No. 10, 1992.
E. Biglieri and K. Yao, “VLSI Decoder Architectures for Generalized Concatenated Codes,”Proceedings of the Second International Workshop on DSP Techniques Applied to Space Communications, Torino, Italy, 24–25 September, 1990.
G. Caire, J. Ventura, J. Murphy, and S.Y. Kung, “VLSI Systolic Array Implementation of a Staged Decoder for BCM Signals,”Proceedings of the IEEE Workshop on VLSI signal processing, Napa, CA, Oct. 28–30, 1992, pp. 139–149.
G. Fettweis and H. Meyr, “High-Rate Viterbi Processor: a Systolic Array Solution,”IEEE Journal on Selected Areas in Communications, Vol. 8, pp. 1520–1533, 1990.
J.K. Wolf, “Efficient Maximum Likelihood Decoding of Linear Block Codes Using a Trellis,”IEEE Trans. Inform. Theory, Vol. 24, pp. 76–80, 1978.
G.D. Forney, Jr., “The Dynamics of Group Codes: State Spaces, Trellis Diagrams and Canonical Encoders,” Submitted toIEEE Trans. Inform. Theory, February 1992.
R.B. Urquhart and D. Wood, “Systolic Matrix and Vector Multiplication Methods for Signal Processing,”IEE Proceedings, Vol. 131, Pt. F, pp. 623–631, Oct. 1984.
A. Krasniewsky and S. Pilarsky, “Circular Self-Test Path: A Low-Cost BIST Technique for VLSI,”IEEE Trans. on Computer Aided Design, Vol. 8, 1989.
Author information
Authors and Affiliations
Additional information
A preliminary, shorter version of this paper was presented at ICC'93, Geneva, May 1993.
Rights and permissions
About this article
Cite this article
Caire, G., Ventura-Traveset, J., Hollreiser, M. et al. Systolic architecture for the VLSI implementation of high-speed staged decoders/quantizers. Journal of VLSI Signal Processing 10, 153–168 (1995). https://doi.org/10.1007/BF02407033
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02407033