## Abstract

In this letter, we propose a low-complexity recursive decoding algorithm for rateless RaptorQ codes, the next generation error correction codes adopted by several standards such as DVB-H. Conventionally, the decoding of RaptorQ codes requires inverting a huge receive code generator matrix (RCGM). Instead of such costly matrix inversion, we propose to calculate the inverse of the transmit code generator matrix (TCGM) beforehand. Then, based on this pre-calculated inverse, the Sherman-Morrison formula is applied to recursively compute the inverse of the RCGM at run time. Most computations are thus shifted offline. Moreover, this recursive decoding distributes the computations among different time slots, thereby significantly shortening the decoding latency and improving the hardware utilization. Numerical simulations demonstrate that the computational complexity of the proposed recursive decoding is as low as 6.5% of that required by the conventional method using direct matrix inversion.

Original language | English |
---|---|

Article number | 6733534 |

Pages (from-to) | 217-220 |

Number of pages | 4 |

Journal | IEEE Wireless Communications Letters |

Volume | 3 |

Issue number | 2 |

DOIs | |

State | Published - 1 Jan 2014 |

## Keywords

- Error correction code
- Raptor code
- RaptorQ code
- Sherman-Morrison formula
- fountain code