Zeinab Roostaie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zeinab Roostaie has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Mohammad Gholami
Department of Applied Mathematics and Computer Science, Faculty of Mathematics and Statistics, University of Isfahan, Iran
2 shared publications - Farzad Parvaresh
Department of Electrical Engineering, Faculty of Engineering, University of Isfahan, Isfahan, Iran
1 shared publication
Latest Publications
- 8 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (7) , 1479-1483
Four-Cycle Free Spatially Coupled LDPC Codes With an Explicit Construction
Spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs) are a class of capacity approaching LDPC codes with low message recovery latency when a sliding window decoding is used. Recently, an edge spreading (unwrapping) approach has been proposed to generate a class of array-based SC-LDPC-CCs by partitioning a spreading matrix into a number of components. Applying the spreading matrix E as the exponent matrix of a QC-LDPC code, the relationship of 4-cycles between E and the corresponding SC-LDPC-CCs is investigated in two cases, in this paper. Then, by defining a new class of integer finite sequences, called good sequences , a class of 4-cycle free SC-LDPC-CCs is constructed by an explicit simple method that can achieve (in most cases) the minimum coupling widths. The constructed codes enjoy a relative advantage in flexibility in rate and lengths, simple constructions, and minimal short-cycle distributions, which can show themselves in improving the bit-error-rate performances.
- 8 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (7) , 1479-1483
Four-Cycle Free Spatially Coupled LDPC Codes With an Explicit Construction
Spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs) are a class of capacity approaching LDPC codes with low message recovery latency when a sliding window decoding is used. Recently, an edge spreading (unwrapping) approach has been proposed to generate a class of array-based SC-LDPC-CCs by partitioning a spreading matrix into a number of components. Applying the spreading matrix E as the exponent matrix of a QC-LDPC code, the relationship of 4-cycles between E and the corresponding SC-LDPC-CCs is investigated in two cases, in this paper. Then, by defining a new class of integer finite sequences, called good sequences , a class of 4-cycle free SC-LDPC-CCs is constructed by an explicit simple method that can achieve (in most cases) the minimum coupling widths. The constructed codes enjoy a relative advantage in flexibility in rate and lengths, simple constructions, and minimal short-cycle distributions, which can show themselves in improving the bit-error-rate performances.
- 27 February 2021
- Published by Springer Nature in Iranian Journal of Science and Technology, Transactions A: Science
- Vol. 45 (2) , 683-694
On the Decoding of [47, 24, 11] and [48, 24, 12] Quadratic Residue Codes by Some New Fast Algorithms
- 27 February 2021
- Published by Springer Nature in Iranian Journal of Science and Technology, Transactions A: Science
- Vol. 45 (2) , 683-694
On the Decoding of [47, 24, 11] and [48, 24, 12] Quadratic Residue Codes by Some New Fast Algorithms