13 research outputs found
A Multistage Method for SCMA Codebook Design Based on MDS Codes
Sparse Code Multiple Access (SCMA) has been recently proposed for the future
generation of wireless communication standards. SCMA system design involves
specifying several parameters. In order to simplify the procedure, most works
consider a multistage design approach. Two main stages are usually emphasized
in these methods: sparse signatures design (equivalently, resource allocation)
and codebook design. In this paper, we present a novel SCMA codebook design
method. The proposed method considers SCMA codebooks structured with an
underlying vector space obtained from classical block codes. In particular,
when using maximum distance separable (MDS) codes, our proposed design provides
maximum signal-space diversity with a relatively small alphabet. The use of
small alphabets also helps to maintain desired properties in the codebooks,
such as low peak-to-average power ratio and low-complexity detection.Comment: Submitted to IEEE Wireless Communication Letter
Generalized punctured convolutional codes
Abstract-This letter introduces the class of generalized punctured convolutional codes (GPCCs), which is broader than and encompasses the class of the standard punctured convolutional codes (PCCs). A code in this class can be represented by a trellis module, the GPCC trellis module, whose topology resembles that of the minimal trellis module. The GPCC trellis module for a PCC is isomorphic to the minimal trellis module. A list containing GPCCs with better distance spectrum than the best known PCCs with same code rate and trellis complexity is presented
On multiplicative matrix channels over finite chain rings
Abstract-Motivated by nested-lattice-based physical-layer network coding, this paper considers communication in multiplicative matrix channels over finite chain rings. Such channels are defined by the law Y = AX, where X and Y are the input and output matrices, respectively, and A is called the transfer matrix. We assume that the instances of the transfer matrix are unknown to the transmitter, but available at the receiver. As contributions, we obtain a closed-form expression for the channel capacity, and we propose a coding scheme that can achieve this capacity with polynomial time complexity. Our results extend the corresponding ones for finite fields. Index Terms-Finite chain rings, multiplicative matrix channels, random linear network coding