Entity

Time filter

Source Type


Liu K.-W.,Wuhan University of Technology | Liu Q.,Wuhan University of Technology | Ma Z.-R.,Guangdong Planning and Designing Institute of Telecommunication Co.
Wuhan Ligong Daxue Xuebao/Journal of Wuhan University of Technology | Year: 2011

This work deals with the existed problems in medium and high-speed scenes, based on the present LTE MIMO technology, an optimized MIMO scheme is presented in this paper. It uses the minimum error probability as the criteria to predict the feedback channel information. The performances of the optimized algorithm and implementation complexity have been analyzed. The results show that it not only achieves the good tradeoff between the system capacity and coverage quality, but also can avoid excess complexity overhead. Source


Ding S.,Guangdong University of Technology | Huang H.,South China University of Technology | Xiao H.,Guangdong Planning and Designing Institute of Telecommunication Co. | Li J.,Guangdong Planning and Designing Institute of Telecommunication Co.
Journal of Computational Information Systems | Year: 2013

In this paper, oscillating shuffled belief propagation (BP) decoding is presented for low-density parity-check (LDPC) codes. Compared with shuffled BP decoding, the proposed algorithms offer better performance and converge faster with a small increase in computational complexity. And the group oscillating shuffled belief propagation decoding is also proposed to solve the problem of relatively large decoding delay in hardware implementation. Finally we show the simulation results which verify our conclusion. © 2013 by Binary Information Press. Source


Huang H.,South China University of Technology | Huang H.,Guangdong Planning and Designing Institute of Telecommunication Co. | Li J.,Guangdong Planning and Designing Institute of Telecommunication Co. | Ding S.,Guangdong Planning and Designing Institute of Telecommunication Co. | And 3 more authors.
Journal of Computational Information Systems | Year: 2013

In this paper, a belief propagation (BP) decoding algorithm via Tchebyshev-Padé approximation is proposed for low-density parity-check (LDPC) codes. Compared with the standard BP decoding algorithm, the proposed algorithm significantly reduces computational complexity without noticeable performance loss. The approximation error is also analyzed and it is demonstrated that this error is indeed very small using appropriate parameters. Simulation results are shown to verify our analysis. This approximation idea can be easily extended to other variations of BP decoding. © 2013 Binary Information Press. Source

Discover hidden collaborations