Fully-parallel quantum turbo decoder
Fully-parallel quantum turbo decoder
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 dependencies 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.
6073-6085
Babar, Z.
23ede793-1796-449d-b5aa-93a297e5677a
Nguyen, H. V.
6f5a71ef-ea98-49e0-9be7-7f5bb9880f52
Botsinis, P.
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Alanis, D.
8ae8ead6-3974-4886-8e17-1b4bff1d94e0
Chandra, D.
d629163f-25d0-42fd-a912-b35cd93e8334
Ng, S. X.
e19a63b0-0f12-4591-ab5f-554820d5f78c
Maunder, R. G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
20 June 2016
Babar, Z.
23ede793-1796-449d-b5aa-93a297e5677a
Nguyen, H. V.
6f5a71ef-ea98-49e0-9be7-7f5bb9880f52
Botsinis, P.
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Alanis, D.
8ae8ead6-3974-4886-8e17-1b4bff1d94e0
Chandra, D.
d629163f-25d0-42fd-a912-b35cd93e8334
Ng, S. X.
e19a63b0-0f12-4591-ab5f-554820d5f78c
Maunder, R. G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
Babar, Z., Nguyen, H. V., Botsinis, P., Alanis, D., Chandra, D., Ng, S. X., Maunder, R. G. and Hanzo, L.
(2016)
Fully-parallel quantum turbo decoder.
IEEE Access, 4, .
(doi:10.1109/ACCESS.2016.2581978).
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 dependencies 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.
Text
FullyParallelQuantumTurboDecoder.pdf
- Accepted Manuscript
Available under License Other.
More information
Accepted/In Press date: 11 June 2016
Published date: 20 June 2016
Organisations:
Electronics & Computer Science, Southampton Wireless Group
Identifiers
Local EPrints ID: 399948
URI: http://eprints.soton.ac.uk/id/eprint/399948
PURE UUID: acaef0b7-262b-496c-bce8-0e83f5abc750
Catalogue record
Date deposited: 04 Sep 2016 17:28
Last modified: 18 Mar 2024 04:01
Export record
Altmetrics
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics