42 citations · 114 across the 25 of their papers we have counts for
19 papers · 1 filter
Efficient Active Deep Decoding of Linear Codes using Importance Sampling
Hassan Noghrei, Mohammad-Reza Sadeghi, Wai Ho Mow
The quality and quantity of data used for training greatly influence the performance and effectiveness of deep learning models. In the context of error correction, it is essential…
Trade-Based LDPC Codes
Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi
LDPC codes based on multiple-edge protographs potentially have larger minimum distances compared to their counterparts, single-edge protographs. However, considering different feat…
Construction of protograph-based LDPC codes with chordless short cycles
Farzane Amirzade, Mohammad-Reza~Sadeghi, Daniel Panario
Controlling small size trapping sets and short cycles can result in LDPC codes with large minimum distance . We prove that short cycles with a chord are the root of sever…
Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels
Hassan Khodaiemehr, Daniel Panario, Mohammad-Reza Sadeghi
Block-fading channel (BF) is a useful model for various wireless communication channels in both indoor and outdoor environments. The design of lattices for BF channels offers a cha…
A Lattice Based Joint Encryption, Encoding and Modulation Scheme
Khadijeh Bagheri, Taraneh Eghlidos, Mohammad-Reza Sadeghi +1
A new nonlinear Rao-Nam like symmetric key encryption scheme is presented in this paper. QC-LDPC lattices that are practically implementable in high dimensions due to their low com…
Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4
Mohammad-Reza Sadeghi, Farzane Amirzade
One of the phenomena that causes high decoding failure rates is trapping sets. Characterization of elementary trapping sets (ETSs), their graphical properties and the lower…
A Neural Network Lattice Decoding Algorithm
Mohammad-Reza Sadeghi, Farzane Amirzade, Daniel Panario +1
Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such…
Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size
Farzane Amirzade, Mohammad-Reza Sadeghi
One of the phenomena that influences significantly the performance of low-density parity-check codes is known as trapping sets. An elementary trapping set, or simply an ETS…
Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices
Farzane Amirzade, Mohammad-Reza Sadeghi
In this paper, we define two matrices named as "difference matrices", denoted by and which significantly contribute to achieve regular single-edge QC-LDPC codes with the s…
Analytical lower bounds for the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8
Farzane Amirzade, Mohammad-Reza Sadeghi
In this paper we give lower bounds on the size of elementary trapping sets (ETSs) belonging to variable-regular LDPC codes with any girth, , and irregular ones with girt…
On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families
A. Tasdighi, M. R. Sadeghi
A simple and general definition of quasi cyclic low density parity check (QC LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an spec…
Construction of Full-Diversity LDPC Lattices for Block-Fading Channels
Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Daniel Panario
LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. Considering Construction D' of lattices with one…
LDPC Lattice Codes for Full-Duplex Relay Channels
Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza Sadeghi
Low density parity check (LDPC) lattices are obtained from Construction D' and a family of nested binary LDPC codes. We consider an special case of these lattices with one binary L…
Practical Encoder and Decoder for Power Constrained QC-LDPC lattices
Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Amin Sakzad
LDPC lattices were the first family of lattices that equipped with iterative decoding algorithms under which they perform very well in high dimensions. In this paper, we introduce…
On the performance of 1-level LDPC lattices
Mohammad-Reza Sadeghi, Amin Sakzad
The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC latt…
Construction of LDGM lattices
Hassan Mehri, Mohammad Reza Sadeghi
Low density generator matrix (LDGM) codes have an acceptable performance under iterative decoding algorithms. This idea is used to construct a class of lattices with relatively goo…
Turbo Lattices: Construction and Error Decoding Performance
Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of n…
Cycle structure of permutation functions over finite fields and their applications
Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario
In this work we establish some new interleavers based on permutation functions. The inverses of these interleavers are known over a finite field . For the first time…
Capacity Achieving Low Density Parity Check Lattices
Mohammad-Reza Sadeghi, Amin Sakzad
The concept and existence of sphere-bound-achieving and capacity-achieving lattices has been explained on AWGN channels by Forney. LDPC lattices, introduced by Sadeghi, perform ver…