Please use this identifier to cite or link to this item:
|Title:||Channel memory truncation for maximum likelihood sequence estimation||Authors:||Farhang-Boroujeny, B.||Issue Date:||1995||Citation:||Farhang-Boroujeny, B. (1995). Channel memory truncation for maximum likelihood sequence estimation. IEEE Communication Theory Mini-Conference, Proceedings, CTMC : 172-176. ScholarBank@NUS Repository.||Abstract:||Calculating the coefficients of a linear equalizer (prefilter) so that the combined response of the equalizer and a given channel is forced to a limited length (memory), while the signal-to-noise ratio at the equalizer output is maximized, is addressed. The process involves simultaneous calculation of a desired response that the combination of the channel and equalizer should approximate and the equalizer coefficients. An iterative algorithm which is an extension of our previous work  is first developed. This is followed by derivation of a non-iterative lattice-based algorithm which uses the Levinson algorithm, in part, to achieve a very low computational complexity.||Source Title:||IEEE Communication Theory Mini-Conference, Proceedings, CTMC||URI:||http://scholarbank.nus.edu.sg/handle/10635/72516|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 21, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.