DocumentCode :
3430413
Title :
Byte-serial convolvers
Author :
Dadda, Luigi
Author_Institution :
Dept. of Electron., Politecnico di Milano, Italy
fYear :
1990
fDate :
5-7 Sep 1990
Firstpage :
530
Lastpage :
541
Abstract :
It is shown that previously proposed bit-serial convolver schemes (with weights in parallel form), working with zero separation between samples, can be transformed into byte-serial input schemes with a comparable clock rate, thus affording an increase in sampling rate equal to the number of bits in each byte. This is achieved by adopting a modified carry save circuit. The proposed schemes are based on a modified version of serial-parallel multipliers and on the use of pre-computed multiples of the weights. The case of 2-bit bytes is fully developed. It is shown that the use of samples represented in a biased binary number system leads to schemes that are only slightly more complex than the corresponding bit-serial schemes. The bit rate is determined by the delays of a full adder and a flip-flop. The schemes are composed by a number of bit-slices and appear to be easily partitionable in identical cascaded modules suitable for a fault tolerant architecture and a WSI implementation
Keywords :
VLSI; computerised signal processing; digital arithmetic; digital signal processing chips; fault tolerant computing; WSI implementation; biased binary number system; byte-serial input schemes; carry save circuit; cascaded modules; fault tolerant architecture; modified version; serial-parallel multipliers; Arithmetic; Bit rate; Circuits; Clocks; Convolvers; Erbium; Flip-flops; Paper technology; Sampling methods; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Application Specific Array Processors, 1990. Proceedings of the International Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
0-8186-9089-5
Type :
conf
DOI :
10.1109/ASAP.1990.145489
Filename :
145489
Link To Document :
بازگشت