Amir H. Banihashemi
Orcid: 0000-0003-0685-5256
According to our database1,
Amir H. Banihashemi
authored at least 154 papers
between 1998 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
A Semi Linear State Space Model for Error Floor Estimation of LDPC Codes Over the AWGN Channel.
IEEE Trans. Commun., 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
2021
IEEE Trans. Commun., 2021
Construction of Time Invariant Spatially Coupled LDPC Codes Free of Small Trapping Sets.
IEEE Trans. Commun., 2021
IEEE Trans. Commun., 2021
2020
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix.
IEEE Trans. Inf. Theory, 2020
IEEE Trans. Inf. Theory, 2020
Construction of QC LDPC Codes With Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets.
IEEE Trans. Commun., 2020
Error Floor Estimation of LDPC Decoders - A Code Independent Approach to Measuring the Harmfulness of Trapping Sets.
IEEE Trans. Commun., 2020
Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result.
IEEE Trans. Commun., 2020
IEEE Commun. Lett., 2020
2019
Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets.
IEEE Trans. Inf. Theory, 2019
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes.
IEEE Trans. Inf. Theory, 2019
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph.
IEEE Trans. Inf. Theory, 2019
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.
IEEE Trans. Inf. Theory, 2019
Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles.
IEEE Trans. Inf. Theory, 2019
Log-Likelihood Ratio Calculation for Pilot Symbol Assisted Coded Modulation Schemes With Residual Phase Noise.
IEEE Trans. Commun., 2019
IEEE Commun. Lett., 2019
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles.
Graphs Comb., 2019
From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019
On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019
2018
Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms.
IEEE Trans. Inf. Theory, 2018
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles.
IEEE Trans. Inf. Theory, 2018
An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes.
IEEE Commun. Lett., 2018
IEEE Commun. Lett., 2018
On Computing the Multiplicity of Short Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph.
CoRR, 2018
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018
Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018
Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
2017
IEEE Trans. Commun., 2017
Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes.
IEEE Commun. Lett., 2017
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles.
CoRR, 2017
Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
2016
New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes.
IEEE Trans. Inf. Theory, 2016
Minimal characterization and provably efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016
Proceedings of the 2016 IEEE International Conference on Communications, 2016
An efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes.
Proceedings of the 2016 IEEE International Conference on Communications, 2016
2015
Iterative Reweighted ℓ<sub>2</sub>/ℓ<sub>1</sub> Recovery Algorithms for Compressed Sensing of Block Sparse Signals.
IEEE Trans. Signal Process., 2015
Corrections to "On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes".
IEEE Trans. Inf. Theory, 2015
Localization and Location Verification in Non-Homogeneous One-Dimensional Wireless Ad-Hoc Networks.
IEEE J. Sel. Areas Commun., 2015
On Characterization and Efficient Exhaustive Search of Elementary Trapping Sets of Variable-Regular LDPC Codes.
IEEE Commun. Lett., 2015
New Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Variable-Regular LDPC Codes.
CoRR, 2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
Proceedings of the 2015 IEEE International Conference on Communications, 2015
Proceedings of the 2015 IEEE International Conference on Communications, 2015
Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing.
Proceedings of the 2015 IEEE Global Communications Conference, 2015
2014
IEEE Trans. Inf. Theory, 2014
Fast and Accurate Error Floor Estimation of Quantized Iterative Decoders for Variable-Regular LDPC Codes.
IEEE Commun. Lett., 2014
IEEE Commun. Lett., 2014
How much can knowledge of delay model help chunked coding over networks with perfect feedback?
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014
2013
IEEE Wirel. Commun. Lett., 2013
Error Rate Estimation of Low-Density Parity-Check Codes Decoded by Quantized Soft-Decision Iterative Algorithms.
IEEE Trans. Commun., 2013
IEEE Trans. Commun., 2013
IEEE Commun. Lett., 2013
2012
Throughput and Energy Optimization in Wireless Networks: Joint MAC Scheduling and Network Coding.
IEEE Trans. Veh. Technol., 2012
IEEE Trans. Veh. Technol., 2012
IEEE Trans. Inf. Theory, 2012
Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing.
IEEE Trans. Inf. Theory, 2012
Performance Analysis of Iterative Decoding Algorithms with Memory over Memoryless Channels.
IEEE Trans. Commun., 2012
LLR Approximation for Wireless Channels Based on Taylor Series and its Application to BICM With LDPC Codes.
IEEE Trans. Commun., 2012
Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings.
IEEE Trans. Commun., 2012
IEEE Commun. Lett., 2012
IEEE Commun. Lett., 2012
CoRR, 2012
Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay
CoRR, 2012
Proceedings of the International Symposium on Network Coding, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Analysis and design of irregular graphs for node-based verification-based recovery algorithms in compressed sensing.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Iterative recovery algorithms for compressed sensing of wideband block sparse spectrums.
Proceedings of IEEE International Conference on Communications, 2012
2011
IEEE Trans. Inf. Theory, 2011
Successive Maximization for Systematic Design of Universally Capacity Approaching Rate-Compatible Sequences of LDPC Code Ensembles over Binary-Input Output-Symmetric Memoryless Channels.
IEEE Trans. Commun., 2011
Network Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes
CoRR, 2011
Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressive Sensing
CoRR, 2011
Scheduling and network coding in wireless multicast networks: A case for unequal time shares.
Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Robust MIMO Receiver Based on Belief Propagation in the Presence of Imperfect Channel and Noise Knowledge.
Proceedings of the Global Communications Conference, 2011
The Effect of Transmission Capacities on Interference-Free Scheduling in Wireless Networks.
Proceedings of the Ninth Annual Communication Networks and Services Research Conference, 2011
Proceedings of the Ninth Annual Communication Networks and Services Research Conference, 2011
2010
New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel.
IEEE Trans. Inf. Theory, 2010
Systematic design of low-density parity-check code ensembles for binary erasure channels.
IEEE Trans. Commun., 2010
An Efficient Approach Toward the Asymptotic Analysis of Node-Based Recovery Algorithms in Compressed Sensing
CoRR, 2010
Proceedings of the Global Communications Conference, 2010
2009
IEEE Trans. Veh. Technol., 2009
IEEE Trans. Commun., 2009
Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration.
IEEE Trans. Commun., 2009
IEEE Trans. Commun., 2009
Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters].
IEEE Trans. Commun., 2009
Policy Allocation for Transmissionof Embedded Bit Streams over Noisy Channels with Feedback.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009
Adaptive Rate Allocation Algorithm for Transmission of Multiple Embedded Bit Streams over Time-Varying Noisy Channels.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009
On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009
2008
A distortion optimal rate allocation algorithm for transmission of embedded bitstreams over noisy channels.
IEEE Trans. Commun., 2008
Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
2007
IEEE Trans. Commun., 2007
Estimation of Bit and Frame Error Rates of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels.
IEEE Trans. Commun., 2007
Performance of Belief Propagation for Decoding LDPC Codes in the Presence of Channel Estimation Error.
IEEE Trans. Commun., 2007
Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration.
Proceedings of the IEEE International Symposium on Information Theory, 2007
Proceedings of the Global Communications Conference, 2007
2006
Combined source and channel coding with JPEG2000 and rate-compatible low-density Parity-check codes.
IEEE Trans. Signal Process., 2006
IEEE Trans. Signal Process., 2006
IEEE Trans. Inf. Theory, 2006
Progressive Transmission of Images Over Fading Channels Using Rate-Compatible LDPC Codes.
IEEE Trans. Image Process., 2006
A fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels.
IEEE Trans. Commun., 2006
IEEE Trans. Commun., 2006
Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes.
IEEE Trans. Commun., 2006
A 0.18-$muhbox m$CMOS Analog Min-Sum Iterative Decoder for a (32, 8) Low-Density Parity-Check (LDPC) Code.
IEEE J. Solid State Circuits, 2006
Estimation of Bit and Frame Error Rates of Low-Density Parity-Check Codes on Binary Symmetric Channels
CoRR, 2006
Proceedings of IEEE International Conference on Communications, 2006
2005
On implementation of min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes.
IEEE Trans. Commun., 2005
IEEE Commun. Lett., 2005
Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes.
Ann. des Télécommunications, 2005
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
An 80-Mb/s 0.18-μm CMOS analog min-sum iterative decoder for a (32, 8, 10) LDPC code.
Proceedings of the IEEE 2005 Custom Integrated Circuits Conference, 2005
2004
Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes.
IEEE Trans. Commun., 2004
IEEE Trans. Commun., 2004
Reliability-based schedule for bit-flipping decoding of low-density Parity-check codes.
IEEE Trans. Commun., 2004
IEEE Commun. Lett., 2004
IEEE Commun. Lett., 2004
IEEE Commun. Lett., 2004
Iterative layered space-time receivers for single-carrier transmission over severe time-dispersive channels.
IEEE Commun. Lett., 2004
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
Proceedings of IEEE International Conference on Communications, 2004
An iterative frequency-domain layered space-time receiver for SDMA systems with single-carrier transmission.
Proceedings of the 2004 IEEE International Conference on Acoustics, 2004
Comparison between continuous-time asynchronous and discrete-time synchronous iterative decoding.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004
2003
A current mode maximum winner-take-all circuit with low voltage requirement for min-sum analog iterative decoders.
Proceedings of the 2003 10th IEEE International Conference on Electronics, 2003
Proceedings of the 13th ACM Great Lakes Symposium on VLSI 2003, 2003
2002
On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codes.
Proceedings of the Global Telecommunications Conference, 2002
2001
IEEE Trans. Inf. Theory, 2001
IEEE Commun. Lett., 2001
Proceedings of the IEEE International Conference on Communications, 2001
Proceedings of the Global Telecommunications Conference, 2001
1999
IEEE Trans. Inf. Theory, 1999
1998
IEEE Trans. Inf. Theory, 1998
IEEE Trans. Inf. Theory, 1998
An Inequality on the Coding Gain of Densest Lattice Packings in Successive Dimensions.
Des. Codes Cryptogr., 1998