Open Science Research Excellence

Open Science Index

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

Select areas to restrict search in scientific publication database:
Multiuser Detection in CDMA Fast Fading Multipath Channel using Heuristic Genetic Algorithms
In this paper, a simple heuristic genetic algorithm is used for Multistage Multiuser detection in fast fading environments. Multipath channels, multiple access interference (MAI) and near far effect cause the performance of the conventional detector to degrade. Heuristic Genetic algorithms, a rapidly growing area of artificial intelligence, uses evolutionary programming for initial search, which not only helps to converge the solution towards near optimal performance efficiently but also at a very low complexity as compared with optimal detector. This holds true for Additive White Gaussian Noise (AWGN) and multipath fading channels. Experimental results are presented to show the superior performance of the proposed techque over the existing methods.
Digital Object Identifier (DOI):


[1] T. S. Rappaport, Wireless Communications, Principles and Practice, Prentice Hall, New Jersey, 1996.
[2] M. K. Varanasi and B. Aazhang, "Multistage detection in asynchronous code-division multiple-access communications," IEEE Trans. Commun., vol. 38, no. 4, pp. 509-519, Apr. 1990.
[3] P. Patel and J. Holtzman, "Analysis of a simple successive interference cancellation scheme in a DS/CDMA system," IEEE J. Select. Areas Commun., vol. 12, no. 4, pp. 796-806, June 1994.
[4] S.Moshavi,"Multi-user detection for DS-CDMA communications," IEEE Commun. Mag., pp. 124-136, Oct. 1996.
[5] J. G. Proakis, Digital Communications, 4th ed. New York: McGraw- Hill, 2001.
[6] Heng Siong Lim and B. Venkatesh, "An Effective Memetic Algorithm for the Optimum Multiuser Detection Problem",ISSSTA2004, Sydney, Australia, 30 Aug. - 2 Sep. 2004.
[7] C. Erg¨un and K. Hacioglu, "Multiuser detection using a genetic algorithm in CDMA communications systems," IEEE Trans. Commun., Vol. 48, No. 8, pp. 1374-1383, Aug. 2000.
[8] H. S. Lim, M. V. C. Rao, W. C. Tan and H. T. Chuah, "Multiuser detection for DS-CDMA systems using evolutionary programming," IEEE Commun. Lett., Vol. 7 Issue:3, Mar. 2003.
[9] A. AlRustamani and B. R. Vojcic, "A new approach to greedy multiuser detection," IEEE Trans. Commun., Vol. 50(8), pp. 1326-1336, Aug. 2002.
[10] L. Wei, L. K. Rasmussen, and R. Wyrwas, "Near optimum tree-search detection schemes for bit-synchronous multiuser CDMA systems over Gaussian and two-path Rayleigh-fading channels," IEEE Trans. Commun., vol. 45, pp. 691-700, June 1997.
[11] Kai Yen and Lajos Hanzo, "Genetic Algorithm Assisted Joint Multiuser Symbol Detection and Fading Channel Estimation for Synchronous CDMA Systems" IEEE journal on selected areas in communications, vol. 19, no. 6, june 2001.
[12] P. H. Tan and L. K. Rasmussen, "Multiuser detection in CDMA - a comparison of relaxation, exact, and heuristic search methods," IEEE Trans. Wireless Commun., vol. 3 no. 5, pp 1802-1809 sep. 2004.
[13] M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA: MIT Press, 1996.
[14] C. Sengupta, J. R. Cavallaro, and B. Aazhang, "On multipath channel estimation for CDMA using multiple sensors," IEEE Trans. Commun., vol. 49, pp. 543-553, Mar. 2001.
[15] A. M. Sayeed , A. Sendonaris and B. Aazhang "Multiuser Detection in Fast fading multipath environments", IEEE journal on selected areas in communications, vol. 16, no. 9, june 1998.
[16] A. Sayeed and B. Aazhang, Joint Multipath-Doppler Diversity in Mobile Wireless Communications, IEEE Transactions on Communications, pp. 123-132, January 1999.
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