© The Institution of Electrical Engineers
In bit/digit-serial architectures the allowable sample word length is lower-bounded to synchronise the feedback loops (the cycles) correctly. A systematic procedure for finding this lower bound and the critical cycle that achieves the bound are described. From this information a successful schedule can be guaranteed for all cases, which has been difficult using previous approaches.
References
-
-
1)
-
F. Fernandez ,
J. Gutierrez
.
(1988)
Application of algebraic graph theory to the analysis and design of bit-serial architectures, VLSI Signal Processing III.
-
2)
-
R. Hartley ,
J. Jasica
.
Behavioral to structural transition in a bit-serial silicon compiler.
IEEE Trans.
,
8 ,
877 -
886
-
3)
-
R. Tarjan
.
Enumeration of the elementary circuits of a directed graph.
SIAM J. Comput.
,
3 ,
211 -
216
-
4)
-
Goossens, G.: `An optimal and flexible delay management technique for VLSI', Proc. 7th Int. Symp. on the Mathematical Theory of Networks and Systems (MTNS), 1985, Stockholm, Sweden.
-
5)
-
P. Denyer ,
D. Renshaw
.
(1985)
, VSLI signal processing: a bit-serial approach.
-
6)
-
N. Christofides
.
(1975)
, Graph theory: an algorithmic approach.
-
7)
-
R. Hartley ,
P. Corbett
.
Digit-serial processing techniques.
IEEE Trans.
,
6 ,
707 -
719
-
8)
-
M. Renfors ,
Y. Neuvo
.
The maximum sampling rate of digital filters under hardware speed constraints.
IEEE Trans.
,
3 ,
196 -
202
-
9)
-
E. Lawler
.
(1976)
, Combinatorial optimization: networks and matroids.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19920038
Related content
content/journals/10.1049/el_19920038
pub_keyword,iet_inspecKeyword,pub_concept
6
6