Current Proceedings on Technology

Current Proceedings on Technology

Reduction of multiplexer trees using modified lookup table

Yazarlar: Peter Pistek, Katarína Jelemenská, Milan Kolesár

Cilt 1 , Sayı - , 2012 , Sayfalar -

Konular:-

Anahtar Kelimeler:Multiplexer,Multiplexer tree,Modified truth table

Özet: Low power consumption belongs to the main requirements of nowadays digital systems. One of the basic power saving concepts is the implementation complexity reduction that can be reached using circuit optimization. The n-to-1 multiplexer is generally implemented decomposed into smaller multiplexers (typically 2-to-1, but up to 16-to-1). We proposed a novel method of multiplexer tree design based on an efficient elimination of multiplexers/group of multiplexers from a circuit. The resulting circuit is made of multiplexers and basic logic gates like AND, NAND, OR, NOR, etc. Thanks to the residue variable usage we can simply eliminate the most numerous layer of multiplexer tree (i.e. in multiplexer tree composed of 2-to-1 multiplexers more than half of multiplexerscan be eliminated). The experimental results show that compared to the original non-optimized circuit the proposed method can reduce the number of required gates up to 68,4 %. In addition, the MLUT (modified lookup table) reduction was designed. 


ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır

KAYNAK GÖSTER
BibTex
KOPYALA
@article{2012, title={Reduction of multiplexer trees using modified lookup table}, volume={1}, number={0}, publisher={Current Proceedings on Technology }, author={Peter Pistek, Katarína Jelemenská, Milan Kolesár}, year={2012} }
APA
KOPYALA
Peter Pistek, Katarína Jelemenská, Milan Kolesár. (2012). Reduction of multiplexer trees using modified lookup table (Vol. 1). Vol. 1. Current Proceedings on Technology .
MLA
KOPYALA
Peter Pistek, Katarína Jelemenská, Milan Kolesár. Reduction of Multiplexer Trees Using Modified Lookup Table. no. 0, Current Proceedings on Technology , 2012.