인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
DBpia AI
AI 에이전트
AI 아이디어
AI 리더
AI 뷰어
Citeasy
크롬 서지관리 다운로드
개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 저자정보
피인용 0
초록·키워드
In order to design FIR digital filters with prescribed amplitude and phase responses, a complex approximation problem must be solved. In this paper, the complex approximation problem is converted into a real approximation problem which is exactly equivalent to the complex problem. The converted approximation problem is solved by successive projections method. Successive projections on to convex sets are used to design a class of FIR filter with prescribed magnitude and phase specifications. This method is an iterative optimization technique, simple and fast, and the required memory space to design a filter is small proposed that the linear complex approximation problem in the complex domain had been converted to the linear optimization problem in the real domain [3]. However this method results in the conversion error because of the discrete conversion variable used in linear programming technique. Furthermore, this method needs a large memory space and requires CPU time which increases exponentially with the increase of filter length and grid density. Now, we propose a new design method in which the conversion error is zero unlike the conventional method. As a result, the Chebyshev error is minimized. The new design method solves a real approximation problem which is equivalent to the complex approximation problem. This means that our method gives optimal solutions. We solve this design problem with successive projections method (SP) [8],[9],[11]. The merit of our method is iterative optimization technique, simple, and fast, and the required memory space to design a filter is small
본문·목차
인공지능 문자 인식 모델을 통해 추출된 텍스트로, 일부 오타나 오류가 포함될 수 있으나 지속적으로 개선 중입니다.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
최근 본 자료 전체보기
UCI(KEPA) : I410-ECN-0101-2009-569-013195043
