Graduate School and Research Center In communication systems

Seminar: A Unified Framework for Searching Trees: A Classification of Sequential Decoding Algorithms

Oussama Damen, - Professeur à l'université de Waterloo, Canada

Mobile Communications

Date: June 28, 2005

Location: Eurecom - Institut Eurecom

Recent years have witnessed a growing interest in the closest lattice point search (CLPS) problem. This interest was primarily sparked by the connection between CLPS and maximum likelihood (ML) decoding in multiple-input multiple-output (MIMO) channels. O

Document

http://www.ece.uwaterloo.ca/~modamen/

A Unified Framework for Searching Trees: A Classification of Sequential Decoding Algorithms

Search