Team M1 Enigma Machine - PowerPoint PPT Presentation

About This Presentation
Title:

Team M1 Enigma Machine

Description:

Optimized logic to use minimum number of transistors and decrease ... Any capacitance load on output (incl small inverters greatly) increases delay. 12. 53 (200 ... – PowerPoint PPT presentation

Number of Views:57
Avg rating:3.0/5.0
Slides: 20
Provided by: ece9
Category:

less

Transcript and Presenter's Notes

Title: Team M1 Enigma Machine


1
Team M1Enigma Machine
  • Milestone 5
  • Adithya Attawar (M11)
  • Shilpi Chakrabarti (M12)
  • Zavo Gabriel (M13)
  • Mike Sokolsky (M14)

Design Manager Prateek Goenka
2
Status
  • Finished
  • - Behavioral Verilog and C simulation
  • - Structural Verilog
  • - Spice Delay Diagrams
  • - Optimization of logic and modules
  • In Progress
  • - Verification of Schematic
  • - Floorplan
  • To do
  • - Layout
  • - Testing
  • - Simulation

3
Design Decisions
  • Optimized logic to use minimum number of
    transistors and decrease critical path
  • Chose a TSPC flipflop to implement registers and
    flip flops
  • Changed RippleCarry adder to a
    chained 3-bit Carry Lookahead

4
FSM Schematic
5
FSM Operation
  • Operation time varies, 17 cycles for a typical
    3-rotor machine.
  • 1 cycle load
  • 1 cycle steckerboard swap
  • 6 cycles for 3 wheels -gt 8 cycles for 4 wheels
  • 1 cycle for reflector
  • 6 cycles for 3 wheels -gt 8 cycles for 4 wheels
  • 1 cycle output

6
Choosing a flipflop for the registers...
  • HL flipflop
  • NAND flipflop
  • N-pass flipflop
  • TSPC flipflop (True Single Phase Clock)
  • We chose the TSPC flipflop because it was the
    fastest and reasonably smaller

7
Choosing a flipflop for the registers...
8
REGISTER SCHEMATIC
9
PROPAGATION DELAY FOR REGISTER
DELAY TIME 68 ps
10
Propagation Delay for Mux
Propagation Delay between A and Y is 111
picoseconds
11
Critical Path Through Adder
  • Worst Case Scenario would be
  • 11001 00111
  • 11001
  • 00111
  • 11110
  • 11100
  • 110..
  • 10
  • 10..

Ripples through five times
12
Propagation Delay for Adder
PROPAGATION DELAY FOR OLD ADDER
Delay Time between A and Cout is 930
picoseconds
DELAY 930 ps
13
3-bit Carry Lookahead Adder
14
PROPAGATION DELAY FOR THE NEW ADDER
DELAY 608 ps
15
Transistor Count
  • Old Adders (2 168) 110 446
  • Optimized Adders (2 230) 110 570
  • Number of Increased Gates 124
  • Delay time decreased by 322 ps

16
Transistor Count (cont)
  • Old Registers 160 trans/reg 4 reg 640
  • Optimized Registers 80 trans/reg 4 reg 320
    gates
  • Number of Saved Gates 320 gates
  • Old Counters 1250 gates (estimated)
  • New Counters 3680 gates

17
Transistor Count (cont)
  • Original FSM 600 gates
  • Optimized FSM 420 gates
  • Number of Saved Gates 180 gates
  • New Revised Total FSM Adders Regs
    CountersMuxesRAMROM 420 570 320 3680
    550 1150 4700 11390 transistors

18
Problems/Concerns
  • Bad rise and fall times in optimized adder
  • Verify the schematic of entire design
  • Implementation of new module (asymmetric key
    encryption) ?

19
Any Questions?
Write a Comment
User Comments (0)
About PowerShow.com