Improved finite‐length Luby‐transform codes in the binary erasure channel

Hayajneh, Khaled F.; Yousefi, Shahram; Valipour, Mehrdad

doi:10.1049/iet-com.2014.0658

Cited by 31 publications

(22 citation statements)

References 21 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MBRSD is described in Algorithm 1 in full. The analytical results of this process are outside the scope of this short conference presentation and it can be found in our journal paper [15].…”

Section: A Memory-based Robust Soliton Distribution Codingmentioning

confidence: 99%

Left degree distribution shaping for LT codes over the binary erasure channel

Hayajneh

Yousefi

Valipour

2014

2014 27th Biennial Symposium on Communications (QBSC)

Self Cite

View full text Add to dashboard Cite

Fountain codes were introduced to provide higher reliability, lower complexities, and more scalability for networks such as the Internet. Luby-Transform (LT) codes, which are the first realization of Fountain codes, achieve the capacity of the binary erasure channel (BEC) asymptotically and universally. For finite lengths, the search is continued to find codes closer to the capacity limits at even lower encoding and decoding complexities. Most previous work on single-layer Fountain coding targets the design via the right degree distribution. The left degree distribution of an LT code is left as Poisson to protect the universality. For finite lengths, this is no longer an issue; thus, we focus on the design of better codes for the BEC at practical lengths. Our left degree shaping provides codes outperforming LT and all other competing schemes in the literature. At a bit error rate of 10 −7 and packet length k = 256, our scheme provides a realized rate of 0.6 which is 23.5% higher than Sorensen et al.'s scheme [1].

show abstract

Section: A Memory-based Robust Soliton Distribution Codingmentioning

confidence: 99%

Left degree distribution shaping for LT codes over the binary erasure channel

Hayajneh

Yousefi

Valipour

2014

2014 27th Biennial Symposium on Communications (QBSC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…A number of distributions have been proposed in the literature. Two preliminary distributions were studied in [10] and [11].…”

Section: Encodingmentioning

confidence: 99%

“…1. The operation of the decoder can be summarized in four steps [10]: 1) Find a coded symbol C n connected to a single data symbol u k (The decoder declares a failure if there is no such coded symbol). 2) Decode u k as C n .…”

Section: Decodingmentioning

confidence: 99%

“…For MBRSD [10], a classical encoding operation of an LT code is modified, introducing a memory unit into the system to keep track of the data symbols connected to degree-one coded symbols. The aim of MBRSD is to decrease the complexity of the decoding operations.…”

Section: Memory Based Rsd (Mbrsd)mentioning

confidence: 99%

“…The authors proved that this approach reduces the packet overhead and supports the efficiency of the original LT decoding process. In addition, memory-based RSD (MBRSD) was investigated by Hayajneh and others [10]. For MBRSD, a degree-one coded symbol choses the information symbol whose degree is the maximum of all information symbols during the encoding operation.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Decoding of LT-Like Codes in the Absence of Degree-One Code Symbols

Abdulkhaleq¹,

Gazi²

2016

ETRI J

View full text Add to dashboard Cite

Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree‐one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree‐one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree‐one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory‐based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.

show abstract

Channel assignment based coding mechanism for reliable transmission for smart cities

Jayaraman

Raja

2017

Cluster Comput

View full text Add to dashboard Cite

Improved finite‐length Luby‐transform codes in the binary erasure channel

Cited by 31 publications

References 21 publications

Left degree distribution shaping for LT codes over the binary erasure channel

Left degree distribution shaping for LT codes over the binary erasure channel

Decoding of LT-Like Codes in the Absence of Degree-One Code Symbols

Channel assignment based coding mechanism for reliable transmission for smart cities

Contact Info

Product

Resources

About