Paper Info
Title
Sum capacity bounds and design of errorless codes for binary asynchronous CDMA systems
Abstract
In this paper, some codes are designed for a binary chip-asynchronous CDMA system which guarantee errorless communication in the absence of noise. These codes also show good performance for noisy channels. In addition, lower and upper bounds for the sum channel capacity are derived for finite and asymptotic cases with the assumption of both noiseless and noisy channels. The results are derived assuming that user delays are known at the receiver end. The performance of proposed codes in the noisy case is also compared to both Gold sequences and a similar class of binary sequences with constrained amount of correlation.
Year
DOI
Venue
2012
10.1109/ICTEL.2012.6221244
Telecommunications
Keywords
Field
DocType
code division multiple access,codes,asymptotic case,binary asynchronous CDMA system,binary sequence,errorless code communication,finite case,gold sequence,noisy channels,sum capacity bound,user delays
Noise measurement,Computer science,Upper and lower bounds,Block code,Pseudorandom binary sequence,Algorithm,Real-time computing,Theoretical computer science,Decoding methods,Code division multiple access,Channel capacity,Gold code
Conference
ISBN
Citations 
PageRank 
978-1-4673-0746-8
0
0.34
References 
Authors
11
4
Name
Order
Citations
PageRank
Shayan Dashmiz100.34
Mansouri, S.M.200.34
Amir Abbas Najafi315313.32
Farrokh Marvasti411313.55