Iterative Decoding of Redundant Residue Number System Codes


Liew, T.H., Yang, L-L. and Hanzo, L. (2000) Iterative Decoding of Redundant Residue Number System Codes. In, VTC'2000, Tokyo, Japan, 15 - 18 May 2000. , 576-580.

This is the latest version of this item.

Download

[img] PDF
Download (421Kb)

Description/Abstract

Turbo decoded Redundant Residue Number System (RRNS) codes are proposed and their performance is evaluated. An RRNS $(n,k)$ code is a maximum-minimum distance block code, exhibiting identical distance properties to Reed-Solomon (RS) codes. Hence their error correction capability is given by $t = (n - k)/2$. We adapt the classic Chase algorithm in order to accept soft inputs and to provide soft outputs. Using the proposed soft input soft output (SISO) Chase algorithm, the turbo decoding of RRNS codes is contrived.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: 15-18 May 2000 Organisation: IEEE Address: Tokyo, Japan
Divisions: Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control
Item ID: 257126
Date Deposited: 26 Jan 2004
Last Modified: 26 Apr 2013 02:47
Contributors: Liew, T.H. (Author)
Yang, L-L. (Author)
Hanzo, L. (Author)
Date: May 2000
Additional Information: Event Dates: 15-18 May 2000 Organisation: IEEE Address: Tokyo, Japan
Status: Published
Further Information:Google Scholar
ISI Citation Count:0
URI: http://eprints.soton.ac.uk/id/eprint/257126

Available Versions of this Item

  • Iterative Decoding of Redundant Residue Number System Codes. (deposited 26 Jan 2004) [Currently Displayed]

Actions (login required)

View Item View Item