The University of Southampton
University of Southampton Institutional Repository

'Errors-and-Erasures' decoding in RS coded DS-CDMA using noncoherent M-ary orthogonal modulation

'Errors-and-Erasures' decoding in RS coded DS-CDMA using noncoherent M-ary orthogonal modulation
'Errors-and-Erasures' decoding in RS coded DS-CDMA using noncoherent M-ary orthogonal modulation
In this contribution we investigate the performance of Reed-Solomon (RS) coded DS-CDMA using noncoherent M-ary orthogonal modulation over multipath Rayleigh fading channels. 'Errors-and-erasures' RS decoding is considered, where erasures are declared based on various erasure insertion schemes, such as the maximum Output Threshold Test (OTT), Ratio Threshold Test (RTT) and the joint Maximum Output and Ratio Threshold Test (MOR-TT). Furthermore, the performance of 'errors-and-erasures' decoding employing the joint MOR-TT is compared to that of 'error-correction-only' decoding and to that of 'errors-and-erasures' decoding using the OTT as well as the RTT. The numerical results show that, when using 'errors-and-erasures' decoding, RS codes of a given code rate can achieve a significantly higher coding gain than without erasure information, and that the MOR-TT technique outperforms both the RTT and the OTT techniques.
41-45
Yang, L-L.
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
Yang, L-L.
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1

Yang, L-L. and Hanzo, L. (2001) 'Errors-and-Erasures' decoding in RS coded DS-CDMA using noncoherent M-ary orthogonal modulation At Eurocon'2001, Slovakia. 04 - 07 Jul 2001. , pp. 41-45.

Record type: Conference or Workshop Item (Paper)

Abstract

In this contribution we investigate the performance of Reed-Solomon (RS) coded DS-CDMA using noncoherent M-ary orthogonal modulation over multipath Rayleigh fading channels. 'Errors-and-erasures' RS decoding is considered, where erasures are declared based on various erasure insertion schemes, such as the maximum Output Threshold Test (OTT), Ratio Threshold Test (RTT) and the joint Maximum Output and Ratio Threshold Test (MOR-TT). Furthermore, the performance of 'errors-and-erasures' decoding employing the joint MOR-TT is compared to that of 'error-correction-only' decoding and to that of 'errors-and-erasures' decoding using the OTT as well as the RTT. The numerical results show that, when using 'errors-and-erasures' decoding, RS codes of a given code rate can achieve a significantly higher coding gain than without erasure information, and that the MOR-TT technique outperforms both the RTT and the OTT techniques.

PDF euron2001-lly.pdf - Other
Download (548kB)

More information

Published date: July 2001
Additional Information: Event Dates: 4-7 July 2001 Organisation: IEEE Address: Bratislava, Slovakia
Venue - Dates: Eurocon'2001, Slovakia, 2001-07-04 - 2001-07-07
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 255980
URI: http://eprints.soton.ac.uk/id/eprint/255980
PURE UUID: 0f0f6b14-5b84-4da4-b486-96316ef64890
ORCID for L-L. Yang: ORCID iD orcid.org/0000-0002-2032-9327
ORCID for L. Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 08 Jan 2004
Last modified: 18 Jul 2017 09:49

Export record

Contributors

Author: L-L. Yang ORCID iD
Author: L. Hanzo ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×