Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/72516
DC Field | Value | |
---|---|---|
dc.title | Channel memory truncation for maximum likelihood sequence estimation | |
dc.contributor.author | Farhang-Boroujeny, B. | |
dc.date.accessioned | 2014-06-19T05:08:56Z | |
dc.date.available | 2014-06-19T05:08:56Z | |
dc.date.issued | 1995 | |
dc.identifier.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. | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/72516 | |
dc.description.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 [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.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL ENGINEERING | |
dc.description.sourcetitle | IEEE Communication Theory Mini-Conference, Proceedings, CTMC | |
dc.description.page | 172-176 | |
dc.description.coden | 00233 | |
dc.identifier.isiut | NOT_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.