상세정보
학술지
An Improved Non-CSD 2-Bit Recursive Common Subexpression Elimination Method to Implement FIR Filter
- 발행일
- 201110
- 출처
- ETRI Journal, v.33 no.5, pp.695-703
- ISSN
- 1225-6463
- 출판사
- 한국전자통신연구원 (ETRI)
- 협약과제
- 10MB2400, 3G LTE 기반 All-In-One FemtoCell 기지국 SoC 플랫폼, 구본태
- 초록
- The number of adders and critical paths in a multiplier block of a multiple constant multiplication based implementation of a finite impulse response (FIR) filter can be minimized through common subexpression elimination (CSE) techniques. A two-bit common subexpression (CS) can be located recursively in a noncanonic sign digit (CSD) representation of the filter coefficients. An efficient algorithm is presented in this paper to improve the elimination of a CS from the multiplier block of an FIR filter so that it can be realized with fewer adders and low logical depth as compared to the existing CSE methods in the literature. Vinod and others claimed the highest reduction in the number of logical operators (LOs) without increasing the logic depth (LD) requirement. Using the design examples given by Vinod and others, we compare the average reduction in LOs and LDs achieved by our algorithm. Our algorithm shows average LO improvements of 30.8%, 5.5%, and 2.5% with a comparative LD requirement over that of Vinod and others for three design examples. Improvement increases as the filter order increases, and for the highest filter order and lowest coefficient width, the LO improvements are 70.3%, 75.3%, and 72.2% for the three design examples. © 2011 Optical Society of America.
- KSP 제안 키워드
- Common subexpression elimination, Critical path, Efficient algorithms, Elimination Method, Filter coefficients, Filter order, Finite Impulse Response filter(FIR filter), Logic depth, Logical depth, Multiple Constant Multiplication(MCM), finite impulse response (FIR) filter