Scribd Logo
Upload

Welcome to Scribd!

  • Bulova Algebra

    Uploaded by

    vdjosa
    68 views24 pages
    George Boole developed Boolean algebra in the 1850s, a new mathematical system using logical expressions that can only be true or false. The basic principles of Boolean algebra are that logical statements combine using AND, OR, and NOT operators and can be represented symbolically or in truth tables. Claude Shannon later applied Boolean algebra's binary true-false values of 0 and 1 to electronic circuits, allowing logical functions to be represented graphically or as equations.

    Original Description:

    Bulova algebra

    Original Title

    Bulova Algebra (2)

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    George Boole developed Boolean algebra in the 1850s, a new mathematical system using logical expressions that can only be true or false. The basic principles of Boolean algebra are that logical statements combine using AND, OR, and NOT operators and can be represented symbolically or in truth tables. Claude Shannon later applied Boolean algebra's binary true-false values of 0 and 1 to electronic circuits, allowing logical functions to be represented graphically or as equations.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    68 views24 pages

    Bulova Algebra

    Uploaded by

    vdjosa
    George Boole developed Boolean algebra in the 1850s, a new mathematical system using logical expressions that can only be true or false. The basic principles of Boolean algebra are that logical statements combine using AND, OR, and NOT operators and can be represented symbolically or in truth tables. Claude Shannon later applied Boolean algebra's binary true-false values of 0 and 1 to electronic circuits, allowing logical functions to be represented graphically or as equations.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 24

    Osnovi digitalne elektronike

    BULOVA ALGEBRA
    (2)
    Dr Bratislav Blagojevi- prof

    UVOD
    Oko 1850, Britanski matematiar George Boole , je
    razvio novu matematiku koja je poznata kao Bulova
    algebra.

    Osnovna naela Bulove algebre su:


    1. Logiki iskaz moe imati samo tanu (TRUE) ili
    netanu vrednost (FALSE).
    2. Logiki iskazi se mogu kombinovati na razne
    naine. Ako se iskazi kombinuju I (AND) operatorom
    nazivaju se konjunkcije. Iskazi kombinovani ILI (OR)
    operatorom nazivaju se disjunkcije.
    3. Veza izmeu logikih iskaza moe biti prikazana
    simbolikom logikom putem jednaina ili tablicom
    istinitosti.

    Operatori u Bulovoj algebri


    Tek je Shannon, koncept Bulove agebre (TRUE- FALSE),
    primenio na binarne vrednosti 0 i 1, koje se jednostavno
    mogu realizovati elektronskim kolima.
    Logike funkcije se mogu predstaviti grafikim simbolima,
    jednainama ili tablicom istinitosti.
    Simboli &, |, ^ i - se koriste da predstave:

    I (AND),

    ILI (OR),
    ISKLJUIVO ILI (XOR)
    NEGACIJU (NOT), (horizontalna linija).

    Diagram

    OSNOVNE JEDNAKOSTI U BULOVOJ ALGEBRI

    Napomena:
    Obavezno
    PREPISATI U SVESKU

    REALIZACIJA BULOVIH FUNKCIJA

    Postoje dve tehnike za realizaciju Bulovih jednaina direktno iz


    tabele istinitosti.
    Kod prve tehnike formiraju se mintermi za svaku liniji iz tabele
    istinitosti iji je izlaz jednak 1 a zatim se povezuju ILI operaterom.
    Ova realizacija se naziva suma-proizvoda.
    Kod druge tehnike formiraju se maxtermi za svaku liniji iz tabele
    istinitosti iji je izlaz jednak 0 a zatim se povezuju I operaterom.
    Ova realizacija se naziva proizvod-suma.

    You might also like