In this paper, we present two joint timing recovery and decoding algorithms for non-binary lowdensity parity-check (ldpc) coded systems. To estimate the timing offset, the first algorithm utilizes the percentage of th...
详细信息
In this paper, we present two joint timing recovery and decoding algorithms for non-binary lowdensity parity-check (ldpc) coded systems. To estimate the timing offset, the first algorithm utilizes the percentage of the satisfied check nodes (SCNs), while the second algorithm utilizes the soft decision metrics (SDMs). Both SCNs and SDMs are fed back from the ldpc decoder, which can be implemented by either the well-known q-ary sum-product algorithm (QSPA) or other low complexity algorithms, such as the X-EMS algorithms. Simulation results show that the proposed algorithms suffer from a little performance degradation compared with the perfect timing system. Simulation results also show that X-EMS algorithms aided by the timing recovery algorithm using SDMs outperform QSPA aided by the timing recovery algorithm using SCNs, but with a much lower complexity. This implies that the performance is mainly affected by the timing recovery algorithms. (C) 2013 Elsevier Inc. All rights reserved.
This paper presents two iterative decoding algorithms for a class of non-binary two-step majority-logic (NB-TS-MLG) decodable cyclic codes. A partial parallel decoding scheme is also introduced to provide a balanced t...
详细信息
This paper presents two iterative decoding algorithms for a class of non-binary two-step majority-logic (NB-TS-MLG) decodable cyclic codes. A partial parallel decoding scheme is also introduced to provide a balanced trade-off between decoding speed and storage requirements. Unlike non-binary one-step MLG decodable cyclic codes, the Tanner graphs of which are 4-cycle-free, NB-TS-MLG decodable cyclic codes contain a large number of short cycles of length 4, which tend to degrade decoding performance. The proposed algorithms utilize the orthogonal structure of the parity-check matrices of the codes to resolve the degrading effects of the short cycles of length 4. Simulation results demonstrate that the NB-TS-MLG decodable cyclic codes decoded with the proposed algorithms offer coding gains as much as 2.5 dB over Reed-Solomon codes of the same lengths and rates decoded with either hard-decision or algebraic soft decision decoding.
The fixed points of the belief propagation decoder for non-binary low-density parity-check (ldpc) codes are referred to as stopping constellations. In this paper, we give the stopping constellation distributions for t...
详细信息
The fixed points of the belief propagation decoder for non-binary low-density parity-check (ldpc) codes are referred to as stopping constellations. In this paper, we give the stopping constellation distributions for the irregular non-binaryldpc code ensembles defined over the general linear group. Moreover, we derive the exponential growth rate of the average stopping constellation distributions in the limit of large code-length.
This work analyzes the optimal power allocation in coded cooperative communication systems with a single relay and using the amplify-and-forward protocol. non-binary low density parity-check (ldpc) codes are used at t...
详细信息
This work analyzes the optimal power allocation in coded cooperative communication systems with a single relay and using the amplify-and-forward protocol. non-binary low density parity-check (ldpc) codes are used at the source and a fast Fourier transform (FFT)-based decoding algorithm is employed at the destination. We study the power distribution between the source and the relay based on the minimization of the ldpc bit error rate (BER) performance at the destination as well as on the information theoretic measures such as the channel capacity and outage probabilities, The optimal power allocation estimated by the ldpc performance simulation corresponds to the capacity/outage probability results. In addition, BER comparisons of the coded systems (cooperative and noncooperative) are carried out for some typical cooperative scenarios. (C) 2016 Elsevier B.V. All rights reserved.
In the framework of error correction in space telecommand (TC) links, the Consultative Committee for Space Data Systems (CCSDS) currently recommends short block-length BCH and binary low-density parity-check (ldpc) co...
详细信息
In the framework of error correction in space telecommand (TC) links, the Consultative Committee for Space Data Systems (CCSDS) currently recommends short block-length BCH and binary low-density parity-check (ldpc) codes. Other alternatives have been discarded due to their high decoding complexity, such as non-binaryldpc (NB-ldpc) codes. NB-ldpccodes perform better than their binary counterparts over AWGN and jamming channels, being great candidates for space communications. We show the feasibility of NB-ldpc coding for space TC applications by proposing a highly efficient decoding architecture. The proposed decoder is implemented for a (128,64) NB-ldpc code over GF(16) and the design is particularized for a space-certified Virtex-5QV FPGA. The results prove that NB-ldpc coding is an alternative that outperforms the standardized binaryldpc, with a coding gain of 0.7 dB at a reasonable implementation cost. Given that the maximum rate for TC recommended by the CCSDS is 2 Mbps, the proposed architecture achieves a throughput of 2.03 Mbps using only 9615 LUTs and 5637 FFs (no dedicated memories are used). In addition, this architecture is suitable for any regular (2,4) NB-ldpc (128,64) code over GF(16) independently of the H matrix, allowing flexibility in the choice of the code. This brief places NB-ldpccodes as the excellent candidates for future versions of the telecommand uplink standard.
An approximate channel-likelihood estimation algorithm is introduced for non-binary coded, square quadrature-amplitude-modulated systems. It is shown that the proposed approximation greatly simplifies the calculation ...
详细信息
An approximate channel-likelihood estimation algorithm is introduced for non-binary coded, square quadrature-amplitude-modulated systems. It is shown that the proposed approximation greatly simplifies the calculation of channel-likelihoods and yet provides results close to those based on exact calculations for non-binary low-density parity-check codes over the additive white Gaussian noise channel.
non-binary ldpc codes offer higher performances than their binary counterpart but suffer from higher decoding complexity. A solution to reduce the decoding complexity is to use the Extended Min-Sum algorithm. The firs...
详细信息
non-binary ldpc codes offer higher performances than their binary counterpart but suffer from higher decoding complexity. A solution to reduce the decoding complexity is to use the Extended Min-Sum algorithm. The first step of this algorithm requires the generation of the first n(m) largest Log-Likelihood Ratio (LLR), sorted in increasing order, of each received symbol. In the case where GF(q) symbols are transmitted using a BPSK modulation, we propose a simple systolic architecture that generates the sorted list of symbols.
The Fourier Transform Sum-Product Algorithm (FT-SPA) used in non-binary Low-Density Parity-Check (ldpc) decoding makes extensive use of the Walsh-Hadamard Transform (WHT). We have developed a massively parallel Fast W...
详细信息
The Fourier Transform Sum-Product Algorithm (FT-SPA) used in non-binary Low-Density Parity-Check (ldpc) decoding makes extensive use of the Walsh-Hadamard Transform (WHT). We have developed a massively parallel Fast Walsh-Hadamard Transform (FWHT) which exploits the Graphics Processing Unit (GPU) pipeline and memory hierarchy, thereby minimizing the level of memory bank conflicts and maximizing the number of returned instructions per clock cycle for different generations of graphics processors, with considerable speedup gains in FT-SPA based non-binaryldpc decoding. (C) 2014 Elsevier B.V. All rights reserved.
Visible light communication (VLC) systems are expected to support a variety of applications, such as common-information broadcasting, real-time multimedia streaming, and large file downloading. Typically, these applic...
详细信息
Visible light communication (VLC) systems are expected to support a variety of applications, such as common-information broadcasting, real-time multimedia streaming, and large file downloading. Typically, these applications have different delay requirements. Hence, it is desirable to design high-performance coding scheme capable of supporting a wide range of delays but with acceptable hardware complexity. To achieve this, we propose a delay-tunable coding scheme for VLC systems based on block Markov superposition transmission of short non-binary low-density parity-check (NBldpc) codes. The proposed coding scheme includes the following advantages: 1) it is easily configurable to fulfill different delay requirements while keeping the code rate constant;2) it requires essentially the same hardware modules to implement the encoder/decoder as the involved short NBldpc code;and 3) it can have a larger coding gain if a longer delay is tolerated. Numerical results are presented to show the expected tradeoff between delay and energy in a VLC system.
Protograph-based non-binary low-density parity-check (ldpc) codes with ultra-sparse parity-check matrices are compared with binaryldpc and turbo codes (TCs) from space communication standards. It is shown that larger...
详细信息
Protograph-based non-binary low-density parity-check (ldpc) codes with ultra-sparse parity-check matrices are compared with binaryldpc and turbo codes (TCs) from space communication standards. It is shown that larger coding gains are achieved, outperforming the binary competitors by more than 0.3?dB on the additive white Gaussian noise channel (AWGN). In the short block length regime, the designed codes gain more than 1?dB with respect to the binary protograph ldpccodes recently proposed for the next generation up-link standard of the Consultative Committee for Space Data Systems. Copyright (c) 2012 John Wiley & Sons, Ltd.
暂无评论