Datapath Subsystems Design

This lecture covers the design of datapath subsystems, focusing on basic combinational components such as decoders, encoders, priority encoders, multiplexers, demultiplexers, magnitude comparators, and shifters. It also delves into the implementation options for adders, including CLA, carry-skip, and carry-save adders, as well as parallel-prefix adders. The lecture explores multiplication algorithms, array multipliers, Booth's algorithm, and Booth's array multipliers. Additionally, it discusses division algorithms, subsystem design using priority encoders, domino logic, and modular design. The lecture concludes with the design of barrel shifters, logical and arithmetic shifts, rotations, and the implementation of counters.

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.

Related lectures (18)

Related concepts (162)

EE-330: Digital IC design

Digital IC Design presents the fundamentals of digital integrated circuit design. The methods and techniques aiming at the fabrication and development of digital integrated circuits are reviewed, the

Multiplexer

In electronics, a multiplexer (or mux; spelled sometimes as multiplexor), also known as a data selector, is a device that selects between several analog or digital input signals and forwards the selected input to a single output line. The selection is directed by a separate set of digital inputs known as select lines. A multiplexer of inputs has select lines, which are used to select which input line to send to the output.

Matrix multiplication algorithm

Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix multiplication in computational problems are found in many fields including scientific computing and pattern recognition and in seemingly unrelated problems such as counting the paths through a graph. Many different algorithms have been designed for multiplying matrices on different types of hardware, including parallel and distributed systems, where the computational work is spread over multiple processors (perhaps over a network).

Logic family

In computer engineering, a logic family is one of two related concepts: A logic family of monolithic digital integrated circuit devices is a group of electronic logic gates constructed using one of several different designs, usually with compatible logic levels and power supply characteristics within a family. Many logic families were produced as individual components, each containing one or a few related basic logical functions, which could be used as "building-blocks" to create systems or as so-called "glue" to interconnect more complex integrated circuits.

Booth's multiplication algorithm

Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. The algorithm was invented by Andrew Donald Booth in 1950 while doing research on crystallography at Birkbeck College in Bloomsbury, London. Booth's algorithm is of interest in the study of computer architecture. Booth's algorithm examines adjacent pairs of bits of the 'N'-bit multiplier Y in signed two's complement representation, including an implicit bit below the least significant bit, y−1 = 0.

Computational complexity of matrix multiplication

In theoretical computer science, the computational complexity of matrix multiplication dictates how quickly the operation of matrix multiplication can be performed. Matrix multiplication algorithms are a central subroutine in theoretical and numerical algorithms for numerical linear algebra and optimization, so finding the right amount of time it should take is of major practical relevance. Directly applying the mathematical definition of matrix multiplication gives an algorithm that requires n3 field operations to multiply two n × n matrices over that field (Θ(n3) in big O notation).

Quantum Random Number Generation PHYS-758: Advanced Course on Quantum Communication

Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.

Datapath Subsystems Design EE-330: Digital IC design

Covers the design of datapath subsystems, focusing on various types of adders and multiplication algorithms.

Logic Systems: Karnaugh Maps and TTL Gates EE-110: Logic systems (for MT)

Explores Karnaugh maps, TTL gates, analog aspects of digital logic, and prime implicants.

Counting Principles: Sequences and Functions CS-101: Advanced information, computation, communication I

Covers counting principles, sequences, functions, and number representations in mathematics and computer science.

Digital Systems Overview: From Transistors to Integrated Circuits EE-110: Logic systems (for MT)

Explores the evolution of digital systems from transistors to integrated circuits and their impact on consumer applications and IoT technologies.