메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
Yu-Chi Tsao (Illinois Institute of Technology) Ken Choi (Illinois Institute of Technology)
저널정보
대한전자공학회 대한전자공학회 ISOCC ISOCC 2010 Conference
발행연도
2010.11
수록면
174 - 177 (4page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
Based on the conventional common subexpression elimination (CSE) algorithm, in this paper we propose a new flow, which reduces redundant recursive cycles so that the required total runtime is shorten. The proposed CSE flow can save at most N?3 (N > 3) recursive loops for pattern searching and pattern elimination processes from the conventional CSE algorithm, where N stands for the maximum number of nonzero bits in all possible patterns from all coefficients. The conventional CSE algorithm examines patterns based on N nonzero bits through all the coefficient set. The searching loop is repeated for N, N?1, N?2…2 nonzero bit patterns. In our proposed flow, all possible common patterns with various lengths of nonzero bits are searched at one time. The pattern searching and frequency
calculation loops are only performed when the new coefficient set is formed after pattern elimination process of all patterns with
maximum frequency, which reduces the redundant recursive cycles of patterns search and frequency calculation from the conventional CSE algorithm. Furthermore, the commensurate amount of adders along the critical path is also achieved by the proposed method for pattern selection.

목차

Abstract
Ⅰ. INTRODUCTION
Ⅱ. PROPOSED CSE FLOW
Ⅲ. EXAMPLE
Ⅳ. EXPERIMENTAL RESULTS
Ⅴ. CONCLUSION
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2013-569-001489220