Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/112258
DC Field | Value | |
---|---|---|
dc.title | Iterative Detection in Code-Division Multiple-Access with Error Control Coding | |
dc.contributor.author | Alexander, P.D. | |
dc.contributor.author | Grant, A.J. | |
dc.contributor.author | Reed, M.C. | |
dc.date.accessioned | 2014-11-28T04:59:02Z | |
dc.date.available | 2014-11-28T04:59:02Z | |
dc.date.issued | 1998-09 | |
dc.identifier.citation | Alexander, P.D.,Grant, A.J.,Reed, M.C. (1998-09). Iterative Detection in Code-Division Multiple-Access with Error Control Coding. European Transactions on Telecommunications 9 (5) : 419-425. ScholarBank@NUS Repository. | |
dc.identifier.issn | 1124318X | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/112258 | |
dc.description.abstract | A code-division multiple-access system with channel coding may be viewed as a serially-concatenated coded system. In this paper we propose a low complexity method for decoding the resulting inner code (due to the spreading sequence), which allows iterative (turbo) decoding of the serially-concatenated code pair. The per-bit complexity of the proposed decoder increases only linearly with the number of users. Performance within a fraction of a dB of the single user bound for heavily loaded asynchronous CDMA is shown both by simulation and analytically. | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | CENTRE FOR WIRELESS COMMUNICATIONS | |
dc.description.sourcetitle | European Transactions on Telecommunications | |
dc.description.volume | 9 | |
dc.description.issue | 5 | |
dc.description.page | 419-425 | |
dc.description.coden | ETTTE | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.