Analysis of tabular methods for modular reduction

Parhami, Behrooz

doi:10.1109/acssc.1994.471508

Cited by 5 publications

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Accumulative parallel counters

Parhami

Yeh

Conference Record of the Twenty-Ninth Asilomar Conference on Signals, Systems and Computers

Self Cite

View full text Add to dashboard Cite

An accumulative parallel counter represents (I true generalization of a sequential counter in that it incorporates the memory feature of an ordinary counter: i.e., it a&& the sum of its n binary inputs to a stored value. We examine the design of accumulative parallel counters and show that direct synthesis of such a counter, as opposed to bdding it from a combinational parallel counter and a fast adder, leads to significant reduction in complexity and delay. While the mere fact that savings can be achieved coines as no surprise to seasoned arithmetic &signers, its extent and consequences in designing large-scale (systolic) associative processors, modular multi-operand adders, serial-pwallel multipliers, and digital neural networks merits dttailed examination. Both simple accumulative parallel counters and their modular versions, that keep the accumulated count modulo an arbitrary constant p , are dealt with.

show abstract

Accumulative parallel counters

Parhami

Yeh

Conference Record of the Twenty-Ninth Asilomar Conference on Signals, Systems and Computers

Self Cite

View full text Add to dashboard Cite

show abstract

Efficient pipelined multi-operand adders with high throughput and low latency: designs and applications

Yeh

Parhami²

Conference Record of the Thirtieth Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

Efficient designs for multi-input counters

Yeh

Parhami²

Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020)

Self Cite

View full text Add to dashboard Cite

A multi-input counter; or accumulative parallel counter; represents a true generalization of a sequential counter in that it incorporates the memory feature of an ordinary counter; i.e., it adds the sum of its inputs to a stored value. In this paper; we present eficient designs for simple multiinput counters and their modular versions, which keep the accumulated count modulo an arbitrary constant.

show abstract

Analysis of tabular methods for modular reduction

Cited by 5 publications

References 14 publications

Accumulative parallel counters

Accumulative parallel counters

Efficient pipelined multi-operand adders with high throughput and low latency: designs and applications

Efficient designs for multi-input counters

Contact Info

Product

Resources

About