Least-squared Design of Sparse FIR Filters by Combinatorial Optimization

DOI Web Site Web Site 1 Citations

Bibliographic Information

Other Title
  • 組合せ最適化によるスパースFIRフィルタの最適設計
  • 組合せ最適化によるスパースFIRフィルタの最適設計 : 分枝限定法の効率化
  • クミアワセ サイテキカ ニ ヨル スパース FIR フィルタ ノ サイテキ セッケイ : ブンシ ゲンテイホウ ノ コウリツカ
  • —An Improvement of Branch and Bound Method—
  • —分枝限定法の効率化—

Search this article

Abstract

<p>In order to reduce the computation amount of FIR filters, we consider design sparse FIR filters by using combinatorial optimization. We also consider solve this optimization problem by using branch and bound method. The computation time for this optimization depends on the initial reference value of branch and bound method. This paper proposes the method to estimate the initial cost value to improve the efficiency for the sparse FIR filter design.</p>

Journal

Citations (1)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top