Title :
Asymptotic optimality of finite-memory detection
Author :
Ferrari, Gianluigi ; Colavolpe, Giulio ; Raheli, Riccardo
Author_Institution :
Dipt. di Ingegneria dell´´Informazione, Univ. di Parma
Abstract :
The subject of this paper is the asymptotic optimality of finite-memory detection for transmission over a channel characterized by a single multiplicative time-invariant stochastic parameter (e.g., block frequency nonselective fading). It is known that any finite-memory detection algorithm, either trellis-based or graph-based, is characterized by a single basic metric. We present a theorem which proves that this metric tends, asymptotically, to that of a receiver with perfect channel state information
Keywords :
channel coding; fading channels; statistical analysis; asymptotic optimality; finite-memory detection; perfect channel state information; single multiplicative time-invariant stochastic parameter; Automata; Channel state information; Chromium; Communication systems; Detection algorithms; Fading; Frequency; Probability density function; Stochastic processes; Viterbi algorithm;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365340
