Alireza Tasdighi

Alireza Tasdighi
Université Bretagne Sud | UBS · Non-binary Lab-Sticc

Doctor of Philosophy (Applied Math)

About

9
Publications
701
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
166
Citations

Publications

Publications (9)
Article
This paper proposes a new method of constructing compact fully-connected Quasi-Cyclic Low Density Parity Check (QC-LDPC) codes with girth g = 8, 10, and 12. The originality of the proposed method is to impose constraints on the exponent matrix P to reduce the search space drastically. For a targeted lifting degree of N, the first step of the method...
Preprint
This paper proposes a new method of construction of compact fully-connected Quasi-Cyclic Low Density Parity Check (QC-LDPC) code with girth g = 10 and g = 12. The originality of the proposed method is to impose constraint on the exponent matrix P to reduce the search space drastically. For a targeted expansion factor of N, the first step of the met...
Preprint
Full-text available
Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special quasi-cyclic low-density parity-check block codes and spatially coupled low-density parity-check convolutional cod...
Article
Full-text available
We propose a low-complexity method to find quasicyclic low-density parity-check block codes with girth 10 or 12 and shorter length than those designed through classical approaches. The method is extended to time-invariant spatially coupled low-density parity-check convolutional codes, permitting to achieve small syndrome former constraint lengths....
Article
Full-text available
In this paper, we deal with time-invariant low-density parity-check convolutional (LDPCC) codes, which are a subclass of spatially coupled low-density parity-check (SC-LDPC) codes. Classic design approaches usually start from quasi-cyclic (QC) low-density parity-check (LDPC) block codes and exploit suitable unwrapping procedures to obtain LDPCC cod...
Article
A simple and general definition of quasi cyclic low density parity check (QC LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of so called combinatorially designed multiple edge protograph codes. The code construction is mainly based on pe...
Article
In this paper, we propose new constructions for regular girth-8 quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices (CPM). The constructions assume symmetries in the structure of the paritycheck matrix and employ a greedy exhaustive search algorithm to find the permutation shifts of the CPMs. As a result of...
Article
In this paper, we study the cycle structure of quasi-cyclic (QC) low-density parity-check (LDPC) codes with the goal of obtaining the shortest code with a given degree distribution and girth. We focus on QC-LDPC codes, whose Tanner graphs are cyclic liftings of fully connected base graphs of size 3 × n, n 4, and obtain minimal lifting degrees that...

Network

Cited By

Projects

Projects (2)
Archived project
Finding small and structured QC codes with marginal improvement usable for small storage devices.