Low-density parity-check(LDPC)codes are widely used due to their significant errorcorrection capability and linear decoding complexity.However,it is not sufficient for LDPC codes to satisfy the ultra low bit error rat...Low-density parity-check(LDPC)codes are widely used due to their significant errorcorrection capability and linear decoding complexity.However,it is not sufficient for LDPC codes to satisfy the ultra low bit error rate(BER)requirement of next-generation ultra-high-speed communications due to the error floor phenomenon.According to the residual error characteristics of LDPC codes,we consider using the high rate Reed-Solomon(RS)codes as the outer codes to construct LDPC-RS product codes to eliminate the error floor and propose the hybrid error-erasure-correction decoding algorithm for the outer code to exploit erasure-correction capability effectively.Furthermore,the overall performance of product codes is improved using iteration between outer and inner codes.Simulation results validate that BER of the product code with the proposed hybrid algorithm is lower than that of the product code with no erasure correction.Compared with other product codes using LDPC codes,the proposed LDPC-RS product code with the same code rate has much better performance and smaller rate loss attributed to the maximum distance separable(MDS)property and significant erasure-correction capability of RS codes.展开更多
In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destinatio...In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.展开更多
Two modified BP algorithms related to vertical and horizontal processes are proposed to accelerate iterative low-density parity- check (LDPC) decoding over an additive white Gaussian noise (AWGN) channel, where th...Two modified BP algorithms related to vertical and horizontal processes are proposed to accelerate iterative low-density parity- check (LDPC) decoding over an additive white Gaussian noise (AWGN) channel, where the newly updated extrinsic information is immediately used in the current decoding round. Theoretical analysis and simulation results demonstrate that both the modified approaches provide significant performance improvements over the traditional BP algorithm with almost no additional decoding complexity. The proposed algorithm with modified horizontal process offers even better performance than another algorithm with the modified horizontal process. The two modified BP algorithms are very promising in practical communications since both can achieve an excellent trade-off between the performance and decoding complexity.展开更多
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation (BP) algorithm. ...For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation (BP) algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.展开更多
A multi dimensional concatenation scheme for block codes is introduced, in which information symbols are interleaved and re encoded for more than once. It provides a convenient platform to design high performance co...A multi dimensional concatenation scheme for block codes is introduced, in which information symbols are interleaved and re encoded for more than once. It provides a convenient platform to design high performance codes with flexible interleaver size. Coset based MAP soft in/soft out decoding algorithms are presented for the F24 code. Simulation results show that the proposed coding scheme can achieve high coding gain with flexible interleaver length and very low decoding complexity.展开更多
An improved list sphere decoder (ILSD) is proposed based on the conventional list sphere decoder (LSD) and the reduced- complexity maximum likelihood sphere-decoding algorithm. Unlike the conventional LSD with fix...An improved list sphere decoder (ILSD) is proposed based on the conventional list sphere decoder (LSD) and the reduced- complexity maximum likelihood sphere-decoding algorithm. Unlike the conventional LSD with fixed initial radius, the ILSD adopts an adaptive radius to accelerate the list cdnstruction. Characterized by low-complexity and radius-insensitivity, the proposed algorithm makes iterative joint detection and decoding more realizable in multiple-antenna systems. Simulation results show that computational savings of ILSD over LSD are more apparent with more transmit antennas or larger constellations, and with no performance degradation. Because the complexity of the ILSD algorithm almost keeps invariant with the increasing of initial radius, the BER performance can be improved by selecting a sufficiently large radius.展开更多
A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single relay.The relay cooperates with mul...A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single relay.The relay cooperates with multiple sources simultaneously via network-coding.It avoids the issues of imperfect frequency/timing synchronization and large transmission delay which may be introduced by frequency-division multiple access(FDMA)/code-division multiple access(CDMA)and time-division multiple access(TDMA)manners.The proposed joint″Min-Sum″iterative decoding is effectively carried out in the destination.Such a decoding algorithm agrees with the introduced equivalent joint Tanner graph which can be used to fully characterize LDPC codes employed by the sources and relay.Theoretical analysis and numerical simulation show that the proposed scheme with joint iterative decoding can achieve significant cooperation diversity gain.Furthermore,for the relay,compared with the cascade scheme,the proposed scheme has much lower complexity of LDPC-encoding and is easier to be implemented in the hardware with similar bit error rate(BER)performance.展开更多
Iterative demodulation and decoding scheme is analyzed and modulation labeling is considered to be one of the crucial factors to this scheme. By analyzing the existent mapping design criterion, four aspects are found ...Iterative demodulation and decoding scheme is analyzed and modulation labeling is considered to be one of the crucial factors to this scheme. By analyzing the existent mapping design criterion, four aspects are found as the key techniques for choosing a label mapping. Based on this discovery, a novel mapping design criteflon is proposed and two label mappings are searched according to it. Simulation results show that the performance of BICM-ID using the novel mappings is better than the former ones. The extrinsic information transfer (EXIT) chart is introduced and it is used to evaluate the proposed mapping design criteria.展开更多
An iterative detection and decoding algorithm with outer code decision feedback is proposed for the dual polarized( DP) land mobile satellite( LMS) MIMO systems using concatenated codes. A feedback structure is added ...An iterative detection and decoding algorithm with outer code decision feedback is proposed for the dual polarized( DP) land mobile satellite( LMS) MIMO systems using concatenated codes. A feedback structure is added after the outer decoder in the proposed algorithm. The feedback information is exploited to control the detecting list in the MIMO detector and reduce the number of symbols which have to be processed at each iteration. As a result,the computational complexity is reduced. Meanwhile,the successfully decoded outer code words are used to calculate the more reliable initial information for the inner decoder and the system performance can be improved by this step. The simulation results show that the proposed algorithm can reduce the computational complexity compared to the traditional iterative detection and decoding algorithm and achieve better performance.展开更多
Today the error correcting codes are present in all the telecom standards, in particular the low density parity check (LDPC) codes. The choice of a good code for a given network is essentially linked to the decoding p...Today the error correcting codes are present in all the telecom standards, in particular the low density parity check (LDPC) codes. The choice of a good code for a given network is essentially linked to the decoding performance obtained by the bit error rate (BER) curves. This approach requires a significant simulation time proportional to the length of the code, to overcome this problem Exit chart was introduced, as a fast technique to predict the performance of a particular class of codes called Turbo codes. In this paper, we success to apply Exit chart to analyze convergence behavior of iterative threshold decoding of one step majority logic decodable (OSMLD) codes. The iterative decoding process uses a soft-input soft-output threshold decoding algorithm as component decoder. Simulation results for iterative decoding of simple and concatenated codes transmitted over a Gaussian channel have shown that the thresholds obtained are a good indicator of the Bit Error Rate (BER) curves.展开更多
This paper presents an intelligent protograph construction algorithm.Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications.Random search or manua...This paper presents an intelligent protograph construction algorithm.Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications.Random search or manual construction are often used to obtain a good protograph,but the efficiency is not high enough and many experience and skills are needed.In this paper,a fast searching algorithm is proposed using the convolution neural network to predict the iterative decoding thresholds of protograph LDPC codes effectively.A special input data transformation rule is applied to provide stronger generalization ability.The proposed algorithm converges faster than other algorithms.The iterative decoding threshold of the constructed protograph surpasses greedy algorithm and random search by about 0.53 dB and 0.93 dB respectively under 100 times of density evolution.Simulation results show that quasi-cyclic LDPC(QC-LDPC)codes constructed from the proposed algorithm have competitive performance compared to other papers.展开更多
Mapping design criteria of bit-interleaved coded modulation with iterative decoding (BICM-ID) with square 16QAM are analyzed. Three of the existing criteria are analyzed and compared with each other. Through the compa...Mapping design criteria of bit-interleaved coded modulation with iterative decoding (BICM-ID) with square 16QAM are analyzed. Three of the existing criteria are analyzed and compared with each other. Through the comparison, two main characters of the mapping design criteria are found. They are the harmonic mean of the minimum squared Euclidean distance and the average of Hamming distances with the nearest Euclidean distance. Based on these two characters, a novel mapping design criterion is proposed and a label mapping named mixed mapping is searched according to it. Simulation results show that mixed mapping performs better than the other mappings in BICM-ID system.展开更多
The 16-ary quadrature amplitude modulation (16QAM) is a high spectral efficient scheme for high-speed transmission systems. To remove the phase ambiguity in the coherent detection system, differential-encoded 16QAM ...The 16-ary quadrature amplitude modulation (16QAM) is a high spectral efficient scheme for high-speed transmission systems. To remove the phase ambiguity in the coherent detection system, differential-encoded 16QAM (DE-16QAM) is usually used, however, it will cause performance degradation about 3 dB as compared to the conventional 16QAM. To overcome the performance loss, a serial concatenated system with outer low density parity check (LDPC) codes and inner DE-16QAM is proposed. At the receiver, joint iterative differential demodulation and decoding (ID) is carried out to approach the maximum likelihood performance. Moreover, a genetic evolution algorithm based on the extrinsic information transfer chart is proposed to optimize the degree distribution of the outer LDPC codes. Both theoretical analyses and simulation results indicate that this algorithm not only compensates the performance loss, but also obtains a significant performance gain, which is up to 1 dB as compared to the conventional non-DE-16QAM.展开更多
Multiple antenna wireless systems can provide larger channel capacity and enable spatial diversity to combat fading. In this paper we conduct an investigation into the design of coded space-time system obtained by ser...Multiple antenna wireless systems can provide larger channel capacity and enable spatial diversity to combat fading. In this paper we conduct an investigation into the design of coded space-time system obtained by serially concatenating channel code module and space-time code module with an interleaver in between. As an example, the system is constructed by employing low decoding complexity turbo-SPC (single parity check) code as outer module and linear complex field space-time code as inner module, which achieves full diversity and lossless equivalent channel capacity. Simulation results prove that our designed system performs well and it only loses 0.8 dB from multiple-input multiple-output (MIMO) capacity at BER = 10^-5 in the case of information bit length 6048. Compared with turbo code-based systems, it also has lower error floor.展开更多
It is well known that turbo decoding always begins from the first component decoder and supposes that the apriori information is '0' at the first iterative decoding. To alternatively start decoding at two comp...It is well known that turbo decoding always begins from the first component decoder and supposes that the apriori information is '0' at the first iterative decoding. To alternatively start decoding at two component decoders, we can gain two soft output values for the received observation of an input bit. It is obvious that two soft output values comprise more sufficient extrinsic information than only one output value obtained in the conventional scheme since different start points of decoding result in different combinations of the a priori information and the input codewords with different symbol orders due to the permutation of an interleaver. Summarizing two soft output values for erery bit before making hard decisions, we can correct more errors due to their complement. Consequently, turbo codes can achieve better error correcting performance than before in this way. Simulation results show that the performance of turbo codes using the novel proposed decoding scheme can get a growing improvement with the increment of SNR in general compared to the conventional scheme. When the bit error probability is 10-5 , the proposed scheme can achieve 0.5 dB asymptotic coding gain or so under the given simulation conditions.展开更多
The soft cancellation decoding of polar codes achieves a better performance than the belief propagation decoding with lower computational time and space complexities.However,because the soft cancellation decoding is b...The soft cancellation decoding of polar codes achieves a better performance than the belief propagation decoding with lower computational time and space complexities.However,because the soft cancellation decoding is based on the successive cancellation decoding,the decoding efficiency and performance with finite-length blocks can be further improved.Exploiting the idea of the successive cancellation list decoding,the soft cancellation decoding can be improved in two aspects:one is by adding branch decoding to the error-prone information bits to increase the accuracy of the soft information,and the other is through using partial iterative decoding to reduce the time and computational complexities.Compared with the original method,the improved soft cancellation decoding makes progress in the error correction performance,increasing the decoding efficiency and reducing the computational complexity,at the cost of a small increase of space complexity.展开更多
In this paper,we study turbo codes from the digital signal processing point of view by defining turbo codes over the complex field.It is known that iterative decoding and interleaving between concatenated parallel cod...In this paper,we study turbo codes from the digital signal processing point of view by defining turbo codes over the complex field.It is known that iterative decoding and interleaving between concatenated parallel codes are two key elements that make turbo codes perform significantly better than the conventional error control codes.This is analytically illustrated in this paper.We show that the decoded noise mean power in the iterative decoding decreases when the number of iterations increases,as long as the interleaving decorrelates the noise after each iterative decoding step.An analytic decreasing rate and the limit of the decoded noise mean power are given.The limit of the decoded noise mean power of the iterative decoding of a turbo code with two parallel codes with their rates less than 1/2 is one third of the noise power before the decoding,which can not be achieved by any non-turbo codes with the same rate.From this study,the role of designing a good interleaver can also be clearly seen.展开更多
Q-ary low-density parity-check (Q-LDPC) codes have a better performance than those of the binary low-density parity-check (B-LDPC) codes, at short and medium block lengths, but the decoder of Q-LDPC has more compl...Q-ary low-density parity-check (Q-LDPC) codes have a better performance than those of the binary low-density parity-check (B-LDPC) codes, at short and medium block lengths, but the decoder of Q-LDPC has more complexity. In this article, a new stop criterion is proposed. By analyzing the changes of the maximum posteriori probability of the variable node, the criterion decides whether the iteration of the decoder must be stopped. The simulation results show that the stop criterion can effectively reduce the computation complexity of the Q-LDPC decoder with negligible performance loss.展开更多
In multipath environments, the error rate performance of orthogonal frequency division multiplexing (OFDM) is severely degraded by the deep fading subcarriers. Powerful error-correcting codes must be used with OFDM....In multipath environments, the error rate performance of orthogonal frequency division multiplexing (OFDM) is severely degraded by the deep fading subcarriers. Powerful error-correcting codes must be used with OFDM. This paper presents a quasi-cyclic low-density parity-check (LDPC) coded OFDM system, in which the redundant bits of each codeword are mapped to a higher-order modulation constellation. The op- timal degree distribution was calculated using density evolution. The corresponding quasi-cyclic LDPC code was then constructed using circulant permutation matrices. Group shuffled message passing scheduling was used in the iterative decoding. Simulation results show that the system achieves better error rate performance and faster decoding convergence than conventional approaches on both additive white Gaussian noise (AWGN) and Rayleigh fading channels.展开更多
When implementing helicopter-satellite communications, periodical interruption of the received signal is a challenging problem because the communication antenna is intermittently blocked by the rotating blades of the ...When implementing helicopter-satellite communications, periodical interruption of the received signal is a challenging problem because the communication antenna is intermittently blocked by the rotating blades of the helicopter. The helicopter-satellite channel model and the Forward Error Control(FEC) coding countermeasure are presented in this paper. On the basis of this model, Check-Hybrid(CH) Low-Density Parity-Check(LDPC)codes are designed to mitigate the periodical blockage over the helicopter-satellite channels. The CH-LDPC code is derived by replacing part of single parity-check code constraints in a Quasi-Cyclic LDPC(QC-LDPC) code by using more powerful linear block code constraints. In particular, a method of optimizing the CH-LDPC code ensemble by searching the best matching component code among a variety of linear block codes using extrinsic information transfer charts is proposed. Simulation results show that, the CH-LDPC coding scheme designed for the helicopter-satellite channels in this paper achieves more than 25% bandwidth efficiency improvement, compared with the FEC scheme that uses QC-LDPC codes.展开更多
基金This work was supported in part by National Natural Science Foundation of China(No.61671324)the Director’s Funding from Pilot National Laboratory for Marine Science and Technology(Qingdao)(QNLM201712).
文摘Low-density parity-check(LDPC)codes are widely used due to their significant errorcorrection capability and linear decoding complexity.However,it is not sufficient for LDPC codes to satisfy the ultra low bit error rate(BER)requirement of next-generation ultra-high-speed communications due to the error floor phenomenon.According to the residual error characteristics of LDPC codes,we consider using the high rate Reed-Solomon(RS)codes as the outer codes to construct LDPC-RS product codes to eliminate the error floor and propose the hybrid error-erasure-correction decoding algorithm for the outer code to exploit erasure-correction capability effectively.Furthermore,the overall performance of product codes is improved using iteration between outer and inner codes.Simulation results validate that BER of the product code with the proposed hybrid algorithm is lower than that of the product code with no erasure correction.Compared with other product codes using LDPC codes,the proposed LDPC-RS product code with the same code rate has much better performance and smaller rate loss attributed to the maximum distance separable(MDS)property and significant erasure-correction capability of RS codes.
基金Supported by the Open Research Fund of National Moblie Communications Research Laboratory of Southeast Uni-versity (No. W200704)
文摘In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.
基金National Mobile Communication Research Laboratory,Southeast University(No.W200704),ChinaNatural Science foundation of Jiangsu Province (No.BK2006188),ChinaQuebec-China Joint Research Foundation by McGill University,Montreal,Quebec,Canada
文摘Two modified BP algorithms related to vertical and horizontal processes are proposed to accelerate iterative low-density parity- check (LDPC) decoding over an additive white Gaussian noise (AWGN) channel, where the newly updated extrinsic information is immediately used in the current decoding round. Theoretical analysis and simulation results demonstrate that both the modified approaches provide significant performance improvements over the traditional BP algorithm with almost no additional decoding complexity. The proposed algorithm with modified horizontal process offers even better performance than another algorithm with the modified horizontal process. The two modified BP algorithms are very promising in practical communications since both can achieve an excellent trade-off between the performance and decoding complexity.
基金Project supported by the National Natural Science Foundation of China(Grant No.60972046)Grant from the National Defense Pre-Research Foundation of China
文摘For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation (BP) algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
文摘A multi dimensional concatenation scheme for block codes is introduced, in which information symbols are interleaved and re encoded for more than once. It provides a convenient platform to design high performance codes with flexible interleaver size. Coset based MAP soft in/soft out decoding algorithms are presented for the F24 code. Simulation results show that the proposed coding scheme can achieve high coding gain with flexible interleaver length and very low decoding complexity.
基金The National Natural Science Founda-tion of China ( No 60496316)the National Hi-Tech Re-search and Development Program (863) of China (No2006-AA01Z270)
文摘An improved list sphere decoder (ILSD) is proposed based on the conventional list sphere decoder (LSD) and the reduced- complexity maximum likelihood sphere-decoding algorithm. Unlike the conventional LSD with fixed initial radius, the ILSD adopts an adaptive radius to accelerate the list cdnstruction. Characterized by low-complexity and radius-insensitivity, the proposed algorithm makes iterative joint detection and decoding more realizable in multiple-antenna systems. Simulation results show that computational savings of ILSD over LSD are more apparent with more transmit antennas or larger constellations, and with no performance degradation. Because the complexity of the ILSD algorithm almost keeps invariant with the increasing of initial radius, the BER performance can be improved by selecting a sufficiently large radius.
基金Supported by the Postdoctoral Science Foundation of China(2014M561694)the Science and Technology on Avionics Integration Laboratory and National Aeronautical Science Foundation of China(20105552)
文摘A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single relay.The relay cooperates with multiple sources simultaneously via network-coding.It avoids the issues of imperfect frequency/timing synchronization and large transmission delay which may be introduced by frequency-division multiple access(FDMA)/code-division multiple access(CDMA)and time-division multiple access(TDMA)manners.The proposed joint″Min-Sum″iterative decoding is effectively carried out in the destination.Such a decoding algorithm agrees with the introduced equivalent joint Tanner graph which can be used to fully characterize LDPC codes employed by the sources and relay.Theoretical analysis and numerical simulation show that the proposed scheme with joint iterative decoding can achieve significant cooperation diversity gain.Furthermore,for the relay,compared with the cascade scheme,the proposed scheme has much lower complexity of LDPC-encoding and is easier to be implemented in the hardware with similar bit error rate(BER)performance.
文摘Iterative demodulation and decoding scheme is analyzed and modulation labeling is considered to be one of the crucial factors to this scheme. By analyzing the existent mapping design criterion, four aspects are found as the key techniques for choosing a label mapping. Based on this discovery, a novel mapping design criteflon is proposed and two label mappings are searched according to it. Simulation results show that the performance of BICM-ID using the novel mappings is better than the former ones. The extrinsic information transfer (EXIT) chart is introduced and it is used to evaluate the proposed mapping design criteria.
基金Sponsored by the Postdoctoral Science Foundation of China(Grant No.2011M500640)
文摘An iterative detection and decoding algorithm with outer code decision feedback is proposed for the dual polarized( DP) land mobile satellite( LMS) MIMO systems using concatenated codes. A feedback structure is added after the outer decoder in the proposed algorithm. The feedback information is exploited to control the detecting list in the MIMO detector and reduce the number of symbols which have to be processed at each iteration. As a result,the computational complexity is reduced. Meanwhile,the successfully decoded outer code words are used to calculate the more reliable initial information for the inner decoder and the system performance can be improved by this step. The simulation results show that the proposed algorithm can reduce the computational complexity compared to the traditional iterative detection and decoding algorithm and achieve better performance.
文摘Today the error correcting codes are present in all the telecom standards, in particular the low density parity check (LDPC) codes. The choice of a good code for a given network is essentially linked to the decoding performance obtained by the bit error rate (BER) curves. This approach requires a significant simulation time proportional to the length of the code, to overcome this problem Exit chart was introduced, as a fast technique to predict the performance of a particular class of codes called Turbo codes. In this paper, we success to apply Exit chart to analyze convergence behavior of iterative threshold decoding of one step majority logic decodable (OSMLD) codes. The iterative decoding process uses a soft-input soft-output threshold decoding algorithm as component decoder. Simulation results for iterative decoding of simple and concatenated codes transmitted over a Gaussian channel have shown that the thresholds obtained are a good indicator of the Bit Error Rate (BER) curves.
基金supported in part with the Project on the Industry Key Technologies of Jiangsu Province(No.BE2017153)the Industry-University-Research Fund of ZTE Corporation.
文摘This paper presents an intelligent protograph construction algorithm.Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications.Random search or manual construction are often used to obtain a good protograph,but the efficiency is not high enough and many experience and skills are needed.In this paper,a fast searching algorithm is proposed using the convolution neural network to predict the iterative decoding thresholds of protograph LDPC codes effectively.A special input data transformation rule is applied to provide stronger generalization ability.The proposed algorithm converges faster than other algorithms.The iterative decoding threshold of the constructed protograph surpasses greedy algorithm and random search by about 0.53 dB and 0.93 dB respectively under 100 times of density evolution.Simulation results show that quasi-cyclic LDPC(QC-LDPC)codes constructed from the proposed algorithm have competitive performance compared to other papers.
文摘Mapping design criteria of bit-interleaved coded modulation with iterative decoding (BICM-ID) with square 16QAM are analyzed. Three of the existing criteria are analyzed and compared with each other. Through the comparison, two main characters of the mapping design criteria are found. They are the harmonic mean of the minimum squared Euclidean distance and the average of Hamming distances with the nearest Euclidean distance. Based on these two characters, a novel mapping design criterion is proposed and a label mapping named mixed mapping is searched according to it. Simulation results show that mixed mapping performs better than the other mappings in BICM-ID system.
基金supported by the National Natural Science Foundation of China(61171101)the State Major Science and Technology Special Projects(2009ZX03003-011-03)
文摘The 16-ary quadrature amplitude modulation (16QAM) is a high spectral efficient scheme for high-speed transmission systems. To remove the phase ambiguity in the coherent detection system, differential-encoded 16QAM (DE-16QAM) is usually used, however, it will cause performance degradation about 3 dB as compared to the conventional 16QAM. To overcome the performance loss, a serial concatenated system with outer low density parity check (LDPC) codes and inner DE-16QAM is proposed. At the receiver, joint iterative differential demodulation and decoding (ID) is carried out to approach the maximum likelihood performance. Moreover, a genetic evolution algorithm based on the extrinsic information transfer chart is proposed to optimize the degree distribution of the outer LDPC codes. Both theoretical analyses and simulation results indicate that this algorithm not only compensates the performance loss, but also obtains a significant performance gain, which is up to 1 dB as compared to the conventional non-DE-16QAM.
基金supported by the National Natural Science Foundation of China (Grant Nos.60332030, 60572157), and the National High-TechnologY Research and Development of China (Grant No.863-2003AA123310)
文摘Multiple antenna wireless systems can provide larger channel capacity and enable spatial diversity to combat fading. In this paper we conduct an investigation into the design of coded space-time system obtained by serially concatenating channel code module and space-time code module with an interleaver in between. As an example, the system is constructed by employing low decoding complexity turbo-SPC (single parity check) code as outer module and linear complex field space-time code as inner module, which achieves full diversity and lossless equivalent channel capacity. Simulation results prove that our designed system performs well and it only loses 0.8 dB from multiple-input multiple-output (MIMO) capacity at BER = 10^-5 in the case of information bit length 6048. Compared with turbo code-based systems, it also has lower error floor.
文摘It is well known that turbo decoding always begins from the first component decoder and supposes that the apriori information is '0' at the first iterative decoding. To alternatively start decoding at two component decoders, we can gain two soft output values for the received observation of an input bit. It is obvious that two soft output values comprise more sufficient extrinsic information than only one output value obtained in the conventional scheme since different start points of decoding result in different combinations of the a priori information and the input codewords with different symbol orders due to the permutation of an interleaver. Summarizing two soft output values for erery bit before making hard decisions, we can correct more errors due to their complement. Consequently, turbo codes can achieve better error correcting performance than before in this way. Simulation results show that the performance of turbo codes using the novel proposed decoding scheme can get a growing improvement with the increment of SNR in general compared to the conventional scheme. When the bit error probability is 10-5 , the proposed scheme can achieve 0.5 dB asymptotic coding gain or so under the given simulation conditions.
文摘The soft cancellation decoding of polar codes achieves a better performance than the belief propagation decoding with lower computational time and space complexities.However,because the soft cancellation decoding is based on the successive cancellation decoding,the decoding efficiency and performance with finite-length blocks can be further improved.Exploiting the idea of the successive cancellation list decoding,the soft cancellation decoding can be improved in two aspects:one is by adding branch decoding to the error-prone information bits to increase the accuracy of the soft information,and the other is through using partial iterative decoding to reduce the time and computational complexities.Compared with the original method,the improved soft cancellation decoding makes progress in the error correction performance,increasing the decoding efficiency and reducing the computational complexity,at the cost of a small increase of space complexity.
文摘In this paper,we study turbo codes from the digital signal processing point of view by defining turbo codes over the complex field.It is known that iterative decoding and interleaving between concatenated parallel codes are two key elements that make turbo codes perform significantly better than the conventional error control codes.This is analytically illustrated in this paper.We show that the decoded noise mean power in the iterative decoding decreases when the number of iterations increases,as long as the interleaving decorrelates the noise after each iterative decoding step.An analytic decreasing rate and the limit of the decoded noise mean power are given.The limit of the decoded noise mean power of the iterative decoding of a turbo code with two parallel codes with their rates less than 1/2 is one third of the noise power before the decoding,which can not be achieved by any non-turbo codes with the same rate.From this study,the role of designing a good interleaver can also be clearly seen.
文摘Q-ary low-density parity-check (Q-LDPC) codes have a better performance than those of the binary low-density parity-check (B-LDPC) codes, at short and medium block lengths, but the decoder of Q-LDPC has more complexity. In this article, a new stop criterion is proposed. By analyzing the changes of the maximum posteriori probability of the variable node, the criterion decides whether the iteration of the decoder must be stopped. The simulation results show that the stop criterion can effectively reduce the computation complexity of the Q-LDPC decoder with negligible performance loss.
文摘In multipath environments, the error rate performance of orthogonal frequency division multiplexing (OFDM) is severely degraded by the deep fading subcarriers. Powerful error-correcting codes must be used with OFDM. This paper presents a quasi-cyclic low-density parity-check (LDPC) coded OFDM system, in which the redundant bits of each codeword are mapped to a higher-order modulation constellation. The op- timal degree distribution was calculated using density evolution. The corresponding quasi-cyclic LDPC code was then constructed using circulant permutation matrices. Group shuffled message passing scheduling was used in the iterative decoding. Simulation results show that the system achieves better error rate performance and faster decoding convergence than conventional approaches on both additive white Gaussian noise (AWGN) and Rayleigh fading channels.
基金supported by the National Natural Science Foundation of China(No.91538203)the new strategic industries development projects of Shenzhen City(No.JCYJ20150403155812833)
文摘When implementing helicopter-satellite communications, periodical interruption of the received signal is a challenging problem because the communication antenna is intermittently blocked by the rotating blades of the helicopter. The helicopter-satellite channel model and the Forward Error Control(FEC) coding countermeasure are presented in this paper. On the basis of this model, Check-Hybrid(CH) Low-Density Parity-Check(LDPC)codes are designed to mitigate the periodical blockage over the helicopter-satellite channels. The CH-LDPC code is derived by replacing part of single parity-check code constraints in a Quasi-Cyclic LDPC(QC-LDPC) code by using more powerful linear block code constraints. In particular, a method of optimizing the CH-LDPC code ensemble by searching the best matching component code among a variety of linear block codes using extrinsic information transfer charts is proposed. Simulation results show that, the CH-LDPC coding scheme designed for the helicopter-satellite channels in this paper achieves more than 25% bandwidth efficiency improvement, compared with the FEC scheme that uses QC-LDPC codes.