Hassan Khodaiemehr

Dr. Hassan Khodaiemehr

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 November 2016 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
HKHassan Khodaiemehr
Hassan Khodaiemehr
MSMohammad-Reza Sadeghi
Mohammad-Reza Sadeghi
Amin SakzadAmin Sakzad
Amin Sakzad
Low density parity check (LDPC) lattices were the first family of lattices equipped with iterative decoding algorithms. We introduce quasi-cyclic LDPC (QC LDPC) lattices as a special case of LDPC lattices with one binary QC-LDPC code as their underlying code. These lattices are obtained from the Construction A of lattices providing us to encode them efficiently using shift registers. To benefit from an encoder with linear complexity in the lattice dimension, we obtain the generator matrix of these lattices in quasi-cyclic form. We generalize the proposed quasi-cyclic form of the generator matrix for other Construction A lattices, namely the LDA lattices, with a non-binary QC-LDPC code as their underlying code. We provide a low-complexity decoding algorithm of QC LDPC-lattices based on the sum product algorithm. To design lattice codes, QC LDPC-lattices are combined with the nested lattice shaping that uses the Voronoi region of a sublattice for shaping. The shaping gain and the shaping loss of our lattice codes with dimensions 40, 50, and 60 using an optimal quantizer, are presented. The guidelines for applying efficient shaping methods, like hypercube shaping, for QC LDPC-lattices are also given. Consequently, we establish a family of lattice codes that perform practically close to the sphere bound.

14 November 2025 in Computer Science Review
Verified
Journal Article
Open access
HKHassan Khodaiemehr
Hassan Khodaiemehr
KBKhadijeh Bagheri
Khadijeh Bagheri
CFChen Feng
Chen Feng


1 January 2026 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
YBYaser Baseri
Yaser Baseri
AHAbdelhakim Hafid
Abdelhakim Hafid
YSYahya Shahsavari
Yahya Shahsavari
DMDimitrios Makrakis
Dimitrios Makrakis
HKHassan Khodaiemehr
Hassan Khodaiemehr

1 May 2015
Verified
Conference Paper
Closed access
HKHassan Khodaiemehr
Hassan Khodaiemehr
DKDariush Kiani
Dariush Kiani
MSMohammad-Reza Sadeghi
Mohammad-Reza Sadeghi
LDPC lattices were first family of lattices which have efficient decoding algorithm in high dimensions. An LDPC lattice can be constructed from Construction D' and a number of nested LDPC codes. When we consider one code as underlying code of these lattices, one-level LDPC lattices will be obtained. In this paper we propose a new encoding and decoding method for one-level LDPC lattices. We also establish an efficient shaping method for these lattices based on hypercube shaping. Then, based on this encoding and decoding, we propose the implementation of block Markov encoding for one-way relay networks, using obtained one-level LDPC lattice codes. Our proposed decoding algorithm has lower complexity than those given for LDLC lattices.

13 December 2016 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
HKHassan Khodaiemehr
Hassan Khodaiemehr
DKDariush Kiani
Dariush Kiani
MSMohammad-Reza Sadeghi
Mohammad-Reza Sadeghi
Low-density parity-check (LDPC) lattices were the first family of lattices to show efficient decoding in high dimensions. We consider a case of these lattices with one binary LDPC code as an underlying code. We employ encoding and decoding of the LDPC lattices in a cooperative transmission framework. We establish two efficient shaping based on hypercube and Voronoi shaping, to obtain LDPC lattice codes. Then, we propose the implementation of block Markov encoding for one-way and two-way relay networks using LDPC lattice codes. An efficient method is also required for decomposing full-rate codebook into lower rate codebooks. We apply different decomposition schemes for one-way and two-way relay channels, which are the altered versions of the decomposition methods of low density lattice code (LDLC) lattices. Due to the lower complexity of the decoding for LDPC lattices comparing with LDLCs, the complexity of our schemes is significantly lower than the ones proposed for LDLCs. The efficiency of the proposed schemes is presented using simulation results that indicate the outperforming behavior of LDLCs over LDPC lattice codes in the same dimensions. However, having lower decoding complexity enables us to increase the dimension of the lattice to compensate the existing gap between the performance of the LDPC lattice codes and the LDLCs.