Scribd Logo
Upload

Welcome to Scribd!

  • DiseÑo de Circuito Combinacional

    Uploaded by

    SistemasUnica
    85 views7 pages

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX or read online from Scribd
    Flag for inappropriate content
    85 views7 pages

    DiseÑo de Circuito Combinacional

    Uploaded by

    SistemasUnica

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX or read online from Scribd
    Flag for inappropriate content
    of 7

    [Escribir el título

    del documento]
    [Escribir el subtítulo del
    documento]

    [Escriba aquí una descripción breve del


    documento. Una descripción breve es un
    resumen corto del contenido del
    documento. Escriba aquí una descripción
    breve del documento. Una descripción
    breve es un resumen corto del contenido
    del documento.]

    Farid Ivanir Escate P.


    16/02/2009
    DISEÑO DE CIRCUITO COMBINACIONAL

    1. Definir entradas y salidas

    2. Tabla de verdad

    3. Métodos

    3.1.Por Minterminos

    3.2.Por Maxterminos

    4. Mapa de karnaugh

    4.1.Minterminos

    4.2.Maxterminos

    5. Simplificar teorema algebra de bool

    6. Implementar

    6.1.Puertas lógicas

    6.2.TTL

    6.3.ANSI/IEEE

    7. Simular

    8. Conclusiones
    1. DEFINIR ENTRADAS Y SALIDAS

    B43210ENTRADA
    S SALIDA
    CODIGO
    CODIGO
    BCD
    JHONSON
    2. TABLA DE VERDAD

    BCD Natural 0 0 0 1 1 2
    Decim 0 0 1 1 1 3
    8 4 2
    al 0 1 1 1 1 4
    1
    B0 B1 B2 B3 1 1 1 1 1 5
    0 0 0 0 0 1 1 1 1 0 6
    1 0 0 0 1 1 1 1 0 0 7
    2 0 0 1 0 1 1 0 0 0 8
    3 0 0 1 1 1 0 0 0 0 9
    4 0 1 0 0 x x x x x 10
    5 0 1 0 1 x x x x x 11
    6 0 1 1 0 x x x x x 12
    7 0 1 1 1 x x x x x 13
    8 1 0 0 0 x x x x x 14
    9 1 0 0 1 x x x x x 15
    10 1 0 1 0
    11 1 0 1 1
    12 1 1 0 0
    13 1 1 0 1
    14 1 1 1 0
    15 1 1 1 1
    JHONSON m

    S0 S1 S2 S3 S4
    0 0 0 0 0 0
    0 0 0 0 1 1
    3. Métodos

    3.1. Por Minterminos

    S0=5,6,7,8,9+d10,11,12,13,14,15

    S1=4,5,6,7,8+d10,11,12,13,14,15

    S2=3,4,5,6,7+d10,11,12,13,14,15

    S3=2,3,4,5,6+d10,11,12,13,14,15

    S4=1,2,3,4,5+d10,11,12,13,14,15

    3.2. Por Maxterminos


    S0=0,1,2,3,4+d10,11,12,13,14,15

    S1=0,1,2,3,9+d10,11,12,13,14,15

    S2=0,1,2,8,9+d10,11,12,13,14,15

    S3=0,1,7,8,9+d10,11,12,13,14,15

    S4=0,6,7,8,9+d10,11,12,13,14,15

    4. MAPAS DE KARNAUGTH

    4.1. MINTERMINOS

    S0=5,6,7,8,9+d10,11,12,13,14,15

    B2 B2

    B2
    B3
    01 11 10
    B0 B1
    1 00
    00 0 1 3 B1 2

    B0

    4 5 7 6

    1B1
    01 1 1

    12 13 15 14

    x
    B0
    11 x x x

    8 9 11 10
    B1

    10
    1 1 x x

    B3 B3 B3

    S0=

    S0=B0+B1B2+B3

    S0=B0+B1B2.B3

    S0=B0+B1(B2.B3)

    S1=4,5,6,7,8+d10,11,12,13,14,15

    B2 B2
    B2
    B3
    01 11 10
    B0 B1
    1 00
    00 0 1 3 B1 2

    B0

    4 5 7 6

    1B1
    01 1 1 1

    12 13 15 14

    11
    B0
    x x x x
    8 9 11 10
    B1

    10
    1 x x

    B3 B3 B3

    S0=B1+B0.B3

    S0=B0+B1B2+B3

    S0=B0+B1B2.B3

    S0=B0+B1(B2.B3)

    You might also like