{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T05:51:07Z","timestamp":1723096267231},"reference-count":19,"publisher":"Hindawi Limited","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>This paper presents an improved decision feedforward equalizer (DFFE) for high speed receivers in the presence of highly dispersive channels. This decision-aided equalizer technique has been recently proposed for multigigabit communication receivers, where the use of parallel processing is mandatory. Well-known parallel architectures for the typical decision feedback equalizer (DFE) have a complexity that grows exponentially with the channel memory. Instead, the new DFFE avoids that exponential increase in complexity by using tentative decisions to cancel iteratively the intersymbol interference (ISI). Here, we demostrate that the DFFE not only allows to obtain a similar performance to the typical DFE but it also reduces the compelxity in channels with large memory. Additionally, we propose a theoretical approximation for the error probability in each iteration. In fact, when the number of iteration increases, the error probability in the DFFE tends to approach the DFE. These benefits make the DFFE an excellent choice for the next generation of high-speed receivers.<\/jats:p>","DOI":"10.1155\/2013\/587108","type":"journal-article","created":{"date-parts":[[2013,5,12]],"date-time":"2013-05-12T17:01:00Z","timestamp":1368378060000},"page":"1-10","source":"Crossref","is-referenced-by-count":3,"title":["A Low-Complexity Decision Feedforward Equalizer Architecture for High-Speed Receivers on Highly Dispersive Channels"],"prefix":"10.1155","volume":"2013","author":[{"given":"Ariel L.","family":"Pola","sequence":"first","affiliation":[{"name":"Laboratorio de Comunicaciones Digitales, Universidad Nacional de C\u00f3rdoba, CONICET, Avenida V\u00e9lez Sarsfield 1611, C\u00f3rdoba X5016GCA, Argentina"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan E.","family":"Cousseau","sequence":"additional","affiliation":[{"name":"Universidad Nacional del Sur, IIIE, CONICET, Avenida Alem 1253, Bah\u00eda Blanca B8000CPB, Argentina"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar E.","family":"Agazzi","sequence":"additional","affiliation":[{"name":"ClariPhy Communications, Inc., 7585 Irvine Center Drive, Suite 100, Irvine, CA 92618, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario R.","family":"Hueda","sequence":"additional","affiliation":[{"name":"Laboratorio de Comunicaciones Digitales, Universidad Nacional de C\u00f3rdoba, CONICET, Avenida V\u00e9lez Sarsfield 1611, C\u00f3rdoba X5016GCA, Argentina"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"98","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2008.2006232"},{"key":"3","year":"2004"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/49.87640"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/31.135746"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/29.32286"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2006.881165"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2004.842935"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds.2010.0445"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2005.1421925"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/26.966073"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014007227625"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.873485"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2008.2008479"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090652"},{"issue":"4","key":"21","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1109\/TIT.1974.1055246","volume":"20","year":"1974","journal-title":"IEEE Transactions on Information Theory"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1049\/ip-f-1.1985.0106"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/18.179351"},{"issue":"5","key":"24","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/26.668737","volume":"46","year":"1998","journal-title":"IEEE Transactions on Communications"},{"key":"25","year":"1991"}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2013\/587108.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2013\/587108.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2013\/587108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T08:54:25Z","timestamp":1498035265000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jece\/2013\/587108\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":19,"alternative-id":["587108","587108"],"URL":"https:\/\/doi.org\/10.1155\/2013\/587108","relation":{},"ISSN":["2090-0147","2090-0155"],"issn-type":[{"value":"2090-0147","type":"print"},{"value":"2090-0155","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}