Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Many Access for Small Packets Based on Precoding and Sparsity-aware Recovery (1510.06454v2)

Published 21 Oct 2015 in cs.IT and math.IT

Abstract: Modern mobile terminals produce massive small data packets. For these short-length packets, it is inefficient to follow the current multiple access schemes to allocate transmission resources due to heavy signaling overhead. We propose a non-orthogonal many-access scheme that is well suited for the future communication systems equipped with many receive antennas. The system is modeled as having a block-sparsity pattern with unknown sparsity level (i.e., unknown number of transmitted messages). Block precoding is employed at each single-antenna transmitter to enable the simultaneous transmissions of many users. The number of simultaneously served active users is allowed to be even more than the number of receive antennas. Sparsity-aware recovery is designed at the receiver for joint user detection and symbol demodulation. To reduce the effects of channel fading on signal recovery, normalized block orthogonal matching pursuit (BOMP) algorithm is introduced, and based on its approximate performance analysis, we develop interference cancellation based BOMP (ICBOMP) algorithm. The ICBOMP performs error correction and detection in each iteration of the normalized BOMP. Simulation results demonstrate the effectiveness of the proposed scheme in small packet services, as well as the advantages of ICBOMP in improving signal recovery accuracy and reducing computational cost.

Citations (35)

Summary

We haven't generated a summary for this paper yet.