<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF7102</article-id><article-id pub-id-type="doi">10.3233/INF-1996-7102</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Pipelining of IIR digital filters</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Kazlauskas</surname><given-names>Kazys</given-names></name><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Institute of Mathematics and Informatics, 2600 Vilnius, Akademijos St. 4, Lithuania</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>1996</year></pub-date><volume>7</volume><issue>1</issue><fpage>15</fpage><lpage>26</lpage><abstract><p>In this paper, we propose to present the direct form recursive digital filter as a state space filter. Then, we apply a look-ahead technique and derive a pipelined equation for block output computation. In addition, we study the stability and multiplication complexity of the proposed pipelined-block implementation and compare with complexities of other methods. An algorithm is derived for the iterative computation of pipelined-block matrices.</p></abstract><kwd-group><label>Keywords</label><kwd>digital filters</kwd><kwd>recursive</kwd><kwd>state space</kwd><kwd>pipelining</kwd><kwd>stability</kwd><kwd>complexity</kwd></kwd-group></article-meta></front></article>