1 / 12

Multi-Level Programmable Array

Multi-Level Programmable Array. 20023179 Kim, Hyung ock. Inroduction. Regular Structures Why? Easy to P&R( almost no need to P&R ) Examples PLA – like Binary Tree base Lattice Diagram Better solution than UAA UAA is treated as attempt to combine PLA-like and tree-like. Inroduction.

willa
Download Presentation

Multi-Level Programmable Array

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Multi-Level Programmable Array 20023179 Kim, Hyung ock

  2. Inroduction • Regular Structures • Why? Easy to P&R( almost no need to P&R ) • Examples • PLA – like • Binary Tree base • Lattice Diagram • Better solution than UAA • UAA is treated as attempt to combine PLA-like and tree-like

  3. Inroduction • This Presentation is composed as following • Intro to Lattice Diagram • MOPS for multiple-out Lattice Diagram • Generalized architecture for MOPS

  4. 1. Intro to Lattice Diagram • Chacteristics • Like Tree and similar to BDD. • BDD has combined predecessors if and only if predecessors in the same level is equal. • But Lattice Diagram has always combine neighbor predecessors by some Rule. It occurs repetition of control variables. • Although BDD grows horizontally, Lattice grows vertically by the repetition of variables… • BDD and Lattice Diagram is made of MUX.

  5. S1 S2 S1 S2 a a a` a` a` a P1-1 P1-2 P2-2 P2-2 P2-2 P1-1 (a AND P1-2) XOR (a’ AND P2-1) 1. Intro to Lattice Diagram • Combining Rule • Basic rule is the combining of two predecessors by XOR • More rule and method are introduced in “LATTICE DIAGRAMS USING REED-MULLER LOGIC” by Perkowski

  6. 2. MOPS for multiple-out Lattice • Some problems in Lattice Diagram • Repetition of control variable • It increases vertical depth. • This problem controlled by variable ordering. • In the case of multi-output func • Ordering is not easy to be performed • There is quite waste for one block • And Partitions generate big empty subareas • Not good method, it leads to horizontal growth.

  7. 2. MOPS for multiple-out Lattice • Functional Decomposition • Basic conception is to divide function to sub-functions • There are some decomposition methods • AND Decomposition, OR ~, Decomposition with Mux • Multi-output func can be decomposed by symmetric func • Multi-output func can be composed of Boolean operation(AND, OR, EXOR) of symmetric funcs. • Because of no repetition of variable in symmetric func, this method is very nice to reduce vertical depth.

  8. c,d 00 01 11 10 F(a,b,c,d) : It polarity 1111 = S3,4 0 0 0 0 a,b 00 01 11 10 0 0 0 1 1 0 1 1 0 0 0 1 2. MOPS for multiple-out Lattice • What is symmetric func? • All minterms that have same number of ones in their binary number have same value( zero, or one ). • Eg

  9. a b c d S1 S2 S3 S4 2. MOPS for multiple-out Lattice • MOPS for 4-variables • MOPS is one diagram but it can express all symmetric func which has same polarity • So that reason, it reduces horizontal width compare to partition-method.

  10. a b c,d c 00 01 11 10 0 0 0 0 a,b 00 01 11 10 d 0 0 0 1 S1 S2 S4 S3 1 0 1 1 0 0 0 1 + F 2. MOPS for Multiple-out Lattice • Examples of using MOPS • F = (~b XOR ~d) OR ( a XOR c ) OR ( abcd )  It is decomposed to two symmetric functions S3, S4 that have same polarity

  11. MOPS polarity1 MOPS polarity2 OR plane 3.Generalized architecture for MOPS • Every multi-output Boolean func can be decomposed to vector-OR of symmetric func of variable polarity • Each MOPS has same control variable but different polarity • Outputs of two MOPSes are combined in OR plane

  12. MOPS1 MOPS2 MOPS3 AND/OR plane 3.Generalized architecture for MOPS • Every multi-output func with subset SVi, i= 1~k of mutual symmetric variables can be decompsed to serial composition of K MOPS arrays followed by AND/OR plane. • F( SV ) = f1( SV1 ) OR f2( SV2 ) … OR fk( SVk ) • Each fi( SVi ) is symmetric , it can be expressed by one MOPS SV1 SV2 SV3

More Related