Spinal Codes Based Efficient Rateless Transmission Scheme for Massive MIMO System with Imperfect CSI

The potential performance gains promised by massive multi-input and multi-output (MIMO) rely heavily on the access to accurate channel state information (CSI), which are difficult to obtain in practice when channel coherence time is short and the number of mobile users is huge. Therefore, a critical question is how to make the system perform well with imperfect CSI. Rateless codes with adaptive code-rates can free the system from the accurate CSI requirements and guarantee it to approach the maximum achievable rate (MAR) as well as improve the achieved-rate over that based on the fixed-rate codes. In this paper, a recently proposed family of rateless codes, called spinal codes, will be involved in massive MIMO transmission scheme, which in general approaches to the MAR with sufficiently large encoding block-size. In addition, multi-level puncturing and dynamic block-size allocation (MPDBA) techniques are proposed, where the block-sizes are determined by user MAR to curb the average retransmission delay for successfully decoding the messages, which further enhancing the system retransmission efficiency. Multi-level puncturing, which is MAR dependent, limits the gap between the system MAR and the related achieved-rate. Theoretical analysis are provided to demonstrate that spinal codes with MPDBA can guarantee the system retransmission efficiency as well as achieved-rate. Numerical simulation results are presented to demonstrate these benefits.

[1]  Erik G. Larsson,et al.  Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays , 2012, IEEE Signal Process. Mag..

[2]  A. Lee Swindlehurst,et al.  A vector-perturbation technique for near-capacity multiantenna multiuser communication-part II: perturbation , 2005, IEEE Transactions on Communications.

[3]  Devavrat Shah,et al.  Spinal codes , 2012, CCRV.

[4]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[5]  Robert F. H. Fischer,et al.  Lattice-reduction-aided broadcast precoding , 2004, IEEE Transactions on Communications.

[6]  Devavrat Shah,et al.  De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code , 2012, ArXiv.

[7]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[8]  Ness B. Shroff,et al.  Scheduling of multicast and unicast services under limited feedback by using rateless codes , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[9]  Sachin Katti,et al.  Strider: automatic rate adaptation and collision handling , 2011, SIGCOMM 2011.

[10]  Omid Etesami,et al.  Raptor codes on binary memoryless symmetric channels , 2006, IEEE Transactions on Information Theory.

[11]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[12]  Wai Ho Mow,et al.  On the Performance of the MIMO Zero-Forcing Receiver in the Presence of Channel Estimation Error , 2007, IEEE Transactions on Wireless Communications.

[13]  Sung-Ju Lee,et al.  Network control without CSI using rateless codes for downlink cellular systems , 2013, 2013 Proceedings IEEE INFOCOM.