Polar-Coded Non-Orthogonal Multiple Access

May 17, 2017 Β· Declared Dead Β· πŸ› IEEE Transactions on Signal Processing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jincheng Dai, Kai Niu, Zhongwei Si, Chao Dong, Jiaru Lin arXiv ID 1705.05976 Category cs.IT: Information Theory Citations 52 Venue IEEE Transactions on Signal Processing Last Checked 5 months ago
Abstract
Non-orthogonal multiple access (NOMA) is one of the key techniques to address the high spectral efficiency and massive connectivity requirements for the fifth generation (5G) wireless system. To efficiently realize NOMA, we propose a joint design framework combining the polar coding and the NOMA transmission, which deeply mines the generalized polarization effect among the users. In this polar coded NOMA (PC-NOMA) framework, the original NOMA channel is decomposed into multiple bit polarized channels by using a three-stage channel transform, that is, user$\to$signal$\to$bit partitions. Specifically, for the first-stage channel transform, we design two schemes, namely sequential user partition (SUP) and parallel user partition (PUP). For the SUP, a joint successive cancellation detecting and decoding scheme is developed, and a search algorithm is proposed to schedule the NOMA detecting order which improves the system performance by enhanced polarization among the user synthesized channels. The "worst-goes-first" idea is employed in the scheduling strategy, and its theoretic performance is analyzed by using the polarization principle. For the PUP, a corresponding parallel detecting scheme is exploited to reduce the latency. The block error ratio performances over the additive white Gaussian noise channel and the Rayleigh fading channel indicate that the proposed PC-NOMA obviously outperforms the state-of-the-art turbo coded NOMA scheme due to the advantages of joint design between the polar coding and NOMA.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted