Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
| Paper: | SPCOM-P4.12 |
| Session: | Iterative Decoding Algorithms and Architectures |
| Time: | Wednesday, May 19, 09:30 - 11:30 |
| Presentation: |
Poster (ICASSP 2003 Presentation) |
| Topic: |
Signal Processing for Communications: Antenna Arrays and Multichannel Processing |
| Title: |
BLIND (TRAINING-LIKE) DECODER ASSISTED BEAMFORMING FOR DS-CDMA SYSTEMS |
| Authors: |
Ryan Pacheco; University of Toronto | | |
| | Dimitrios Hatzinakos; University of Toronto | | |
| Abstract: |
We propose an iterative blind beamforming strategy forshort-burst high-rate DS-CDMA systems. The blind strategy works by creating a set of``training sequences'' in the receiver that are used as input to a semi-blind beamformingalgorithm, thus producing a corresponding set of beamformers. The objective thenbecomes to find which beamformer gives the best performance (smallest bit error). Twochallenges we face are, to first find a semi-blind algorithmthat requires very few training symbols (to minimize the search time), and then tofind an appropriate criterion for picking the beamformer that offersthe best performance. Different semi-blind algorithms and criteria are tested. Therecently proposed SBCMACI (Semi-Blind CMA with Channel Identification) is demonstratedto be ideal because of how few training symbols it needs for convergence. Of thetested criteria, one based on feedback from the decoder (essentially using trellis information)is shown to achieve nearly optimal performance. |
| |
| Back | |