Amir H. Banihashemi
YOU?
Author Swipe
View article: Error Floor Analysis of LDPC Column Layered Decoders
Error Floor Analysis of LDPC Column Layered Decoders Open
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 algorithm (SPA). To estimate the error floor, we evaluate the fai…
View article: Error Floor Analysis of LDPC Row Layered Decoders
Error Floor Analysis of LDPC Row Layered Decoders Open
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 scheduling. For this, we develop a linear state-space model of…
View article: On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix Open
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 two computational approaches to count short cycles (with le…
View article: Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles Open
View article: Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles
Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles Open
The performance of low-density parity-check (LDPC) codes in the error floor region is closely related to some combinatorial structures of the code's Tanner graph, collectively referred to as {\it trapping sets (TSs)}. In this paper, we stu…
View article: On Computing the Number of Short Cycles in Bipartite Graphs Using the\n Spectrum of the Directed Edge Matrix
On Computing the Number of Short Cycles in Bipartite Graphs Using the\n Spectrum of the Directed Edge Matrix Open
Counting short cycles in bipartite graphs is a fundamental problem of\ninterest in many fields including the analysis and design of low-density\nparity-check (LDPC) codes. There are two computational approaches to count\nshort cycles (with…
View article: Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes Open
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 Gaussian (AWGN) channel under iterative decoding algorithms. Wh…
View article: On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph Open
Counting short cycles in bipartite graphs is a fundamental problem of interest in the analysis and design of low-density parity-check (LDPC) codes. The vast majority of research in this area is focused on algorithmic techniques. Most recen…
View article: From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes Open
Cages, defined as regular graphs with minimum number of nodes for a given girth, are well-studied in graph theory. Trapping sets are graphical structures responsible for error floor of low-density parity-check (LDPC) codes, and are well in…
View article: On Computing the Multiplicity of Cycles in Bipartite Graphs Using the\n Degree Distribution and the Spectrum of the Graph
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the\n Degree Distribution and the Spectrum of the Graph Open
Counting short cycles in bipartite graphs is a fundamental problem of\ninterest in the analysis and design of low-density parity-check (LDPC) codes.\nThe vast majority of research in this area is focused on algorithmic\ntechniques. Most re…
View article: Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets
Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets Open
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 hierarchy of embedded graphs starting from an ETS. The cha…
View article: Characterization and Efficient Search of Non-Elementary Trapping Sets of\n LDPC Codes with Applications to Stopping Sets
Characterization and Efficient Search of Non-Elementary Trapping Sets of\n LDPC Codes with Applications to Stopping Sets Open
In this paper, we propose a characterization for non-elementary trapping sets\n(NETSs) of low-density parity-check (LDPC) codes. The characterization is based\non viewing a NETS as a hierarchy of embedded graphs starting from an ETS. The\n…
View article: From Cages to Trapping Sets and Codewords: A Technique to Derive Tight\n Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of\n LDPC Codes
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight\n Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of\n LDPC Codes Open
Cages, defined as regular graphs with minimum number of nodes for a given\ngirth, are well-studied in graph theory. Trapping sets are graphical structures\nresponsible for error floor of low-density parity-check (LDPC) codes, and are\nwell…
View article: Asymptotic Average Multiplicity of Structures within Different\n Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random\n Regular and Irregular LDPC Code Ensembles
Asymptotic Average Multiplicity of Structures within Different\n Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random\n Regular and Irregular LDPC Code Ensembles Open
The performance of low-density parity-check (LDPC) codes in the error floor\nregion is closely related to some combinatorial structures of the code's Tanner\ngraph, collectively referred to as {\\it trapping sets (TSs)}. In this paper, we\…
View article: Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles.
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. Open
The performance of low-density parity-check (LDPC) codes in the error floor region is closely related to some combinatorial structures of the code's Tanner graph, collectively referred to as {\it trapping sets (TSs)}. In this paper, we stu…
View article: On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles Open
In this paper, we study the cycle distribution of random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes. We prove that for a random bipartite graph, with a g…
View article: On the Tanner Graph Cycle Distribution of Random LDPC, Random\n Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles
On the Tanner Graph Cycle Distribution of Random LDPC, Random\n Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles Open
In this paper, we study the cycle distribution of random low-density\nparity-check (LDPC) codes, randomly constructed protograph-based LDPC codes,\nand random quasi-cyclic (QC) LDPC codes. We prove that for a random bipartite\ngraph, with …
View article: Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Irregular LDPC Codes
Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Irregular LDPC Codes Open
In this paper, we propose a characterization of elementary trapping sets (ETSs) for irregular low-density parity-check (LDPC) codes. These sets are known to be the main culprits in the error floor region of such codes. The characterization…
View article: Characterization and Efficient Exhaustive Search Algorithm for\n Elementary Trapping Sets of Irregular LDPC Codes
Characterization and Efficient Exhaustive Search Algorithm for\n Elementary Trapping Sets of Irregular LDPC Codes Open
In this paper, we propose a characterization of elementary trapping sets\n(ETSs) for irregular low-density parity-check (LDPC) codes. These sets are\nknown to be the main culprits in the error floor region of such codes. The\ncharacterizat…
View article: New Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Variable-Regular LDPC Codes
New Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Variable-Regular LDPC Codes Open
In this paper, we propose a new characterization for elementary trapping sets (ETSs) of variable-regular low-density parity-check (LDPC) codes. Recently, Karimi and Banihashemi proposed a characterization of ETSs, which was based on viewin…
View article: Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing
Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing Open
Wideband spectrum sensing is a significant challenge in cognitive radios (CRs) due to requiring very high-speed analog- to-digital converters (ADCs), operating at or above the Nyquist rate. Here, we propose a very low-complexity zero-block…
View article: Energy-Efficient Broadcasting for Cross Wireless Ad-Hoc Networks
Energy-Efficient Broadcasting for Cross Wireless Ad-Hoc Networks Open
In this paper, we propose solutions for the energy-efficient broadcasting over cross networks, where N nodes are located on two perpendicular lines. Our solutions consist of an algorithm which finds the optimal range assignment in polynomi…
View article: Corrections to “On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes” [Sep 14 5188-5203]
Corrections to “On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes” [Sep 14 5188-5203] Open
In the above paper, there are some erroneous entries in Tables I, III, IV, VII, and X, which are corrected here. Moreover, for the proper application of the definition of layered superset (LSS) property to all the results of Tables I –VII …