Design of Degree Distributions for Finite Length LT Codes.
Saved in:
| Title: | Design of Degree Distributions for Finite Length LT Codes. |
|---|---|
| Authors: | Xu, Shengkai1 xushengkai@nuaa.edu.cn, Xu, Dazhuan1 xudazhuan@nuaa.edu.cn |
| Source: | Wireless Personal Communications. Jan2018, Vol. 98 Issue 2, p2251-2260. 10p. |
| Subjects: | Luby transform codes, Binary erasure channels (Telecommunications), Ripple (Computer network protocol), Decoding algorithms, Computer simulation |
| Abstract: | In this paper we investigate the design of degree distributions for finite length LT codes over the binary erasure channel. A decreasing ripple size in literature provides the state of the art degree distributions for finite length LT codes. However, study on releasing multiple encoding symbols in each decoding step shows that the ripple size increases first and then decreases during the decoding process. Therefore, we propose the corresponding ripple size evolution model considering multiple releases. In the design procedure with any ripple size evolution models, the computational cost increases greatly as the length of source symbols increases. Thus, we design a suboptimal degree distribution of low computational complexity. The proposed degree distributions are compared to others through simulations and a increase in performance with respect to block error rate is provided. [ABSTRACT FROM AUTHOR] |
| Copyright of Wireless Personal Communications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this paper we investigate the design of degree distributions for finite length LT codes over the binary erasure channel. A decreasing ripple size in literature provides the state of the art degree distributions for finite length LT codes. However, study on releasing multiple encoding symbols in each decoding step shows that the ripple size increases first and then decreases during the decoding process. Therefore, we propose the corresponding ripple size evolution model considering multiple releases. In the design procedure with any ripple size evolution models, the computational cost increases greatly as the length of source symbols increases. Thus, we design a suboptimal degree distribution of low computational complexity. The proposed degree distributions are compared to others through simulations and a increase in performance with respect to block error rate is provided. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09296212 |
| DOI: | 10.1007/s11277-017-4972-y |
