{"title":"An arbitrarily fast block processing architecture for decision feedback equalizers","authors":"Meng-Lin Yu, K. Azadet","doi":"10.1109/VTSA.1999.786028","DOIUrl":null,"url":null,"abstract":"In this paper, a novel architecture is proposed to solve the decision feedback equalizer (DFE) critical path problem by parallel processing. This architecture uses the block processing technique. A block processing DFE with block factor of N takes N inputs and produces N outputs in parallel. Since each output computation depends on previous decisions, the computation of the N outputs forms a dependency chain in block processing DFEs and requires N-1 multiplexing delay time when it is done sequentially. Our architecture employs a fast, O(logN) multiplexing delay algorithm to resolve the output dependency and thus speeds up parallel block processing DFEs. Further, our architecture can be used with pipelining to completely eliminate the critical path problem. This architecture enables digital DFEs to be used in many important applications, such as very high speed data communication systems.","PeriodicalId":237214,"journal":{"name":"1999 International Symposium on VLSI Technology, Systems, and Applications. Proceedings of Technical Papers. (Cat. No.99TH8453)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 International Symposium on VLSI Technology, Systems, and Applications. Proceedings of Technical Papers. (Cat. No.99TH8453)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTSA.1999.786028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
In this paper, a novel architecture is proposed to solve the decision feedback equalizer (DFE) critical path problem by parallel processing. This architecture uses the block processing technique. A block processing DFE with block factor of N takes N inputs and produces N outputs in parallel. Since each output computation depends on previous decisions, the computation of the N outputs forms a dependency chain in block processing DFEs and requires N-1 multiplexing delay time when it is done sequentially. Our architecture employs a fast, O(logN) multiplexing delay algorithm to resolve the output dependency and thus speeds up parallel block processing DFEs. Further, our architecture can be used with pipelining to completely eliminate the critical path problem. This architecture enables digital DFEs to be used in many important applications, such as very high speed data communication systems.