Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ISIT.1998.708847
DC Field | Value | |
---|---|---|
dc.title | Iterative sequence estimation using unconstrained state space | |
dc.contributor.author | Alexander, P.D. | |
dc.contributor.author | Grant, A.J. | |
dc.date.accessioned | 2014-11-28T04:59:53Z | |
dc.date.available | 2014-11-28T04:59:53Z | |
dc.date.issued | 1998 | |
dc.identifier.citation | Alexander, P.D., Grant, A.J. (1998). Iterative sequence estimation using unconstrained state space. IEEE International Symposium on Information Theory - Proceedings : 242-. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIT.1998.708847 | |
dc.identifier.isbn | 0780350006 | |
dc.identifier.issn | 21578095 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/112342 | |
dc.description.abstract | Iterative sequence estimation complexity for concatenated finite state machines may be reduced if one of the constituent FSMs is linear and an appropriate vector space can be defined. © 1998 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISIT.1998.708847 | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | CENTRE FOR WIRELESS COMMUNICATIONS | |
dc.description.doi | 10.1109/ISIT.1998.708847 | |
dc.description.sourcetitle | IEEE International Symposium on Information Theory - Proceedings | |
dc.description.page | 242- | |
dc.description.coden | PISTF | |
dc.identifier.isiut | 000075932800240 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.