activity
20072021
most citedDesign of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings

26 citations · 66 across the 31 of their papers we have counts for

collaborators
Showing cs.ITShow all

31 papers · 1 filter

cs.IT2021

Error Floor Analysis of LDPC Column Layered Decoders

Ali Farsiabi, Amir H. Banihashemi

In this paper, we analyze the error floor of column layered decoders, also known as shuffled decoders, for low-density parity-check (LDPC) codes under saturating sum-product algori…

cs.IT2021

Error Floor Analysis of LDPC Row Layered Decoders

Ali Farsiabi, Amir H. Banihashemi

In this paper, we analyze the error floor of quasi-cyclic (QC) low-density parity-check (LDPC) codes decoded by the sum-product algorithm (SPA) with row layered message-passing sch…

cs.IT2019

On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix

Ali Dehghan, Amir H. Banihashemi

Counting short cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. There are…

cs.IT2019

Construction of QC-LDPC Codes with Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets

Bashirreza Karimi, Amir. H Banihashemi

We propose a systematic design of protograph-based quasi-cyclic (QC) low-density parity-check (LDPC) codes with low error floor. We first characterize the trapping sets of such cod…

cs.IT2018

Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets

Yoones Hashemi, Amir H. Banihashemi

In this paper, we propose a characterization for non-elementary trapping sets (NETSs) of low-density parity-check (LDPC) codes. The characterization is based on viewing a NETS as a…

cs.IT2017

Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes

Ali Dehghan, Amir H. Banihashemi

Leafless elementary trapping sets (LETSs) are known to be the problematic structures in the error floor region of low-density parity-check (LDPC) codes over the additive white Gaus…