Multiuser Information Processing in Wireless Communication

Simple item page
dc.citation.bibtexNamephdthesisen_US
dc.citation.journalTitlePh.D. Thesisen_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.creatorDas, Sumanen_US
dc.date.accessioned2007-10-31T00:41:34Zen_US
dc.date.available2007-10-31T00:41:34Zen_US
dc.date.issued2000-09-20en_US
dc.date.modified2003-07-12en_US
dc.date.submitted2002-03-20en_US
dc.descriptionPhD Thesisen_US
dc.description.abstractWireless channel is not very conducive towards error-free raw data transmission. On the other hand the tremendous growth in wireless services has made the channel bandwidth a scarce resource and effective utilization of this resource is mandatory. Thus it is instructive to know the limits of a wireless channel. Shannonâ s theorems on channel capacity have been used so far to find the maximum rate at which data can be transmitted over any noisy channel. The theorem calculates the minimum signal to noise ratio (SNR) required to transmit data across a channel with zero probability of sequence error. However the result is practically inhibitive, as it requires encoding and decoding of infinite length code sequences. Practical finite codes never achieve this zero error limit. For practical code design bit-error-rate is often a preferred metric over sequence error rate. However there is no satisfactory method to compare the Shannonâ s capacity results with the bit error rate performance of the practical codes. We introduce the notion of distorted channel capacity to bridge this gap. This measure defines the capacity of a channel when a particular bit-error-rate is allowed. It can also be used as a benchmark to measure the â goodnessâ of a code. Our results show that most of the practical codes lie far beyond the capacity limit. We see that Turbo codes and the convolutional codes come close to this achievable at a prohibitively large computational cost. Specifically, for the convolutional codes the performance improves with large constraint length codes. However the optimal decoding complexity of the convolutional codes grow exponentially with this parameter. We propose a suboptimal decoding technique that has linear complexity in the size of the constraint length and provides close to optimal performance. We further extend our results to a multiuser environment. The optimal joint decoding complexity of multiple users data symbols is exponential in the number of users. Our proposed iterative joint interference cancellation and decoding technique provides computational gain without performance loss.en_US
dc.description.sponsorshipTexas Instrumentsen_US
dc.description.sponsorshipNokiaen_US
dc.description.sponsorshipNational Science Foundationen_US
dc.identifier.citation "Multiuser Information Processing in Wireless Communication," <i>Ph.D. Thesis,</i> 2000.en_US
dc.identifier.urihttps://hdl.handle.net/1911/19830en_US
dc.language.isoengen_US
dc.subjectCDMAen_US
dc.subjectDetectionen_US
dc.subjectDecodingen_US
dc.subject.keywordCDMAen_US
dc.subject.keywordDetectionen_US
dc.subject.keywordDecodingen_US
dc.titleMultiuser Information Processing in Wireless Communicationen_US
dc.typeThesisen_US
dc.type.dcmiTexten_US
thesis.degree.levelDoctoralen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Das2000Sep3MultiuserI.PDF
Size:
634.36 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications
Rice Wireless