default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmir H. Banihashemi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j92]Ali Farsiabi
, Amir H. Banihashemi:
Error Floor Analysis of LDPC Column Layered Decoders. IEEE Commun. Lett. 26(3): 485-489 (2022)- [j91]Ali Farsiabi, Amir H. Banihashemi:
A Semi Linear State Space Model for Error Floor Estimation of LDPC Codes Over the AWGN Channel. IEEE Trans. Commun. 70(11): 7075-7088 (2022) - [c63]Sima Naseri, Ali Dehghan, Amir H. Banihashemi:
On Average Number of Cycles in Finite-Length Spatially Coupled LDPC Codes. ISIT 2022: 378-383 - [c62]Ali Farsiabi, Amir H. Banihashemi:
A Semi Linear State Space Model for Error Floor Estimation of LDPC codes over the AWGN Channel. ISIT 2022: 2928-2933 - 2021
- [j90]Bashirreza Karimi, Amir H. Banihashemi:
Construction of Irregular Protograph-Based QC-LDPC Codes With Low Error Floor. IEEE Trans. Commun. 69(1): 3-18 (2021) - [j89]Peyman Neshaastegaran, Amir H. Banihashemi, Ramy H. Gohary:
Error Floor Estimation of LDPC Coded Modulation Systems Using Importance Sampling. IEEE Trans. Commun. 69(5): 2784-2799 (2021) - [j88]Sima Naseri, Amir H. Banihashemi:
Construction of Time Invariant Spatially Coupled LDPC Codes Free of Small Trapping Sets. IEEE Trans. Commun. 69(6): 3485-3501 (2021) - [j87]Haoyuan Wei, Amir H. Banihashemi:
ADMM Check Node Penalized Decoders for LDPC Codes. IEEE Trans. Commun. 69(6): 3528-3540 (2021) - [j86]Ali Farsiabi, Amir H. Banihashemi:
Error Floor Analysis of LDPC Row Layered Decoders. IEEE Trans. Inf. Theory 67(9): 5804-5826 (2021) - [i36]Ali Farsiabi, Amir H. Banihashemi:
Error Floor Analysis of LDPC Row Layered Decoders. CoRR abs/2104.06867 (2021) - [i35]Ali Farsiabi, Amir H. Banihashemi:
Error Floor Analysis of LDPC Column Layered Decoders. CoRR abs/2107.11479 (2021) - 2020
- [j85]Sima Naseri, Amir H. Banihashemi:
Spatially Coupled LDPC Codes With Small Constraint Length and Low Error Floor. IEEE Commun. Lett. 24(2): 254-258 (2020) - [j84]Bashirreza Karimi, Amir H. Banihashemi:
Construction of QC LDPC Codes With Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets. IEEE Trans. Commun. 68(2): 697-712 (2020) - [j83]Ali Dehghan, Amir H. Banihashemi:
Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result. IEEE Trans. Commun. 68(3): 1378-1390 (2020) - [j82]Ali Farsiabi, Amir H. Banihashemi:
Error Floor Estimation of LDPC Decoders - A Code Independent Approach to Measuring the Harmfulness of Trapping Sets. IEEE Trans. Commun. 68(5): 2667-2679 (2020) - [j81]Ali Dehghan, Amir H. Banihashemi:
On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth. IEEE Trans. Inf. Theory 66(10): 6024-6036 (2020) - [j80]Ali Dehghan, Amir H. Banihashemi:
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix. IEEE Trans. Inf. Theory 66(10): 6037-6047 (2020)
2010 – 2019
- 2019
- [j79]Ali Dehghan, Amir H. Banihashemi:
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles. Graphs Comb. 35(6): 1673-1693 (2019) - [j78]Sima Naseri, Amir H. Banihashemi:
Construction of Girth-8 QC-LDPC Codes Free of Small Trapping Sets. IEEE Commun. Lett. 23(11): 1904-1908 (2019) - [j77]Peyman Neshaastegaran, Amir H. Banihashemi:
Log-Likelihood Ratio Calculation for Pilot Symbol Assisted Coded Modulation Schemes With Residual Phase Noise. IEEE Trans. Commun. 67(5): 3782-3790 (2019) - [j76]Yoones Hashemi, Amir H. Banihashemi:
Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets. IEEE Trans. Inf. Theory 65(2): 1017-1033 (2019) - [j75]Ali Dehghan, Amir 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. Inf. Theory 65(4): 2062-2074 (2019) - [j74]Ali Dehghan, Amir H. Banihashemi:
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. IEEE Trans. Inf. Theory 65(6): 3778-3789 (2019) - [j73]Ali Dehghan, Amir H. Banihashemi:
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. IEEE Trans. Inf. Theory 65(7): 4307-4315 (2019) - [j72]Ali Dehghan, Amir 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. Inf. Theory 65(10): 6022-6043 (2019) - [c61]Ali Dehghan, Amir H. Banihashemi:
On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth. ITW 2019: 1-5 - [c60]Ali Dehghan, Amir 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. ITW 2019: 1-5 - [i34]Bashirreza Karimi, Amir H. Banihashemi:
Construction of QC-LDPC Codes with Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets. CoRR abs/1902.07332 (2019) - [i33]Ali Dehghan, Amir H. Banihashemi:
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix. CoRR abs/1903.08332 (2019) - [i32]Ali Dehghan, Amir H. Banihashemi:
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles. CoRR abs/1905.13228 (2019) - 2018
- [j71]Haoyuan Wei, Amir H. Banihashemi:
An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes. IEEE Commun. Lett. 22(1): 29-32 (2018) - [j70]Yoones Hashemi, Amir H. Banihashemi:
Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes. IEEE Commun. Lett. 22(1): 33-36 (2018) - [j69]Yoones Hashemi, Amir H. Banihashemi:
Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms. IEEE Trans. Inf. Theory 64(5): 3411-3430 (2018) - [j68]Ali Dehghan, Amir H. Banihashemi:
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles. IEEE Trans. Inf. Theory 64(6): 4438-4451 (2018) - [c59]Yoones Hashemi, Amir H. Banihashemi:
Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets. ISIT 2018: 1635-1639 - [c58]Ali Dehghan, Amir 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. ISIT 2018: 1640-1644 - [c57]Ali Dehghan, Amir H. Banihashemi:
Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard. ISIT 2018: 1645-1649 - [c56]Ali Dehghan, Amir H. Banihashemi:
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles. ISIT 2018: 1650-1654 - [c55]Ali Dehghan, Amir H. Banihashemi:
Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles. ISTC 2018: 1-5 - [c54]Ali Dehghan, Amir H. Banihashemi:
Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles. ISTC 2018: 1-5 - [c53]Ali Dehghan, Amir H. Banihashemi:
On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum. ISTC 2018: 1-5 - [i31]Yoones Hashemi, Amir H. Banihashemi:
Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets. CoRR abs/1801.02028 (2018) - [i30]Ebrahim Karami, Amir H. Banihashemi:
Cluster Size Optimization in Cooperative Spectrum Sensing. CoRR abs/1803.03740 (2018) - [i29]Ali Dehghan, Amir H. Banihashemi:
On Computing the Multiplicity of Short Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. CoRR abs/1806.01433 (2018) - 2017
- [j67]Yoones Hashemi, Amir H. Banihashemi:
Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes. IEEE Commun. Lett. 21(9): 1905-1908 (2017) - [j66]Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi:
Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes. IEEE Trans. Commun. 65(1): 14-22 (2017) - [c52]Yoones Hashemi, Amir H. Banihashemi:
Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes. ISIT 2017: 1192-1196 - [i28]Ali Dehghan, Amir H. Banihashemi:
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles. CoRR abs/1701.02379 (2017) - [i27]Ali Dehghan, Amir H. Banihashemi:
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. CoRR abs/1705.06798 (2017) - [i26]Ali Dehghan, Amir 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. CoRR abs/1711.10539 (2017) - [i25]Ali Dehghan, Amir H. Banihashemi:
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. CoRR abs/1711.10543 (2017) - 2016
- [j65]Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi:
Efficient Search of Girth-Optimal QC-LDPC Codes. IEEE Trans. Inf. Theory 62(4): 1552-1564 (2016) - [j64]Yoones Hashemi, Amir H. Banihashemi:
New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes. IEEE Trans. Inf. Theory 62(12): 6713-6736 (2016) - [c51]Yoones Hashemi, Amir H. Banihashemi:
An efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes. ICC 2016: 1-7 - [c50]Zeinab Zeinalkhani, Neda Haghighatpanah, Amir H. Banihashemi:
On weighting/reweighting schemes for approximate message passing algorithms. ICC 2016: 1-5 - [c49]Yoones Hashemi, Amir H. Banihashemi:
Minimal characterization and provably efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes. ISIT 2016: 2524-2528 - [i24]Yoones Hashemi, Amir H. Banihashemi:
Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Irregular LDPC Codes. CoRR abs/1611.10014 (2016) - 2015
- [j63]Yoones Hashemi, Amir H. Banihashemi:
On Characterization and Efficient Exhaustive Search of Elementary Trapping Sets of Variable-Regular LDPC Codes. IEEE Commun. Lett. 19(3): 323-326 (2015) - [j62]Mohammad R. Ataei, Thomas Kunz, Amir H. Banihashemi:
Localization and Location Verification in Non-Homogeneous One-Dimensional Wireless Ad-Hoc Networks. IEEE J. Sel. Areas Commun. 33(7): 1304-1316 (2015) - [j61]Yoones Hashemi, Amir H. Banihashemi:
Corrections to "On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes". IEEE Trans. Inf. Theory 61(3): 1508 (2015) - [j60]Zeinab Zeinalkhani, Amir H. Banihashemi:
Iterative Reweighted ℓ2/ℓ1 Recovery Algorithms for Compressed Sensing of Block Sparse Signals. IEEE Trans. Signal Process. 63(17): 4516-4531 (2015) - [c48]Zeinab Zeinalkhani, Amir H. Banihashemi:
Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing. GLOBECOM 2015: 1-7 - [c47]Mohammad R. Ataei, Amir H. Banihashemi, Thomas Kunz:
Minimum-energy broadcasting for cross wireless ad-hoc networks. ICC 2015: 6577-6583 - [c46]Mohammad R. Ataei, Thomas Kunz, Amir H. Banihashemi:
Localization in non-homogeneous one-dimensional wireless ad-hoc networks. ICC 2015: 6627-6633 - [c45]Zeinab Zeinalkhani, Amir H. Banihashemi:
Low-complexity detection of zero blocks in wideband spectrum sensing. ISIT 2015: 2578-2582 - [i23]Mohammad R. Ataei, Amir H. Banihashemi, Thomas Kunz:
Energy-Efficient Broadcasting for Cross Wireless Ad-Hoc Networks. CoRR abs/1504.05268 (2015) - [i22]Zeinab Zeinalkhani, Amir H. Banihashemi:
Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing. CoRR abs/1507.00993 (2015) - [i21]Yoones Hashemi, Amir H. Banihashemi:
New Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Variable-Regular LDPC Codes. CoRR abs/1510.04954 (2015) - 2014
- [j59]Sina Tolouei, Amir H. Banihashemi:
Lowering the Error Floor of LDPC Codes Using Multi-Step Quantization. IEEE Commun. Lett. 18(1): 86-89 (2014) - [j58]Sina Tolouei, Amir H. Banihashemi:
Fast and Accurate Error Floor Estimation of Quantized Iterative Decoders for Variable-Regular LDPC Codes. IEEE Commun. Lett. 18(8): 1283-1286 (2014) - [j57]Mehdi Karimi, Amir H. Banihashemi:
On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes. IEEE Trans. Inf. Theory 60(9): 5188-5203 (2014) - [c44]Anoosheh Heidarzadeh, Amir H. Banihashemi:
How much can knowledge of delay model help chunked coding over networks with perfect feedback? ISIT 2014: 456-460 - [c43]Mehdi Karimi, Amir H. Banihashemi:
On characterization of elementary trapping sets of variable-regular LDPC codes. ISTC 2014: 62-66 - 2013
- [j56]Reza Asvadi, Amir H. Banihashemi:
A Rate-Compatible Puncturing Scheme for Finite-Length LDPC Codes. IEEE Commun. Lett. 17(1): 147-150 (2013) - [j55]Hua Xiao, Amir H. Banihashemi, Mehdi Karimi:
Error Rate Estimation of Low-Density Parity-Check Codes Decoded by Quantized Soft-Decision Iterative Algorithms. IEEE Trans. Commun. 61(2): 474-484 (2013) - [j54]Mehdi Karimi, Amir H. Banihashemi:
Message-Passing Algorithms for Counting Short Cycles in a Graph. IEEE Trans. Commun. 61(2): 485-495 (2013) - [j53]Mehdi Karimi, Amir H. Banihashemi:
On the Girth of Quasi-Cyclic Protograph LDPC Codes. IEEE Trans. Inf. Theory 59(7): 4542-4552 (2013) - [j52]Mohammad R. Ataei, Amir H. Banihashemi, Thomas Kunz:
An Energy-Efficient Transmission Range Assignment for 1-D Wireless Ad Hoc Networks. IEEE Wirel. Commun. Lett. 2(5): 543-546 (2013) - [i20]Mehdi Karimi, Amir H. Banihashemi:
On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes. CoRR abs/1308.1259 (2013) - 2012
- [j51]Mehdi Karimi, Amir H. Banihashemi:
Counting Short Cycles of Quasi Cyclic Protograph LDPC Codes. IEEE Commun. Lett. 16(3): 400-403 (2012) - [j50]Sina Khazraie, Reza Asvadi, Amir H. Banihashemi:
A PEG Construction of Finite-Length LDPC Codes with Low Error Floor. IEEE Commun. Lett. 16(8): 1288-1291 (2012) - [j49]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings. IEEE Trans. Commun. 60(4): 902-907 (2012) - [j48]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari, Hamid Saeedi:
LLR Approximation for Wireless Channels Based on Taylor Series and its Application to BICM With LDPC Codes. IEEE Trans. Commun. 60(5): 1226-1236 (2012) - [j47]Emil Janulewicz, Amir H. Banihashemi:
Performance Analysis of Iterative Decoding Algorithms with Memory over Memoryless Channels. IEEE Trans. Commun. 60(12): 3556-3566 (2012) - [j46]Yaser Eftekhari, Anoosheh Heidarzadeh, Amir H. Banihashemi, Ioannis Lambadaris:
Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing. IEEE Trans. Inf. Theory 58(10): 6616-6645 (2012) - [j45]Mehdi Karimi, Amir H. Banihashemi:
Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes. IEEE Trans. Inf. Theory 58(11): 6942-6958 (2012) - [j44]Raheleh Niati, Amir H. Banihashemi, Thomas Kunz:
Throughput and Energy Optimization in Wireless Networks: Joint MAC Scheduling and Network Coding. IEEE Trans. Veh. Technol. 61(3): 1372-1382 (2012) - [j43]Mohammad R. Ataei, Amir H. Banihashemi, Thomas Kunz:
Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks. IEEE Trans. Veh. Technol. 61(7): 3276-3282 (2012) - [c42]Zeinab Zeinalkhani, Amir H. Banihashemi:
Iterative recovery algorithms for compressed sensing of wideband block sparse spectrums. ICC 2012: 1630-1634 - [c41]Yaser Eftekhari, Amir H. Banihashemi, Ioannis Lambadaris:
Analysis and design of irregular graphs for node-based verification-based recovery algorithms in compressed sensing. ISIT 2012: 1872-1876 - [c40]Anoosheh Heidarzadeh, Amir H. Banihashemi:
How fast can dense codes achieve the min-cut capacity of line networks? ISIT 2012: 2461-2465 - [c39]Mehdi Karimi, Amir H. Banihashemi:
On the girth of quasi cyclic protograph LDPC codes. ISIT 2012: 3078-3082 - [c38]Anoosheh Heidarzadeh, Amir H. Banihashemi:
Coding delay analysis of Chunked codes over line networks. NetCod 2012: 55-60 - [i19]Anoosheh Heidarzadeh, Amir H. Banihashemi:
How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks? CoRR abs/1202.0343 (2012) - [i18]Anoosheh Heidarzadeh, Amir H. Banihashemi:
Coding Delay Analysis of Chunked Codes over Line Networks. CoRR abs/1203.1643 (2012) - [i17]Mohammad R. Ataei, Amir H. Banihashemi, Thomas Kunz:
Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks. CoRR abs/1204.3920 (2012) - [i16]Yaser Eftekhari, Amir H. Banihashemi, Ioannis Lambadaris:
Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing. CoRR abs/1204.5136 (2012) - [i15]Anoosheh Heidarzadeh, Amir H. Banihashemi:
Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay. CoRR abs/1207.4711 (2012) - [i14]Anoosheh Heidarzadeh, Amir H. Banihashemi:
Coding Delay Analysis of Dense and Chunked Network Codes over Line Networks. CoRR abs/1207.6052 (2012) - 2011
- [j42]Hamid Saeedi, Hossein Pishro-Nik, Amir H. Banihashemi:
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. 59(7): 1807-1819 (2011) - [j41]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Lowering the Error Floor of LDPC Codes Using Cyclic Liftings. IEEE Trans. Inf. Theory 57(4): 2213-2224 (2011) - [c37]Ebrahim Karami, Amir H. Banihashemi:
Cluster Size Optimization in Cooperative Spectrum Sensing. CNSR 2011: 13-17 - [c36]Raheleh Niati, Thomas Kunz, Amir H. Banihashemi:
The Effect of Transmission Capacities on Interference-Free Scheduling in Wireless Networks. CNSR 2011: 257-262 - [c35]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari, Hamid Saeedi:
LLR Approximation for Wireless Channels Based on Taylor Series and Its Application to BICM with LDPC Codes. GLOBECOM 2011: 1-6 - [c34]Ahmad Ali Farhoodi, Amir H. Banihashemi:
Robust MIMO Receiver Based on Belief Propagation in the Presence of Imperfect Channel and Noise Knowledge. GLOBECOM 2011: 1-5 - [c33]Yaser Eftekhari, Anoosheh Heidarzadeh, Amir H. Banihashemi, Ioannis Lambadaris:
Density evolution analysis of node-based verification-based algorithms in compressed sensing. ISIT 2011: 474-478 - [c32]Anoosheh Heidarzadeh, Amir H. Banihashemi:
Analysis of overlapped chunked codes with small chunks over line networks. ISIT 2011: 801-805 - [c31]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Design of irregular quasi-cyclic protograph codes with low error floors. ISIT 2011: 908-912 - [c30]Mehdi Karimi, Amir H. Banihashemi:
An efficient algorithm for finding dominant trapping sets of irregular LDPC codes. ISIT 2011: 1091-1095 - [c29]Raheleh Niati, Amir H. Banihashemi, Thomas Kunz:
Scheduling and network coding in wireless multicast networks: A case for unequal time shares. WCNC 2011: 891-896 - [i13]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings. CoRR abs/1102.0424 (2011) - [i12]Yaser Eftekhari, Anoosheh Heidarzadeh, Amir H. Banihashemi, Ioannis Lambadaris:
Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing. CoRR abs/1102.2928 (2011) - [i11]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari, Hamid Saeedi:
LLR Approximation for Wireless Channels Based on Taylor Series and Its Application to BICM with LDPC Codes. CoRR abs/1103.2607 (2011) - [i10]Yaser Eftekhari, Anoosheh Heidarzadeh, Amir H. Banihashemi, Ioannis Lambadaris:
Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressive Sensing. CoRR abs/1104.0224 (2011) - [i9]Anoosheh Heidarzadeh, Amir H. Banihashemi:
Network Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes. CoRR abs/1105.5736 (2011) - [i8]Anoosheh Heidarzadeh, Amir H. Banihashemi:
Analysis of Overlapped Chunked Codes with Small Chunks over Line Networks. CoRR abs/1105.6288 (2011) - [i7]Mehdi Karimi, Amir H. Banihashemi:
An Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes. CoRR abs/1108.4478 (2011) - 2010
- [j40]Hamid Saeedi, Amir H. Banihashemi:
Systematic design of low-density parity-check code ensembles for binary erasure channels. IEEE Trans. Commun. 58(1): 118-127 (2010) - [j39]Hamid Saeedi, Amir H. Banihashemi:
On the design of LDPC code ensembles for BIAWGN channels. IEEE Trans. Commun. 58(5): 1376-1382 (2010) - [j38]Hamid Saeedi, Amir H. Banihashemi:
New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel. IEEE Trans. Inf. Theory 56(12): 6332-6346 (2010) - [c28]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Approximation of Log-Likelihood Ratio for Wireless Channels Based on Taylor Series. GLOBECOM 2010: 1-5 - [c27]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Lowering the error floor of LDPC codes using cyclic liftings. ISIT 2010: 724-728 - [i6]Yaser Eftekhari, Amir H. Banihashemi, Ioannis Lambadaris:
An Efficient Approach Toward the Asymptotic Analysis of Node-Based Recovery Algorithms in Compressed Sensing. CoRR abs/1001.2284 (2010) - [i5]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Lowering the Error Floor of LDPC Codes Using Cyclic Liftings. CoRR abs/1002.4311 (2010) - [i4]Mehdi Karimi, Amir H. Banihashemi:
A Message-Passing Algorithm for Counting Short Cycles in a Graph. CoRR abs/1004.3966 (2010)
2000 – 2009
- 2009
- [j37]Hamid Saeedi, Amir H. Banihashemi:
Design of irregular LDPC codes for BIAWGN channels with SNR mismatch. IEEE Trans. Commun. 57(1): 6-11 (2009) - [j36]Hua Xiao, Amir H. Banihashemi:
Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration. IEEE Trans. Commun. 57(6): 1550-1555 (2009) - [j35]Nastaran Mobini, Amir H. Banihashemi, Saied Hemati:
A differential binary message-passing LDPC decoder. IEEE Trans. Commun. 57(9): 2518-2523 (2009) - [j34]Hua Xiao, Amir H. Banihashemi:
Comments on successive relaxation for decoding of LDPC codes. IEEE Trans. Commun. 57(10): 2846-2848 (2009) - [j33]Jinshi Qiu, Amir H. Banihashemi:
Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters]. IEEE Trans. Commun. 57(11): 3197-3182 (2009) - [j32]Reza Kalbasi, David D. Falconer, Amir H. Banihashemi, Rui Dinis:
A Comparison of Frequency-Domain Block MIMO Transmission Systems. IEEE Trans. Veh. Technol. 58(1): 165-175 (2009) - [c26]Hamid Saeedi, Hossein Pishro-Nik, Amir H. Banihashemi:
On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels. Allerton 2009: 400-407 - [c25]Ahmad Hatam, Amir H. Banihashemi:
Adaptive Rate Allocation Algorithm for Transmission of Multiple Embedded Bit Streams over Time-Varying Noisy Channels. DCC 2009: 448 - [c24]Jinshi Qiu, Amir H. Banihashemi:
Policy Allocation for Transmissionof Embedded Bit Streams over Noisy Channels with Feedback. DCC 2009: 464 - [i3]Anoosheh Heidarzadeh, Amir H. Banihashemi:
Overlapped Chunked Network Coding. CoRR abs/0908.3234 (2009) - 2008
- [j31]Amir H. Banihashemi, Ahmad Hatam:
A distortion optimal rate allocation algorithm for transmission of embedded bitstreams over noisy channels. IEEE Trans. Commun. 56(10): 1581-1584 (2008) - [c23]Hua Xiao, Amir H. Banihashemi:
Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms. ISIT 2008: 439-443 - [c22]Hamid Saeedi, Amir H. Banihashemi:
New sequences of capacity achieving LDPC code ensembles over the binary erasure channel. ISIT 2008: 797-801 - [i2]Hamid Saeedi, Amir H. Banihashemi:
Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels. CoRR abs/0801.3511 (2008) - 2007
- [j30]Hamid Saeedi, Amir H. Banihashemi:
Performance of Belief Propagation for Decoding LDPC Codes in the Presence of Channel Estimation Error. IEEE Trans. Commun. 55(1): 83-89 (2007) - [j29]Pirouz Zarrinkhat, Amir H. Banihashemi:
Hybrid Hard-Decision Iterative Decoding of Irregular Low-Density Parity-Check Codes. IEEE Trans. Commun. 55(2): 292-302 (2007) - [j28]Saied Hemati, Amir H. Banihashemi:
Convergence Speed and Throughput of Analog Decoders. IEEE Trans. Commun. 55(5): 833-836 (2007) - [j27]Hua Xiao, Amir H. Banihashemi:
Estimation of Bit and Frame Error Rates of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels. IEEE Trans. Commun. 55(12): 2234-2239 (2007) - [c21]Amir H. Banihashemi, Ahmad Hatam:
A Distortion Optimal Rate Allocation Algorithm for Transmission of Embedded Bitstreams over Noisy Channels. DCC 2007: 376 - [c20]Nastaran Mobini, Amir H. Banihashemi, Saied Hemati:
A Differential Binary Message-Passing LDPC Decoder. GLOBECOM 2007: 1561-1565 - [c19]Hamid Saeedi, Amir H. Banihashemi:
Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels. GLOBECOM 2007: 1566-1570 - [c18]Hua Xiao, Amir H. Banihashemi:
Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration. ISIT 2007: 1551-1555 - 2006
- [j26]Saied Hemati, Amir H. Banihashemi, Calvin Plett:
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 41(11): 2531-2540 (2006) - [j25]Xiang Pan, Amir H. Banihashemi, Aysegul Cuhadar:
A fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels. IEEE Trans. Commun. 54(1): 1-6 (2006) - [j24]Saied Hemati, Amir H. Banihashemi:
Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes. IEEE Trans. Commun. 54(1): 61-70 (2006) - [j23]Robert D. Maddock, Amir H. Banihashemi:
Reliability-based coded modulation with low-density parity-check codes. IEEE Trans. Commun. 54(3): 403-406 (2006) - [j22]Xiang Pan, Amir H. Banihashemi, Banihashemi Cuhadar:
Progressive Transmission of Images Over Fading Channels Using Rate-Compatible LDPC Codes. IEEE Trans. Image Process. 15(12): 3627-3635 (2006) - [j21]Mohammad-Reza Sadeghi, Amir H. Banihashemi, Daniel Panario:
Low-Density Parity-Check Lattices: Construction and Decoding Analysis. IEEE Trans. Inf. Theory 52(10): 4481-4495 (2006) - [j20]Xiang Pan, Aysegul Cuhadar, Amir H. Banihashemi:
Combined source and channel coding with JPEG2000 and rate-compatible low-density Parity-check codes. IEEE Trans. Signal Process. 54(3): 1160-1164 (2006) - [j19]Reza Kalbasi, David D. Falconer, Amir H. Banihashemi:
Optimum space-time processors with symbol-rate sampling are bandlimited. IEEE Trans. Signal Process. 54(5): 1936-1941 (2006) - [c17]Xiang Pan, Amir H. Banihashemi, Aysegul Cuhadar:
Wireless Image Transmission Using Rate-Compatible LDPC Codes. ICC 2006: 3299-3304 - [i1]Hua Xiao, Amir H. Banihashemi:
Estimation of Bit and Frame Error Rates of Low-Density Parity-Check Codes on Binary Symmetric Channels. CoRR abs/cs/0612011 (2006) - 2005
- [j18]Pirouz Zarrinkhat, Amir H. Banihashemi, Hua Xiao:
Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes. Ann. des Télécommunications 60(1-2): 103-131 (2005) - [j17]Reza Kalbasi, David D. Falconer, Amir H. Banihashemi:
Optimum power allocation for a V-BLAST system with two antennas at the transmitter. IEEE Commun. Lett. 9(9): 826-828 (2005) - [j16]Jianguang Zhao, Farhad Zarkeshvari, Amir H. Banihashemi:
On implementation of min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes. IEEE Trans. Commun. 53(4): 549-554 (2005) - [c16]Saied Hemati, Amir H. Banihashemi, Calvin Plett:
An 80-Mb/s 0.18-μm CMOS analog min-sum iterative decoder for a (32, 8, 10) LDPC code. CICC 2005: 243-246 - [c15]Xiang Pan, Amir H. Banihashemi, Aysegul Cuhadar:
A Fast Trellis-Based Rate-Allocation Algorithm for Robust Transmission of Progressively Coded Images over Noisy Channels. DCC 2005: 473 - [c14]Pirouz Zarrinkhat, Amir H. Banihashemi:
Hybrid decoding of irregular LDPC codes. ISIT 2005: 312-316 - [c13]Saied Hemati, Amir H. Banihashemi, Calvin Plett:
A high-speed analog min-sum iterative decoder. ISIT 2005: 1768-1772 - 2004
- [j15]Mohammadreza Yazdani, Saied Hemati, Amir H. Banihashemi:
Improving belief propagation on graphs with cycles. IEEE Commun. Lett. 8(1): 57-59 (2004) - [j14]Mohammadreza Yazdani, Amir H. Banihashemi:
On construction of rate-compatible low-density Parity-check codes. IEEE Commun. Lett. 8(3): 159-161 (2004) - [j13]Pirouz Zarrinkhat, Amir H. Banihashemi:
Hybrid hard-decision iterative decoding of regular low-density parity-check codes. IEEE Commun. Lett. 8(4): 250-252 (2004) - [j12]Rui Dinis, Reza Kalbasi, David D. Falconer, Amir H. Banihashemi:
Iterative layered space-time receivers for single-carrier transmission over severe time-dispersive channels. IEEE Commun. Lett. 8(9): 579-581 (2004) - [j11]Hua Xiao, Amir H. Banihashemi:
Improved progressive-edge-growth (PEG) construction of irregular LDPC codes. IEEE Commun. Lett. 8(12): 715-717 (2004) - [j10]Ahmed Nouh, Amir H. Banihashemi:
Reliability-based schedule for bit-flipping decoding of low-density Parity-check codes. IEEE Trans. Commun. 52(12): 2038-2040 (2004) - [j9]Pirouz Zarrinkhat, Amir H. Banihashemi:
Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes. IEEE Trans. Commun. 52(12): 2087-2097 (2004) - [j8]Hua Xiao, Amir H. Banihashemi:
Graph-based message-passing schedules for decoding LDPC codes. IEEE Trans. Commun. 52(12): 2098-2105 (2004) - [c12]Saied Hemati, Amir H. Banihashemi:
Comparison between continuous-time asynchronous and discrete-time synchronous iterative decoding. GLOBECOM 2004: 356-360 - [c11]Hua Xiao, Amir H. Banihashemi:
Improved progressive-edge-growth (PEG) construction of irregular LDPC codes. GLOBECOM 2004: 489-492 - [c10]Reza Kalbasi, Rui Dinis, David D. Falconer, Amir H. Banihashemi:
An iterative frequency-domain layered space-time receiver for SDMA systems with single-carrier transmission. ICASSP (4) 2004: 793-796 - [c9]Mohammadreza Yazdani, Amir H. Banihashemi:
On construction of rate-compatible low-density parity-check codes. ICC 2004: 430-434 - [c8]Pirouz Zarrinkhat, Amir H. Banihashemi:
Hybrid hard-decision iterative decoding of regular low-density parity-check codes. ICC 2004: 435-439 - [c7]Ahmed Nouh, Amir H. Banihashemi:
Reliability-based schedule for decoding low-density parity-check codes. ICC 2004: 444-447 - [c6]Saied Hemati, Amir H. Banihashemi:
On the dynamics of continuous-time analog iterative decoding. ISIT 2004: 262 - 2003
- [c5]Saied Hemati, Amir H. Banihashemi:
Iterative decoding in analog CMOS. ACM Great Lakes Symposium on VLSI 2003: 15-20 - [c4]Saied Hemati, Amir H. Banihashemi:
A current mode maximum winner-take-all circuit with low voltage requirement for min-sum analog iterative decoders. ICECS 2003: 4-7 - 2002
- [j7]Ahmed Nouh, Amir H. Banihashemi:
Bootstrap decoding of low-density parity-check codes. IEEE Commun. Lett. 6(9): 391-393 (2002) - [c3]Farhad Zarkeshvari, Amir H. Banihashemi:
On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codes. GLOBECOM 2002: 1349-1353 - 2001
- [j6]Yongyi Mao, Amir H. Banihashemi:
Decoding low-density parity-check codes with probabilistic scheduling. IEEE Commun. Lett. 5(10): 414-416 (2001) - [j5]Amir H. Banihashemi, Frank R. Kschischang:
Tanner graphs for group block codes and lattices: Construction and complexity. IEEE Trans. Inf. Theory 47(2): 822-834 (2001) - [c2]Yongyi Mao, Amir H. Banihashemi:
A new schedule for decoding low-density parity-check codes. GLOBECOM 2001: 1007-1010 - [c1]Yongyi Mao, Amir H. Banihashemi:
A heuristic search for good low-density parity-check codes at short block lengths. ICC 2001: 41-44
1990 – 1999
- 1999
- [j4]Amir H. Banihashemi, Ian F. Blake:
On the trellis complexity of root lattices and their duals. IEEE Trans. Inf. Theory 45(6): 2168-2172 (1999) - 1998
- [j3]Amir H. Banihashemi, Amir K. Khandani:
An Inequality on the Coding Gain of Densest Lattice Packings in Successive Dimensions. Des. Codes Cryptogr. 14(3): 207-212 (1998) - [j2]Amir H. Banihashemi, Amir K. Khandani:
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis. IEEE Trans. Inf. Theory 44(1): 162-171 (1998) - [j1]Amir H. Banihashemi, Ian F. Blake:
Trellis Complexity and Minimal Trellis Diagrams of Lattices. IEEE Trans. Inf. Theory 44(5): 1829-1847 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
