Channel Coding for Future Space Missions: New Requirements and Trends

Calzolari, Gian Paolo; Chiani, Marco; Chiaraluce, Franco; Garello, Roberto; Paolini, Enrico

doi:10.1109/jproc.2007.905134

Cited by 40 publications

(27 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This means that has a non-zero entry at row i and column j if and only if j = (i + 1) mod M. Moreover, 2 represents the second right circular shift of I M , that is, 2 has a non-zero entry at row i and column j if and only if j = (i + 2) mod M, and so on. The ⊕ operator indicates element-wise modulo-2 addition.…”

Section: Parity-check and Generator Matricesmentioning

confidence: 99%

See 1 more Smart Citation

On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links

Baldi

Maturo

Chiaraluce

2016

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

The performance of short low-density parity-check (LDPC) codes that will be included in the standard for next-generation space telecommanding is analyzed. The paper is focused on the use of a famous ordered statistics decoder known as most reliable basis (MRB) algorithm. Despite its complexity may appear prohibitive in space applications, this algorithm is shown to actually represent a realistic option for short LDPC codes, enabling significant gains over more conventional iterative algorithms. This is possible by a hybrid approach which combines the MRB decoder with an iterative decoding procedure in a sequential manner. The effect of quantization is also addressed, by considering two different quantization laws and comparing their performance. Finally, the impact of limited memory availability onboard of spacecrafts is analyzed and some solutions are proposed for efficient processing, towards a practical onboard decoder implementation.

show abstract

Section: Parity-check and Generator Matricesmentioning

confidence: 99%

“…Wireless communication links in space missions extensively use error-correcting codes in order to improve transmission reliability [1][2][3][4]. There are two types of space links: telemetry (TM) links from space to ground and telecommand (TC) links from ground to space.…”

Section: Introductionmentioning

confidence: 99%

On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links

Baldi

Maturo

Chiaraluce

2016

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, even considering the case with k − k = 10, the average number of pivots is kept small, α = 16, and hence high decoding speeds can be achieved. 6 …”

Section: Performancementioning

confidence: 99%

“…The packet level decoder may recover the erased packets by means of the parity packets. Packet level codes are employed in multimedia wireless broadcasting systems (see for example the DVB-H/SH standards [3], [4]), in multicast scenarios [5], and are currently invested in space communication systems [6].…”

Section: Introductionmentioning

confidence: 99%

Flexible On-Line Construction of IRA Codes for Packet Erasure Correction with Application to Aeronautical Communications

Liva

Pulini

Chiani

2011

2011 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

Abstract-In many applications erasure correcting codes are used to recover packet losses at high protocol stack layers. The objects (e.g. files) to be transmitted often have variable sizes, resulting in a variable number of packet to be encoded by the packet-level encoder. In this paper, algorithms for the (online) flexible design of parity-check matrices for irregular-repeataccumulate codes are investigated. The proposed algorithms allow designing in fast manner parity-check matrices that are suitable for low-complexity maximum-likelihood decoding. The code ensembles generated by the proposed algorithms are analyzed via extrinsic information transfer charts. Numerical results show how the designed codes can attain codeword error rates as low as 10

show abstract

“…For instance, LDPC codes with good properties in terms of correction of single bursts of erasures have been shown in [2] and [3] to represent a promising solution, respectively, for the error control system in magnetic recording applications, and for communication on correlated Rayleigh fading channels. Furthermore, it is currently under investigation the possibility to implement LDPC-like codes at the upper layers of the communication stack, for correcting bursts of packet erasures in space and satellite communication links [4], [5], in order to heavily reduce the use of automatic repeat request (ARQ) protocols.…”

Section: Introductionmentioning

confidence: 99%

Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes

Chiani

2009

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists in starting from the parity-check matrix of an LDPC code and developing an optimized parity-check matrix, with the same performance on the memory-less erasure channel, and suitable also for the iterative correction of single bursts of erasures. The parity-check matrix optimization is performed by an algorithm called pivot searching and swapping (PSS) algorithm, which executes permutations of carefully chosen columns of the parity-check matrix, after a local analysis of particular variable nodes called stopping set pivots. This algorithm can be in principle applied to any LDPC code. If the input parity-check matrix is designed for achieving good performance on the memory-less erasure channel, then the code obtained after the application of the PSS algorithm provides good joint correction of independent erasures and single erasure bursts. Numerical results are provided in order to show the effectiveness of the PSS algorithm when applied to different categories of LDPC codes.

show abstract

Channel Coding for Future Space Missions: New Requirements and Trends

Abstract: Exploration of Mars and beyond will require development of new bandwidth-efficient, high data rate, zero packet loss codes for telemetry and telecommand.

Cited by 40 publications

References 36 publications

On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links

On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links

Flexible On-Line Construction of IRA Codes for Packet Erasure Correction with Application to Aeronautical Communications

Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes

Contact Info

Product

Resources

About