|
|
|
Seminar Announcement
These events are organized by various sub-sets of the IEEE Toronto Section.
The contact person listed below is the volunteer who has arranged this event.
Please use the e-mail link provided if you have any questions, suggestions,
or concerns.
| Title
|
Application of Heuristic Algorithms to Multiuser Detection
|
| Speaker
|
Dr. A. Sheikh, Bugshan/Bell Labs Chair in Telecommunications
King Fahd University of Petroleum and Minerals
Dhahran, Saudi Arabia
|
| Day and Time
|
Thursday, July 28, 2005 at 4:00 p.m.
|
| Location
|
Bahen Centre, Room BA 1170
University of Toronto
40 St. George Street, Toronto
|
| Organizer
|
Communications Chapter (IEEE Communications Society)
|
| Contact
|
Alagan Anpalagan -
everyone welcome
|
| Abstract
|
The presentation will introduce the basics of multiuser detection and
conventional techniques of multiuser detection. The heuristic algorithms
will be introduced and several heuristic algorithms including Genetic
Algorithm, Particle Swarm, and Tabu search algorithms will be presented
in some detail. Simulation results on some of these algorithms will be
presented. It is shown that the noise enhancement found in the
decorrelator detector is not present in the case of heuristic algorithms
with the result that the performances of these algorithms are better
than that of decorrelator detectors.
|
| Biography
|
After obtaining Ph.D. from the University of Birminghamm England, Dr.
Sheikh has worked in Pakistan, Iran, Libya, England, Canada and Hong
Kong before taking up the Bugshan/Bell Labs Chair in Telecommunications
at the King Fahd University of Petroleum and Minerals, Dhahran, Saudi
Arabia. Professor Sheikh has authored the book entitled, Wireless
Communications: Theory and Techniques published by Kluwer Academics (now
Springer Verlag) in 2004. Dr. Sheikh has published extensively in
several areas of wireless communications. His research interests are in
CDMA, propagation modeling, interference analysis, and equalization, Dr.
Sheikh is a Fellow of IEEE and of IEE.
|
|
|
|
|
|