Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization

Taizo Suzuki, Seisuke Kyochi, Yuichi Tanaka, Masaaki Ikehara

研究成果: Article査読

3 被引用数 (Scopus)


This paper presents M-channel (M= 2 N, N∈ N, N≥ 1) multiplierless lifting-based (ML-) fast X transforms (FXTs), where X = F (Fourier), C (cosine), S (sine), and H (Hartley), i.e., FFT, FCT, FST, and FHT, derived from FHT factorization as way of lowering the cost of signal (image) processing. The basic forms of ML-FXTs are described. Then, they are customized for efficient image processing. The customized ML-FFT has a real-valued calculation followed by a complex-valued one. The ML-FCT customization for a block size of 8, which is a typical size for image coding, further reduces computational costs. We produce two customized ML-FCTs for lossy and lossless image coding. Numerical simulations show that ML-FFT and ML-FCTs perform comparably to the conventional methods in spite of having fewer operations.

ジャーナルMultidimensional Systems and Signal Processing
出版ステータスPublished - 2018 1月 1

ASJC Scopus subject areas

  • ソフトウェア
  • 信号処理
  • 情報システム
  • ハードウェアとアーキテクチャ
  • コンピュータ サイエンスの応用
  • 人工知能
  • 応用数学


「Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。