Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29530


Select areas to restrict search in scientific publication database:
14677
Overloading Scheme for Cellular DS-CDMA using Quasi-Orthogonal Sequences and Iterative Interference Cancellation Receiver
Abstract:
Overloading is a technique to accommodate more number of users than the spreading factor N. This is a bandwidth efficient scheme to increase the number users in a fixed bandwidth. One of the efficient schemes to overload a CDMA system is to use two sets of orthogonal signal waveforms (O/O). The first set is assigned to the N users and the second set is assigned to the additional M users. An iterative interference cancellation technique is used to cancel interference between the two sets of users. In this paper, the performance of an overloading scheme in which the first N users are assigned Walsh-Hadamard orthogonal codes and extra users are assigned the same WH codes but overlaid by a fixed (quasi) bent sequence [11] is evaluated. This particular scheme is called Quasi- Orthogonal Sequence (QOS) O/O scheme, which is a part of cdma2000 standard [12] to provide overloading in the downlink using single user detector. QOS scheme are balance O/O scheme, where the correlation between any set-1 and set-2 users are equalized. The allowable overload of this scheme is investigated in the uplink on an AWGN and Rayleigh fading channels, so that the uncoded performance with iterative multistage interference cancellation detector remains close to the single user bound. It is shown that this scheme provides 19% and 11% overloading with SDIC technique for N= 16 and 64 respectively, with an SNR degradation of less than 0.35 dB as compared to single user bound at a BER of 0.00001. But on a Rayleigh fading channel, the channel overloading is 45% (29 extra users) at a BER of 0.0005, with an SNR degradation of about 1 dB as compared to single user performance for N=64. This is a significant amount of channel overloading on a Rayleigh fading channel.
Digital Object Identifier (DOI):

References:

[1] F. Adachi, M. Sawahashi and H. Suda, " Wideband DS-CDMA for next-generation mobile communication systems, " IEEE Commun. Mag., vol.36, pp. 56-59, September 1998
[2] H. Sari, F. Vanhaverbeke, and M. Moeneclaey, " Multiple access using two sets of orthogonal signal waveforms," IEEE Commun. Lett., vol. 4, no. 1, pp. 4-6, Jan. 2000.
[3] S. Verdu, Multi - user Detection. Cambridge University Press, 1998.
[4] J. A. F. Ross and D. P. Taylor, "Vector assignment scheme for M+N users in N-dimensional global additive channel," Electronics. Letter, vol. 28, August 1992.
[5] R. E. Learned, A. S. Willisky and D. M. Boroson, "Low complexity joint detection for oversaturated multiple access communications," IEEE Trans. Signal Processing, vol. 45, pp. 113-122, January 1997.
[6] F. Vanhaverbeke, M. Moeneclaey and H. Sari, "DS/CDMA with two sets of orthogonal sequences and iterative - detection," IEEE Commun. Lett., vol. 4, pp. 289-291, Sept. 2000.
[7] F. Vanhaverbeke and M. Moeneclaey, "Critical load of oversaturated systems with multistage successive interfernce cancellation", Proceedings of IEEE VTC, vol. 4, pp. 2663-2666, Apr. 2003.
[8] P. Kumar, M. Ramesh, and S. Chakrabarti, "Performance evaluation of orthogonal/scrambled-orthogonal overloaded DS-CDMA system", Proceedings of IFIP International Conference on Wireless Communications and Networks (WOCN), pp. 1-5, July 2007, Singapore
[9] D. Djonin and V. K. Bhargava, "New results on low complexity detectors for oversaturated CDMA systems", Proceedings of Globecom 2001, pp. 846-850, Nov. 2001
[10] P. Kumar and S. Chakrabarti, "A New Overloading Scheme for DSCDMA System", Proceedings of National Conference on Communicatiosn, pp. 285-288, Jan.- 2007, IIT Kanpur
[11] K. Yang, Y.K. Kim and P. V. Kumar, "Quasi-orthogonal Sequences for Code-division Multiple-Access Systems", lEEE Trans. Inform. Theory, vol. 46, pp. 982-993, May 2000.
[12] Physical Layer Standard for cdma2000 Spread Spectrum Systems, Realse B, TIA/EIA 3GPP2 C.S0002-B, Jan. 16, 2001
[13] J. G. Proakis, Digital Communications, McGraw-Hill, New York, 4th edition, 2001
Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007