Search

Targeting to provide reliable short-packet communications with tens of bits in machine-type networks, we investigate a novel sparse code multiple access (SCMA) scheme called delayed bit-interleaved coded SCMA (DBIC-SCMA). At the transmitter side, a delay module is introduced between each channel encoder and SCMA mapper such that data bits from different channel codewords can be mapped to an identical SCMA codeword. We present the main components and principles for the transmitter of DBIC-SCMA, followed by a pre-decoding assisted receiver design which exploits systematic and rate-adaptive properties of certain channel codes. Our simulation results show that the proposed DBIC-SCMA leads to significant improvements in error rate performance over the classical BIC-SCMA scheme. [ABSTRACT FROM AUTHOR]

This paper investigates the design of unequal error protection (UEP) codebooks for sparse code multiple access (SCMA) systems. We propose a joint low-density parity check (LDPC) code and SCMA codebook design approach by incorporating cloud partitioning of codewords in the design of SCMA codebooks with different protection levels. The protection levels of the SCMA codebooks could be optimized based on the existing error correction code. Simulation results show that significant gains could be obtained using code-aware UEP SCMA codebooks, compared to codebooks designed independently of the channel code. [ABSTRACT FROM AUTHOR]

In this paper, we propose to use golden angle modulation (GAM) points to construct codebooks for uplink and downlink sparse code multiple access (SCMA) systems. We provide two categories of codebooks with one and two optimization parameters, respectively. The advantages of the proposed design method are twofold: $1)$ the number of optimization variables is independent of codebook and system parameters; and $2)$ it is simple to implement. In the downlink, we use GAM points to build a multidimensional mother constellation for SCMA codebooks, while in the uplink GAM points are directly mapped to user codebooks. The proposed codebooks exhibit good performance with low peak to average power ratio compared to the codebooks proposed in the literature based on constellation rotation and interleaving. [ABSTRACT FROM AUTHOR]

This paper studies secure communication based on incremental redundancy (INR) secure hybrid automatic retransmission request (HARQ) protocol over block-fading wiretap channels. The transmitter has no instantaneous channel state information (CSI) available from either main channel or the eavesdropper channel, hence the coding rates cannot be adapted to instantaneous channel conditions. We investigate the outage performance for two schemes of INR secure HARQ protocols: case 1) when there exists two reliable multibit feedback channels from both legitimate receiver and eavesdropper to the transmitter carrying a function of outdated CSI, and case 2) when there is a multibit feedback channel only from legitimate receiver. In both cases, we demonstrate that using the information carried via multibit feedback channels, the transmitter can adapt the coding rates in order to achieve a better secrecy throughput using a smaller number of transmissions comparing to the ACK/NACK feedback channel model. For some parameters, our rate adaptation protocol achieves a strictly positive secrecy throughput whereas it is equal to zero for the protocol with ACK/NACK feedback. We show that for some set of parameters, the loss of secrecy throughput between case 1 and case 2 is very small compared to the gain provided by both protocols. [ABSTRACT FROM PUBLISHER]

This paper considers the Broadcast Channel with Confidential Message (BCCM) where the sender attempts to send altogether a common message to two receivers and a confidential message to one of them. The achievable rate regions are derived for the power-constrained Gaussian BCCM with finite input alphabet using various transmission strategies. Namely, time sharing, superposition modulation and superposition coding are used as broadcast strategies. For superposition modulation and superposition coding, the maximal achievable rate regions are obtained by maximizing over both constellation symbol positions and the joint probability distribution. The maximization of the secrecy rate for wiretap channels is also studied as a particular case of the BCCM problem. We compare the considered transmission strategies in terms of percentage gains in achievable rates. We concentrate on the impact of the finite alphabet constraint on achievable rates, and show that this constraint may change well known results obtained in the Gaussian case. We show also that the secrecy constraint can change the shape of the achievable rate region in superposition modulation used in some standards when symbols are equiprobable. On a more practical side, it is shown that a performance close to the optimum can be obtained by strategies with reduced complexity. [ABSTRACT FROM AUTHOR]

This paper considers the problem of source coding with side information at the decoder, also called Slepian–Wolf source coding scheme. In practical applications of this coding scheme, the statistical relation between the source and the side information can vary from one data transmission to another, and there is a need to adapt the coding rate depending on the current statistical relation. In this paper, we propose a novel rate-adaptive code construction based on LDPC codes for the Slepian–Wolf source coding scheme. The proposed code design method allows to optimize the code degree distributions at all the considered rates, while minimizing the amount of short cycles in the parity check matrices at all rates. Simulation results show that the proposed method greatly reduces the source coding rate compared to the standard low density parity check accumulated (LDPCA) solution. [ABSTRACT FROM AUTHOR]