Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/603270
Title: Fully-Parallel Quantum Turbo Decoder
Authors: Zunaira Babar;Hung Viet Nguyen;Panagiotis Botsinis;Dimitrios Alanis;Daryus Chandra;Soon Xin Ng;Robert G. Maunder;Lajos Hanzo
subject: fully-parallel decoding|Quantum error correction|iterative decoding|turbo codes
Year: 2016
Publisher: IEEE
Abstract: Quantum turbo codes (QTCs) are known to operate close to the achievable Hashing bound. However, the sequential nature of the conventional quantum turbo decoding algorithm imposes a high decoding latency, which increases linearly with the frame length. This posses a potential threat to quantum systems having short coherence times. In this context, we conceive a fully-parallel quantum turbo decoder (FPQTD), which eliminates the inherent time dependences of the conventional decoder by executing all the associated processes concurrently. Due to its parallel nature, the proposed FPQTD reduces the decoding times by several orders of magnitude, while maintaining the same performance. We have also demonstrated the significance of employing an odd-even interleaver design in conjunction with the proposed FPQTD. More specifically, it is shown that an odd-even interleaver reduces the computational complexity by 50%, without compromising the achievable performance.
Description: 
URI: http://localhost/handle/Hannan/135671
http://localhost/handle/Hannan/603270
ISSN: 2169-3536
volume: 4
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7494985.pdf6.98 MBAdobe PDFThumbnail
Preview File
Title: Fully-Parallel Quantum Turbo Decoder
Authors: Zunaira Babar;Hung Viet Nguyen;Panagiotis Botsinis;Dimitrios Alanis;Daryus Chandra;Soon Xin Ng;Robert G. Maunder;Lajos Hanzo
subject: fully-parallel decoding|Quantum error correction|iterative decoding|turbo codes
Year: 2016
Publisher: IEEE
Abstract: Quantum turbo codes (QTCs) are known to operate close to the achievable Hashing bound. However, the sequential nature of the conventional quantum turbo decoding algorithm imposes a high decoding latency, which increases linearly with the frame length. This posses a potential threat to quantum systems having short coherence times. In this context, we conceive a fully-parallel quantum turbo decoder (FPQTD), which eliminates the inherent time dependences of the conventional decoder by executing all the associated processes concurrently. Due to its parallel nature, the proposed FPQTD reduces the decoding times by several orders of magnitude, while maintaining the same performance. We have also demonstrated the significance of employing an odd-even interleaver design in conjunction with the proposed FPQTD. More specifically, it is shown that an odd-even interleaver reduces the computational complexity by 50%, without compromising the achievable performance.
Description: 
URI: http://localhost/handle/Hannan/135671
http://localhost/handle/Hannan/603270
ISSN: 2169-3536
volume: 4
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7494985.pdf6.98 MBAdobe PDFThumbnail
Preview File
Title: Fully-Parallel Quantum Turbo Decoder
Authors: Zunaira Babar;Hung Viet Nguyen;Panagiotis Botsinis;Dimitrios Alanis;Daryus Chandra;Soon Xin Ng;Robert G. Maunder;Lajos Hanzo
subject: fully-parallel decoding|Quantum error correction|iterative decoding|turbo codes
Year: 2016
Publisher: IEEE
Abstract: Quantum turbo codes (QTCs) are known to operate close to the achievable Hashing bound. However, the sequential nature of the conventional quantum turbo decoding algorithm imposes a high decoding latency, which increases linearly with the frame length. This posses a potential threat to quantum systems having short coherence times. In this context, we conceive a fully-parallel quantum turbo decoder (FPQTD), which eliminates the inherent time dependences of the conventional decoder by executing all the associated processes concurrently. Due to its parallel nature, the proposed FPQTD reduces the decoding times by several orders of magnitude, while maintaining the same performance. We have also demonstrated the significance of employing an odd-even interleaver design in conjunction with the proposed FPQTD. More specifically, it is shown that an odd-even interleaver reduces the computational complexity by 50%, without compromising the achievable performance.
Description: 
URI: http://localhost/handle/Hannan/135671
http://localhost/handle/Hannan/603270
ISSN: 2169-3536
volume: 4
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7494985.pdf6.98 MBAdobe PDFThumbnail
Preview File