Finite Memory-length Linear Multiuser detection for Asyncchronous Communications

Simple item page
dc.citation.bibtexNameinproceedingsen_US
dc.citation.conferenceNameIEEE Transactions on Communicationsen_US
dc.citation.firstpage611
dc.citation.lastpage622
dc.citation.volumeNumber45en_US
dc.contributor.authorJuntti, Markku J.en_US
dc.contributor.authorAazhang, Behnaamen_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.date.accessioned2007-10-31T00:48:47Z
dc.date.available2007-10-31T00:48:47Z
dc.date.issued1997-05-20
dc.date.modified2003-11-10en_US
dc.date.note2001-10-10en_US
dc.date.submitted1997-05-20en_US
dc.descriptionConference Paperen_US
dc.description.abstractDecorrelating, linear, minimum mean-squared error (LMMSE), and noise-whitening multiuser detectors for code-division multiple-access systems (CDMA) are ideally infinite memory-length (referred to as IIR) detectors. To obtain practical detectors, which have low implementation complexity and are suitable for CDMA systems with time-variant system parameters (e.g., the number of users, the delays of users, and the signature waveforms), linear finite-memory-length (referred to as FIR) multiuser detectors are studied in this paper. They are obtained by truncating the IIR detectors or by finding optimal FIR detectors. The signature waveforms are not restricted to be time-invariant (periodic over symbol interval). Thus, linear multiuser detection is generalized to systems with spreading sequences longer than the symbol interval. Conditions for the stability of the truncated detectors are discussed. Stable truncated detectors are shown to be near-far resistant if the received powers are upper bounded, and if the memory length is large enough (but finite). Numerical examples demonstrate that moderate memory lengths are sufficient to obtain the performance of the IIR detectors even with a severe near-far problem.en_US
dc.description.sponsorshipTexas Advanced Technology Programen_US
dc.description.sponsorshipNokiaen_US
dc.description.sponsorshipNational Science Foundationen_US
dc.identifier.citationM. J. Juntti and B. Aazhang, "Finite Memory-length Linear Multiuser detection for Asyncchronous Communications," vol. 45, 1997.
dc.identifier.doihttp://dx.doi.org/10.1109/26.592564en_US
dc.identifier.urihttps://hdl.handle.net/1911/19994
dc.language.isoeng
dc.subjectCode-division multiaccess*
dc.subjectlinear multiuser detector*
dc.subjectspread-spectrum communication*
dc.subject.keywordCode-division multiaccessen_US
dc.subject.keywordlinear multiuser detectoren_US
dc.subject.keywordspread-spectrum communicationen_US
dc.titleFinite Memory-length Linear Multiuser detection for Asyncchronous Communicationsen_US
dc.typeConference paper
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Jun1997May5FiniteMemo.PDF
Size:
491.54 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications