.png){kind=icon}
Return
On Convolutional Lattice Codes and Lattice Decoding Using Trellis Structure
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2016.2632038.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Constructing hypercubic lattices from convolutional codes based on Constructions A and D is investigated in this paper and their error performance in a point-to-point communication system is studied. Moreover, analogous to Construction A/D, single/multilayer code lattices are proposed. As Construction D requires certain minimum Euclidean distance criteria, we propose methods to guarantee the distance requirements of Construction D, which results in a superior lattice construction compared with Construction A. Due to the key role of soft input soft out decoding algorithms in improving the performance of a code, lattice decoding based on the Bahl, Cocke, Jelinek and Raviv (BCJR) algorithm for lattices constructed from convolutional codes is also proposed in this paper. Moreover, as the BCJR algorithm requires knowledge of the statistical characteristics of modulo lattice additive noise (MLAN), the probability density function of MLAN is derived in closed form.
Keywords:
Lattice encoding/decoding
convolutional lattices
BCJR lattice decoder
construction A/D
modulo-lattice additive noise
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more