In prior researches, low-density-parity-check (LDPC) code is applied on high-speed magnetic random-access-memory (MRAM) for a better correctable bit error rate (CBER). However, on another emerging memory, resistive ra...
详细信息
In prior researches, low-density-parity-check (LDPC) code is applied on high-speed magnetic random-access-memory (MRAM) for a better correctable bit error rate (CBER). However, on another emerging memory, resistive random-access-memory (RRAM), reset hard breakdown errors have high-reliability log-likelihood ratio (LLR) which significantly degrades LDPC code soft decision CBER and decoding iterations. To solve this issue, two schemes, improved-LLR and reset-check-reverse-flag (RCRF) concatenating systematic LDPC code (RCRF + LDPC), are proposed. The first scheme increases soft decision CBER by using asymmetric LLRs for matching the distribution of reset hard breakdown errors. In addition, RCRF corrects at least one reset error per array subsection. So, both hard and soft decision CBERs are improved. The best performance is obtained by combining these proposals. The hard decision CBER is increased by more than 50% on a wide range of LDPC code options. Moreover, soft decision CBER is improved by 69% and 51%, respectively, on a 1KB codeword, 0.91 code rate quasi-cyclic-LDPC (QC-LDPC) code, and a 2KB codeword, 0.89 code rate Mackey's code.
The computational complexity required by the complete calculation of the distance spectrum of turbo codes, even limited to low weight input sequences, makes it too slow for practical purposes such as interleaver optim...
详细信息
The computational complexity required by the complete calculation of the distance spectrum of turbo codes, even limited to low weight input sequences, makes it too slow for practical purposes such as interleaver optimization or effective bit error rate bounding. In this paper, a fast algorithm for distance spectrum estimation purposes is presented. A comparison with complete computed spectra, theoretically derived spectra and results from previous works will be presented for both deterministic and uniform interleavers.
In this letter, the performance of turbo codes is evaluated through analysis and simulation over the Rice multiplicative fading channel. The analysis is conducted extending the results presented by Viterbi and Viterbi...
详细信息
In this letter, the performance of turbo codes is evaluated through analysis and simulation over the Rice multiplicative fading channel. The analysis is conducted extending the results presented by Viterbi and Viterbi (1998) to the Rice multiplicative fading channel case. Simulation results are obtained using an extended version of the improved Jakes' channel simulator, first presented by Pop and Beaulieu (2001).
In this paper, the performance of turbo hybrid-ARQ (HARQ) Type-I, Type-II and Type-III schemes are examined for wideband communications based on an orthogonal frequency division multiplexing (OFDM) system. In addition...
详细信息
ISBN:
(纸本)0780383737
In this paper, the performance of turbo hybrid-ARQ (HARQ) Type-I, Type-II and Type-III schemes are examined for wideband communications based on an orthogonal frequency division multiplexing (OFDM) system. In addition, various non-linear clustering strategies for minimizing the effects of peak-to-average power (PAP) ratio are compared and examined based on their throughput performance.
In this paper we study Low Density Party Check (LDPC) codes used in the IEEE 802.16 physical layer standard. We introduce two novel techniques to enhance the performance of such codes. In the first technique, we use t...
详细信息
ISBN:
(纸本)9781424403523
In this paper we study Low Density Party Check (LDPC) codes used in the IEEE 802.16 physical layer standard. We introduce two novel techniques to enhance the performance of such codes. In the first technique, we use the binary parity check matrix proposed in the IEEE 802.16 standard, and propose a novel parity check matrix for LDPC codes over GF(4) with the non-zero entries chosen to maximize the entropy. We show that our proposed code outperforms the binary code proposed in the IEEE 802.16 standard over both AWGN and SUI-3 channel model. In our second technique, we use a high rate LDPC code, in a concatenated coding structure, as an outer code, with a convolutional code as an inner code. We compare the performance of such a concatenated code with the commonly used one utilizing Reed-Solomon codes over the standard SUI-3 channel model, and show better performance.
In this paper, we consider fast decoding of soft-decision (SD) Hamming codes as inner codes in concatenated forward error-correction (FEC) schemes for high-speed optical communication. The goal is single FPGA implemen...
详细信息
ISBN:
(纸本)9781728182988
In this paper, we consider fast decoding of soft-decision (SD) Hamming codes as inner codes in concatenated forward error-correction (FEC) schemes for high-speed optical communication. The goal is single FPGA implementations at speeds of 400 Gb/s and beyond. A low complexity maximum a posteriori (MAP) probability decoding is applied to a (128,120) Hamming code. Chase decoding of a (128,119) Hamming code is also implemented. The VHDL designs for both decoding schemes are presented. The FEC performance and FPGA resource utilization are investigated and compared. Synthesis results indicate that, both the Chase and the MAP decoder leave sufficient resources available to also accommodate a powerful outer hard decision code, on a single FPGA. Furthermore, MAP decoding of (128,120) Hamming code features lower hardware complexity and provides a higher data throughput.
Error floor behavior of low-density parity-check (LDPC) codes using quantized decoding algorithms is statistically studied with experimental results on a hardware evaluation platform. The results present the distribut...
详细信息
ISBN:
(纸本)9780819469601
Error floor behavior of low-density parity-check (LDPC) codes using quantized decoding algorithms is statistically studied with experimental results on a hardware evaluation platform. The results present the distribution of the residual errors after decoding failure and reveal that the number of residual error bits in a codeword is usually very small using quantized sum-product (SP) algorithm. Therefore, LDPC code may serve as the inner code in a concatenated coding system with a high code rate outer code and thus an ultra low error floor can be achieved. This conclusion is also verified by the experimental results.
In this paper the interleaving distances spectrum (IDS) is defined. The EDSs for random, block and pseudo-random interleavers are established. The theoretical EDSs for the random and square block interleavers are calc...
详细信息
ISBN:
(纸本)9782960055153
In this paper the interleaving distances spectrum (IDS) is defined. The EDSs for random, block and pseudo-random interleavers are established. The theoretical EDSs for the random and square block interleavers are calculated. On the basis of the EDS, some parameters like the minimum interleaving distance and the spreading degree are defined and calculated. These parameters allow us to make a comparison between different and also same type interleavers.
In the binary online (or "causal") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x(1), ... , x(n)) is an element of {0, 1}(n) bit by bit via a c...
详细信息
ISBN:
(纸本)9781450335362
In the binary online (or "causal") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x(1), ... , x(n)) is an element of {0, 1}(n) bit by bit via a channel limited to at most pn corruptions. The channel is "online" in the sense that at the ith step of communication the channel decides whether to corrupt the ith bit or not based on its view so far, i.e., its decision depends only on the transmitted bits (x(1), ..., x(i)). This is in contrast to the classical adversarial channel in which the error is chosen by a channel that has full knowledge of the transmitted codeword x. In this work we study the capacity of binary online channels for two corruption models: the bit-flip model in which the channel may flip at most pn of the bits of the transmitted codeword, and the erasure model in which the channel may erase at most pn bits of the transmitted codeword. Specifically, for both error models we give a full characterization of the capacity as a function of p. The online channel (in both the bit-flip and erasure case) has seen a number of recent studies which present both upper and lower bounds on its capacity. In this work, we present and analyze a coding scheme that improves on the previously suggested lower bounds and matches the previously suggested upper bounds thus implying a tight characterization.
A simple turbo decoding scheme is proposed for partial-response (PR) channels by using high-rate parity-check codes as an outer error-correction code (ECC), The use of the simple parity codes enables a simplified and ...
详细信息
A simple turbo decoding scheme is proposed for partial-response (PR) channels by using high-rate parity-check codes as an outer error-correction code (ECC), The use of the simple parity codes enables a simplified and high-speed implementation of the a posterior probability (APP) decoder. Its key feature is an iterative decoding step for the parallel concatenation of two parity-check outer codes connected via an interleaver, The parity iterative decoding can provide the high-rate parity-check outer codes with superior correction capability for random error-events, so it can help to reduce the decoding latency, The combination of the serial turbo decoding for a modified E-2 PR ((MEPR)-P-2) channel and the parity iterative decoding demonstrated a coding gain of 4-5 dB at a bit error rate of 1.0E-5 for a coding rate of 8/9.
暂无评论