Analisis Interation Bound Pada Algoritma Digital Signal Processing  

Oleh:

Sereati, Catherine Olivia

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI - atma jaya
Dalam koleksi: Jurnal Elektro vol. 1 no. 1 (Oct. 2008), page 76-85.
Topik: DFG; DSP algorithm; Iteration Bound
Fulltext: elektro_1_1_76-85.pdf (215.41KB)

Isi artikel

Iteration bound is a charateristic representation of a DSP (Digital Signal Processing) algorithm in the form of a Data Flow Graph (DFG). This article defines the iteration bound and presents two techniques to compute the iteration bound, i.e. Longest Past Matrix (LPM) algorithm and minimum cycle mean (MCM) algorithm. Both algorithms can be used to determine the iteration bound by constructing an equivalent single rate DFG initially and computing the iteration bound afterward.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali