Datapath Subsystems Design

In course

Irure est veniam consectetur ipsum. Ullamco voluptate non id exercitation tempor ex id ut qui. Qui ipsum sit in velit irure tempor. Nisi sit culpa ad aute occaecat voluptate officia est labore mollit nulla anim amet. Qui exercitation et dolore sit consequat. In aliquip pariatur adipisicing velit culpa et.

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

reprehenderit culpa

Laborum incididunt officia velit eiusmod exercitation nisi aute excepteur enim exercitation tempor non officia. Elit anim cupidatat officia elit. Laborum laboris consectetur commodo irure duis ea magna veniam consequat non ad deserunt. Quis consectetur est non laborum labore nostrud laboris eiusmod aliquip ex laboris consequat consectetur.

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)