- Book Chapter
- 10.1016/b978-0-12-821982-9.00015-0
Chapter 10 - Quantum LDPC Codes
- Jan 01, 2021
- Quantum Information Processing, Quantum Computing, and Quantum Error Correction
- Ivan B Djordjević
Chapter 10 - Quantum LDPC Codes
Chapter 10 - Quantum Low-Density Parity-Check Codes
Chapter 10 - Quantum LDPC Codes
Chapter 10 - Quantum LDPC Codes
Construction of good quasi-cyclic LDPC codes
DOI: 10.1049/cp:20061337 ISBN: 0 86341 644 6 Location: Hangzhou, China Conference date: 6-9 Nov. 2006 Format: PDF The BER performance of presented quasi-cyclic (QC) low-density parity-check (LDPC) codes is not good as that of randomly constructed LDPC codes, while the lack of structure of randomly constructed LDPC codes implies serious disadvantages in terms of storing and accessing a large parity-check matrix. To solve the problems, this paper proposes a design of good quasi-cyclic (QC) low-density parity-check (LDPC) codes, the obtained algebraically structured codes have large minimum distances and good BER performance. The proposed design is based on index matrices, which determines the shifts of the circulant matrices of the sparse parity-check matrices. Compared with the presented design of QC LDPC codes, the designed QC LDPC codes are free from girth 4, sometimes free from girth 6, and have much larger minimum distances. Based on the algebraic code structure, the conditions of the girth and minimum distance of the codes are found. The BER performance of the designed QC LDPC block codes compares with that of randomly constructed LDPC codes for any block lengths. Better BER performance is obtained by increasing the circulant size of the base QC code. Simulations verify the construction of the QC LDPC codes to be valid. (4 pages) Inspec keywords: AWGN channels; error statistics; channel coding; algebraic codes; parity check codes; sparse matrices Subjects: Algebra; Other topics in statistics; Codes
Read moreQuantum stabilizer and quantum LDPC codes
Quantum stabilizer and quantum LDPC codes
CLIP: A Distributed Emulation Platform for Research on Information Reconciliation
In the quantum key distribution (QKD) system, information reconciliation is an essential component within the QKD post processing. Emulation techniques play an important role in information reconciliation since it enables the research of information processing to be independent with expensive and time-consuming physical systems. In this paper, we design CLIP, a novel Cross-pLatform quantum Information reconciliation experimental tool. CLIP is written in the C++ language to run at various platforms(including Linux and Windows, etc.), and it works in a distributed paradigm to enhance the experimental performance. We conducted numerous experiments on Quantum LDPC codes and evaluate the performance using our CLIP tool. Experimental results show that our LDPC platform is very powerful on the research of Information reconciliation.
Read moreAccumulate repeat accumulate codes
In this paper we propose an innovative channel coding scheme called 'Accumulate Repeat Accumulate codes' (ARA). This class of codes can be viewed as serial turbo-like codes, or as a subclass of Low Density Parity Check (LDPC) codes, thus belief propagation can be used for iterative decoding of ARA codes on a graph. The structure of encoder for this class can be viewed as precoded Repeat Accumulate (RA) code or as precoded Irregular Repeat Accumulate (IRA) code, where simply an accumulator is chosen as a precoder. Thus ARA codes have simple, and very fast encoder structure when they representing LDPC codes. Based on density evolution for LDPC codes through some examples for ARA codes, we show that for maximum variable node degree 5 a minimum bit SNR as low as 0.08 dB from channel capacity for rate 1/2 can be achieved as the block size goes to infinity. Thus based on fixed low maximum variable node degree, its threshold outperforms not only the RA and IRA codes but also the best known LDPC codes with the dame maximum node degree. Furthermore by puncturing the accumulators any desired high rate codes close to code rate 1 can be obtained with thresholds that stay close to the channel capacity thresholds uniformly. Iterative decoding simulation results are provided. The ARA codes also have projected graph or protograph representation that allows for high speed decoder implementation.
Read moreA novel concatenated coding scheme combined LDPC and VBLAST for FSO links
We propose a novel concatenated coding scheme combined Low Density Parity Check(LDPC) code and vertical Bell Labs layered space-time (VBLAST) code to improve the bit error rate (BER) performance for Free-space optical (FSO) communication links with On Off Keying(OOK) modulation. In the scheme, π-rotation encoding and belief-propagation (BP) decoding algorithm are employed in LDPC code, and minimum mean-square error (MMSE) soft-decision decoding algorithm is used for VBLAST code. Moreover, a joint iterative detection and decoding algorithm of VBLAST code and LDPC code is used to improve the overall link performance. At last, the BER of the proposed scheme over lognormal atmospheric turbulent fading channels is analyzed by using Monte Carlo method. The result shows that the BER of the proposed concatenated coding scheme is much improved than that only use VBLAST code scheme.
Read moreAn Improvement on LDPC Coded Queued Codes
The queued-code based on low-density parity-check (LDPC) codes, which exploit both the near Shannon-limit performance LDPC codes and the instantaneous channel state information (CSI), can provide excellent performance in the block fading channels. The existing work utilized the conventional random puncturing and repetition operation, which may lead to considerable performance loss due to the changed intrinsic connections of parity-check matrix (PCM) for the receiver. In this paper, we present a reversed sequential puncturing (RSP) scheme and a construction method with modified dual-diagonal structure for the LDPC coded queued-code. The consecutive puncturing pattern in reversed direction can ensure the uniform row-weight distribution of the punctured PCM. The modified dual-diagonal form and the RSP scheme can ensure no more than one punctured symbol involved in each check-sum equation. The simulation results demonstrate that our proposed scheme can achieve noticeable performance gains.
Read moreDesign of SPA decoder for CDMA applications
Low Density Parity Check (LDPC) codes are Shannon-Limit approaching codes. Shannon stated the theoretical bounds for digital data transmission in a given channel capacity with error correction coding. Spread Spectrum also called as CDMA (Code Division Multiple Access) is an efficient way of radio wave communication deployed in commercial broadcasts, ham radios, military communications, police radios, etc. CDMA is a means of signal transmission in which the signal frequency is spread over a very wide bandwidth. Spreading of data is achieved prior to transmission with the help of an independent code called ‘Pseudo Noise Code’ (PN sequences), which is subsequently used in the receiver end to de-spread the signal received in order to recover the signal data. PN sequences based on prime numbers like Legendre & Weil sequences are used in the present work. An impressive part of LDPC lies in its decoding algorithm. Sum-Product Algorithm (SPA) decoding offers the best error performance amongst all the types of decoding techniques of LDPC codes and thus applied here. This paper demonstrates an idea of introducing LDPC codes along with DS-Spread Spectrum technique using Legendre & Weil sequences. In the present work, the encoding and decoding algorithms are applied after spreading of the signal. SPA decoding technique is successfully employed and simulated results are plotted taking an example design to illustrate the concepts discussed above.
Read moreNovel Construction and Optimization of LDPC Codes for NC-OFDM Cognitive Radio Systems
In this paper, a random Low-Density Parity-Check (LDPC) code is proposed for Noncontiguous Orthogonal Frequency Division Multiplexing (NC-OFDM) Cognitive Radio (CR) systems. Unlike other encoding schemes which achieve a system code rate of only 1/4 when half of the subcarriers are active, the proposed scheme achieves a system code rate of 1/2. The LDPC code is used to enhance the data transmission rate. A new channel model comprised of a binary erasure channel concatenated with an uncorrelated fading channel and an AWGN channel is adopted for NC-OFDM CR systems. Moreover, the adopted channel model is employed with density evolution algorithm to obtain good degree distribution pairs for the LDPC code. Thereafter, a modified shortest-path algorithm is used to construct the parity-check matrix for the LDPC code. Simulation results show that the proposed LDPC code performs well in terms of both error rate and data transmission rate.
Read moreCheck Node Reliability-Based Scheduling for BP Decoding of Non-Binary LDPC Codes
Scheduling strategy is considered an important aspect of belief-propagation (BP) decoding of low-density parity-check (LDPC) codes because it affects the decoder's convergence rate, decoding complexity and error-correction performance. In this paper, we propose two new scheduling strategies for the BP decoding of non-binary LDPC (NB-LDPC) codes. Both the strategies are devised based on the concept of check node reliability and employ a heuristically defined threshold which can adapt to the communication channel variations. As the scheduling strategies only update a subset of the check nodes in each iteration, they result in reduced iteration cost. Furthermore, since the BP performs suboptimally for finite-length LDPC codes, especially for short-length LDPC codes, by enhancing the message propagation over the Tanner Graphs of short-length NB-LDPC codes, the new scheduling strategies can even improve the error-correction performances of BP decoding. Simulation results demonstrate that the new scheduling strategies provide good performance/complexity tradeoffs.
Read moreAlgorithmic and Combinatorial Analysis of Trapping Sets in Structured LDPC Codes
Several combinatorial properties of low-density parity-check (LDPC) codes, such as minimum distance, diameter, stopping number, girth and cycle-length distribution of the corresponding Tanner graph, are known to influence their performance under iterative decoding. Recently, a new class of combinatorial configurations, termed trapping sets, was shown to be of significant importance in determining the properties of LDPC codes in the error-floor region. Very little is known both about the existence/parameters of trapping sets in structured LDPC codes and about possible techniques for reducing their negative influence on the code's performance. In this paper, we address both these problems from an algorithmic and combinatorial perspective. We first provide a numerical study of the trapping phenomena for the Margulis code, which exhibits a fairly high error-floor. Based on this analysis, conducted for two different implementations of iterative belief propagation, we propose a novel decoding process, termed averaged decoding. Averaged decoding provides for a significant reduction in the number of incorrectly decoded frames in the error-floor region of the Margulis code. Furthermore, based on the results of the algorithmic approach, we suggest a novel combinatorial characterizations of trapping sets in the class of LDPC codes based on finite geometries. Projective geometry LDPC codes are suspected to have extremely low error-floors, which is a property that we may attribute to the non-existence of certain small trapping sets in the code graph.
Read moreShort-Block-Length Low-Density Parity-Check Codes-Based Underwater Acoustic Spread-Spectrum Communication System
Low-density parity-check (LDPC) codes are commonly used in communication systems to improve the system performance, but LDPC codes takes too long for decoding, making communication inefficient and unsuitable for short-frame data transmission methods. In underwater acoustic channels, spread-spectrum communication becomes an effective way to realize long-distance communication. This paper combines short-block LDPC codes with a direct sequence spread spectrum and soft spread spectrum in underwater acoustic communication, addressing the problem of the inapplicability of conventional LDPC codes. The applicability of the proposed method in this paper is verified through simulation tests and pool experiments. The results indicate that the proposed communication system achieves lower bit error rates compared to the classical coding methods used in underwater acoustic spread-spectrum communication systems under the same channel conditions.
Read moreStructured LDPC Codes to Reduce Pseudo Cycles for Turbo Equalization in Perpendicular Magnetic Recording
Low-density parity-check (LDPC) codes are typically designed to avoid the length-4 cycles to ensure acceptable levels of performance. However, the turbo equalization, which relies on an interaction between an inner code such as an LDPC code and a soft-output Viterbi algorithm (SOVA) detector, exhibits a performance degradation due to the pseudo cycles. In this paper, we propose an interleaved modified array code (IMAC) that can reduce the number of pseudo cycles, hence, improving the gains from the iterative processing technique. The modification is made on the existing array-based LDPC codes named modified array codes (MAC) by introducing an additional interleaving matrix to the parity-check matrix. Simulation results on the perpendicular magnetic recording channels (PMRC) demonstrate that the IMAC outperforms both the MAC and the previously proposed random interleave array (RIA) codes for the partial-response targets under consideration. In addition, a subblock-based encoder design is proposed to reduce the encoding complexity of the IMAC and when compared with the RIA code, the IMAC exhibits a lower encoding complexity, and still maintains a comparable level of the decoding complexity.
Read moreChannel Coding and Information Theory
This chapter discusses fundamentals of information theory and channel coding (error correction coding ECC, Forward error correction FEC). First, key results of Shannon, including channel capacity and the relationship between transmit power and bandwidth, are discussed. Block codes multiply a block of data with an encoding matrix. For systematic codes, the resulting codeword consists of systematic bits and parity check bits. Decoding is achieved by multiplication with a parity check matrix and determination of the syndrome vector. Correction of errors within the correction sphere can be done, e.g., through lookup tables. Convolutional codes send the source data stream through shift registers and adders, a process described by a trellis diagram. Maximum-likelihood sequence estimation (Viterbi algorithm) determines the (transmit) bit sequence with best distance metric (Hamming or Euclidean) from the received signal. Methods for combining coding and higher-order modulation include trellis coded modulation (using set partitioning for code design) and bit-interleaved coded modulation (BICM). Turbo codes are close to capacity-achieving. They are based on transmitting differently interleaved convolutional codes; receivers use soft decoding of the constituent codes and iterative exchange of soft information (log-likelihood ratios). Low-density parity check codes (LDPCC) are decoded by belief propagation (message passing), where variable nodes and constraint nodes exchange beliefs about the codeword. In fading channels, (block or convolutional) interleaving is essential to provide diversity. From an information-theoretic point of view, in fading channels we can distinguish between the ergodic capacity and the outage capacity. If the channel state information is known at the transmitter, waterfilling is the optimum power allocation strategy. Automatic Repeat Request ARQ) and Hybrid ARQ (including chase combining or incremental redundancy) are described in the appendix.
Read moreThroughput-Optimized Multi-Rate LDPC Codes for Satellite Communication Systems With Restricted Decoder Complexity
Multi-rate low-density parity-check (LDPC) codes are widely used in satellite communication (SatCom) systems due to their outstanding performance and adaptable code rates. However, their hardware decoder implementations typically require high hardware resources and many decoding iterations, which pose challenges for high-throughput applications in resource-constrained, high-data-rate SatCom scenarios. To this end, the design of throughput-optimized multi-rate LDPC codes is investigated, aiming to tackle the decoder implementation problem from the perspective of practical code design. Specifically, a multi-rate weighted normalized throughput metric is introduced, which considers two key factors, i.e., the number of non-zero elements in the parity-check matrix and the required decoding iterations. Then, the throughput-optimized multi-rate code design problem is formulated to maximize the proposed metric under given decoding threshold constraints, which is later solved using a protomatrix search method based on the differential evolution (DE) algorithm. Finally, three multi-rate LDPC codes are optimized for scenes with different code rate usage frequencies. Their performance is extensively evaluated both theoretically and numerically. Results demonstrate that the proposed codes outperform other similar LDPC codes in the literature, showing a throughput increase of 20% to 30% under the same hardware resource consumption.
Read more