Updating search results...

Search Resources

6 Results

View
Selected filters:
  • boolean-algebra
Introductory Digital Systems Laboratory
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

6.111 consists of lectures and labs on digital logic, flipflops, PALs, counters, timing, synchronization, finite-state machines, and microprogrammed systems. Students are expected to design and implement a final project of their choice: games, music, digital filters, graphics, etc. The course requires extensive use of VHDL for describing and implementing digital logic designs. 6.111 is worth 12 Engineering Design Points.

Subject:
Applied Science
Career and Technical Education
Computer Science
Electronic Technology
Engineering
Material Type:
Full Course
Provider:
MIT
Provider Set:
MIT OpenCourseWare
Author:
Kirtley, James
Troxel, Don
Date Added:
09/01/2002
Introductory Digital Systems Laboratory
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

6.111 is reputed to be one of the most demanding classes at MIT, exhausting many students' time and creativity. The course covers digital design topics such as digital logic, sequential building blocks, finite-state machines, FPGAs, timing and synchronization. The semester begins with lectures and problem sets, to introduce fundamental topics before students embark on lab assignments and ultimately, a digital design project. The students design and implement a final digital project of their choice, in areas such as games, music, digital filters, wireless communications, video, and graphics. The course relies on extensive use of Verilog® for describing and implementing digital logic designs on state-of-the-art FPGA.

Subject:
Applied Science
Career and Technical Education
Computer Science
Electronic Technology
Engineering
Material Type:
Full Course
Provider:
MIT
Provider Set:
MIT OpenCourseWare
Author:
Chandrakasan, Anantha
Date Added:
02/01/2006
Simplification of boolean functions
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This topic explains the need for simpliciation of boolean functions, boolean algebra, K-map and tabulation method simplification with example

Subject:
Computer Science
Material Type:
Lesson Plan
Author:
Dr ARUNA SUNDARAM
Date Added:
08/26/2019
boolean expression
Unrestricted Use
CC BY
Rating
0.0 stars

In this session the audience will be able to know the Boolean algebra

Subject:
Applied Science
Material Type:
Lecture
Date Added:
07/25/2016
k-maps
Unrestricted Use
CC BY
Rating
0.0 stars

This flip class room activity makes the audience to understand K-maps thouroughly

Subject:
Applied Science
Material Type:
Lecture
Date Added:
07/25/2016