Closed-System Quantum Logic Network Implementation of the Viterbi Algorithm

New convolution-based multiple-stream error-control coding and decoding schemes are introduced. The new coding method applies the reversibility property in the convolution-based encoder for multiple-stream erro r-control encoding and im- plements the reversibility property in the new reversible Viterbi decoding algorithm for multiple-stream error-correction decoding. The compl ete design of quantum cir- cuits for the quantum realization of the new quantum Viterbi cell in the quantum do- main is also introduced. In quantum mechanics, a closed system is an isolated system that can't exchange energy or matter with its surroundings a nd doesn't interact with other quantum systems. In contrast to open quantum systems, closed quantum sys- tems obey the unitary evolution and thus they are reversible . Reversibility property in error-control coding can be important for the following mai n reasons: (1) reversibility is a basic requirement for low-power circuit design in futur e technologies such as in quantum computing (QC), (2) reversibility leads to super-speedy encoding/decoding operations because of the superposition and entanglement properties that emerge in the quantum computing systems that are naturally reversible and therefore very high performance is obtained, and (3) it is shown in this paper tha t the reversibility rela- tionship between multiple-streams of data can be used for further correction of errors that are uncorrectable using the implemented decoding algorithm such as in the case of triple-errors that are uncorrectable using the classica l irreversible Viterbi algorithm.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Jiří Adámek Foundations of coding , 1991 .

[3]  Vijay K. Bhargava,et al.  Forward error correction schemes for digital communications , 1983, IEEE Communications Magazine.

[4]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[5]  Robert M. Gray,et al.  Speech coding based upon vector quantization , 1980, ICASSP.

[6]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[7]  Hu Chuan-Gan,et al.  On The Shift Register Sequences , 2004 .

[8]  John Bowman Thomas,et al.  An introduction to statistical communication theory , 1969 .

[9]  Irwin M. Jacobs,et al.  Practical applications of coding , 1974, IEEE Trans. Inf. Theory.

[10]  Adam Lender Correlative level coding for binary-data transmission , 1966, IEEE Spectrum.

[11]  Jr. G. Forney,et al.  Viterbi Algorithm , 1973, Encyclopedia of Machine Learning.

[12]  L. Lundquist Digital communications by satellite, modulation multiple access, and coding , 1983, Proceedings of the IEEE.

[13]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[14]  Stephen B. Wicker,et al.  Turbo Coding , 1998 .

[15]  Jerry D. Gibson,et al.  Digital coding of waveforms: Principles and applications to speech and video , 1985, Proceedings of the IEEE.

[16]  Thomas M. Thompson From error-correcting codes through sphere packings to simple groups , 1983 .

[17]  A.J. Viterbi,et al.  Wireless digital communication: a view based on three lessons learned , 1991, IEEE Communications Magazine.

[18]  Prashant Parikh A Theory of Communication , 2010 .

[19]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[20]  Fred Daneshgaran,et al.  Design of interleavers for turbo codes: Iterative interleaver growth algorithms of polynomial complexity , 1999, IEEE Trans. Inf. Theory.

[21]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[22]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[23]  Hisashi Kobayashi,et al.  Correlative level coding and maximum-likelihood decoding , 1971, IEEE Trans. Inf. Theory.

[24]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[25]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[26]  Bishnu S. Atal,et al.  Stochastic coding of speech signals at very low bit rates: The importance of speech perception , 1985, Speech Commun..

[27]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[28]  David J. C. MacKay,et al.  Comparison of constructions of irregular Gallager codes , 1999, IEEE Trans. Commun..

[29]  Rodger E. Ziemer,et al.  Principles of communications , 1976 .

[30]  Lee-Fang Wei Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part II: Nonlinear Codes , 1984, IEEE J. Sel. Areas Commun..

[31]  A.J. Paulraj,et al.  Space-time processing for wireless communications , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[32]  W. Root,et al.  Remarks, mostly historical, on signal detection and signal parameter estimation , 1987, Proceedings of the IEEE.

[33]  Kaushik Roy,et al.  Low-Power CMOS VLSI Circuit Design , 2000 .

[34]  Gérard Battail Coding for the Gaussian channel - The promise of weighted-output decoding , 1989 .

[35]  J G Daugman,et al.  Information Theory and Coding , 2005 .

[36]  Lee-Fang Wei Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part I: 180° , 1984, IEEE J. Sel. Areas Commun..

[37]  B. P. Lathi,et al.  Modern Digital and Analog Communication Systems , 1983 .

[38]  B. Sklar,et al.  A primer on turbo code concepts , 1997, IEEE Commun. Mag..

[39]  Jorge Castiñeira Moreira,et al.  Reed–Solomon Codes , 2006 .

[40]  F. Lemmermeyer Error-correcting Codes , 2005 .

[41]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[42]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[43]  Matthew Valenti,et al.  Turbo Codes , 2007 .

[44]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[45]  John B. Anderson,et al.  Source and Channel Coding: An Algorithmic Approach , 1991 .

[46]  John G. Proakis,et al.  Digital Communications , 1983 .

[47]  Vinton G. Cerf,et al.  A brief history of the internet , 1999, CCRV.

[48]  T. Aaron Gulliver,et al.  Cross-Entropy and Iterative Decoding , 1998, IEEE Trans. Inf. Theory.

[49]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[50]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[51]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[52]  Ajoy Kumar Ray,et al.  Intel microprocessors : architecture, programming and interfacing , 2001 .

[53]  D. Huffman A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[54]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[55]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

[56]  Shirley Dex,et al.  JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .

[57]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[58]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[59]  Robert M. Gray,et al.  Coding for noisy channels , 2011 .

[60]  Yoshihiko Akaiwa,et al.  Introduction to digital mobile communication , 1997, Wiley series in telecommunicatins and signal processing.

[61]  Pierre Lafrance Fundamental concepts in communication , 1990 .

[62]  G.D. Forney,et al.  Combined equalization and coding using precoding , 1991, IEEE Communications Magazine.

[63]  Allen H. Levesque,et al.  Error-control techniques for digital communication , 1985 .

[64]  J. Bibb Cain,et al.  Error-Correction Coding for Digital Communications , 1981 .

[65]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[66]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[67]  R. Steele,et al.  Delta Modulation Systems , 1975 .

[68]  N. S. Jayant Coding speech at low bit rates: Advanced algorithms and hardware for voice telecommunications are paring hit rates by at least a factor of four, without losing intelligibility , 1986, IEEE Spectrum.

[69]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[70]  V.W.S. Chan,et al.  Principles of Digital Communication and Coding , 1979 .

[71]  G. Longo,et al.  The theory of information and coding: A mathematical framework for communication , 1979, Proceedings of the IEEE.

[72]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[73]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[74]  Jr.,et al.  Multivalued logic gates for quantum computation , 2000, quant-ph/0002033.

[75]  Barry B. Brey The Intel Microprocessors , 2008 .

[76]  D. W. Hagelbarger,et al.  Recurrent codes: Easily mechanized, burst-correcting, binary codes , 1959 .

[77]  Peter Adam Hoeher,et al.  Separable MAP "filters" for the decoding of product and concatenated codes , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[78]  Lee-Fang Wei Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space - Part II: Nonlinear Codes , 1984, IEEE Journal on Selected Areas in Communications.

[79]  Brendan J. Frey,et al.  Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models , 1998, IEEE J. Sel. Areas Commun..

[80]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[81]  John M. Cioffi,et al.  Discrete multiple tone modulation with coset coding for the spectrally shaped channel , 1992, IEEE Trans. Commun..

[82]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[83]  D.J.C. MacKay,et al.  Irregular turbocodes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[84]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[85]  Shu Lin,et al.  Automatic-repeat-request error-control schemes , 1984, IEEE Communications Magazine.

[86]  P. K. Chaturvedi,et al.  Communication Systems , 2002, IFIP — The International Federation for Information Processing.

[87]  Stephen G. Wilson,et al.  Digital Modulation and Coding , 1995 .

[88]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[89]  R W Lucky,et al.  Principles of data communication , 1968 .

[90]  John B. Anderson,et al.  A bandwidth-efficient class of signal-space codes , 1978, IEEE Trans. Inf. Theory.

[91]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[92]  Dwijendra K. Ray-Chaudhuri,et al.  Binary mixture flow with free energy lattice Boltzmann methods , 2022, arXiv.org.

[93]  S. Pasupathy Correlative coding: A bandwidth-efficient signaling scheme , 1977, IEEE Communications Society Magazine.