CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
Implementation of Feature Selection Using Correlation Matrix in Python

Ahmad Farhan AlShammari
Random Articles
Reseach Article

Analysis of Quantum Computing and Trellis Coding based on PUM Codes

by Vijey Thayananthan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 30 - Number 5
Year of Publication: 2011
Authors: Vijey Thayananthan
10.5120/3640-5084

Vijey Thayananthan . Analysis of Quantum Computing and Trellis Coding based on PUM Codes. International Journal of Computer Applications. 30, 5 ( September 2011), 8-12. DOI=10.5120/3640-5084

@article{ 10.5120/3640-5084,
author = { Vijey Thayananthan },
title = { Analysis of Quantum Computing and Trellis Coding based on PUM Codes },
journal = { International Journal of Computer Applications },
issue_date = { September 2011 },
volume = { 30 },
number = { 5 },
month = { September },
year = { 2011 },
issn = { 0975-8887 },
pages = { 8-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume30/number5/3640-5084/ },
doi = { 10.5120/3640-5084 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:16:09.366998+05:30
%A Vijey Thayananthan
%T Analysis of Quantum Computing and Trellis Coding based on PUM Codes
%J International Journal of Computer Applications
%@ 0975-8887
%V 30
%N 5
%P 8-12
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we describe the trellis coding where quantum computing (QC) is employed to analyze the coding gain and complexity. According to quantum information theory, quantum bits increase the storage capacity as well as speed. High complex trellis based on partial memory code (PUM) is designed and simulated in digital computers. In order to reduce simulation time for trellis decoding, QC is analyzed with PUM coding. From the theoretical analysis, QC in a quantum computer will be the best option because quantum bits can be stored simultaneously in a given moment of time. From this theory, trellis states, paths, metric calculations are stored in lesser time and space than conventional storing procedures. Therefore, QC certainly will improve the trellis coder performance.

References
  1. Shraga. I. Bross, “Unit-memory codes for continuous phase modulation in an AWGN channel,” IEEE Trans. Inform. Theory, vol.IT-43, pp. 261 - 268, Feb/Mar/April 1995.
  2. Zyablov V. V., Markarian G. S., Portnoy S.L., Balanced codes constructions based on partial unit memory codes, Proceedings of Soviet-Sweden Symposium on Information Theory, Jan 1991, Moscow.
  3. Professor Sidorenko, “Unit Memory/Partial Unit Memory Codes,” Lecture Notes 1995.
  4. G. Markarian, B. Honary: ‘Trellis decoding technique for block RLL/ECC’, IEE Proc.., Oct 1994, vol 141, pp 297-302.
  5. Markarian G., Honary B.,Thayananthan.V. “Trellis Coded Quantisation technique based on partial unit memory codes”, Proceedings of the 4th International Symposium on Communication Theory and applications, Ambleside, Lake District, July 1997, pp.56-58.
  6. Vijey Thayananthan, Bahram Honary and Garik Markarian, “Trellis Coded Quantisation Technique Based on Partial Unit Memory Codes”, 1998 IEEE International Symposium on Information Theory MIT, August 16th -21st 1998.
  7. Vijey.Thayananthan, Garik Markarian, and Bahram Honary, “DSP Implementation and Design of Trellis Coded Quantisation Technique Based on Partial Unit Memory Codes”, IEEE GLOBECOM 98, 8 12 November 1998.
  8. V. Sidorenko, G. Markarian, and B. Honary. Minimal Trellis Design for Linear Codes Based on the Shannon Product. IEEE Transactions on Information Theory. ISSN 0018-9448. 42(6) pp. 2048-2053. November 1996.
  9. D. A. Lidar, I. L. Chuang, and K. B. Whaley. Decoherence-Free Subspaces for Quantum Computation. Physical Review Letters 81(12):2594{2597, 21. Sept. 1998.
  10. Schumacher, B., Quantum coding, Phys. Rev. A 51, 2738-2747 (1995)
  11. E. M. Rains. Nonbinary Quantum Codes. IEEE Transactions on Information Theory, 45(6):1827{1832, Sept. 1999. See also LANL preprint quant-ph/9703048.
  12. Palmer, J. 2011 Quantum computing device hints at powerful future. Science and technology reporter, BBC News, Dallas. http://www.bbc.co.uk/news/science-environment-12811199.
  13. M. Grassl, A. Klappenecker, and M. Rotteler. Graphs, Quadratic Forms, and Quantum Codes. In Proceedings of the 2002 IEEE International Symposium on Information Theory, page 45, 2002.
  14. A. Ashikhmin and E. Knill. Nonbinary quantum stabilizer codes. IEEE Transactions on Information Theory, 47(7), Nov. 2001.
Index Terms

Computer Science
Information Sciences

Keywords

Trellis coding QC complexity PUM coding information theory

Powered by PhDFocusTM