K. H. ChenC. N. ChenTZI-DAR CHIUEH2018-09-102018-09-102005-1215497747http://scholars.lib.ntu.edu.tw/handle/123456789/318156https://www.scopus.com/inward/record.uri?eid=2-s2.0-30344445061&doi=10.1109%2fTCSII.2005.853895&partnerID=40&md5=7d8e7e7b8b382c4c9d3b310bcc9b3879With increasing demand for higher data rate, modern communication systems have grown more complex. Equalization has become more and more important as it is effective in mitigating the multipath fading often occurred in high-data-rate communication systems. However, the implementation complexity of adaptive equalizers is usually too high for mobile communication applications. In this paper, a novel adaptive equalization algorithm and its low-complexity architecture are proposed. This algorithm employs a new grouped signed power-of-two (GSPT) number representation. The GSPT algorithm and several enhanced versions are simulated as adaptive equalizers in a phase-shift keying communication receiver for several practical channels and the GSPT-based equalizers perform as well as the least mean square (LMS) equalizer. Moreover, for comparison, two GSPT-based equalizers and two other equalizers are implemented in field-programmable gate arrays. The GSPT-based equalizers require only about 25%-30% of the hardware resources needed in the LMS equalizer. Also the GSPT-based equalizers are more than twice as fast as the LMS equalizer. © 2005, IEEEAdaptive algorithms; adaptive filters; low circuit complexity; power-of-two (PT)Adaptive algorithms; Communication channels (information theory); Computational complexity; Computer simulation; Field programmable gate arrays; Mobile telecommunication systems; Quadrature phase shift keying; Signal receivers; Least mean square (LMS) equalizers; Low circuit complexity; Power-of-two (PT); Digital filtersGrouped Signed Power-of-Two Algorithms for Low-Complexity Adaptive Equalizationjournal article10.1109/TCSII.2005.8538952-s2.0-30344445061WOS:000234192900003