12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > A Minimum Distance guided Genetic Algorithm for...
View graph of relations

« Back

A Minimum Distance guided Genetic Algorithm for Multi-User Detection in a Multi-Carrier CDMA Wireless Broadband System

Research output: Contribution in Book/Report/ProceedingsPaper

Published

  • Qiang Ni
  • Jehanzeb Jehanzeb
  • Yang Zhang
  • Sheng-Uei Guan
Publication date2008
Host publicationBroadband Communications, Networks and Systems, 2008. BROADNETS 2008. 5th International Conference on
Place of publicationNew York
PublisherIEEE
Pages500-505
Number of pages6
ISBN (Print)978-1-4244-2391-0
Original languageEnglish

Conference

Conference5th International Conference on Broadband Communications Networks and Systems
CityLondon
Period8/09/0811/09/08

Conference

Conference5th International Conference on Broadband Communications Networks and Systems
CityLondon
Period8/09/0811/09/08

Abstract

We propose a novel Minimum Distance guided Genetic Algorithm (MDGA) for Multi-User Detection (MUD) in a synchronous Multi-Carrier Code Division Multiple Access (MC-CDMA) broadband wireless system. In contrast to conventional GAs, our MDGA exploits adequately the output from a bank of Matched Filters as guidance. It starts with a balanced ratio of exploration and exploitation which is maintained throughout the process. A novel replacement strategy is proposed which increases dramatically the convergence rate as compared to the conventional GAs. This allows us to use the simplest form of genetic operators to gain significant reduction in computational complexity as well as near-optimum results. The simulation results demonstrate that our scheme achieves 99.54% and 50+% reduction in computational complexity as compared to the MUD schemes using exhaustive search and conventional GA respectively.