Publications in Refereed Journals (96)

2022

• A. Farsiabi and A. H. Banihashemi, ``A Semi Linear State Space Model for Error Floor Estimation of LDPC codes over the AWGN Channel," to appear in IEEE Trans. Comm..
  
  
• A. Farsiabi and A. H. Banihashemi, ``Error Floor Analysis of LDPC Column Layered Decoders," IEEE Comm. Lett., vol. 26, no. 3, pp. 485 - 489, March 2022.
  
  

  2021

• A. Farsiabi and A. H. Banihashemi, ``Error Floor Analysis of LDPC Row Layered Decoders," IEEE Trans. Inform. Theory, vol. 67, no. 9, pp. 5804 - 5826, Sept. 2021.
  
  
• S. Naseri and A. H. Banihashemi, ``Construction of Time Invariant Spatially Coupled LDPC Codes Free of Small Trapping Sets," IEEE Trans. Comm., vol. 69, no. 6, pp. 3485 - 3501, June 2021.
  
  
• H. Wei and A. H. Banihashemi, ``ADMM Check Node Penalized Decoders for LDPC Codes," IEEE Trans. Comm., vol. 69, no. 6, pp. 3528 - 3540, June 2021.
  
  
• P. Neshaastegaran and A. H. Banihashemi, ``Error Floor Estimation of LDPC Coded Modulation Systems Using Importance Sampling," IEEE Trans. Comm., vol. 69, no. 5, pp. 2784 - 2799, May 2021.
  
  
• B. Karimi and A. H. Banihashemi, ``Construction of Irregular Protograph-Based QC-LDPC Codes With Low Error Floor," IEEE Trans. Comm., vol. 69, no. 1, pp. 3 - 18, Jan. 2021.
  
  

  2020

• A. Dehghan and A. H. Banihashemi, ``On Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth," IEEE Trans. Inform. Theory, vol. 66, no. 10, pp. 6024 - 6036, Oct. 2020.
  
  
• A. Dehghan and A. H. Banihashemi, ``On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix," IEEE Trans. Inform. Theory, vol. 66, no. 10, pp. 6037 - 6047, Oct. 2020.
  
  
• A. Farsiabi and A. H. Banihashemi, ``Error Floor Estimation of LDPC Decoders - A Code Independent Approach to Measuring the Harmfulness of Trapping Sets, IEEE Trans. Comm., vol. 68, no. 5, pp. 2667 - 2679, May 2020.
  
  
• A. Dehghan and A. H. Banihashemi, ``Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result," IEEE Trans. Comm., vol. 68, no. 3, pp. 1378 - 1390, March 2020.
  
  
• S. Naseri and A. H. Banihashemi, ``Spatially Coupled LDPC Codes with Small Constraint Length and Low Error Floor," IEEE Comm. Lett., vol. 24, no. 2, pp. 254 - 258, Feb. 2020.
  
  
• B. Karimi and A. H. Banihashemi, ``Construction of QC LDPC Codes with Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets," IEEE Trans. Comm., vol. 68, no. 2, pp. 697 - 712, Feb. 2020.
  
  

  2019

• A. Dehghan and A. H. Banihashemi, ``Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles," Graphs and Combinatorics, vol. 35, no. 6, pp. 1673 - 1693, Oct. 2019.
  
  
• S. Naseri and A. H. Banihashemi, ``Construction of Girth-8 QC-LDPC Codes Free of Small Trapping Sets," IEEE Comm. Lett., vol. 23, no. 11, pp. 1904 - 1908, Nov. 2019.
  
  
• A. Dehghan and A. H. Banihashemi, ``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. Inform. Theory, vol. 65, no. 10, pp. 6022 - 6043, October 2019.
  
  
• A. Dehghan and A. H. Banihashemi, ``Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes," IEEE Trans. Inform. Theory, vol. 65, no. 7, pp. 4307 - 4315, July 2019.
  
  
• A. Dehghan and A. H. Banihashemi, ``On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph," IEEE Trans. Inform. Theory, vol. 65, no. 6, pp. 3778 - 3789, June 2019.
  
  
• P. Neshaastegaran and A. H. Banihashemi, ``Log-likelihood Ratio Calculation for Pilot Symbol Assisted Coded Modulation Schemes with Residual Phase Noise," IEEE Trans. Comm., vol. 67, no. 5, pp. 3782 - 3790, May 2019.
  
  
• A. Dehghan and A. H. Banihashemi, ``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. Inform. Theory, vol. 65, no. 4, pp. 2062 - 2074, April 2019.
  
  
• Y. Hashemi and A. H. Banihashemi, ``Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets," IEEE Trans. Inform. Theory, vol. 65, no. 2, pp. 1017 - 1033, Feb. 2019.
  
  

  2018

• A. Dehghan and A. H. Banihashemi, ``On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles," IEEE Trans. Inform. Theory, vol. 64, no. 6, pp. 4438 - 4451, June 2018.
  
  
• Y. Hashemi and A. H. Banihashemi, ``Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms," IEEE Trans. Inform. Theory, vol. 64, no. 5, pp. 3411 - 3430, May 2018.
  
  
• Y. Hashemi and A. H. Banihashemi, ``Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes," IEEE Comm. Lett., vol. 22, no. 1, pp. 33 - 36, Jan. 2018.
  
  
• H. Wei and A. H. Banihashemi, ``An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes," IEEE Comm. Lett., vol. 22, no. 1, pp. 29 - 32, Jan. 2018.
  
  

  2017

• Y. Hashemi and A. H. Banihashemi, ``Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes," IEEE Comm. Lett., vol. 21, no. 9, pp. 1905 - 1908, Sept. 2017.
  
  
• A. Tasdighi, A. H. Banihashemi and M. R. Sadeghi, ``Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes," IEEE Trans. Commun., vol. 65, no. 1, pp. 14 - 22, Jan. 2017.
  
  

  2016

• Y. Hashemi and A. H. Banihashemi, ``New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes," IEEE Trans. Inform. Theory, vol. 62, no. 12, pp. 6713 - 6736, Dec. 2016.
  
  
• A. Tasdighi, A. H. Banihashemi and M. R. Sadeghi, ``Efficient Search of Girth-Optimal QC-LDPC Codes,'' IEEE Trans. Inform. Theory, vol. 62, no. 4, pp. 1552 - 1564, April 2016.
  
  

  2015

• Z. Zeinalkhani and A. H. Banihashemi, ``Iterative Reweighted $\ell_2/\ell_1$ Recovery Algorithms for Compressed Sensing of Block Sparse Signals,'' IEEE Trans. Signal Proc., vol. 63, no. 17, pp. 4516 - 4531, Sept. 2015.
  
  
• M. Ataei, T. Kunz and A. H. Banihashemi, ``Localization and Location Verification in Non-Homogeneous One-Dimensional Wireless Ad-Hoc Networks,'' IEEE JSAC - 2014 Special Issue on Location-Awareness for Radios and Networks, vol. 33, no. 7, pp. 1304 - 1316, July 2015.
  
  
• Y. Hashemi and A. H. Banihashemi, ``On Characterization and Efficient Exhaustive Search of Elementary Trapping Sets of Variable-Regular LDPC Codes,'' IEEE Comm. Lett., vol. 19, no. 3, pp. 323 - 326, March 2015.
  
  
• Y. Hashemi and A. H. Banihashemi, ``Corrections to ''On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes'','' IEEE Trans. Inform. Theory, vol. 61, no. 3, p. 1508, March 2015.
  
  

  2014

• M. Karimi and A. H. Banihashemi, ``On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes,'' IEEE Trans. Inform. Theory, vol. 60, no. 9, pp. 5188 - 5203, Sept. 2014.
  
  
• S. Tolouei and A. H. Banihashemi, ``Fast and Accurate Error Floor Estimation of Quantized Iterative Decoders for Variable-Regular LDPC codes,'' IEEE Comm. Lett., vol. 18, no. 8, pp. 1283 - 1286, August 2014.
  
  
• S. Tolouei and A. H. Banihashemi, ``Lowering the Error Floor of LDPC Codes Using Multi-Step Quantization,'' IEEE Comm. Lett., vol. 18, no. 1, pp. 86 - 89, Jan. 2014.
  
  

  2013

• M. Ataei, A. H. Banihashemi and T. Kunz, ``An Energy-Efficient Transmission Range Assignment for 1-D Wireless Ad Hoc Networks,'' IEEE Wireless Comm. Lett., vol. 2, no. 5, pp. 543-546, October 2013.
  
  
• M. Karimi and A. H. Banihashemi, ``On the Girth of Quasi Cyclic Protograph LDPC Codes,'' IEEE Trans. Inform. Theory, vol. 59, no. 7, pp. 4542-4552, July 2013.
  
  
• H. Xiao, A. H. Banihashemi and M. Karimi, ``Error Rate Estimation of Low-Density Parity-Check Codes Decoded by Quantized Soft-Decision Iterative Algorithms,'' IEEE Trans. Comm., vol. 61, no. 2, pp. 474-484, Feb. 2013.
  
  
• M. Karimi and A. H. Banihashemi, ``Message-Passing Algorithms for Counting Short Cycles in a Graph,'' IEEE Trans. Comm., vol. 61, no. 2, pp. 485-495, Feb. 2013.
  
  
• R. Asvadi and A. H. Banihashemi, ``A Rate-Compatible Puncturing Scheme for Finite-Length LDPC Codes,'' IEEE Comm. Lett., vol. 17, no. 1, pp. 147-150, Jan. 2013.
  
  

  2012

• M. Karimi and A. H. Banihashemi, ``An Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes,'' IEEE Trans. Inform. Theory, vol. 58, pp. 6942 - 6958, Nov. 2012.
  
  
• Y. Eftekhari, A. Heidarzadeh, A. H. Banihashemi and I. Lambadaris, ``Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing,'' IEEE Trans. Inform. Theory, vol. 58, pp. 6616 - 6645, Oct. 2012.
  
  
• E. Janulewicz and A. H. Banihashemi, ``Performance Analysis of Iterative Decoding Algorithms with Memory over Memoryless Channels,'' IEEE Trans. Comm., vol. 60, no. 12, pp. 3556 - 3566, Dec. 2012.
  
  
• M. Ataei, A. H. Banihashemi and T. Kunz, ``Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks,'' IEEE Trans. Vehicular Tech., vol. 61, pp. 3276 - 3282, Sept. 2012.
  
  
• S. Khazraie, R. Asvadi and A. H. Banihashemi, ``A PEG Construction of Finite-Length LDPC Codes with Low Error Floor,'' IEEE Comm. Lett., vol. 16, pp. 1288 - 1291, August 2012.
  
  
• M. Karimi and A. H. Banihashemi, ``Counting Short Cycles of Quasi Cyclic Protograph LDPC Codes,'' IEEE Comm. Lett., vol. 16, no. 3, pp. 400 - 403, March 2012.
  
  
• R. Asvadi, A. H. Banihashemi, M. Ahmadian-Attari and H. Saeedi, ``LLR Approximation for Wireless Channels Based on Taylor Series and Its Application to BICM with LDPC Codes," IEEE Trans. Comm., vol. 60, no. 5, pp. 1226 - 1236, May 2012.
  
  
• R. Niati, A. H. Banihashemi and T. Kunz, ``Throughput and Energy Optimization in Wireless Networks: Joint MAC Scheduling and Network Coding," IEEE Trans. Vehicular Tech., vol. 61, no. 3, pp. 1372 - 1382, March 2012.
  
  
• R. Asvadi, A. H. Banihashemi and M. Ahmadian-Attari, ``Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings," IEEE Trans. Comm., vol. 60, no. 4, pp. 902 - 907, April 2012.
  
  

  2011

• H. Saeedi, H. Pishro-Nik and A. H. Banihashemi, ``Successive maximization for the systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels," IEEE Trans. Comm., vol. 59, no. 7, pp. 1807 - 1819, July 2011.
  
  
• R. Asvadi, A. H. Banihashemi and M. Ahmadian-Attari, ``Lowering the Error Floor of LDPC Codes Using Cyclic Liftings," IEEE Trans. Inform. Theory, vol. 57, no. 4, pp. 2213 - 2224, April 2011.
  
  

  2010

• H. Saeedi and A. H. Banihashemi, ``New Sequences of Capacity Achieving LDPC Code Ensembles over the Binary Erasure Channel," IEEE Trans. Inform. Theory, vol. 56, no. 12, pp. 6332 - 6346, Dec. 2010.
  
  
• H. Saeedi and A. H. Banihashemi, ``On the Design of Irregular LDPC Code Ensembles for BIAWGN Channels," IEEE Trans. Comm., vol. 58. no. 5, pp. 1376 - 1382, May 2010.
  
  
• H. Saeedi and A. H. Banihashemi, ``Systematic Design of Low-Density Parity-Check Codes for Binary Erasure Channels," IEEE Trans. Comm., vol. 58, no. 1, pp. 118 - 127, Jan. 2010.
  
  

  2009

• J. Qiu and A. H. Banihashemi, ``Policy Allocation for Transmission of Embedded Bit Streams over Noisy Channels with Feedback," IEEE Trans. Comm., vol. 57, no. 11, pp. 3197 - 3182, Nov. 2009.
  
  
• Y. Boiko, A. H. Banihashemi and T. H. Yeap, ``3-D Neural Mapper for LDPC Sum-Product Decoder," Optical Memory and Neural Networks (Information Optics), vol. 18, no. 2, pp. 101 - 107, 2009. (The original authorship was ``Y. Boiko." An Erratum was subsequently published in vol. 18, no. 4, p. 349 to correct the authorship.)
  
  
• N. Mobini, A. H. Banihashemi and S. Hemati, ``A Differential Binary Message-Passing LDPC Decoder," IEEE Trans. Comm., vol. 57, no. 9, pp. 2518 - 2523, Sept. 2009.
  
  
• H. Xiao and A. H. Banihashemi, ``Comments on Successive Relaxation for Decoding of LDPC Codes," IEEE Trans. Comm., vol. 57, no. 10, pp. 2846 - 2848, Oct. 2009.
  
  
• H. Xiao and A. H. Banihashemi, ``Error Rate Estimation of Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration," IEEE Trans. Comm., vol. 57, no. 6, pp. 1550 - 1555, June 2009.
  
  
• H. Saeedi and A. H. Banihashemi, ``Design of Irregular LDPC Codes for BIAWGN Channels with SNR Mismatch," IEEE Trans. Comm., vol. 57, no. 1, pp. 6 - 11, Jan. 2009.
  
  
• R. Kalbasi, D. Falconer, A. H. Banihashemi and R. Dinis, ``A comparison of frequency domain block MIMO transmission systems," IEEE Trans. Vehicular Tech., vol. 58, no. 1, pp. 165 - 175, Jan. 2009.
  
  

  2008

• A. H. Banihashemi and A. Hatam, ``A Distortion Optimal Rate Allocation Algorithm for Transmission of Embedded Bitstreams over Noisy Channels," IEEE Trans. Comm., vol. 56, no. 10, pp. 1581 - 1584, Oct. 2008.
  
  

  2007

• H. Xiao and A. H. Banihashemi, ``Estimation of bit and frame error rates of finite-length low-density parity-check codes on binary symmetric channels," IEEE Trans. Comm., vol. 55, no. 12, pp. 2234 - 2239, Dec. 2007.
  
  
• S. Hemati and A. H. Banihashemi, ``Convergence speed and throughput of analog decoders," IEEE Trans. Comm., vol. 55, no. 5, pp. 833 - 836, May 2007.
  
  
• P. Zarrinkhat and A. H. Banihashemi, ``Hybrid Hard-Decision Iterative Decoding of Irregular Low-Density Parity-Check Codes," IEEE Trans. Comm., vol. 55, no. 2, pp. 292 - 302, Feb. 2007.
  
  
• H. Saeedi and A. H. Banihashemi, ``Performance of Belief Propagation for Decoding LDPC codes in the Presence of Channel Estimation Error," IEEE Trans. Comm., vol. 55, no. 1, pp. 83 - 89, Jan. 2007.
  
  

  2006

• X. Pan, A. H. Banihashemi and A. Cuhadar, ``Progressive Transmission of Images over Fading Channels Using Rate-Compatible LDPC Codes," IEEE Trans. Image Processing, vol. 15, no. 12, pp. 3627 - 3635, Dec. 2006.
  
  
• H. Saeedi and A. H. Banihashemi, ``A Note on "Signal-to-Noise Ratio Mismatch for Low-Density Parity-Check Coded Magnetic Recording Channels" by W. Tan and J. R. Cruz," IEEE Trans. Magnetics, vol. 42, no. 11, pp. 3765 - 3766, Nov. 2006.
  
  
• S. Hemati, A. H. Banihashemi and C. Plett, ``A 0.18-\mum CMOS Analog Min-Sum Iterative Decoder for a (32,8) Low-Density Parity-Check (LDPC) Code," IEEE Journal of Solid-States Circuits, vol. 41, no. 11, pp. 2531 - 2540, Nov. 2006.
  
  
• M. R. Sadeghi, A. H. Banihashemi and D. Panario, ``Low Density Parity Check Lattices: Construction and Performance Analysis," IEEE Trans. Inform. Theory, vol. 52, no. 10, pp. 4481 - 4495, Oct. 2006.
  
  
• M. H. Radfar, A. H. Banihashemi, R. M. Dansereau, and A. Sayadiyan, "Nonlinear minimum mean square error estimator for mixture-maximisation approximation," Electronic Letters, vol. 42, no. 12, pp. 75-76, June 2006.
  
  
• R. Kalbasi, D. Falconer and A. H. Banihashemi, ``Optimum space-time processors are bandlimited," IEEE Trans. Signal Processing, vol. 54, no. 5, pp. 1936 - 1941, May 2006.
  
  
• X. Pan, A. Cuhadar and A. H. Banihashemi, ``Joint Source/Channel Coding with JPEG2000 and Rate-Compatible Low-Density Parity-Check (RC-LDPC) Codes," IEEE Trans. Signal Processing, vol. 54, no. 3, pp. 1160 - 1164, March 2006.
  
  
• R. Maddock and A. H. Banihashemi, ``Reliability-Based Coded Modulation with Low-Density Parity-Check Codes," IEEE Trans. Comm., vol. 54, no. 3, pp. 403 - 406, March 2006.
  
  
• X. Pan, A. H. Banihashemi and A. Cuhadar, ``A Fast Trellis-Based Rate-Allocation Algorithm for Robust Transmission of Progressively Coded Images over Noisy Channels," IEEE Trans. Comm., vol. 54, no. 1, pp. 1 - 6, Jan. 2006.
  
  
• S. Hemati and A. H. Banihashemi, ``Dynamics and Performance Analysis of Analog Iterative Decoding for Low-Density Parity-Check (LDPC) Codes," IEEE Trans. Comm., vol. 54, no. 1, pp. 61 - 70, Jan. 2006.
  
  

  2005

• R. Kalbasi, D. Falconer and A. H. Banihashemi, ``Optimum Power Allocation for a V-BLAST System with Two Antennas at the Transmitter," IEEE Comm. Letters, vol. 9, no. 9, pp. 826 - 828, Sept. 2005.
  
  
• J. Zhao, F. Zarkeshvari and A. H. Banihashemi, ``On implementation of min-sum algorithm and its modifications for decoding LDPC codes," IEEE Trans. Comm., vol. 53, no. 4, pp. 549-554, April 2005.
  
  
• P. Zarrinkhat, A. H. Banihashemi and H. Xiao, ``Time-Invariant and Switch-Type Hybrid Iterative Decoding of Low-Density Parity-Check Codes," Annals of Telecommunications (special issue on Turbo Codes), vol. 60, no. 1-2, pp. 103 - 131, Jan./Feb. 2005.
  
  

  2004

• P. Zarrinkhat and A. H. Banihashemi, ``Threshold Values and Convergence Properties of Majority-Based Algorithms for Decoding Regular Low-Density Parity-Check Codes," IEEE Trans. Comm., vol. 52, no. 12, pp. 2087 - 2097, Dec. 2004.
  
  
• H. Xiao and A. H. Banihashemi, ``Graph-based message-passing schedules for decoding LDPC codes," IEEE Trans. Comm., vol. 52, no. 12, pp. 2098 - 2105, Dec. 2004.
  
  
• A. Nouh and A. H. Banihashemi, ``Reliability-Based Schedule for Bit-Flipping Decoding of Low-Density Parity-Check Codes," IEEE Trans. Comm., vol. 52, no. 12, pp. 2038 - 2040, Dec. 2004.
  
  
• H. Xiao and A. H. Banihashemi, ``Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes," IEEE Comm. Lett., vol. 8, no. 12, pp. 715 - 717, Dec. 2004.
  
  
• R. Dinis, R. Kalbasi, D. Falconer and A. H. Banihashemi, ``Iterative Layered Space-Time Receivers for Single-Carrier Transmission over Severe Time-Dispersive Channels," IEEE Comm. Lett., vol. 8, no. 9, pp. 579 - 581, Sept. 2004.
  
  
• P. Zarrinkhat and A. H. Banihashemi, ``Hybrid hard-decision iterative decoding of regular low-density parity-check codes," IEEE Comm. Letters, vol. 8, no. 4, pp. 250 - 252, April 2004.
  
  
• M. R. Yazdani and A. H. Banihashemi, ``On Construction of Rate-Compatible Low-Density Parity-Check Codes," IEEE Comm. Letters, vol. 8, no. 3, pp. 159 - 161, March 2004.
  
  
• M. R. Yazdani, S. Hemati and A. H. Banihashemi, ``Improving Belief Propagation on Graphs with Cycles," IEEE Comm. Letters, vol. 8, no. 1, pp. 57 - 59, Jan. 2004.
  
  

  2002 and before

• A. Nouh and A. H. Banihashemi, ``Bootstrap decoding of low-density parity-check codes," IEEE Comm. Letters, vol. 6, no. 9, pp. 391-393, Sept. 2002.
  
  
• Y. Mao and A.H. Banihashemi, ``Decoding low-density parity-check codes with probabilistic schedule," IEEE Comm. Letters, vol. 5, no. 10, pp. 414-416, Oct. 2001.
  
  
• A. H. Banihashemi and F. R. Kschischang, ``Abelian Group Block Code and Lattice Tanner Graphs: Construction and Complexity," IEEE Trans. Inform. Theory, special issue on codes on graphs and iterative algorithms, vol. 47, pp. 822-834, Feb. 2001.
  
  
• A.H. Banihashemi and I.F. Blake, "On the trellis complexity of root lattices and their duals," IEEE Trans. Inform. Theory, vol. 45, pp. 2168-2172, Sept. 1999.
  
  
• A.H. Banihashemi and I.F. Blake, "Trellis complexity and minimal trellis diagrams of lattices", IEEE Trans. Inform. Theory, vol. 44, pp. 1829-1847, Sept. 1998.
  
  
• A.H. Banihashemi and A.K. Khandani, "An inequality on the coding gain of densest lattice packings", Designs, Codes and Cryptography, vol. 14, pp. 207-212, Sept. 1998.
  
  
• A.H. Banihashemi and A.K. Khandani, "On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis", IEEE Trans. Inform. Theory, vol. 44., pp. 162-171, Jan. 1998.
  
  
• A.H. Banihashemi and A.K. Khandani, "On the decoding complexity of lattices", Journal of Computing and Information, vol. 2, No. 1, pp. 205-218, 1996.
  
  

Publications in Refereed Conferences (121)

2022

• A. Ahadi, A. Dehghan and A. H. Banihashemi, ``A Polynomial Time Algorithm for Finding Bi-Regular Tanner Graphs With Large Girth," accepted for presentation at IEEE ISIT 2022, Espoo, Finland, June 26-July 1, 2022.
  
  
• S. Naseri, A. Dehghan and A. H. Banihashemi, ``On Average Number of Cycles in Finite-Length Spatially Coupled LDPC Codes," accepted for presentation at IEEE ISIT 2022, Espoo, Finland, June 26-July 1, 2022.
  
  
• A. Farsiabi and A. H. Banihashemi, ``A Semi Linear State Space Model for Error Floor Estimation of LDPC Codes Over the AWGN Channel," accepted for presentation at IEEE ISIT 2022, Espoo, Finland, June 26-July 1, 2022.
  
  

  2019

• A. Dehghan and A. H. Banihashemi, ``On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth,'' accepted for presentation at the 2019 IEEE Information Theory Workshop (ITW), Visby, Gotland, Sweden, Aug. 25-28, 2019.
  
  
• A. Dehghan and A. H. Banihashemi, ``From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation,'' accepted for presentation at the 2019 IEEE Information Theory Workshop (ITW), Visby, Gotland, Sweden, Aug. 25-28, 2019.
  
  

  2018

• A. Dehghan and A. H. Banihashemi, ``Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles,'' accepted for presentation at International Symposium on Turbo Codes & Iterative Information Processing 2018 (ISTC'18), Hong Kong, Dec. 3-7, 2018.
  
  
• A. Dehghan and A. H. Banihashemi, ``Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles,'' accepted for presentation at International Symposium on Turbo Codes & Iterative Information Processing 2018 (ISTC'18), Hong Kong, Dec. 3-7, 2018.
  
  
• A. Dehghan and A. H. Banihashemi, ``On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum,'' accepted for presentation at International Symposium on Turbo Codes & Iterative Information Processing 2018 (ISTC'18), Hong Kong, Dec. 3-7, 2018.
  
  
• Y. Hashemi and A. H. Banihashemi, ``Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets,'' accepted for presentation at IEEE ISIT 2018, Colorado, USA, June 17-22, 2018.
  
  
• A. Dehghan and A. H. Banihashemi, ``Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles,'' accepted for presentation at IEEE ISIT 2018, Colorado, USA, June 17-22, 2018.
  
  
• A. Dehghan and A. H. Banihashemi, ``Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard,'' accepted for presentation at IEEE ISIT 2018, Colorado, USA, June 17-22, 2018.
  
  
• A. Dehghan and A. H. Banihashemi, ``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,'' accepted for presentation at IEEE ISIT 2018, Colorado, USA, June 17-22, 2018.
  
  

  2017

• Y. Hashemi and A. H. Banihashemi, ``Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Irregular LDPC Codes,'' accepted for presentation at IEEE ISIT 2017, Aachen, Germany, June 25-30, 2017.
  
  

  2016

• Y. Hashemi and A. H. Banihashemi, ``Minimal Characterization and Provably Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Variable-Regular LDPC Codes,'' accepted for presentation at IEEE ISIT 2016, Barcelona, Spain, July 10-15, 2016.
  
  
• Z. Zeinalkhani, N. Haghighatpanah and A. H. Banihashemi, ``On Weighting/Reweighting Schemes for Approximate Message Passing Algorithms,'' accepted for presentation at IEEE ICC 2016, Kuala Lumpur, Malaysia, May 23-27, 2016.
  
  
• Y. Hashemi and A. H. Banihashemi, ``An Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Variable-Regular LDPC Codes,'' accepted for presentation at IEEE ICC 2016, Kuala Lumpur, Malaysia, May 23-27, 2016.
  
  

  2015

• Z. Zeinalkhani and Amir H. Banihashemi, ``Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing,'' accepted for presentation at IEEE Globecom 2015, San Diego, CA, Dec. 6 - 10, 2015.
  
  
• Z. Zeinalkhani and Amir H. Banihashemi, ``Low-complexity Detection of Zero Blocks in Wideband Spectrum Sensing,'' accepted for presentation at IEEE ISIT 2015, Hong Kong, June 14 - 19, 2015.
  
  
• M. R. Ataei, A. H. Banihashemi and T. Kunz, ``Minimum-Energy Broadcasting for Cross Wireless Ad-Hoc Networks,'' accepted for presentation at IEEE ICC 2015, London, UK, June 8 - 12.
  
  
• M. R. Ataei, T. Kunz and A. H. Banihashemi, ``Localization in Non-Homogeneous One-Dimensional Wireless Ad-Hoc Networks,'' accepted for presentation at IEEE ICC 2015, London, UK, June 8 - 12.
  
  

  2014

• Mehdi Karimi and Amir H. Banihashemi, ``On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes,'' accepted for presentation at the 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), Bremen, Germany, August 18 - 22, 2014.
  
  
• Anoosheh Heidarzadeh and Amir H. Banihashemi, ``How Much Can Knowledge of Delay Model Help Chunked Coding over Networks with Perfect Feedback?,'' accepted for presentation at IEEE ISIT 2014, Honolulu, HI, USA, June 29 - July 4, 2014.
  
  

  2012

• Anoosheh Heidarzadeh and Amir H. Banihashemi, ``Coding Delay Analysis of Chunked Codes over Line Networks,'' accepted for presentation at International Symposium on Network Coding 2012 (NetCod 2012), MIT, Cambridge, MA, USA, June 29 - 30, 2012.
  
  
• Mehdi Karimi and Amir H. Banihashemi, ``On the Girth of Quasi Cyclic Protograph LDPC Codes,'' accepted for presentation at IEEE ISIT 2012, MIT, Cambridge, MA, USA, July 1 - 6, 2012.
  
  
• Anoosheh Heidarzadeh and Amir H. Banihashemi, ``How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?'' accepted for presentation at IEEE ISIT 2012, MIT, Cambridge, MA, USA, July 1 - 6, 2012.
  
  
• Yaser Eftekhari, Amir H. Banihashemi and Ioannis Lambadaris, ``Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing,'' accepted for presentation at IEEE ISIT 2012, MIT, Cambridge, MA, USA, July 1 - 6, 2012.
  
  
• Z. Zeinalkhani and Amir H. Banihashemi, ``Iterative Recovery Algorithms for Compressed Sensing of Wideband Block Sparse Spectrums,'' accepted for presentation at IEEE ICC 2012, Ottawa, ON, Canada, June 10 - 15, 2012.
  
  

  2011

• Ahmad Ali Farhoodi and Amir H. Banihashemi, ``Robust MIMO Receiver Based on Belief Propagation in the Presence of Imperfect Channel and Noise Knowledge,'' accepted for presentation at IEEE Globecom 2011, Houston, TX, USA, Dec. 5 - 9, 2011.
  
  
• Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari and Hamid Saeedi, ``LLR Approximation for Wireless Channels Based on Taylor Series and Its Application to BICM with LDPC Codes,'' accepted for presentation at IEEE Globecom 2011, Houston, TX, USA, Dec. 5 - 9, 2011.
  
  
• Anoosheh Heidarzadeh and Amir H. Banihashemi, ``Analysis of Overlapped Chunked Codes with Small Chunks over Line Networks,'' accepted for presentation at IEEE ISIT 2011, Saint-Petersburg, Russia, July 31 - August, 5, 2011.
  
  
• Mehdi Karimi and Amir H. Banihashemi, ``An Efficient Algorithm for Finding Dominant Trapping Sets of Irregular LDPC Codes,'' accepted for presentation at IEEE ISIT 2011, Saint-Petersburg, Russia, July 31 - August, 5, 2011.
  
  
• Yaser Eftekhari, Anoosheh Heidarzadeh, Amir H. Banihashemi and Ioannis Lambadaris, ``Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing,'' accepted for presentation at IEEE ISIT 2011, Saint-Petersburg, Russia, July 31 - August, 5, 2011.
  
  
• Reza Asvadi, Amir H. Banihashemi and Mahmoud Ahmadian-Attari, ``Design of Irregular Quasi-Cyclic Protograph Codes with Low Error Floors,'' accepted for presentation at IEEE ISIT 2011, Saint-Petersburg, Russia, July 31 - August, 5, 2011.
  
  
• Ebrahim Karami and Amir H. Banihashemi, ``Cluster size Optimization in Cooperative Spectrum Sensing," accepted for presentation at the 9th Conference on Communication Networks and Services Research (CSNR 2011), Ottawa, Canada, May 2-5th, 2011.
  
  
• Raheleh Niati, Thomas Kunz, and Amir H. Banihashemi, ``The Effect of Transmission Capacities on Interference-free Scheduling in Wireless Networks," accepted for presentation at the 9th Conference on Communication Networks and Services Research (CSNR 2011), Ottawa, Canada, May 2-5th, 2011.
  
  
• Raheleh Niati, Amir H. Banihashemi and Thomas Kunz, ``Scheduling and Network Coding in Wireless Multicast Networks: A Case for Unequal Time Shares," accepted for presentation at the IEEE WCNC 2011, Quintana-Roo, Mexico, March 28 - 31, 2011.
  
  

  2010

• Reza Asvadi, Amir H. Banihashemi and Mahmoud Ahmadian-Attari, ``Approximation of Log-Likelihood Ratio for Wireless Channels Based on Taylor Series," accepted for presentation at the IEEE GLOBECOM 2010, Miami, Florida, Dec. 6 - 10, 2010.
  
  
• M. Karimi and A. H. Banihashemi, ``An Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes," accepted for presentation at the 6th International Symposium on Turbo Codes & Iterative Information Processing, Brest, France, Sept. 6 - 10, 2010.
  
  
• Reza Asvadi, Amir H. Banihashemi and Mahmoud Ahmadian-Attari, ``Lowering the Error Floor of LDPC Codes Using Cyclic Liftings," accepted for presentation at the 2010 Int. Symp. Inform. Theory (ISIT), Austin, Texas, June 13 - 18, 2010.
  
  
• R. Niati, A. H. Banihashemi and T. Kunz, ``On Code Design in Joint MAC Scheduling and Wireless Network Coding," accepted for presentation at the 25th Queen's Biennial Symposium on Communications, Queen's University, Kingston, Ontario, May 12 - 14, 2010.
  
  
• A. Heidarzadeh and A. H. Banihashemi, ``Overlapped Chunked Network Coding," accepted for presentation at the 2010 IEEE Information Theory Workshop, Cairo, Egypt, Jan. 6 - 8, 2010.
  
  
• M. Karimi Dehkordi and A. H. Banihashemi, ``A Message-Passing Algorithm for Counting Short Cycles in a Graph," accepted for presentation at the 2010 IEEE Information Theory Workshop, Cairo, Egypt, Jan. 6 - 8, 2010.
  
  
• E. Janulewicz and A. H. Banihashemi, ``Performance Analysis of Iterative Decoding Algorithms with Memory," accepted for presentation at the 2010 IEEE Information Theory Workshop, Cairo, Egypt, Jan. 6 - 8, 2010.
  
  

  2009

• H. Saeedi, H. Pishro-Nik and A. H. Banihashemi, ``On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels," accepted for presentation in the Forty-Seventh Annual Allerton Conf. Commun. Control, and Computing, Sept. 30 - Oct. 2, 2009.
  
  
• A. Hatam and A. H. Banihashemi, ``Adaptive Rate Allocation Algorithm for Transmission of Multiple Embedded Bit Streams over Time-Varying Noisy Channels," accepted for presentation in the 2009 IEEE DCC, Snowbird, Utah, March 16 - 18, 2009.
  
  
• J. Qiu and A. H. Banihashemi, ``Policy Allocation for Transmission of Embedded Bit Streams over Noisy Channels with Feedback," accepted for presentation in the 2009 IEEE DCC, Snowbird, Utah, March 16 - 18, 2009.
  
  

  2008

• H. Saeedi and A. H. Banihashemi, ``New Sequences of Capacity Achieving LDPC Code Ensembles over the Binary Erasure Channel," accepted for presentation in the 2008 IEEE International Symposium on Information Theory, Toronto, Ontario, July 6 - 11, 2008.
  
  
• H. Xiao and A. H. Banihashemi, ``Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes Decoded by Soft-Decision Iterative Algorithms," accepted for presentation in the 2008 IEEE International Symposium on Information Theory, Toronto, Ontario, July 6 - 11, 2008.
  
  
• H. Xiao, S. Tolouei and A. H. Banihashemi, ``Successive Relaxation for Decoding of LDPC Codes," accepted for presentation in the 24th Queen's Biennial Symposium on Communications, Kingston, Ontario, June 24 - 26, 2008.
  
  
• S. Tolouei and A. H. Banihashemi, ``FPGA Implementation of Variants of Min-Sum Algorithm," accepted for presentation in the 24th Queen's Biennial Symposium on Communications, Kingston, Ontario, June 24 - 26, 2008.
  
  

  2007

• H. Saeedi and A. H. Banihashemi, ``Deterministic Design of Low-Density Parity-Check codes for Binary Erasure Channels," accepted for presentation in the IEEE Globecom 2007, Washington D.C., U.S.A., Nov. 26 - 30, 2007.
  
  
• N. Mobini, A. H. Banihashemi and S. Hemati, ``A Differential Binary Message-Passing LDPC Decoder," accepted for presentation in the IEEE Globecom 2007, Washington D.C., U.S.A., Nov. 26 - 30, 2007.
  
  
• H. Xiao and A. H. Banihashemi, ``Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration," accepted for presentation in the IEEE ISIT 2007, Nice, France, June 24 - 29, 2007.
  
  
• H. Saeedi and A. H. Banihashemi, ``EXIT charts of LDPC codes over BIAWGN channels with imperefect channel estimation," accepted for presentation in the 10th Canadian Workshop on Inform. Theory (CWIT), Edmonton, Alberta, June 6 - 8, 2007.
  
  
• H. Xiao and A. H. Banihashemi, ``Estimation of Bit and Frame Error Rates of Low-Density Parity-Check Codes on Binary Symmetric Channels," accepted for presentation in the 10th Canadian Workshop on Inform. Theory (CWIT), Edmonton, Alberta, June 6 - 8, 2007.
  
  
• N. Mobini, A. H. Banihashemi and S. Hemati, ``Differential Decoding of LDPC Codes with Binary Message-Passing," accepted for presentation in the Analog Decoding Workshop (ADW), Montreal, May 24-25, 2007.
  
  
• A. H. Banihashemi and A. Hatam, ``A Distortion Optimal Rate Allocation Algorithm for Transmission of Embedded Bitstreams over Noisy Channels," accepted for presentation in the IEEE Data Compression Conference (DCC), Snowbird, Utah, March 27 - 29, 2007.
  
  

  2006

• H. Xiao and A. H. Banihashemi, ``Hard-Decision Performance of LDPC Codes on Binary Symmetric Channels with Small Crossover Probabilities," accepted for presentation in the 23rd Biennial Symposium on Communications, Queen's University, Kingston, Ontario, Canada, May 29 - June 1, 2006.
  
  
• X. Pan, A. H. Banihashemi and A. Cuhadar, ``Wireless image transmission using rate-compatible LDPC codes," accepted for presentation in the IEEE ICC 2006, Istanbul, Turkey, June 11 - 15, 2006.
  
  
• S. Hemati and A. H. Banihashemi, ``Convergence Speed and Throughput of Analog Decoders," accepted for presentation in the 4th International Symposium on Turbo Codes, Munich, Germany, April 3 - 7, 2006.
  
  
• H. Saeedi and A. H. Banihashemi, ``Design of LDPC codes for BP algorithm with channel SNR mismatch," accepted for presentation in the 4th International Symposium on Turbo Codes, Munich, Germany, April 3 - 7, 2006.
  
  

  2005

• S. Hemati, A. H. Banihashemi, C. Plett, ``An 80-Mb/s 0.18-\mum CMOS Analog Min-Sum Iterative Decoder for a (32,8,10) LDPC Code," accepted for presentation in IEEE Custom Integrated Circuits Conference (CICC) 2005, San Jose, California, September 18 - 21, 2005.
  
  
• P. Zarrinkhat and A. H. Banihashemi, ``Hybrid Decoding of Irregulr LDPC Codes," accepted for presentation in IEEE ISIT 2005, Adelaide, Australia, Sept. 4 - 9, 2005.
  
  
• S. Hemati, A. H. Banihashemi, C. Plett, ``A High-Speed Analog Min-Sum Iterative Decoder," accepted for presentation in IEEE ISIT 2005, Adelaide, Australia, Sept. 4 - 9, 2005.
  
  
• P. Zarrinkhat and A. H. Banihashemi, ``Time-Invariant Hybrid Decoding of Irregulr LDPC Codes," accepted for presentation in CWIT 2005, Montreal, Quebec, Canada, June 5 - 8, 2005.
  
  
• S. Hemati and A. H. Banihashemi, ``Convergence Speed and Throughput of Analog Decoders," accepted for presentation in CWIT 2005, Montreal, Quebec, Canada, June 5 - 8, 2005.
  
  
• S. Hemati, A. H. Banihashemi, C. Plett and N. Ogbebor, ``An Analog Min-Sum Decoder for a (32,8) LDPC Code," accepted for presentation in CWIT 2005, Montreal, Quebec, Canada, June 5 - 8, 2005.
  
  
• H. Saeedi and A. H. Banihashemi, ``Effects of Channel Estimation Error on the Asymptotic Performance of LDPC Codes," accepted for presentation in CWIT 2005, Montreal, Quebec, Canada, June 5 - 8, 2005.
  
  
• X. Pan, A. H. Banihashemi and A. Cuhadar, ``A Fast Trellis-Based Rate-Allocation Algorithm for Robust Transmission of Progressively Coded Images over Noisy Channels," accepted for presentation in IEEE DCC 2005, Snowbird, Utah, USA, March 29 - 31, 2005.
  
  
• H. Saeedi, A. H. Banihashemi and Q. Hong, ``Asymptotic Performance Analysis of LDPC codes with Channel Estmation Error," accepted for presentation in IEEE VTC2005-Spring, Stockholm, Sweden, May 30 - June 1, 2005.
  
  
• R. Kalbasi, R. Dinis, D. Falconer and A. H. Banihashemi, ``Frequency-Domain Space-Time Precoders for Severe Time-dispersive channel Employing Single-Carrier Modulations," accepted for presentation in IEEE VTC2005-Spring, Stockholm, Sweden, May 30 - June 1, 2005.
  
  

  2004

• P. Zarrinkhat and A. H. Banihashemi, ``Hybrid Hard-Decision Iterative Decoding of Irregular Low-Density Parity-Check Codes," accepted for presentation at 42nd Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, Sept. 29 - Oct. 1, 2004.
  
  
• S. Hemati and A. H. Banihashemi, ``Comparison between Continuous-Time Asynchronous and Discrete-Time Synchronous Iterative Decoding," accepted for presentation at IEEE Globecom 2004, Dallas, Texas, Nov. 29 - Dec. 3, 2004.
  
  
• H. Xiao and A. H. Banihashemi, ``Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes," accepted for presentation at IEEE Globecom 2004, Dallas, Texas, Nov. 29 - Dec. 3, 2004.
  
  
• S. Hemati and A. H. Banihashemi, ``On the Dynamics of Continuous-Time Analog Iterative Decoding," accepted for presentation at IEEE ISIT 2004, Chicago, Illinois, June 27 - July 2, 2004.
  
  
• R. Dinis, R. Kalbasi, D. Falconer and A. H. Banihashemi, ``Channel Estimation for MIMO Systems Employing Single-Carrier Modulations with Iterative Frequency-Domain Equalization," accepted for presentation at IEEE VTC2004-Fall, Los Angeles, CA, September 26-29, 2004.
  
  
• R. Kalbasi, R. Dinis, D. Falconer and A. H. Banihashemi, ``Hybrid Time-Frequency Layered Space-Time Receivers for Severe Time-Dispersive Channels," accepted for presentation at IEEE Workshop on Signal Processing Advances in Wireless Communications, Lisbon, Portugal, July 11 - 14, 2004.
  
  
• P. Zarrinkhat and A.H. Banihashemi, ``Hybrid Hard-Decision Iterative Decoding of Regular Low-Density Parity-Check Codes," accepted for presentation at IEEE ICC'04, Paris, France, June 20 - 24, 2004.
  
  
• M. R. Yazdani and A.H. Banihashemi, ``On Construction of Rate-Compatible Low-Density Parity-Check Codes ," accepted for presentation at IEEE ICC'04, Paris, France, June 20 - 24, 2004.
  
  
• A. Nouh and A.H. Banihashemi, ``Reliability-Based Schedule for Decoding Low-Density Parity-Check Codes," accepted for presentation at IEEE ICC'04, Paris, France, June 20 - 24, 2004.
  
  
• R. Kalbasi, R. Dinis, D. Falconer and A. H. Banihashemi, ``An Iterative Frequency-Domain Layered Space-Time Receiver for SDMA Systems with Single-Carrier Transmission," accepted for presentation at IEEE ICASSP'04, Montreal, Canada, May 17 - 21, 2004.
  
  
• R. Kalbasi, R. Dinis, D. Falconer and A. H. Banihashemi, ``Layered Space-Time Receivers for Single-Carrier Transmission with Iterative Frequency-Domain Equalization," accepted for presentation at IEEE VTC2004-Spring, Milan, Italy, May 17 - 19, 2004.
  
  
• M. R. Sadeghi, A. H. Banihashemi and D. Panario, ``Construction of Lattices from Low Density Parity Check Codes," accepted for presentation at IEEE Canadian Conf. Elec. Comp. Engg., Niagra Falls, Canada, May 2 - 5, 2004.
  
  
• M. R. Sadeghi, A. H. Banihashemi and D. Panario, ``On Iterative Decoding of Lattices," accepted for presentation at IEEE Canadian Conf. Elec. Comp. Engg., Niagra Falls, Canada, May 2 - 5, 2004.
  
  
• M. R. Yazdani and A.H. Banihashemi, ``Irregular rate-compatible LDPC codes for capacity approaching hybrid ARQ schemes," accepted for presentation at IEEE Canadian Conf. Elec. Comp. Engg., Niagra Falls, Canada, May 2 - 5, 2004.
  
  

  2003

• S. Hemati and A.H. Banihashemi, ``A Current-Mode Maximum Winner-Take-All Circuit with Low Voltage Requirement for Min-Sum Analog Iterative Decoders," accepted for presentation at 10th IEEE International Conference on Electronics, Circuits and Systems (ICECS), Sharjah, United Arab Emirates, Dec. 14-17, 2003.
  
  
• S. Hemati and A.H. Banihashemi, ``On the Dynamics of Analog Asynchronous Iterative Decoders," accepted for presentation at 41st Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, Oct. 1-3, 2003.
  
  
• P. Zarrinkhat and A.H. Banihashemi, ``Hybrid Decoding of LDPC Codes," accepted for presentation at 3rd International Symposium on Turbo Codes and Related Topics, Brest, France, September 1-5, 2003.
  
  
• S. Hemati and A.H. Banihashemi, ``Full CMOS Min-Sum Analog Iterative Decoder," accepted for presentation at IEEE ISIT 2003, Yokohama, Japan, June 29 - July 4, 2003.
  
  
• R. Kalbasi, D. Falconer and A.H. Banihashemi, ``Optimum MIMO PAM Filters are Bandlimited," accepted for presentation at Wireless 2003 Conference, Calgary, Alberta, Canada, July 7-9, 2003.
  
  
• S. Hemati and A.H. Banihashemi, ``Iterative Decoding in Analog CMOS," to appear in Proc. of ACM GLSVLSI 2003, Washington D.C., April 28-29, 2003.
  
  
• P. Zarrinkhat and A.H. Banihashemi, ``Dynamics of Hybrid Decoding Algorithms for Decoding Low-Density Parity-Check (LDPC) Codes," accepted for presentation at the 2003 Canadian Workshop on Information Theory, Waterloo, May 18 - May 21, 2003.
  
  
• M. R. Yazdani, S. Hemati and A.H. Banihashemi, ``Improving Belief Propagation on Graphs with Cycles," accepted for presentation at the 2003 Canadian Workshop on Information Theory, Waterloo, May 18 - May 21, 2003.
  
  
• R. Kalbasi, D. Falconer and A. H. Banihashemi, ``Optimal Power Allocation and Transmitter Optimization in a Two-Transmitter Zero-Forcing V-Blast with error propagation," accepted for presentation at the 2003 Canadian Workshop on Information Theory, Waterloo, May 18 - May 21, 2003.
  
  

  2002 and before

• F. Zarkeshvari and A.H. Banihashemi, ``On Implementation of Min-Sum Algorithm for Decoding Low-Density Parity-Check (LDPC) Codes," accepted for presentation at IEEE Globecom 2002, Taipei, Taiwan, November 17-21, 2002.
  
  
• A.H. Banihashemi, A. Nouh and P. Zarrinkhat, ``Hybrid (Multistage) Decoding of Low-Density Parity-Check (LDPC) Codes," accepted for presentation at Fortieth Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, Oct. 2-4, 2002.
  
  
• P. Zarrinkhat and A.H. Banihashemi, ``Density Evolution and Convergence Properties of Bit-Flipping Algorithms for Decoding Low-Density Parity-Check (LDPC) Codes," accepted for presentation at Fortieth Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, Oct. 2-4, 2002.
  
  
• A.H. Banihashemi and S. Hemati, ``Decoding in Optics," accepted for presentation at 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 30 - July 5, 2002.
  
  
• A.H. Banihashemi and S. Hemati, ``Electro-optical Implementation of Iterative Decoding Algorithms," accepted for presentation at 21st Biennial Symposium on Communications, Queen's University, Kingston, Ont., Canada, June 2-5, 2002.
  
  
• S. Hemati and A.H. Banihashemi, ``New Analog VLSI Circuits for Iterative Decoding," accepted for presentation at 21st Biennial Symposium on Communications, Queen's University, Kingston, Ont., Canada, June 2-5, 2002.
  
  
• A. Nouh and A.H. Banihashemi, ``A New Decoding Algorithm for Low-Density Parity-Check Codes," accepted for presentation at 21st Biennial Symposium on Communications, Queen's University, Kingston, Ont., Canada, June 2-5, 2002.
  
  
• H. Xiao and A.H. Banihashemi, ``New Schedules for Decoding LDPC Codes," accepted for presentation at 21st Biennial Symposium on Communications, Queen's University, Kingston, Ont., Canada, June 2-5, 2002.
  
  
• F. Zarkeshvari and A.H. Banihashemi, ``On Implementation Issues of Min-Sum Algorithm for Decoding Low-Density Parity-Check (LDPC) Codes," accepted for presentation at 21st Biennial Symposium on Communications, Queen's University, Kingston, Ont., Canada, June 2-5, 2002.
  
  
• S. Hemati and A.H. Banihashemi, ``Towards photonic decoders," accepted for presentation at 8th Microoptics Conference (MOC'01), Osaka, Japan, October 24-26, 2001.
  
  
• Y. Mao and A.H. Banihashemi, ``A new schedule for decoding low-density parity-check codes," accepted for presentation at IEEE Globecom 2001, San Antonio, Texas, November 25-29, 2001.
  
  
• Y. Mao and A.H. Banihashemi, ``Decoding low-density parity-check codes with probabilistic schedule," Proc. IEEE PACRIM2001, vol. 1, pp. 119-123, Victoria, B.C., Canada, August 26-28, 2001.
  
  
• Y. Mao and A.H. Banihashemi, ``A heuristic search for good low-density parity-check codes at short block lengths," presented at IEEE ICC2001, Helsinki, Finland, June 11-14, 2001.
  
  
• Y. Mao, A.H. Banihashemi and M. Landolsi, "Comparison between low-density parity-check codes and turbo product codes for delay and complexity sensitive applications," Proc. 20th Biennial Symposium on Communications, pp. 151-153, Queen's University, May 28-31, 2000.
  
  
• A.H. Banihashemi and F.R. Kschischang,``Abelian group block code and lattice Tanner graphs," Proc. 1999 Canadian Workshop on Information Theory, pp. 36-39, Kingston, Ont., June 15-18, 1999.
  
  
• A.H. Banihashemi, F.R. Kschischang and P.G. Gulak, "On Tanner graphs of lattices and codes", Proc. 1998 IEEE International Symposium on Information Theory, p. 115, MIT, Cambridge, USA, August 16-21, 1998.
  
  
• A.H. Banihashemi and I.F. Blake, "On the trellis complexity of root lattices and their duals", Proc. 1997 IEEE Information Theory Workshop, pp. 73-74, Longyearbyen, Svalbard, Norway, July 6-12, 1997.
  
  
• A.H. Banihashemi and I.F. Blake, "Minimal trellis diagrams of lattices", Proc. 1997 IEEE International Symposium on Information Theory, p. 434, Ulm, Germany, June 29-July 4, 1997.
  
  
• A.H. Banihashemi and I.F. Blake, "New upper bounds on trellis complexity of lattices", Proc. 1997 IEEE International Symposium on Information Theory,p. 435, Ulm, Germany, June 29-July 4, 1997.
  
  
• A.H. Banihashemi and I.F. Blake, "New lower bounds on trellis complexity of lattices", Proc. 1997 Canadian Workshop on Information Theory, pp. 105-108, Toronto, ON, Canada, June 3-6, 1997.
  
  
• A.H. Banihashemi and A.K. Khandani, "An inequality on the coding gain of densest lattice packings in successive dimensions", Proc. Eighth International Conference of Computing and Information, University of Waterloo, Waterloo, ON, Canada, June 19-22, 1996.
  
  
• A.H. Banihashemi and A.K. Khandani, "Some results on lattice decoding problem in communication applications", Proc. 18th Biennial Symposium on Communications, pp. 387-392, Queen's University, Kingston, ON, Canada, June 2-5, 1996.
  
  
• A.H. Banihashemi and A.K. Khandani, "Lattice decoding using the Korkin-Zolotarev reduced basis", presented at the 30th Annual Conference on Information Sciences and Systems, Princeton University, Princeton, NJ, USA, March 20-22, 1996.
  
  
• A.H. Banihashemi and A.K. Khandani, "An inequality on the coding gain of densest lattice packings", presented at the 30th Annual Conference on Information Sciences and Systems, Princeton University, Princeton, NJ, USA, March 20-22, 1996.
  
  
• A.H. Banihashemi and S. Safavi-Naeini, "A CG-FFT method with nonuniform sampling for Pocklington's equation", Proc. IEEE Antennas and Propagation International Symposium, pp. 76-79, University of Michigan, Ann Arbor, MI, June 28-July 2, l993.
  
  
• A.H. Banihashemi and S. Safavi-Naeini, "A combination of CGM and FFT to solve scattering and radiation from wire antennas using uniform and nonuniform sampling schemes", Proc. International Congress on Computational Methods in Engineering, vol. 5, pp. 137-143, 1993.
  
  
• A.H. Banihashemi and H. Alavi, "A new method and criterion for optimization of periods and coefficients in a staggered PRF MTI radar", Proc. Iranian Conference on Electrical Engineering, vol. 2, pp. 196-206, 1993.