On the Performance of Interleavers for Quantum Turbo Codes
Quantum turbo codes (QTC) have shown excellent error correction capabilities in the setting of quantum communication, achieving a performance less than 1 dB away from their corresponding hashing bounds. Existing QTCs have been constructed using uniform random interleavers. However, interleaver desig...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universidad de Navarra |
| Repositorio: | Dadun. Depósito Académico Digital de la Universidad de Navarra |
| Idioma: | inglés |
| OAI Identifier: | oai:dadun.unav.edu:10171/61893 |
| Acceso en línea: | https://hdl.handle.net/10171/61893 |
| Access Level: | acceso abierto |
| Palabra clave: | Materias Investigacion::Física::Física aplicada Quantum error correction Turbo codes Interleavers Error floors |
| Sumario: | Quantum turbo codes (QTC) have shown excellent error correction capabilities in the setting of quantum communication, achieving a performance less than 1 dB away from their corresponding hashing bounds. Existing QTCs have been constructed using uniform random interleavers. However, interleaver design plays an important role in the optimization of classical turbo codes. Consequently, inspired by the widely used classical-to-quantum isomorphism, this paper studies the integration of classical interleaving design methods into the paradigm of quantum turbo coding. Simulations results demonstrate that error floors in QTCs can be lowered significantly, while decreasing memory consumption, by proper interleaving design without increasing the overall decoding complexity of the system. |
|---|