On the optimality of symbol-by-symbol filtering and denoising
نویسندگان
چکیده
منابع مشابه
On the Optimality of Symbol-by-Symbol Communication
When is uncoded transmission optimal? This paper derives easy-to-check necessary and suÆcient conditions that do not require nding the rate-distortion and the capacity-cost functions. We consider the symbol-by-symbol communication of discretetime memoryless sources across discrete-time memoryless channels, using single-letter coding and decoding. This is an optimal communication system if and o...
متن کاملSymbol-by-Symbol MAP Decoding of Variable Length Codes
In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...
متن کاملTwo-dimensional pilot-symbol-aided channel estimation by Wiener filtering
The potentials of pilot-symbol-aided channel estimation in two dimensions are explored. In order to procure this goal, the discrete shift-variant 2-D Wiener lter is derived and analyzed given an arbitrary sampling grid, an arbitrary (but possibly optimized) selection of observations, and the possibility of model mismatch. Filtering in two dimensions is revealed to outperform ltering in just one...
متن کاملSymbol-by-Symbol MAP Decoding of Nonbinary Codes
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...
متن کاملDiversity Order of Infinite-length Symbol-by-symbol Linear Equalization
The processing complexity of optimal receivers in frequency selective channels grows exponentially with the channel memory length. Linear receivers, alternatively, offer significantly less complexity with the cost of performance degradation. Such degradation can be due to not fully capturing the inherent frequency diversity or degraded coding gain. In this paper we investigate how effectively t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2006
ISSN: 0018-9448
DOI: 10.1109/tit.2005.860432