| 1. |
- Engdahl, Karin, et al.
(författare)
-
Analytical approach to low-density convolutional codes
- 2000
-
Ingår i: [Host publication title missing]. - 0780358570
-
Konferensbidrag (refereegranskat)abstract
- A statistical analysis of low-density convolutional (LDC) codes is performed. This analysis is based on the consideration of a special statistical ensemble of Markov scramblers and the solution to a system of recurrent equations describing this ensemble. The results of the analysis are lower bounds for the free distance of the codes and upper bounds for the maximum likelihood decoding error probability. For the case where the size of the scrambler tends to infinity some asymptotic bounds for the free distance and the error probability are derived. Simulation results for iterative decoding of LDC codes are also presented.
|
|
| 2. |
|
|
| 3. |
- Jimenez Feltström, Alberto, et al.
(författare)
-
Braided Block Codes
- 2009
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 55:6, s. 2640-2658
-
Tidskriftsartikel (refereegranskat)abstract
- A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe methods of their construction, analyze code properties, and study asymptotic iterative decoding performance.
|
|
| 4. |
- Lentmaier, Michael, et al.
(författare)
-
An analysis of the block error probability performance of iterative decoding
- 2005
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 51:11, s. 3834-3855
-
Tidskriftsartikel (refereegranskat)abstract
- Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes N and the number of iterations I go to infinity. Three classes of codes are considered. These are Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due to Berrou et al. It is proved that there exist codes in these classes and iterative decoding algorithms for these codes for which not only the bit error probability Pb, but also the block (frame) error probability PB, goes to zero as N and I go to infinity.
|
|
| 5. |
- Lentmaier, Michael, et al.
(författare)
-
Analysis of the asymptotic iterative decoding performance of turbo codes
- 2001
-
Ingår i: [Host publication title missing]. - 0780371232
-
Konferensbidrag (refereegranskat)abstract
- We analyse the iterative decoding performance of conventional rate R=1/3 turbo codes, when both code length and number of iterations tend to infinity. To obtain a rigorous bound on the iterative limit, we introduce a two-phase decoding algorithm which can be analyzed asymptotically
|
|
| 6. |
- Lentmaier, Michael, et al.
(författare)
-
Analytic expression for the exact bit error probability of the (7,5) convolutional code
- 2002
-
Ingår i: IEEE International Symposium on Information Theory - Proceedings. ; , s. 7-7
-
Konferensbidrag (refereegranskat)abstract
- Analytic expression for the exact bit error probability of the (7,5) convolutional code was discussed. Recursive systematic encodes which became especially important as component encoders in concatenated coding schemes were also studied. This technique can calculate the probability distribution of the output log-likelihood ratios of the Max-Log-MAP algorithm in analytic form.
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
- Lentmaier, Michael, et al.
(författare)
-
To the theory of low-density convolutional codes II
- 2001
-
Ingår i: Problems of Information Transmission. - 0032-9460. ; 37:4, s. 288-306
-
Tidskriftsartikel (refereegranskat)abstract
- A theoretical and experimental analysis of iterative decoding of low-density convolutional (LDC) codes is given. Two families are investigated: homogeneous LDC codes and a convolutional code version of turbo-codes.
|
|
| 10. |
- Shridharan, A., et al.
(författare)
-
On the Free Distance of LDPC Convolutional Codes
- 2004
-
Ingår i: International Symposium on Information Theory, ISIT 2004. Proceedings.. - 0780382803 ; , s. 312-312
-
Konferensbidrag (refereegranskat)abstract
- A lower bound on the free distance of LDPC convolutional codes defined by syndrome former matrices comprised of MtimesM permutation matrices is derived. We show that asymptotically, i.e., as Mrarrinfin, for almost all codes in the ensemble the free distance grows linearly with constraint length
|
|
