Two-operand binary addition is the most widely used arithmetic operation in modern data path designs. To improve the efficiency of this operation, it is desirable to use an adder with good performance and area trade-off characteristics. This work presents an efficient carry- look-ahead adder architecture based on the parallel-prefix computation graph. In this book, we define the notion of triple-carry-operator, which computes the generateand propagate signals for a merged block which combines three adjacent blocks. We use conjunction with the classic approach of the carry-operator to compute the generate and propagate signals for a merged block combining two adjacent blocks. The timing-driven nature of the proposed design reduces the depth of the adder. In addition, we use a ripple-carry type of structure in the non-timing critical portion of the parallel-prefix computationnetwork.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Two-operand binary addition is the most widely used arithmetic operation in modern data path designs. To improve the efficiency of this operation, it is desirable to use an adder with good performance and area trade-off characteristics. This work presents an efficient carry- look-ahead adder architecture based on the parallel-prefix computation graph. In this book, we define the notion of triple-carry-operator, which computes the generateand propagate signals for a merged block which combines three adjacent blocks. We use conjunction with the classic approach of the carry-operator to compute the generate and propagate signals for a merged block combining two adjacent blocks. The timing-driven nature of the proposed design reduces the depth of the adder. In addition, we use a ripple-carry type of structure in the non-timing critical portion of the parallel-prefix computationnetwork. 104 pp. Englisch. N° de réf. du vendeur 9786200783363
Quantité disponible : 2 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26403784701
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 409402402
Quantité disponible : 4 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Basha M. MahaboobDr M. Mahaboob Basha and Dr Sibghatullah Khan hold Ph.D in Electronics and Communication Engineering. They are working as Associate Professor in Department of Electronic and Communication Engineering, Sreenidhi Insti. N° de réf. du vendeur 385897646
Quantité disponible : Plus de 20 disponibles
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18403784695
Quantité disponible : 4 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Two-operand binary addition is the most widely used arithmetic operation in modern data path designs. To improve the efficiency of this operation, it is desirable to use an adder with good performance and area trade-off characteristics. This work presents an efficient carry- look-ahead adder architecture based on the parallel-prefix computation graph. In this book, we define the notion of triple-carry-operator, which computes the generateand propagate signals for a merged block which combines three adjacent blocks. We use conjunction with the classic approach of the carry-operator to compute the generate and propagate signals for a merged block combining two adjacent blocks. The timing-driven nature of the proposed design reduces the depth of the adder. In addition, we use a ripple-carry type of structure in the non-timing critical portion of the parallel-prefix computationnetwork.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 104 pp. Englisch. N° de réf. du vendeur 9786200783363
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Two-operand binary addition is the most widely used arithmetic operation in modern data path designs. To improve the efficiency of this operation, it is desirable to use an adder with good performance and area trade-off characteristics. This work presents an efficient carry- look-ahead adder architecture based on the parallel-prefix computation graph. In this book, we define the notion of triple-carry-operator, which computes the generateand propagate signals for a merged block which combines three adjacent blocks. We use conjunction with the classic approach of the carry-operator to compute the generate and propagate signals for a merged block combining two adjacent blocks. The timing-driven nature of the proposed design reduces the depth of the adder. In addition, we use a ripple-carry type of structure in the non-timing critical portion of the parallel-prefix computationnetwork. N° de réf. du vendeur 9786200783363
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Parallel Prefix Adder Architecture | A Novel Approach | M. Mahaboob Basha (u. a.) | Taschenbuch | Englisch | 2020 | LAP LAMBERT Academic Publishing | EAN 9786200783363 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 118420620
Quantité disponible : 5 disponible(s)