Save this video free

ECE1756_lecture9_part1_2026_logic_blocks

Vaughn Betz · 1:29:36 · Watch on YouTube

Part of University of Toronto ECE 1756 FPGA Architecture and Reconfigurable Computing. See all 12 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

Vaughn Betz explains how Altera and Xilinx balance LUT size, fracturability, cluster routing, and registers, then shows why FPGA arithmetic benefits from dedicated carry chains embedded in logic blocks. The lecture compares Altera's 8-input ALM and 10-ALM clusters with Xilinx's Versal architecture, and derives how carry-chain adders reduce LUT use and can support 32-bit addition above 500 MHz; it also previews Assignment 3, a RAM-mapping CAD tool due December 3.

Key takeaways

Chapters

0:00 Assignment 3: Build a RAM-Mapping CAD Tool
5:12 Why Six-LUT Architectures Need Fracturable LUTs
11:00 Altera's Eight-Input Adaptive Logic Module
15:59 ALM Packing Results and Synthesis Tradeoffs
21:15 Why Altera Uses Ten ALMs per Logic Cluster
25:32 ALM Registers and Low-Cost Register Reuse
30:47 Why a Fast Register-to-LUT Path May Not Improve Timing
38:23 Agilex Adds Shorter Local Interconnect Hierarchy
45:11 Xilinx Versal's Fracturable LUTs and Register Inputs
49:14 Versal's Larger Clusters Capture More Internal Connections
52:36 A 32-Bit Ripple-Carry Adder Costs 64 Four-LUTs
56:09 Why AND Logic Maps Better Than Ripple-Carry Arithmetic
1:00:25 Why FPGAs Add Dedicated Arithmetic Hardware
1:06:26 Why Standalone Adder Blocks Waste Routing Resources
1:12:06 Embed Carry Chains Inside Logic Clusters
1:17:54 A Cluster Carry Chain Adds Ten Bits with Low Overhead
1:24:37 LUT Configuration Enables Subtraction and Fast Addition

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:00 Welcome, everybody. Sorry I'm a few minutes late. Uh, so let's let's get right to it. Okay, so uh, assignment two, you handed in. Hopefully it all went well. Assignment three is coming out tonight or tomorrow. Um, it's worth Actually, this is wrong. It's like 21% of your final mark now. So it's been reduced slightly. Uh, and yeah, my plan is to make it due December 3rd, so almost three weeks. This one's a bit different. Uh, it is uh, it's a software tool. So you're developing um by the end of this lecture we should get to information that will help you with this assignment. But basically you're going to develop a RAM mapping CAD tool. So we haven't done RAM mapping yet, but should

0:46 be doing it towards the end of this lecture. Um, so basically you you'll see this in the handout and in today's lecture. The way an FPGA designer normally asks for RAM is you you just write I want a RAM this big, and you don't worry about what's on the chip. Uh, and so there's a phase of the FPGA CAD flow that does what's called RAM mapping. Says takes the RAMs that you asked for and figures out how can I implement them on this chip with the resources that actually exist, which will generally be RAMs that are not the size you asked for. So we got to build uh look at the RAMs that physically exist, figure out how we could combine them with some logic or other things and make the RAMs that you actually asked for. Um, this is related to bin packing, and bin packing is already a computationally hard

1:35 problem. Um, meaning there are no perfect solutions that run in sort of guaranteed fast time.

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Vaughn Betz.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.