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 the Davey-MacKay(DM) construction,the inner decoder treats unknown transmitted bits as random independent substitution errors. It limits the synchronization capability of the inner decoder, and thus weakens the err...In the Davey-MacKay(DM) construction,the inner decoder treats unknown transmitted bits as random independent substitution errors. It limits the synchronization capability of the inner decoder, and thus weakens the error-correcting capability of the DM construction.In order to improve the performance of the DM construction, an iterative decoding scheme is proposed, which iteratively utilizes the more accurate estimates of transmitted codewords. In the proposed scheme, the estimated average bit error rates and the estimated low-density parity-check(LDPC) codewords from the outer decoder are fed back into the inner decoder to update the synchronization process. Simulation results show that the proposed iterative decoding scheme significantly outperforms the traditional DM construction.展开更多
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.展开更多
The uplink of mobile satellite communication(MSC) system with hundreds of spot beams is essentially a multiple-input multiple-output(MIMO) channel. Dual-turbo iterative detection and decoding as a kind of MIMO receive...The uplink of mobile satellite communication(MSC) system with hundreds of spot beams is essentially a multiple-input multiple-output(MIMO) channel. Dual-turbo iterative detection and decoding as a kind of MIMO receiver, which exchanges soft extrinsic information between a soft-in soft-out(SISO) detector and an SISO decoder in an iterative fashion, is an efficient method to reduce the uplink inter-beam-interference(IBI),and so the receiving bit error rate(BER).We propose to replace the linear SISO detector of traditional dual-turbo iterative detection and decoding with the AMP detector for the low-density parity-check(LDPC) coded multibeam MSC uplink. This improvement can reduce the computational complexity and achieve much lower BER.展开更多
An iterative detection/decoding algorithm of correlated sources for the LDPC-based relay systems is presented. The signal from the source-destination(S-D) link is formulated as a highly correlated counterpart from the...An iterative detection/decoding algorithm of correlated sources for the LDPC-based relay systems is presented. The signal from the source-destination(S-D) link is formulated as a highly correlated counterpart from the relay-destination(R-D) link. A special XOR vector is defined using the correlated hard decision information blocks from two decoders and the extrinsic information exchanged between the two decoders is derived by the log-likelihood ratio(LLR) associated with the XOR vector. Such the decoding scheme is different from the traditional turbo-like detection/decoding algorithm, where the extrinsic information is computed by the side information and the soft decoder outputs. Simulations show that the presented algorithm has a slightly better performance than the traditional turbo-like algorithm(Taking the(255,175) EG-LDPC code as an example, it achieves about 0.1 dB performance gains aroundBLER=10^(-4)). Furthermore, the presented algorithm requires fewer computing operations per iteration and has faster convergence rate. For example, the average iteration of the presented algorithm is 33 at SNR=1.8 dB, which is about twice faster than that of the turbo-like algorithm, when decoding the(961,721) QC-LDPC code. Therefore, the presented decoding algorithm of correlated sources provides an alternative decoding solution for the LDPC-based relay systems.展开更多
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.展开更多
We combine the Turbo codes with differential frequency hopping (DFH) technique and propose a new technique called Turbo-DFH coding. The structures of Turbo-DFH encoder and decoder are given. Taking aim at characterist...We combine the Turbo codes with differential frequency hopping (DFH) technique and propose a new technique called Turbo-DFH coding. The structures of Turbo-DFH encoder and decoder are given. Taking aim at characteristic of Turbo-DFH system, the modified Log-MAP algorithm is presented and used for iterative decoding of Turbo-DFH decoder. Simulation results show that because the ideas of random coding and iterative decoding are used, the bit error rate (BER) performance of the Turbo-DFH system is better than that of the conventional DFH system.展开更多
There is a contradiction between high processing complexity and limited processing resources when turbo codes are used on the on-board processing(OBP)satellite platform.To solve this problem,this paper proposes a part...There is a contradiction between high processing complexity and limited processing resources when turbo codes are used on the on-board processing(OBP)satellite platform.To solve this problem,this paper proposes a partial iterative decode method for on-board application,in which satellite only carries out limited number of iteration according to the on-board processing resource limitation and the throughput capacity requirements.In this method,the soft information of parity bits,which is not obtained individually in conventional turbo decoder,is encoded and forwarded along with those of information bits.To save downlink transmit power,the soft information is limited and normalized before forwarding.The iteration number and limiter parameters are optimized with the help of EXIT chart and numerical analysis,respectively.Simulation results show that the proposed method can effectively decrease the complexity of onboard processing while achieve most of the decoding gain..展开更多
With the development of manufacture technology, the multi-level cell(MLC)technique dramatically increases the storage density of NAND flash memory. As the result,cell-to-cell interference(CCI) becomes more serious and...With the development of manufacture technology, the multi-level cell(MLC)technique dramatically increases the storage density of NAND flash memory. As the result,cell-to-cell interference(CCI) becomes more serious and hence causes an increase in the raw bit error rate of data stored in the cells.Recently, low-density parity-check(LDPC)codes have appeared to be a promising solution to combat the interference of MLC NAND flash memory. However, the decoding complexity of the sum-product algorithm(SPA) is extremely high. In this paper, to improve the accuracy of the log likelihood ratio(LLR) information of each bit in each NAND flash memory cell, we adopt a non-uniform detection(N-UD) which uses the average maximum mutual information to determine the value of the soft-decision reference voltages.Furthermore, with an aim to reduce the decoding complexity and improve the decoding performance, we propose a modified soft reliabilitybased iterative majority-logic decoding(MSRBI-MLGD) algorithm, which uses a non-uniform quantizer based on power function to decode LDPC codes. Simulation results show that our design can offer a desirable trade-off between the performance and complexity for high-column-weight LDPC-coded MLC NAND flash memory.展开更多
This paper addresses the problem of channel estimation in 5G-enabled vehicular-to-vehicular(V2V) channels with high-mobility environments and non-stationary feature. Considering orthogonal frequency division multiplex...This paper addresses the problem of channel estimation in 5G-enabled vehicular-to-vehicular(V2V) channels with high-mobility environments and non-stationary feature. Considering orthogonal frequency division multiplexing(OFDM) system, we perform extended Kalman filter(EKF) for channel estimation in conjunction with Iterative Detector & Decoder(IDD) at the receiver to improve the estimation accuracy. The EKF is proposed for jointly estimating the channel frequency response and the time-varying time correlation coefficients. And the IDD structure is adopted to reduce the estimation errors in EKF. The simulation results show that, compared with traditional methods, the proposed method effectively promotes the system performance.展开更多
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.展开更多
Massive multiple-input multiple-output provides improved energy efficiency and spectral efficiency in 5 G. However it requires large-scale matrix computation with tremendous complexity, especially for data detection a...Massive multiple-input multiple-output provides improved energy efficiency and spectral efficiency in 5 G. However it requires large-scale matrix computation with tremendous complexity, especially for data detection and precoding. Recently, many detection and precoding methods were proposed using approximate iteration methods, which meet the demand of precision with low complexity. In this paper, we compare these approximate iteration methods in precision and complexity, and then improve these methods with iteration refinement at the cost of little complexity and no extra hardware resource. By derivation, our proposal is a combination of three approximate iteration methods in essence and provides remarkable precision improvement on desired vectors. The results show that our proposal provides 27%-83% normalized mean-squared error improvement of the detection symbol vector and precoding symbol vector. Moreover, we find the bit-error rate is mainly controlled by soft-input soft-output Viterbi decoding when using approximate iteration methods. Further, only considering the effect on soft-input soft-output Viterbi decoding, the simulation results show that using a rough estimation for the filter matrix of minimum mean square error detection to calculating log-likelihood ratio could provideenough good bit-error rate performance, especially when the ratio of base station antennas number and the users number is not too large.展开更多
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.展开更多
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.展开更多
The demand for high-data-rate underwater acoustic communications(UACs)in marine development is increasing;however,severe multipaths make demodulation a challenge.The decision feedback equalizer(DFE)is one of the most ...The demand for high-data-rate underwater acoustic communications(UACs)in marine development is increasing;however,severe multipaths make demodulation a challenge.The decision feedback equalizer(DFE)is one of the most popular equalizers in UAC;however,it is not the optimal algorithm.Although maximum likelihood sequence estimation(MLSE)is the optimal algorithm,its complexity increases exponentially with the number of channel taps,making it challenging to apply to UAC.Therefore,this paper proposes a complexity-reduced MLSE to improve the bit error rate(BER)performance in multipath channels.In the proposed algorithm,the original channel is first shortened using a channel-shortening method,and several dominant channel taps are selected for MLSE.Subsequently,sphere decoding(SD)is performed in the following MLSE.Iterations are applied to eliminate inter-symbol interference caused by weak channel taps.The simulation and sea experiment demonstrate the superiority of the proposed algorithm.The simulation results show that channel shortening combined with SD can drastically reduce computational complexity,and iterative SD performs better than DFE based on recursive least squares(RLS-DFE),DFE based on improved proportionate normalized least mean squares(IPNLMS-DFE),and channel estimation-based DFE(CE-DFE).Moreover,the sea experimental results at Zhairuoshan Island in Zhoushan show that the proposed receiver scheme has improved BER performance over RLSDFE,IPNLMS-DFE,and CE-DFE.Compared with the RLS-DFE,the BER,after five iterations,is reduced from 0.0076 to 0.0037 in the 8–12 k Hz band and from 0.1516 to 0.1145 in the 13–17 k Hz band at a distance of 2000 m.Thus,the proposed algorithm makes it possible to apply MLSE in UAC in practical scenarios.展开更多
基金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 in part by National Natural Science Foundation of China(61671324)the Director’s Funding from Qingdao National Laboratory for Marine Science and Technology
文摘In the Davey-MacKay(DM) construction,the inner decoder treats unknown transmitted bits as random independent substitution errors. It limits the synchronization capability of the inner decoder, and thus weakens the error-correcting capability of the DM construction.In order to improve the performance of the DM construction, an iterative decoding scheme is proposed, which iteratively utilizes the more accurate estimates of transmitted codewords. In the proposed scheme, the estimated average bit error rates and the estimated low-density parity-check(LDPC) codewords from the outer decoder are fed back into the inner decoder to update the synchronization process. Simulation results show that the proposed iterative decoding scheme significantly outperforms the traditional DM construction.
基金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.
基金supported by the National Natural Science Foundation of China under Grants 61320106003 and 61401095the Civil Aerospace Technologies Research Project under Grant D010109The Fundamental Research Funds for the Central Universities under Grant YZZ17009
文摘The uplink of mobile satellite communication(MSC) system with hundreds of spot beams is essentially a multiple-input multiple-output(MIMO) channel. Dual-turbo iterative detection and decoding as a kind of MIMO receiver, which exchanges soft extrinsic information between a soft-in soft-out(SISO) detector and an SISO decoder in an iterative fashion, is an efficient method to reduce the uplink inter-beam-interference(IBI),and so the receiving bit error rate(BER).We propose to replace the linear SISO detector of traditional dual-turbo iterative detection and decoding with the AMP detector for the low-density parity-check(LDPC) coded multibeam MSC uplink. This improvement can reduce the computational complexity and achieve much lower BER.
基金supported by NSF of China (No.61362010,61661005)NSF of Guangxi (No.2015GXNSFAA139290,2014GXNSFBA118276,2012GXNSFAA053217)
文摘An iterative detection/decoding algorithm of correlated sources for the LDPC-based relay systems is presented. The signal from the source-destination(S-D) link is formulated as a highly correlated counterpart from the relay-destination(R-D) link. A special XOR vector is defined using the correlated hard decision information blocks from two decoders and the extrinsic information exchanged between the two decoders is derived by the log-likelihood ratio(LLR) associated with the XOR vector. Such the decoding scheme is different from the traditional turbo-like detection/decoding algorithm, where the extrinsic information is computed by the side information and the soft decoder outputs. Simulations show that the presented algorithm has a slightly better performance than the traditional turbo-like algorithm(Taking the(255,175) EG-LDPC code as an example, it achieves about 0.1 dB performance gains aroundBLER=10^(-4)). Furthermore, the presented algorithm requires fewer computing operations per iteration and has faster convergence rate. For example, the average iteration of the presented algorithm is 33 at SNR=1.8 dB, which is about twice faster than that of the turbo-like algorithm, when decoding the(961,721) QC-LDPC code. Therefore, the presented decoding algorithm of correlated sources provides an alternative decoding solution for the LDPC-based relay systems.
基金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.
文摘We combine the Turbo codes with differential frequency hopping (DFH) technique and propose a new technique called Turbo-DFH coding. The structures of Turbo-DFH encoder and decoder are given. Taking aim at characteristic of Turbo-DFH system, the modified Log-MAP algorithm is presented and used for iterative decoding of Turbo-DFH decoder. Simulation results show that because the ideas of random coding and iterative decoding are used, the bit error rate (BER) performance of the Turbo-DFH system is better than that of the conventional DFH system.
基金supported by National High Technology Research and Development Program(863 Program,2012AA01A502)National Natural Science Foundation of China (41206031)National Basic Research Program(2012CB316000)
文摘There is a contradiction between high processing complexity and limited processing resources when turbo codes are used on the on-board processing(OBP)satellite platform.To solve this problem,this paper proposes a partial iterative decode method for on-board application,in which satellite only carries out limited number of iteration according to the on-board processing resource limitation and the throughput capacity requirements.In this method,the soft information of parity bits,which is not obtained individually in conventional turbo decoder,is encoded and forwarded along with those of information bits.To save downlink transmit power,the soft information is limited and normalized before forwarding.The iteration number and limiter parameters are optimized with the help of EXIT chart and numerical analysis,respectively.Simulation results show that the proposed method can effectively decrease the complexity of onboard processing while achieve most of the decoding gain..
基金supported in part by the NSF of China (61471131, 61771149, 61501126)NSF of Guangdong Province 2016A030310337+1 种基金the open research fund of National Mobile Communications Research Laboratory, Southeast University (No. 2018D02)the Guangdong Province Universities and Colleges Pearl River Scholar Funded Scheme (2017-ZJ022)
文摘With the development of manufacture technology, the multi-level cell(MLC)technique dramatically increases the storage density of NAND flash memory. As the result,cell-to-cell interference(CCI) becomes more serious and hence causes an increase in the raw bit error rate of data stored in the cells.Recently, low-density parity-check(LDPC)codes have appeared to be a promising solution to combat the interference of MLC NAND flash memory. However, the decoding complexity of the sum-product algorithm(SPA) is extremely high. In this paper, to improve the accuracy of the log likelihood ratio(LLR) information of each bit in each NAND flash memory cell, we adopt a non-uniform detection(N-UD) which uses the average maximum mutual information to determine the value of the soft-decision reference voltages.Furthermore, with an aim to reduce the decoding complexity and improve the decoding performance, we propose a modified soft reliabilitybased iterative majority-logic decoding(MSRBI-MLGD) algorithm, which uses a non-uniform quantizer based on power function to decode LDPC codes. Simulation results show that our design can offer a desirable trade-off between the performance and complexity for high-column-weight LDPC-coded MLC NAND flash memory.
基金supported by the National Natural Science Foundation of China (No.61501066,No.61572088,No.61701063)Chongqing Frontier and Applied Basic Research Project (No.cstc2015jcyjA40003,No.cstc2017jcyjAX0026,No.cstc2016jcyjA0209)+1 种基金the Open Fund of the State Key Laboratory of Integrated Services Networks (No.ISN16-03)the Fundamental Research Funds for the Central Universities (No.106112017CDJXY 500001)
文摘This paper addresses the problem of channel estimation in 5G-enabled vehicular-to-vehicular(V2V) channels with high-mobility environments and non-stationary feature. Considering orthogonal frequency division multiplexing(OFDM) system, we perform extended Kalman filter(EKF) for channel estimation in conjunction with Iterative Detector & Decoder(IDD) at the receiver to improve the estimation accuracy. The EKF is proposed for jointly estimating the channel frequency response and the time-varying time correlation coefficients. And the IDD structure is adopted to reduce the estimation errors in EKF. The simulation results show that, compared with traditional methods, the proposed method effectively promotes the system performance.
文摘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.
文摘Massive multiple-input multiple-output provides improved energy efficiency and spectral efficiency in 5 G. However it requires large-scale matrix computation with tremendous complexity, especially for data detection and precoding. Recently, many detection and precoding methods were proposed using approximate iteration methods, which meet the demand of precision with low complexity. In this paper, we compare these approximate iteration methods in precision and complexity, and then improve these methods with iteration refinement at the cost of little complexity and no extra hardware resource. By derivation, our proposal is a combination of three approximate iteration methods in essence and provides remarkable precision improvement on desired vectors. The results show that our proposal provides 27%-83% normalized mean-squared error improvement of the detection symbol vector and precoding symbol vector. Moreover, we find the bit-error rate is mainly controlled by soft-input soft-output Viterbi decoding when using approximate iteration methods. Further, only considering the effect on soft-input soft-output Viterbi decoding, the simulation results show that using a rough estimation for the filter matrix of minimum mean square error detection to calculating log-likelihood ratio could provideenough good bit-error rate performance, especially when the ratio of base station antennas number and the users number is not too large.
文摘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 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 National Natural Science Foundation of China under Grant Nos. 62101489, 62171405 and 62225114.
文摘The demand for high-data-rate underwater acoustic communications(UACs)in marine development is increasing;however,severe multipaths make demodulation a challenge.The decision feedback equalizer(DFE)is one of the most popular equalizers in UAC;however,it is not the optimal algorithm.Although maximum likelihood sequence estimation(MLSE)is the optimal algorithm,its complexity increases exponentially with the number of channel taps,making it challenging to apply to UAC.Therefore,this paper proposes a complexity-reduced MLSE to improve the bit error rate(BER)performance in multipath channels.In the proposed algorithm,the original channel is first shortened using a channel-shortening method,and several dominant channel taps are selected for MLSE.Subsequently,sphere decoding(SD)is performed in the following MLSE.Iterations are applied to eliminate inter-symbol interference caused by weak channel taps.The simulation and sea experiment demonstrate the superiority of the proposed algorithm.The simulation results show that channel shortening combined with SD can drastically reduce computational complexity,and iterative SD performs better than DFE based on recursive least squares(RLS-DFE),DFE based on improved proportionate normalized least mean squares(IPNLMS-DFE),and channel estimation-based DFE(CE-DFE).Moreover,the sea experimental results at Zhairuoshan Island in Zhoushan show that the proposed receiver scheme has improved BER performance over RLSDFE,IPNLMS-DFE,and CE-DFE.Compared with the RLS-DFE,the BER,after five iterations,is reduced from 0.0076 to 0.0037 in the 8–12 k Hz band and from 0.1516 to 0.1145 in the 13–17 k Hz band at a distance of 2000 m.Thus,the proposed algorithm makes it possible to apply MLSE in UAC in practical scenarios.
