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.
It is well known that non-binary ldpc codes outperform the BER performance of binaryldpccodes for the same code length. The superior BER performance of non-binarycodes comes at the expense of more complex decoding ...
详细信息
ISBN:
(纸本)9781479903566
It is well known that non-binary ldpc codes outperform the BER performance of binaryldpccodes for the same code length. The superior BER performance of non-binarycodes comes at the expense of more complex decoding algorithms that demand higher computational power. In this paper, we propose parallel signal processing algorithms for performing the FFT-SPA and the corresponding decoding of non-binary ldpc codes over GF(q). The constraints imposed by the complex nature of associated subsystems and kernels, in particular the Check Nodes, present computational challenges regarding multicore systems. Experimental results obtained on GPU for a variety of GF(q) show throughputs in the order of 2 Mbps, which is far above from the minimum throughput required, for example, for real-time video applications that can benefit from such error correcting capabilities.
In this paper, we propose a construction method for two-level quantum error-correcting codes via non-binary ldpc codes over an extended field of order 2(p), p an integer p > 1. The proposed quantum error-correcting...
详细信息
ISBN:
(纸本)9781457705953
In this paper, we propose a construction method for two-level quantum error-correcting codes via non-binary ldpc codes over an extended field of order 2(p), p an integer p > 1. The proposed quantum error-correcting codes are based on binary quasi-cyclic ldpccodes which have almost achieved a "Bounded Distance Decoding (BDD)" limit but have not surpassed the limit yet. Quantum codes constructed from the proposed method surpass the BDD limit. Furthermore the codes outperform the efficiently-decodable state-of-the-art quantum codes.
It is well known that non-binary ldpc codes outperform the BER performance of binaryldpccodes for the same code length. The superior BER performance of non-binarycodes comes at the expense of more complex decoding ...
详细信息
ISBN:
(纸本)9781479903573
It is well known that non-binary ldpc codes outperform the BER performance of binaryldpccodes for the same code length. The superior BER performance of non-binarycodes comes at the expense of more complex decoding algorithms that demand higher computational power. In this paper, we propose parallel signal processing algorithms for performing the FFT-SPA and the corresponding decoding of non-binary ldpc codes over GF(q). The constraints imposed by the complex nature of associated subsystems and kernels, in particular the Check Nodes, present computational challenges regarding multicore systems. Experimental results obtained on GPU for a variety of GF(q) show throughputs in the order of 2 Mbps, which is far above from the minimum throughput required, for example, for real-time video applications that can benefit from such error correcting capabilities.
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.
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.
We propose a non-binaryldpc coded mode-multiplexed coherent optical OFDM system suitable for transmission of 1.28 Tb/s 16-QAM signals over 2000 km of few-mode fiber with mode dependent loss, in strong coupling regime.
ISBN:
(纸本)9781457707339
We propose a non-binaryldpc coded mode-multiplexed coherent optical OFDM system suitable for transmission of 1.28 Tb/s 16-QAM signals over 2000 km of few-mode fiber with mode dependent loss, in strong coupling regime.
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.
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.
This paper presents a link adaptation strategy for non-binaryldpc code over a time-variant frequency-selective channel. The algorithm is based first on the adoption of waterfilling technique to wisely adapt the trans...
详细信息
ISBN:
(纸本)9781424480166
This paper presents a link adaptation strategy for non-binaryldpc code over a time-variant frequency-selective channel. The algorithm is based first on the adoption of waterfilling technique to wisely adapt the transmitted power. It is shown that as long as best subchannels are identified with the waterfilling algorithm, an equal power distribution can be applied with performance comparable to the ideal power adaptation. What it is more important is to decide which are the subchannels that should not be used in order to increase the energy efficiency of the system. The throughput is increased with the adoption of multilevel modulations that changes the rate of each subchannel depending on the channel-to-noise ratio and the quality of service required. The Galois Field GF(64) code symbols are mapped into four modulation schemes (BPSK, 4QAM, 16QAM, 64QAM) and the channel is assumed to be constant over six OFDM symbols. Simulation results are presented when a perfect channel state information is available at the transmitter and at the receiver side. In real dynamic channel environments, the performance of the system degrades due to the delay and the approximation of the feedback information. Simulation of partial channel state information scenario is also reported.
暂无评论