Arti Yardi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Arti Yardi has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Charly Poulliat
INPT-ENSEEIHT IRIT Lab UMR CNRS 5505 University of Toulouse France
1 shared publication - Iryna Andriyanova
ETIS/ENSEA, UCP, CNRS, Cergy-Pontoise, France
1 shared publication Saravanan Vijayakumaran
Indian Institute of Technology (IIT)
1 shared publication- Tarik Benaddi
Thales Alenia Space
1 shared publication - Tejas Bodas
International Institute of Information Technology Hyderabad
1 shared publication
Latest Publications
- 13 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 70 (6) , 3613-3626
EBP-GEXIT Charts for M-Ary AWGN Channel for Generalized LDPC and Turbo Codes
The maximum a posteriori (MAP) threshold corresponds to the fundamental limit that one can hope to achieve with the given channel code ensemble. Apart from theoretical interests, finding this limit is also desirable since spatial-coupled code ensembles approach this MAP threshold due to phenomenon termed as threshold saturation. However finding this MAP threshold, in general, is known to be computationally prohibitive. This work proposes a tractable method for estimating the MAP threshold for various families of sparse-graph code ensembles over non-binary complex-input additive white Gaussian noise (AWGN) channel. Towards this, we provide a method to approximate the extended belief propagation generalized extrinsic information transfer (EBP-GEXIT) chart and estimate the MAP threshold by applying the Maxwell construction to it. To illustrate the validity of our method, we study spatial coupling for serially-concatenated turbo-codes and numerically observe threshold saturation of these codes to the MAP thresholds estimated via our method.
- 13 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 70 (6) , 3613-3626
EBP-GEXIT Charts for M-Ary AWGN Channel for Generalized LDPC and Turbo Codes
The maximum a posteriori (MAP) threshold corresponds to the fundamental limit that one can hope to achieve with the given channel code ensemble. Apart from theoretical interests, finding this limit is also desirable since spatial-coupled code ensembles approach this MAP threshold due to phenomenon termed as threshold saturation. However finding this MAP threshold, in general, is known to be computationally prohibitive. This work proposes a tractable method for estimating the MAP threshold for various families of sparse-graph code ensembles over non-binary complex-input additive white Gaussian noise (AWGN) channel. Towards this, we provide a method to approximate the extended belief propagation generalized extrinsic information transfer (EBP-GEXIT) chart and estimate the MAP threshold by applying the Maxwell construction to it. To illustrate the validity of our method, we study spatial coupling for serially-concatenated turbo-codes and numerically observe threshold saturation of these codes to the MAP thresholds estimated via our method.
- 16 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (3) , 726-729
A Covert Queueing Problem With Busy Period Statistic
- 16 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (3) , 726-729
A Covert Queueing Problem With Busy Period Statistic
- 26 June 2019
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 31 (1) , 23-41
Properties of syndrome distribution for blind reconstruction of cyclic codes
- 26 June 2019
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 31 (1) , 23-41
Properties of syndrome distribution for blind reconstruction of cyclic codes