Linear minimum mean square error(MMSE)detection has been shown to achieve near-optimal performance for massive multiple-input multiple-output(MIMO)systems but inevitably involves complicated matrix inversion,which ent...Linear minimum mean square error(MMSE)detection has been shown to achieve near-optimal performance for massive multiple-input multiple-output(MIMO)systems but inevitably involves complicated matrix inversion,which entails high complexity.To avoid the exact matrix inversion,a considerable number of implicit and explicit approximate matrix inversion based detection methods is proposed.By combining the advantages of both the explicit and the implicit matrix inversion,this paper introduces a new low-complexity signal detection algorithm.Firstly,the relationship between implicit and explicit techniques is analyzed.Then,an enhanced Newton iteration method is introduced to realize an approximate MMSE detection for massive MIMO uplink systems.The proposed improved Newton iteration significantly reduces the complexity of conventional Newton iteration.However,its complexity is still high for higher iterations.Thus,it is applied only for first two iterations.For subsequent iterations,we propose a novel trace iterative method(TIM)based low-complexity algorithm,which has significantly lower complexity than higher Newton iterations.Convergence guarantees of the proposed detector are also provided.Numerical simulations verify that the proposed detector exhibits significant performance enhancement over recently reported iterative detectors and achieves close-to-MMSE performance while retaining the low-complexity advantage for systems with hundreds of antennas.展开更多
Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list...Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list(SCL)decoding algorithm.However,the SCL algorithm suffers from a large amount of memory overhead.This paper proposes an adaptive simplified decoding algorithm for multiple cyclic redundancy check(CRC)polar codes.Simulation results show that the proposed method can reduce the decoding complexity and memory space.It can also acquire the performance gain in the low signal to noise ratio region.展开更多
A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbo...A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbol vector iteratively in search of a valid codeword in the symbol vector space. Only one symbol is flipped in each iteration, and symbol flipping function, which is employed as the symbol flipping metric, combines the number of failed checks and the reliabilities of the received bits and calculated symbols. A scheme to avoid infinite loops and select one symbol to flip in high order Galois field search is also proposed. The design of flipping pattern＇s order and depth, which is dependent of the computational requirement and error performance, is also proposed and exemplified. Simulation results show that the algorithm achieves an appealing tradeoff between performance and computational requirement over relatively low Galois field for short to medium code length.展开更多
Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh ma...Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform（LT） codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage（IC） of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting（DNS） encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation（OFG-BP） decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.展开更多
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.展开更多
This paper focuses on reducing the complexity of K-best sphere decoding （SD） algorithm for the detection of uncoded multi-ple input multiple output （MIMO） systems. The proposed algorithm utilizes the threshold-pru...This paper focuses on reducing the complexity of K-best sphere decoding （SD） algorithm for the detection of uncoded multi-ple input multiple output （MIMO） systems. The proposed algorithm utilizes the threshold-pruning method to cut nodes with partial Euclidean distances （PEDs） larger than the threshold. Both the known noise value and the unknown noise value are considered to generate the threshold, which is the sum of the two values. The known noise value is the smal est PED of signals in the detected layers. The unknown noise value is generated by the noise power, the quality of service （QoS） and the signal-to-noise ratio （SNR） bound. Simulation results show that by considering both two noise values, the proposed algorithm makes an efficient reduction while the performance drops little.展开更多
To improve the error correction performance, an innovative encoding structure with tail-biting for spinal codes is designed. Furthermore, an adaptive forward stack decoding(A-FSD) algorithm with lower complexity for s...To improve the error correction performance, an innovative encoding structure with tail-biting for spinal codes is designed. Furthermore, an adaptive forward stack decoding(A-FSD) algorithm with lower complexity for spinal codes is proposed. In the A-FSD algorithm, a flexible threshold parameter is set by a variable channel state to narrow the scale of nodes accessed. On this basis, a new decoding method of AFSD with early termination(AFSD-ET) is further proposed. The AFSD-ET decoder not only has the ability of dynamically modifying the number of stored nodes, but also adopts the early termination criterion to curtail complexity. The complexity and related parameters are verified through a series of simulations. The simulation results show that the proposed spinal codes with tail-biting and the AFSD-ET decoding algorithms can reduce the complexity and improve the decoding rate without sacrificing correct decoding performance.展开更多
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.展开更多
交替方向乘子法(Alternating Direction Method of Multiplier,ADMM)因具有线性规划(Linear Programming,LP)译码条件约束的几何结构,同时利用了消息传递机制,被认为是一种第5代移动通信技术(5th Generation Mobile Communication Techn...交替方向乘子法(Alternating Direction Method of Multiplier,ADMM)因具有线性规划(Linear Programming,LP)译码条件约束的几何结构,同时利用了消息传递机制,被认为是一种第5代移动通信技术(5th Generation Mobile Communication Technology,5G)低密度校验(Low Density Parity Check,LDPC)码新型优化译码算法。通过在LP译码模型的目标函数中引入惩罚项,基于ADMM的变量节点惩罚译码有效地减轻了非积分解,从而提高了误帧率(Frame Error Rate,FER)性能。尽管ADMM在许多实际应用中表现出色,其收敛速度较慢以及对初始条件和参数设置敏感的问题仍然限制了其在高维、实时性要求高的场景中的进一步应用。特别是在LDPC线性规划译码过程中,ADMM的交替更新机制容易导致优化路径振荡,且在处理非精确约束时表现不佳。针对ADMM算法收敛速度慢的问题,我们提出了一种新的优化算法,该算法将Nesterov动量加速方法与ADMM相结合,以解决ADMM对LDPC译码器错误修正能力和收敛效率的影响。算法通过动量项减少迭代次数将一个Nesterov加速格式从无约束复合优化问题推广到ADMM惩罚函数模型,利用ADMM算法将原问题的约束条件有效转化为目标函数的一部分,从而构造出无约束优化子问题;在此基础上,进一步采用Nesterov加速技术对梯度下降迭代过程进行改进,以提高收敛速度和求解精度。仿真实验使用了三种不同码率的5G LDPC短码。结果表明,相对于现有ADMM惩罚译码算法,所提出的基于动量加速的ADMM译码算法不仅有大约0.2 dB的信噪比增益,而且平均迭代次数也降低了20%左右,加快了收敛速度。展开更多
基金supported by National Natural Science Foundation of China(62371225,62371227)。
文摘Linear minimum mean square error(MMSE)detection has been shown to achieve near-optimal performance for massive multiple-input multiple-output(MIMO)systems but inevitably involves complicated matrix inversion,which entails high complexity.To avoid the exact matrix inversion,a considerable number of implicit and explicit approximate matrix inversion based detection methods is proposed.By combining the advantages of both the explicit and the implicit matrix inversion,this paper introduces a new low-complexity signal detection algorithm.Firstly,the relationship between implicit and explicit techniques is analyzed.Then,an enhanced Newton iteration method is introduced to realize an approximate MMSE detection for massive MIMO uplink systems.The proposed improved Newton iteration significantly reduces the complexity of conventional Newton iteration.However,its complexity is still high for higher iterations.Thus,it is applied only for first two iterations.For subsequent iterations,we propose a novel trace iterative method(TIM)based low-complexity algorithm,which has significantly lower complexity than higher Newton iterations.Convergence guarantees of the proposed detector are also provided.Numerical simulations verify that the proposed detector exhibits significant performance enhancement over recently reported iterative detectors and achieves close-to-MMSE performance while retaining the low-complexity advantage for systems with hundreds of antennas.
基金supported by the National Key R&D Program of China(2018YFB2101300)the National Science Foundation of China(61973056)
文摘Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list(SCL)decoding algorithm.However,the SCL algorithm suffers from a large amount of memory overhead.This paper proposes an adaptive simplified decoding algorithm for multiple cyclic redundancy check(CRC)polar codes.Simulation results show that the proposed method can reduce the decoding complexity and memory space.It can also acquire the performance gain in the low signal to noise ratio region.
文摘A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbol vector iteratively in search of a valid codeword in the symbol vector space. Only one symbol is flipped in each iteration, and symbol flipping function, which is employed as the symbol flipping metric, combines the number of failed checks and the reliabilities of the received bits and calculated symbols. A scheme to avoid infinite loops and select one symbol to flip in high order Galois field search is also proposed. The design of flipping pattern＇s order and depth, which is dependent of the computational requirement and error performance, is also proposed and exemplified. Simulation results show that the algorithm achieves an appealing tradeoff between performance and computational requirement over relatively low Galois field for short to medium code length.
基金supported by the National Natural Science Foundation of China(61371099)the Fundamental Research Funds for the Central Universities of China(HEUCF150812/150810)
文摘Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform（LT） codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage（IC） of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting（DNS） encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation（OFG-BP） decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.
文摘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.
基金supported by the National Natural Science Foundation of China(61071083)
文摘This paper focuses on reducing the complexity of K-best sphere decoding （SD） algorithm for the detection of uncoded multi-ple input multiple output （MIMO） systems. The proposed algorithm utilizes the threshold-pruning method to cut nodes with partial Euclidean distances （PEDs） larger than the threshold. Both the known noise value and the unknown noise value are considered to generate the threshold, which is the sum of the two values. The known noise value is the smal est PED of signals in the detected layers. The unknown noise value is generated by the noise power, the quality of service （QoS） and the signal-to-noise ratio （SNR） bound. Simulation results show that by considering both two noise values, the proposed algorithm makes an efficient reduction while the performance drops little.
基金supported by the National Natural Science Foundation of China (61701020)the Scientific and Technological Innovation Foundation of Shunde Graduate School,USTB (BK19BF009)。
文摘To improve the error correction performance, an innovative encoding structure with tail-biting for spinal codes is designed. Furthermore, an adaptive forward stack decoding(A-FSD) algorithm with lower complexity for spinal codes is proposed. In the A-FSD algorithm, a flexible threshold parameter is set by a variable channel state to narrow the scale of nodes accessed. On this basis, a new decoding method of AFSD with early termination(AFSD-ET) is further proposed. The AFSD-ET decoder not only has the ability of dynamically modifying the number of stored nodes, but also adopts the early termination criterion to curtail complexity. The complexity and related parameters are verified through a series of simulations. The simulation results show that the proposed spinal codes with tail-biting and the AFSD-ET decoding algorithms can reduce the complexity and improve the decoding rate without sacrificing correct decoding performance.
文摘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.
文摘交替方向乘子法(Alternating Direction Method of Multiplier,ADMM)因具有线性规划(Linear Programming,LP)译码条件约束的几何结构,同时利用了消息传递机制,被认为是一种第5代移动通信技术(5th Generation Mobile Communication Technology,5G)低密度校验(Low Density Parity Check,LDPC)码新型优化译码算法。通过在LP译码模型的目标函数中引入惩罚项,基于ADMM的变量节点惩罚译码有效地减轻了非积分解,从而提高了误帧率(Frame Error Rate,FER)性能。尽管ADMM在许多实际应用中表现出色,其收敛速度较慢以及对初始条件和参数设置敏感的问题仍然限制了其在高维、实时性要求高的场景中的进一步应用。特别是在LDPC线性规划译码过程中,ADMM的交替更新机制容易导致优化路径振荡,且在处理非精确约束时表现不佳。针对ADMM算法收敛速度慢的问题,我们提出了一种新的优化算法,该算法将Nesterov动量加速方法与ADMM相结合,以解决ADMM对LDPC译码器错误修正能力和收敛效率的影响。算法通过动量项减少迭代次数将一个Nesterov加速格式从无约束复合优化问题推广到ADMM惩罚函数模型,利用ADMM算法将原问题的约束条件有效转化为目标函数的一部分,从而构造出无约束优化子问题;在此基础上,进一步采用Nesterov加速技术对梯度下降迭代过程进行改进,以提高收敛速度和求解精度。仿真实验使用了三种不同码率的5G LDPC短码。结果表明,相对于现有ADMM惩罚译码算法,所提出的基于动量加速的ADMM译码算法不仅有大约0.2 dB的信噪比增益,而且平均迭代次数也降低了20%左右,加快了收敛速度。
文摘水声网络(underwater acoustic network,UAN)具有长传播时延、高误码率、半双工通信等特性,这些特性严重影响了UAN中数据的可靠传输。而在线喷泉码具有在线控制、编解码复杂度低、码率自适应等诸多优势,在线喷泉码适合于保障UAN中数据的可靠传输。针对递归与限制反馈的在线喷泉码(recursive OFC with limited feedback,ROFC-LF)存在不理想覆盖和4元环问题导致略高的开销和频繁的反馈,提出适用于UAN的基于优先级与可Zigzag解码的ROFC-LF(priority-based and zigzag-decodable ROFC-LF,P-ZROFC-LF)。P-ZROFC-LF在建立阶段选取具有最高优先级的原始包进行编码直至所有原始包均参与编码。同时,引入可Zigzag解码编码,将无用编码包进行移位异或转换为有用编码包来提高解码性能。通过随机图理论,分析P-ZROFC-LF所需编码包数与原始包数之间的关系。理论分析与仿真结果表明,与大部分在线喷泉码相比,P-ZROFC-LF显著提高了反馈和开销性能。其中P-ZROFC-LF相比于ROFC-LF的反馈和开销分别减少了18%和0.0176,更适用于UAN。
