Datapath Subsystems Design

In course

Quis aliqua nostrud dolor ut consequat fugiat. Reprehenderit tempor veniam duis consequat esse excepteur consequat velit consectetur veniam do. Amet pariatur id eu veniam.

Description

This lecture covers the design of datapath subsystems, focusing on various types of adders including carry-lookahead, carry-select, carry-save, and parallel-prefix adders. It also discusses multiplication algorithms, such as shift-and-add, array multipliers, and Booth's algorithm, as well as non-restoring division. The presentation includes examples and comparisons of adder performances.

Instructor

culpa ullamco

Dolore deserunt quis minim cupidatat mollit ullamco velit ut anim. Mollit ad incididunt non non occaecat culpa labore aliquip aliquip fugiat. Eiusmod excepteur occaecat elit quis deserunt adipisicing mollit irure. Deserunt reprehenderit amet ad ex ex fugiat et fugiat id esse consequat. Esse veniam Lorem mollit ex. Dolor id eu eiusmod eiusmod aute sit ex et fugiat esse in esse qui.

Official source

https://mediaspace.epfl.ch/media/0_i6fvi95l

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Arithmetic: Topics in arithmetic

Computer engineering

Hardware engineering: Microprocessors

Electrical engineering

Electronic engineering: Digital electronics

Related lectures (33)