Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/72516
DC FieldValue
dc.titleChannel memory truncation for maximum likelihood sequence estimation
dc.contributor.authorFarhang-Boroujeny, B.
dc.date.accessioned2014-06-19T05:08:56Z
dc.date.available2014-06-19T05:08:56Z
dc.date.issued1995
dc.identifier.citationFarhang-Boroujeny, B. (1995). Channel memory truncation for maximum likelihood sequence estimation. IEEE Communication Theory Mini-Conference, Proceedings, CTMC : 172-176. ScholarBank@NUS Repository.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/72516
dc.description.abstractCalculating 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 [4] 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.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleIEEE Communication Theory Mini-Conference, Proceedings, CTMC
dc.description.page172-176
dc.description.coden00233
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.