This work investigates the performance of various forward error correction codes, by which the MIMO-OFDM system is deployed. To ensure fair investigation, the performance of four modulations, namely, binary phase shif...This work investigates the performance of various forward error correction codes, by which the MIMO-OFDM system is deployed. To ensure fair investigation, the performance of four modulations, namely, binary phase shift keying(BPSK), quadrature phase shift keying(QPSK), quadrature amplitude modulation(QAM)-16 and QAM-64 with four error correction codes(convolutional code(CC), Reed-Solomon code(RSC)+CC, low density parity check(LDPC)+CC, Turbo+CC) is studied under three channel models(additive white Guassian noise(AWGN), Rayleigh, Rician) and three different antenna configurations(2×2, 2×4, 4×4). The bit error rate(BER) and the peak signal to noise ratio(PSNR) are taken as the measures of performance. The binary data and the color image data are transmitted and the graphs are plotted for various modulations with different channels and error correction codes. Analysis on the performance measures confirm that the Turbo + CC code in 4×4 configurations exhibits better performance.展开更多
The decoding algorithm for the correction of errors of arbitrary Mannheim weight has discussed for Lattice constellations and codes from quadratic number fields.Following these lines,the decoding algorithms for the co...The decoding algorithm for the correction of errors of arbitrary Mannheim weight has discussed for Lattice constellations and codes from quadratic number fields.Following these lines,the decoding algorithms for the correction of errors of n=p−12 length cyclic codes(C)over quaternion integers of Quaternion Mannheim(QM)weight one up to two coordinates have considered.In continuation,the case of cyclic codes of lengths n=p−12 and 2n−1=p−2 has studied to improve the error correction efficiency.In this study,we present the decoding of cyclic codes of length n=ϕ(p)=p−1 and length 2n−1=2ϕ(p)−1=2p−3(where p is prime integer andϕis Euler phi function)over Hamilton Quaternion integers of Quaternion Mannheim weight for the correction of errors.Furthermore,the error correction capability and code rate tradeoff of these codes are also discussed.Thus,an increase in the length of the cyclic code is achieved along with its better code rate and an adequate error correction capability.展开更多
In this paper,we propose an arbitrary decode-forward single-relay scheme for finite blocklength polar codes,which can be applied to the general symmetric discrete memoryless relay channel with orthogonal receiver comp...In this paper,we propose an arbitrary decode-forward single-relay scheme for finite blocklength polar codes,which can be applied to the general symmetric discrete memoryless relay channel with orthogonal receiver components.The relay node decodes the received message.The relay node selectively re-encodes the message and transmits it to the destination node.Furthermore,in order to minimize the upper-bound of the block error probability,we propose a selection strategy to decide the proper re-encoded bit set by the relay.Simulation results are presented to illustrate the improvement in decoding performance of the proposed scheme compared to conventional relay schemes in both additive white Gaussian noise(AWGN)channel and Rayleigh fading channel(RFC).展开更多
Efficient anti-jamming rateless coding based on cognitive Orthogonal Frequency Division Multiplexing (OFDM) modulation in Cognitive Radio Network (CRN) is mainly discussed. Rateless coding with small redundancy and lo...Efficient anti-jamming rateless coding based on cognitive Orthogonal Frequency Division Multiplexing (OFDM) modulation in Cognitive Radio Network (CRN) is mainly discussed. Rateless coding with small redundancy and low complexity is presented, and the optimal design methods of building rateless codes are also proposed. In CRN, anti-jamming rateless coding could recover the lost packets in parallel channels of cognitive OFDM, thus it protects Secondary Users (SUs) from the in-terference by Primary Users (PUs) efficiently. Frame Error Rate (FER) and throughput performance of SU employing anti-jamming rateless coding are analyzed in detail. Performance comparison between rateless coding and piecewise coding are also presented. It is shown that, anti-jamming rateless coding provides low FER and Word Error Rate (WER) performance with uniform sub-channel selection. Meanwhile, it is also verified that, in higher jamming rate and longer code redundancy scenario, rateless coding method could achieve better FER and throughput performance than another anti-jamming coding schemes.展开更多
It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） re...It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder＇s LRBs adapt to the external parameter of the decoder like SNR （Signal Noise Ratio） level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah＇s iterative decoding algorithm using the fixed LRBs parameter.展开更多
The closed-form solutions for error rates of Space-Time Block Code (STBC) Multiple Phase Shift Keying (MPSK) systems are derived in this paper. With characteristic function based method and the partial integration bas...The closed-form solutions for error rates of Space-Time Block Code (STBC) Multiple Phase Shift Keying (MPSK) systems are derived in this paper. With characteristic function based method and the partial integration based respectively, the exact expressions of error rates are obtained for (2,1) STBC with and without channel estimation error. Simulations show that the practical error rates accord with the theoretical ones, so closed-form error rates are accurate references for STBC performance evaluation. For the error of pilot assisted channel estimation, the performance of a (2,1) STBC system is deteriorated about 3dB.展开更多
The Enhanced Variable Rate Codec (EVRC) is a standard for the Speech Service Option 3 for Wideband Spread Spectrum Digital System, which has been employed in both IS-95 cellular systems and ANSI J-STC-008 PCS (Persona...The Enhanced Variable Rate Codec (EVRC) is a standard for the Speech Service Option 3 for Wideband Spread Spectrum Digital System, which has been employed in both IS-95 cellular systems and ANSI J-STC-008 PCS (Personal Communications Systems). This paper investigated the combination of turbo codes with Unequal Error Protection (UEP) and 16-QAM modulation for EVRC codec of Rate 1 to get power and bandwidth efficient coding scheme. The results show that the UEP system outperforms the Equal Error Protection (EEP) one by 1.45 dB at BER of 10 -5.展开更多
Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, ...Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, called pairwisequasi-ZF and pairwise-quasi-MMSE decoders, are proposed. First,two transmit signals are detected by the quasi-ZF or the quasiMMSE algorithm at the receiver. Then, the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate（ BER） performance of the proposed algorithms is compared with that of the current known decoding algorithms.Also, the number of calculations of ZF, MMSE, quasi-ZF and quasi-MMSE algorithms is compared with each other. Simulation results showthat the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasiMMSE algorithms. The BER performance of the pairwise-quasiZF（ pairwise-quasi-MMSE） decoder is equivalent to the pairwiseZF（ pairwise-MMSE） decoder, while the computational complexity is significantly reduced.展开更多
The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder nee...The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.展开更多
An adaptive modulation （AM） algorithm is proposed and the application of the adapting algorithm together with low-density parity-check （LDPC） codes in multicarrier systems is investigated. The AM algorithm is base...An adaptive modulation （AM） algorithm is proposed and the application of the adapting algorithm together with low-density parity-check （LDPC） codes in multicarrier systems is investigated. The AM algorithm is based on minimizing the average bit error rate （BER） of systems, the combination of AM algorithm and LDPC codes with different code rates （half and three-fourths） are studied. The proposed AM algorithm with that of Fischer et al is compared. Simulation results show that the performance of the proposed AM algorithm is better than that of the Fischer＇s algorithm. The results also show that application of the proposed AM algorithm together with LDPC codes can greatly improve the performance of multicarrier systems. Results also show that the performance of the proposed algorithm is degraded with an increase in code rate when code length is the same.展开更多
According to the requirements of the increasing development for optical transmission systems,a novel construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on the subgroup of the finite fiel...According to the requirements of the increasing development for optical transmission systems,a novel construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on the subgroup of the finite field multiplicative group is proposed.Furthermore,this construction method can effectively avoid the girth-4 phenomena and has the advantages such as simpler construction,easier implementation,lower encoding/decoding complexity,better girth properties and more flexible adjustment for the code length and code rate.The simulation results show that the error correction performance of the QC-LDPC(3 780,3 540) code with the code rate of 93.7% constructed by this proposed method is excellent,its net coding gain is respectively 0.3dB,0.55dB,1.4dB and 1.98dB higher than those of the QC-LDPC(5 334,4 962) code constructed by the method based on the inverse element characteristics in the finite field multiplicative group,the SCG-LDPC(3 969,3 720) code constructed by the systematically constructed Gallager(SCG) random construction method,the LDPC(32 640,30 592) code in ITU-T G.975.1 and the classic RS(255,239) code which is widely used in optical transmission systems in ITU-T G.975 at the bit error rate(BER) of 10-7.Therefore,the constructed QC-LDPC(3 780,3 540) code is more suitable for optical transmission systems.展开更多
In this paper, we study the performance of physical-layer network coding in asymmetric two-way relay channels using four different cases having different poor channels:phase asymmetry, downlink asymmetry, uplink asymm...In this paper, we study the performance of physical-layer network coding in asymmetric two-way relay channels using four different cases having different poor channels:phase asymmetry, downlink asymmetry, uplink asymmetry and node asymmetry. The decision and mapping rule for symmetric and asymmetric cases are studied. The performance in terms of bit error rate for each case will be studied and analysed by computer simulation. Analytical and simulation results show that uplink asymmetry is the worst case;intra-phase asymmetry and unreliable uplink channels will more severely affect the performance degradation, which is caused by channel asymmetry.展开更多
This paper proposes a high-throughput short reference differential chaos shift keying cooperative communication system with the aid of code index modulation,referred to as CIM-SR-DCSK-CC system.In the proposed CIM-SR-...This paper proposes a high-throughput short reference differential chaos shift keying cooperative communication system with the aid of code index modulation,referred to as CIM-SR-DCSK-CC system.In the proposed CIM-SR-DCSK-CC system,the source transmits information bits to both the relay and destination in the first time slot,while the relay not only forwards the source information bits but also sends new information bits to the destination in the second time slot.To be specific,the relay employs an N-order Walsh code to carry additional log_(2)N information bits,which are superimposed onto the SRDCSK signal carrying the decoded source information bits.Subsequently,the superimposed signal carrying both the source and relay information bits is transmitted to the destination.Moreover,the theoretical bit error rate(BER)expressions of the proposed CIMSR-DCSK-CC system are derived over additive white Gaussian noise(AWGN)and multipath Rayleigh fading channels.Compared with the conventional DCSKCC system and SR-DCSK-CC system,the proposed CIM-SR-DCSK-CC system can significantly improve the throughput without deteriorating any BER performance.As a consequence,the proposed system is very promising for the applications of the 6G-enabled lowpower and high-rate communication.展开更多
A direct detection optical orthogonal frequency division multiplexing(DDO-OFDM)system using turbo codes is built,and the transmission performance comparison between coded system and uncoded system is analyzed.Three de...A direct detection optical orthogonal frequency division multiplexing(DDO-OFDM)system using turbo codes is built,and the transmission performance comparison between coded system and uncoded system is analyzed.Three decoding algorithms,which are Log-maximum a posteriori(MAP),Max-Log-MAP and threshold Max-Log-MAP,are used in the turbo coded system.By comparing three decoding algorithms,the system using Max-Log-MAP algorithm has the best bit error rate(BER)performance.At the transmission distance of 240 km,the uncoded system with transmission rate of 30 Gbit/s can get the BER performance at the degree of 8.93×10-3 with optical signal to noise ratio(OSNR)of24 d B,while the turbo coded system with transmission rate of 50 Gbit/s can achieve it within OSNR of 20 d B.展开更多
timizing the formula, the energy for every bit of the codeword is optimized to achieve the minimum BER at high SNR region. At last, an adjustable parameter is employed to compensate the degrada- tions of BER at low an...timizing the formula, the energy for every bit of the codeword is optimized to achieve the minimum BER at high SNR region. At last, an adjustable parameter is employed to compensate the degrada- tions of BER at low and moderate SNR regions. Case studies indicate that the improvements of BER for turbo codes with short frame size are significant at a wide range of SNR展开更多
Puncturing is the predominant strategy to construct high code rate turbo codes. Puncturing tables are crucial to the performance of punctured turbo codes(PTC). This paper developed a new searching algorithm of optimal...Puncturing is the predominant strategy to construct high code rate turbo codes. Puncturing tables are crucial to the performance of punctured turbo codes(PTC). This paper developed a new searching algorithm of optimal puncturing tables based on average distance spectrum(ADS) criterion. Consequently, some optimal puncturing tables were presented as the searching results. Finally, it presented the performance comparison among some optimal and bad puncturing tables by simulation.展开更多
A differential modulation scheme using space-time block codes is put forward. Compared with other schemes, our scheme has lower computational complexity and has a simpler decoder. In the case of three or four transmit...A differential modulation scheme using space-time block codes is put forward. Compared with other schemes, our scheme has lower computational complexity and has a simpler decoder. In the case of three or four transmitter antennas, our scheme has a higher rate a higher coding gain and a lower bit error rate for a given rate. Then we made simulations for space-time block codes as well as group codes in the case of two, three, four and five transmit antennas. The simulations prove that using two transmit antennas, one receive antenna and code rate of 4 bits/s/Hz, the differential STBC method outperform the differential group codes method by 4 dB. Useing three, four and five transmit antennas, one receive antenna, and code rate of 3 bits/s/Hz are adopted, the differential STBC method outperform the differential group codes method by 5 dB, 6. 5 dB and 7 dB, respectively. In other words, the differential modulation scheme based on space-time block code is better than the corresponding differential modulation scheme展开更多
Currently puncturing is the predominant strategy to construct high code rate turbo codes. The puncturing period and puncturing patterns, which have important effect on the performance of punctured turbo codes (PTC), y...Currently puncturing is the predominant strategy to construct high code rate turbo codes. The puncturing period and puncturing patterns, which have important effect on the performance of punctured turbo codes (PTC), yet have not received complete investigations, are addressed in this paper. Proposes on selecting puncturing period and puncturing patterns are presented. Since puncturing will alter the distance spectrum of turbo codes, the performance of PTC needs further consideration. We derive an analytical upper bound for PTC, based on the assumption of uniform puncturing defined in this paper. Finally, we present some numeric results on the performance of PTC.展开更多
Turbo codes can achieve excellent performance at low signal-to-noise ratio (SNR), but the performance can be severely degraded if no trellis termination is employed. This paper proved that if trellis termination bits ...Turbo codes can achieve excellent performance at low signal-to-noise ratio (SNR), but the performance can be severely degraded if no trellis termination is employed. This paper proved that if trellis termination bits were appended to RSC1, trellis of RSC2 could be terminated by designing the interleaver properly, consequently, derived the designing condition of such self-terminated interleaver (STI). Then we presented an algorithm of implementing a kind of STI, which could terminate RSC2 as well on condition that the RSC1 was terminated. We verified the performance of STI for turbo codes by simulation, and the simulation results showed that turbo codes with STI outperformed interleavers that could not terminate RSC2 as well.展开更多
文摘This work investigates the performance of various forward error correction codes, by which the MIMO-OFDM system is deployed. To ensure fair investigation, the performance of four modulations, namely, binary phase shift keying(BPSK), quadrature phase shift keying(QPSK), quadrature amplitude modulation(QAM)-16 and QAM-64 with four error correction codes(convolutional code(CC), Reed-Solomon code(RSC)+CC, low density parity check(LDPC)+CC, Turbo+CC) is studied under three channel models(additive white Guassian noise(AWGN), Rayleigh, Rician) and three different antenna configurations(2×2, 2×4, 4×4). The bit error rate(BER) and the peak signal to noise ratio(PSNR) are taken as the measures of performance. The binary data and the color image data are transmitted and the graphs are plotted for various modulations with different channels and error correction codes. Analysis on the performance measures confirm that the Turbo + CC code in 4×4 configurations exhibits better performance.
基金The authors extend their gratitude to the Deanship of Scientific Research at King Khalid University for funding this work through research groups program under grant number R.G.P.1/85/42.
文摘The decoding algorithm for the correction of errors of arbitrary Mannheim weight has discussed for Lattice constellations and codes from quadratic number fields.Following these lines,the decoding algorithms for the correction of errors of n=p−12 length cyclic codes(C)over quaternion integers of Quaternion Mannheim(QM)weight one up to two coordinates have considered.In continuation,the case of cyclic codes of lengths n=p−12 and 2n−1=p−2 has studied to improve the error correction efficiency.In this study,we present the decoding of cyclic codes of length n=ϕ(p)=p−1 and length 2n−1=2ϕ(p)−1=2p−3(where p is prime integer andϕis Euler phi function)over Hamilton Quaternion integers of Quaternion Mannheim weight for the correction of errors.Furthermore,the error correction capability and code rate tradeoff of these codes are also discussed.Thus,an increase in the length of the cyclic code is achieved along with its better code rate and an adequate error correction capability.
基金supported in part by the National Natural Science Foundation of China under Grant 92067202,Grant 62071058.
文摘In this paper,we propose an arbitrary decode-forward single-relay scheme for finite blocklength polar codes,which can be applied to the general symmetric discrete memoryless relay channel with orthogonal receiver components.The relay node decodes the received message.The relay node selectively re-encodes the message and transmits it to the destination node.Furthermore,in order to minimize the upper-bound of the block error probability,we propose a selection strategy to decide the proper re-encoded bit set by the relay.Simulation results are presented to illustrate the improvement in decoding performance of the proposed scheme compared to conventional relay schemes in both additive white Gaussian noise(AWGN)channel and Rayleigh fading channel(RFC).
基金Supported by the National Natural Science Foundation of China (No. 60972039)the Scientific Planning Project of Zhejiang Province entitled "Research and Development of Smart Antenna for the Next Generation Mobile Com-munications Based on TDD"the Young Staff Startup Research Foundation of Hangzhou Dianzi University entitled "Research on Key Technologies of Resource Allocation in Cognitive Radio Networks Based on Multicarrier Modulation"
文摘Efficient anti-jamming rateless coding based on cognitive Orthogonal Frequency Division Multiplexing (OFDM) modulation in Cognitive Radio Network (CRN) is mainly discussed. Rateless coding with small redundancy and low complexity is presented, and the optimal design methods of building rateless codes are also proposed. In CRN, anti-jamming rateless coding could recover the lost packets in parallel channels of cognitive OFDM, thus it protects Secondary Users (SUs) from the in-terference by Primary Users (PUs) efficiently. Frame Error Rate (FER) and throughput performance of SU employing anti-jamming rateless coding are analyzed in detail. Performance comparison between rateless coding and piecewise coding are also presented. It is shown that, anti-jamming rateless coding provides low FER and Word Error Rate (WER) performance with uniform sub-channel selection. Meanwhile, it is also verified that, in higher jamming rate and longer code redundancy scenario, rateless coding method could achieve better FER and throughput performance than another anti-jamming coding schemes.
基金the National Natural Science Foundation of China under grants，NUAA research funding
文摘It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder＇s LRBs adapt to the external parameter of the decoder like SNR （Signal Noise Ratio） level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah＇s iterative decoding algorithm using the fixed LRBs parameter.
文摘The closed-form solutions for error rates of Space-Time Block Code (STBC) Multiple Phase Shift Keying (MPSK) systems are derived in this paper. With characteristic function based method and the partial integration based respectively, the exact expressions of error rates are obtained for (2,1) STBC with and without channel estimation error. Simulations show that the practical error rates accord with the theoretical ones, so closed-form error rates are accurate references for STBC performance evaluation. For the error of pilot assisted channel estimation, the performance of a (2,1) STBC system is deteriorated about 3dB.
基金National Natural Science Foundation ofChina( No.6972 5 0 0 1)
文摘The Enhanced Variable Rate Codec (EVRC) is a standard for the Speech Service Option 3 for Wideband Spread Spectrum Digital System, which has been employed in both IS-95 cellular systems and ANSI J-STC-008 PCS (Personal Communications Systems). This paper investigated the combination of turbo codes with Unequal Error Protection (UEP) and 16-QAM modulation for EVRC codec of Rate 1 to get power and bandwidth efficient coding scheme. The results show that the UEP system outperforms the Equal Error Protection (EEP) one by 1.45 dB at BER of 10 -5.
基金The National Natural Science Foundation of China(No.6157110861201248)+1 种基金the Open Research Fund of National Mobile Communications Research Laboratory of China(No.2011D18)China Postdoctoral Science Foundation(No.2012M511175)
文摘Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, called pairwisequasi-ZF and pairwise-quasi-MMSE decoders, are proposed. First,two transmit signals are detected by the quasi-ZF or the quasiMMSE algorithm at the receiver. Then, the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate（ BER） performance of the proposed algorithms is compared with that of the current known decoding algorithms.Also, the number of calculations of ZF, MMSE, quasi-ZF and quasi-MMSE algorithms is compared with each other. Simulation results showthat the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasiMMSE algorithms. The BER performance of the pairwise-quasiZF（ pairwise-quasi-MMSE） decoder is equivalent to the pairwiseZF（ pairwise-MMSE） decoder, while the computational complexity is significantly reduced.
基金supported by Beijing Natural Science Foundation(4102050)the National Natural Science of Foundation of China(NSFC)-Korea Science and Engineering Foundation (KOSF) Joint Research Project of China and Korea (60811140343)
文摘The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.
基金the National Natural Science Foundation of China (60496313)
文摘An adaptive modulation （AM） algorithm is proposed and the application of the adapting algorithm together with low-density parity-check （LDPC） codes in multicarrier systems is investigated. The AM algorithm is based on minimizing the average bit error rate （BER） of systems, the combination of AM algorithm and LDPC codes with different code rates （half and three-fourths） are studied. The proposed AM algorithm with that of Fischer et al is compared. Simulation results show that the performance of the proposed AM algorithm is better than that of the Fischer＇s algorithm. The results also show that application of the proposed AM algorithm together with LDPC codes can greatly improve the performance of multicarrier systems. Results also show that the performance of the proposed algorithm is degraded with an increase in code rate when code length is the same.
基金supported by the Program for Innovation Team Building at Institutions of Higher Education in Chongqing(No.J2013-46)the National Natural Science Foundation of China(Nos.61472464 and 61471075)+1 种基金the Natural Science Foundation of Chongqing Science and Technology Commission(Nos.cstc2015jcyj A0554 and cstc2013jcyj A40017)the Program for Postgraduate Science Research and Innovation of Chongqing University of Posts and Telecommunications(Chongqing Municipal Education Commission)(No.CYS14144)
文摘According to the requirements of the increasing development for optical transmission systems,a novel construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on the subgroup of the finite field multiplicative group is proposed.Furthermore,this construction method can effectively avoid the girth-4 phenomena and has the advantages such as simpler construction,easier implementation,lower encoding/decoding complexity,better girth properties and more flexible adjustment for the code length and code rate.The simulation results show that the error correction performance of the QC-LDPC(3 780,3 540) code with the code rate of 93.7% constructed by this proposed method is excellent,its net coding gain is respectively 0.3dB,0.55dB,1.4dB and 1.98dB higher than those of the QC-LDPC(5 334,4 962) code constructed by the method based on the inverse element characteristics in the finite field multiplicative group,the SCG-LDPC(3 969,3 720) code constructed by the systematically constructed Gallager(SCG) random construction method,the LDPC(32 640,30 592) code in ITU-T G.975.1 and the classic RS(255,239) code which is widely used in optical transmission systems in ITU-T G.975 at the bit error rate(BER) of 10-7.Therefore,the constructed QC-LDPC(3 780,3 540) code is more suitable for optical transmission systems.
基金supported by the National Natural Science Foundation of China under Grant No.61101248the Equipment Advance Research Projectof"Twelfth Five-Year"Plan under Grant No.51306040202And this work has been performed in the Project"Advanced Communication Research Program(ACRP)"supported by the Directorate of Research and Development,Defense Science and Technology Agency,Singapore under Grant No.DSOCL04020
文摘In this paper, we study the performance of physical-layer network coding in asymmetric two-way relay channels using four different cases having different poor channels:phase asymmetry, downlink asymmetry, uplink asymmetry and node asymmetry. The decision and mapping rule for symmetric and asymmetric cases are studied. The performance in terms of bit error rate for each case will be studied and analysed by computer simulation. Analytical and simulation results show that uplink asymmetry is the worst case;intra-phase asymmetry and unreliable uplink channels will more severely affect the performance degradation, which is caused by channel asymmetry.
基金supported in part by the NSF of China under Grant 62322106,62071131 and 62171135the Guangdong Basic and Applied Basic Research Foundation under Grant 2022B1515020086+2 种基金the NSF of Guangdong Province under Grant 2019A1515011465the International Collaborative Research Program of Guangdong Science and Technology Department under Grant 2022A0505050070the Industrial R&D Project of Haoyang Electronic Co.,Ltd.under Grant 2022440002001494.
文摘This paper proposes a high-throughput short reference differential chaos shift keying cooperative communication system with the aid of code index modulation,referred to as CIM-SR-DCSK-CC system.In the proposed CIM-SR-DCSK-CC system,the source transmits information bits to both the relay and destination in the first time slot,while the relay not only forwards the source information bits but also sends new information bits to the destination in the second time slot.To be specific,the relay employs an N-order Walsh code to carry additional log_(2)N information bits,which are superimposed onto the SRDCSK signal carrying the decoded source information bits.Subsequently,the superimposed signal carrying both the source and relay information bits is transmitted to the destination.Moreover,the theoretical bit error rate(BER)expressions of the proposed CIMSR-DCSK-CC system are derived over additive white Gaussian noise(AWGN)and multipath Rayleigh fading channels.Compared with the conventional DCSKCC system and SR-DCSK-CC system,the proposed CIM-SR-DCSK-CC system can significantly improve the throughput without deteriorating any BER performance.As a consequence,the proposed system is very promising for the applications of the 6G-enabled lowpower and high-rate communication.
基金supported by the National Natural Science Foundation of China(No.61107052)the Tianjin Natural Science Foundation of China(No.11JCYBJC0010)the Tianjin Youth Foundation of China(No.13JCQNJC01800)
文摘A direct detection optical orthogonal frequency division multiplexing(DDO-OFDM)system using turbo codes is built,and the transmission performance comparison between coded system and uncoded system is analyzed.Three decoding algorithms,which are Log-maximum a posteriori(MAP),Max-Log-MAP and threshold Max-Log-MAP,are used in the turbo coded system.By comparing three decoding algorithms,the system using Max-Log-MAP algorithm has the best bit error rate(BER)performance.At the transmission distance of 240 km,the uncoded system with transmission rate of 30 Gbit/s can get the BER performance at the degree of 8.93×10-3 with optical signal to noise ratio(OSNR)of24 d B,while the turbo coded system with transmission rate of 50 Gbit/s can achieve it within OSNR of 20 d B.
基金Supported by the National High Technology Research and Development Programme of China(No.2014AA01A705)the National Natural Science Foundation of China(U1204607)
文摘timizing the formula, the energy for every bit of the codeword is optimized to achieve the minimum BER at high SNR region. At last, an adjustable parameter is employed to compensate the degrada- tions of BER at low and moderate SNR regions. Case studies indicate that the improvements of BER for turbo codes with short frame size are significant at a wide range of SNR
文摘Puncturing is the predominant strategy to construct high code rate turbo codes. Puncturing tables are crucial to the performance of punctured turbo codes(PTC). This paper developed a new searching algorithm of optimal puncturing tables based on average distance spectrum(ADS) criterion. Consequently, some optimal puncturing tables were presented as the searching results. Finally, it presented the performance comparison among some optimal and bad puncturing tables by simulation.
基金This project was supported by the National Natural Science Foundation of China (60172018) .
文摘A differential modulation scheme using space-time block codes is put forward. Compared with other schemes, our scheme has lower computational complexity and has a simpler decoder. In the case of three or four transmitter antennas, our scheme has a higher rate a higher coding gain and a lower bit error rate for a given rate. Then we made simulations for space-time block codes as well as group codes in the case of two, three, four and five transmit antennas. The simulations prove that using two transmit antennas, one receive antenna and code rate of 4 bits/s/Hz, the differential STBC method outperform the differential group codes method by 4 dB. Useing three, four and five transmit antennas, one receive antenna, and code rate of 3 bits/s/Hz are adopted, the differential STBC method outperform the differential group codes method by 5 dB, 6. 5 dB and 7 dB, respectively. In other words, the differential modulation scheme based on space-time block code is better than the corresponding differential modulation scheme
基金This work is supported by National 863 Project of China (No. 2002 AA123046)
文摘Currently puncturing is the predominant strategy to construct high code rate turbo codes. The puncturing period and puncturing patterns, which have important effect on the performance of punctured turbo codes (PTC), yet have not received complete investigations, are addressed in this paper. Proposes on selecting puncturing period and puncturing patterns are presented. Since puncturing will alter the distance spectrum of turbo codes, the performance of PTC needs further consideration. We derive an analytical upper bound for PTC, based on the assumption of uniform puncturing defined in this paper. Finally, we present some numeric results on the performance of PTC.
文摘Turbo codes can achieve excellent performance at low signal-to-noise ratio (SNR), but the performance can be severely degraded if no trellis termination is employed. This paper proved that if trellis termination bits were appended to RSC1, trellis of RSC2 could be terminated by designing the interleaver properly, consequently, derived the designing condition of such self-terminated interleaver (STI). Then we presented an algorithm of implementing a kind of STI, which could terminate RSC2 as well on condition that the RSC1 was terminated. We verified the performance of STI for turbo codes by simulation, and the simulation results showed that turbo codes with STI outperformed interleavers that could not terminate RSC2 as well.
