A computationally efficient soft-output detector with lattice-reduction （LR） for the multiple-input multiple-output （MIMO） systems is proposed. In the proposed scheme, the sorted QR de- composition is applied on t...A computationally efficient soft-output detector with lattice-reduction （LR） for the multiple-input multiple-output （MIMO） systems is proposed. In the proposed scheme, the sorted QR de- composition is applied on the lattice-reduced equivalent channel to obtain the tree structure. With the aid of the boundary control, the stack algorithm searches a small part of the whole search tree to generate a handful of candidate lists in the reduced lattice. The proposed soft-output algorithm achieves near-optimal perfor- mance in a coded MIMO system and the associated computational complexity is substantially lower than that of previously proposed methods.展开更多
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.展开更多
Relay transmission technique can be utilized to increase coverage or enhance throughput for conventional cellular communication systems. There are two typical relaying schemes： amplify-and- forward （AF） and decode-...Relay transmission technique can be utilized to increase coverage or enhance throughput for conventional cellular communication systems. There are two typical relaying schemes： amplify-and- forward （AF） and decode-and-forward （DF）. This paper presents a new scheme named soft symbol Estimation and Forward （SEF） , which holds the advantages of both AF and DF, i.e. keeping soft information and obtaining decoding gain. This scheme has similar operations as DF except that the operations are performed in a soft-input-soft-output （SISO） fashion. The relay performs SISO deco- ding, SISO re-encoding and key point soft symbol estimation, which is derived based on the maxi- mum likelihood （ML） criteria. Simulation results prove that the proposed SEF scheme much outper- forms both AF and DF.展开更多
为了降低Turbo均衡中均衡器的复杂度,该文提出了符号方差反馈均衡算法(SVFE)。该算法是对精确的线性最小均方误差估计值(LMMSE)进行Taylor展开得到的。在该算法中,先利用时不变均衡器得到初步符号估计值,再根据先验符号方差对估计值加权...为了降低Turbo均衡中均衡器的复杂度,该文提出了符号方差反馈均衡算法(SVFE)。该算法是对精确的线性最小均方误差估计值(LMMSE)进行Taylor展开得到的。在该算法中,先利用时不变均衡器得到初步符号估计值,再根据先验符号方差对估计值加权,最后进行时不变滤波得到更佳的符号估计值。由于用到了时变的先验符号方差信息,其性能更接近精确的LMMSE均衡器。将所提算法用于Proakis C信道下的Turbo均衡处理,和时不变均衡算法进行仿真对比,所提算法将信噪比损失从0.83 d B降到了0.17 d B,并且仍可通过快速傅里叶变换降低为对数复杂度。展开更多
文摘A computationally efficient soft-output detector with lattice-reduction （LR） for the multiple-input multiple-output （MIMO） systems is proposed. In the proposed scheme, the sorted QR de- composition is applied on the lattice-reduced equivalent channel to obtain the tree structure. With the aid of the boundary control, the stack algorithm searches a small part of the whole search tree to generate a handful of candidate lists in the reduced lattice. The proposed soft-output algorithm achieves near-optimal perfor- mance in a coded MIMO system and the associated computational complexity is substantially lower than that of previously proposed methods.
文摘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.
文摘Relay transmission technique can be utilized to increase coverage or enhance throughput for conventional cellular communication systems. There are two typical relaying schemes： amplify-and- forward （AF） and decode-and-forward （DF）. This paper presents a new scheme named soft symbol Estimation and Forward （SEF） , which holds the advantages of both AF and DF, i.e. keeping soft information and obtaining decoding gain. This scheme has similar operations as DF except that the operations are performed in a soft-input-soft-output （SISO） fashion. The relay performs SISO deco- ding, SISO re-encoding and key point soft symbol estimation, which is derived based on the maxi- mum likelihood （ML） criteria. Simulation results prove that the proposed SEF scheme much outper- forms both AF and DF.
文摘为了降低Turbo均衡中均衡器的复杂度,该文提出了符号方差反馈均衡算法(SVFE)。该算法是对精确的线性最小均方误差估计值(LMMSE)进行Taylor展开得到的。在该算法中,先利用时不变均衡器得到初步符号估计值,再根据先验符号方差对估计值加权,最后进行时不变滤波得到更佳的符号估计值。由于用到了时变的先验符号方差信息,其性能更接近精确的LMMSE均衡器。将所提算法用于Proakis C信道下的Turbo均衡处理,和时不变均衡算法进行仿真对比,所提算法将信噪比损失从0.83 d B降到了0.17 d B,并且仍可通过快速傅里叶变换降低为对数复杂度。
