1-codage, circuits logique, architecture.pdf

Upload: gargield63

Post on 03-Apr-2018

230 views

Category:

Documents


0 download

TRANSCRIPT

  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    1/68

    1/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e , c i r c u i t s l o g i q u e s , a r c h i t e c t u r e

    I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    D a m i e n M a s s < d a m i e n . m a s s e @ u n i v - b r e s t . f r >

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    2/68

    2/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    D e s c r i p t i o n d u c o u r s

    Q u ' e s t - c e q u ' u n o r d i n a t e u r ?

    1 . S i g n i c a t i o n d e s d o n n e s : l e c o d a g e .

    2 . O p r a t i o n s s u r l e s d o n n e s : l e s c i r c u i t s l o g i q u e s .

    3 . M o d l e d ' o r d i n a t e u r : l ' a r c h i t e c t u r e .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    3/68

    3/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e

    I n f o r m a t i q u e : t r a i t e m e n t a u t o m a t i s d ' i n f o r m a t i o n s p a r o r d i n a t e u r .

    L e c o d a g e d s i g n e l a f a o n d e r e p r s e n t e r l ' i n f o r m a t i o n e n u n e d o n n e ( o b j e c t

    c o n c r e t ) . L e s e n s d e c e c o d a g e ( l a c o r r e s p o n d a n c e e n t r e d o n n e e t i n f o r m a t i o n )

    e s t f a i t p a r l ' h u m a i n .

    t r a i t e m e n t

    I n f o r m a t i o n s

    o r d i n a t e u r h u m a i n

    D c o d a g e

    C o d a g e

    D o n n e s

    L ' i d e d e c o d a g e e s t i n d p e n d a n t e d e s o r d i n a t e u r s .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    4/68

    4/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x e m p l e : c r i t u r e

    L ' c r i t u r e e s t u n c o d a g e : l ' i n f o r m a t i o n e s t r e p r s e n t e p a r u n e s u i t e d e s y m b o l e s

    ( l e s l e t t r e s ) . L e s o p r a t i o n s d e c o d a g e e t d c o d a g e s o n t f a i t e s p a r l ' h u m a i n .

    N o u s t u d i o n s d a n s l a s u i t e l ' c r i t u r e e t l e c o d a g e d e s n o m b r e s ( i n f o r m a t i o n f a c i l e

    c o d e r ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    5/68

    5/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e d e s e n t i e r s n a t u r e l s

    L e s e n t i e r s n a t u r e l s s e r v e n t c o m p t e r d e s o b j e t s . M a t h m a t i q u e m e n t , o n l e s d n i t

    p a r t i r d u v i d e ( l e z r o ) e t d ' u n e o p r a t i o n s u c c e s s e u r ( l e + 1 ) .

    E x : t r o i s e s t l e s u c c e s s e u r d u s u c c e s s e u r d u s u c c e s s e u r d u v i d e .

    C o u r a m m e n t , l ' c r i t u r e d ' u n e n t i e r s e f a i t l ' a i d e d e d i x s y m b o l e s ( l e s c h i r e s ) :

    0 , 1 , . . . , 9 . O n a p p e l l e c e t t e c r i t u r e l e c o d a g e e n b a s e 1 0 d e s e n t i e r s .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    6/68

    6/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e e n b a s e 1 0

    L e s c h i r e s r e p r s e n t e n t l e s d i x p r e m i e r s e n t i e r s , d a n s l ' o r d r e 0 , 1 , 2 , . . . , 9 .

    U n n o m b r e e s t r e p r s e n t c o m m e u n e s u i t e d e c h i r e s :

    l ' e n t i e r r e p r s e n t p a r l e c h i r e l e p l u s d r o i t e ( l e s u n i t s ) e s t p r i s t e l q u e l ;

    c e l u i r e p r s e n t p a r l e c h i r e s a g a u c h e e s t m u l t i p l i p a r d i x ;

    c e l u i e n c o r e s a g a u c h e p a r d i x f o i s d i x ;

    e t a i n s i d e s u i t e . . .

    L e n o m b r e t o t a l e s t l a s o m m e d e s d i r e n t s n o m b r e s o b t e n u s .

    S i n o t r e n o m b r e e s t c r i t akak1 . . . a0 , l e n o m b r e r e p r s e n t e s t :

    a0 + 10 a1 + 102 a2 + . . . + 10

    k ak

    E x e m p l e : 4 3 2 = 4 * 1 0 0 + 3 * 1 0 + 2 .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    7/68

    7/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e e n b a s e

    nC o d a g e p o s i t i o n n e l l ' a i d e d e b a s e s :

    1 . o n u t i l i s e u n n o m b r e l i m i t d e c h i r e s , e n p a r t a n t d e z r o ;

    2 . l a p o s i t i o n d u c h i r e d a n s l e n o m b r e d o n n e s a v a l e u r .

    D a n s u n c o d a g e e n b a s e n

    :

    o n u t i l i s e n c h i r e s , r e p r s e n t a n t l e s n o m b r e s d e 0 n - 1 ;

    s i u n c h i r e e s t a u k - i m e r a n g ( e n p a r t a n t d e l a d r o i t e , d e 0 ) , c e c h i r e e s t

    m u l t i p l i p a r nk ( e t nk s e r a a p p e l l e p o i d s d u c h i r e d a n s l e n o m b r e ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    8/68

    8/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    N o t e s h i s t o r i q u e s

    L ' i d e d e c o d a g e p o s i t i o n n e l n ' e s t p a s v i d e n t e . L ' c r i t u r e r o m a i n e u t i l i s a i t p l u t t

    u n s y m b o l e d i r e n t p a r c h a n g e m e n t d e d i z a i n e ( I , X , C , M , e t c . . . ) .

    H i s t o r i q u e m e n t , l e s b a s e s 1 2 , 2 0 , 6 0 o n t t u t i l i s e s ( e t a p p a r a i s s e n t e n c o r e p a r -

    f o i s ) . L a b a s e 1 0 s ' e s t p r o g r e s s i v e m e n t i m p o s e p a r t o u t .

    L e c o d a g e p o s i t i o n n e l a t e n v i s a g e n C h i n e e t e n I n d e , a v a n t d ' t r e f o r m a l i s

    d a n s l e m o n d e a r a b e a v e c l ' u s a g e d u 0 .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    9/68

    9/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x e m p l e : l a n u m r a t i o n s h a d o k

    L e s s h a d o k s c o m p t e n t e n b a s e 4 : l e s q u a t r e c h i r e s s o n t d a n s l ' o r d r e G a , B u ,

    Z o , M e u . O n p e u t a l o r s n u m r e r l e s p r e m i e r s n o m b r e s :

    0 G a 4 B u G a 8 Z o G a 1 2 M e u G a 1 6 B u G a G a

    1 B u 5 B u B u 9 Z o B u 1 3 M e u B u 1 7 B u G a B u

    2 Z o 6 B u Z o 1 0 Z o Z o 1 4 M e u Z o 1 8 B u G a Z o

    3 M e u 7 B u M e u 1 1 Z o M e u 1 5 M e u M e u 1 9 B u G a M e u

    D a n s M e u B u , B u a p o u r r a n g 0 e t p o i d s 1 , e t M e u a p o u r r a n g 1 e t p o i d s 4 .

    MeuBu 1 + 3 4 = 13.

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    10/68

    10/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    R e p r s e n t a t i o n d e s c h i r e s

    S i p o s s i b l e , o n u t i l i s e l e s m m e c h i r e s p o u r l a b a s e n e t l a b a s e 1 0 . O n d o n n e a l o r s

    l a b a s e e n i n d i c e :

    (4263) =7

    4 73 + 2 72 + 6 7 + 3 = 1515

    n o m b r e b a s e

    v a l e u r e n b a s e 1 0

    A u - d e l d e 1 0 , o n u t i l i s e l e s l e t t r e s : A p o u r 1 0 , B p o u r 1 1 , e t c . . .

    E x e m p l e : (AD5)17 = 10 172 + 13 17 + 5 = 3116 .

    P o u r d e s t r s g r a n d e b a s e , o n p e u t u t i l i s e r l e s n o m b r e s e n b a s e 1 0 , e n t r e p a r e n t h s e s .

    P a r e x e m p l e :

    ((23)(56)(04))60 = 23 602 + 56 60 + 4 = 86164

    http://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    11/68

    11/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P a s s a g e d e l a b a s e n l a b a s e 1 0

    F a c i l e :

    (akak1 . . . a0)n = a0 + a1 n + a2 n2 + . . . + ak n

    k

    =k

    i=0

    ai ni

    E x e m p l e : T r a d u i r e (4263)7 e n b a s e 1 0 : (4263)7 = 3 + 6 7 + 2 72 + 4 73 = 1515.

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    12/68

    12/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P a s s a g e d e l a b a s e 1 0 l a b a s e n

    P r i n c i p e :

    (akak1 . . . a0)n = a0 + a1 n + . . . + ak nk

    = a0 + n (a1 + n (a2 + n . . . (ak1 + n ak) . . .))

    = a0 + n ( machin )

    L e p r e m i e r c h i r e ( d r o i t e ) e s t d o n c l e r e s t e d e l a d i v i s i o n e u c l i d i e n n e d u

    n o m b r e p a r n.

    E t p o u r l a s u i t e , o n p a r t d u q u o t i e n t ( l e m a c h i n ) , o n d i v i s e p a r n p o u r a v o i r l e

    r e s t e , e t o n r e c o m m e n c e . . .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    13/68

    13/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x e m p l e

    O n c h e r c h e t r a d u i r e 1 5 1 5 e n b a s e 7 .

    1515 7

    3 7

    306 7

    2 4 7

    04

    216

    Sensdele

    cture

    1515 = 7 * 216

    216 = 7 * 30

    30 = 7 * 4

    4 = 7 * 0

    + 3

    + 6

    + 2

    + 4

    D o n c :

    1515 = 3 + 7 ( 6 + 7 ( 2 + 7 4))

    = 3 + 6 7 + 2 72 + 4 73

    = (4263)7

    http://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    14/68

    14/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e e t o r d i n a t e u r s

    D e u x b a s e s ( e n p l u s d e l a b a s e 1 0 ) s o n t u t i l i s e s c o u r a m m e n t p o u r l e s o r d i n a t e u r s :

    l a b a s e d e u x , d i t e a u s s i b i n a i r e , q u i d c r i t c e q u i s e p a s s e a u n i v e a u d e s l s ( 0

    = p a s d e c o u r a n t , 1 = d u c o u r a n t )

    l a b a s e s e i z e , d i t e h e x a d c i m a l e , q u i r e g r o u p e l e s l s p a r 4 .

    U n c h i r e e n b a s e 2 e s t a p p e l u n b i t ( d e l ' a n g l a i s B I n a r y d i g i T , c h i r e b i n a i r e ) .

    D a n s u n n o m b r e b i n a i r e , l e s b i t s g a u c h e s o n t d i t s b i t s d e p o i d s f o r t e t l e s b i t s

    d r o i t e b i t s d e p o i d s f a i b l e s .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    15/68

    15/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e s u r u n o r d i n a t e u r

    U n o r d i n a t e u r a u n e m m o i r e l i m i t e , d o n c o n l i m i t e l a t a i l l e d e s e n t i e r s p a r l e

    n o m b r e d e b i t s c o d a n t l ' e n t i e r .

    C e n o m b r e e s t s o u v e n t u n m u l t i p l e d e 8 ( o n a p p e l l e 8 b i t s u n o c t e t ) .

    U n n o m b r e 8 b i t s i r a d e 0 2 5 5 .

    U n n o m b r e 1 6 b i t s d e 0 6 5 5 3 5 .

    U n n o m b r e 3 2 b i t s d e 0 4 2 9 4 9 6 7 2 9 5 .

    U n n o m b r e 6 4 b i t s d e 0 1 8 4 4 6 7 4 4 0 7 3 7 0 9 5 5 1 6 1 5

    P l u s g n r a l e m e n t , p o u r

    Nb i t s , l e n o m b r e v a d e 0

    2N

    1.

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    16/68

    16/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    R e m a r q u e s

    L o r s q u ' i l e s t d e m a n d d e r e p r s e n t e r u n e n t i e r s u r u n n o m b r e x d e b i t s , i l f a u t

    d o n n e r t o u s l e s c h i r e s , m m e c e u x q u i s o n t n u l s . P a r e x e m p l e , 4 5 s u r 8 b i t s

    00101101.

    O n n e p e u t p a s t e n d r e c o m m e o n v e u t l e n o m b r e d e b i t s r e p r s e n t a n t u n e n t i e r : l e

    d p a s s e m e n t d e l a t a i l l e d ' u n n o m b r e e s t u n e s o u r c e f r q u e n t e d ' e r r e u r s

    i n f o r m a t i q u e s .

    E x e m p l e : s i i l e s t d e m a n d d e c o d e r 2 7 7 s u r 8 b i t s , d i r e s i m p l e m e n t q u e c ' e s t

    i m p o s s i b l e .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    17/68

    17/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e d e s e n t i e r s r e l a t i f s

    E n c o d a g e m a t h m a t i q u e , l a f a o n c o u r a n t e d ' c r i r e u n e n t i e r n g a t i f e s t d e m e t t r e

    u n - d e v a n t s o n n o m b r e c r i t e n v a l e u r a b s o l u . C e l a s e f a i t p o u r t o u t e s l e s b a s e s .

    E x e m p l e :

    1515 = (4263)7

    S u r u n o r d i n a t e u r , o n p a r l e d e c o d a g e d e s e n t i e r s s i g n s ( p a r o p p o s i t i o n a u x

    e n t i e r s n a t u r e l s q u i s o n t d i t s n o n s i g n s ) . O n n e p e u t p a s u t i l i s e r d e s y m b o l e

    p a r t i c u l i e r ( p u i s q u ' o n a q u e d e s 0 e t d e s 1 ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    18/68

    18/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e d e s e n t i e r s s i g n s

    1 e r e s s a i : m e t t r e u n b i t d e s i g n e d e v a n t l e n o m b r e . S i c e b i t e s t 0 , l e n o m b r e

    e s t p o s i t i f , s i c e b i t e s t 1 , c e n o m b r e e s t n g a t i f .

    E x e m p l e : s u r 8 b i t s , - 5 d e v i e n t 1 0 0 0 0 1 0 1 .

    C o n s q u e n c e : c e c o d a g e d p e n d d u n o m b r e d e b i t s u t i l i s s . A i n s i - 5 n e

    s ' c r i r a p a s d e l a m m e f a o n s u r 8 e t 1 6 b i t s . C e s e r a l e c a s p o u r t o u s l e s c o d a g e s

    p o s s i b l e s .

    I n c o n v n i e n t s :

    1 . 0 e s t r e p r s e n t d e u x f o i s ( c o m m e + 0 e t - 0 ) ;

    2 . l e s c a l c u l s s o n t c o m p l i q u s : q u a n d l ' o r d i n a t e u r a d d i t i o n n e d e u x e n t i e r s , i l d o i t

    s a v o i r l ' a v a n c e s ' i l s s o n t s i g n s o u n o n .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    19/68

    19/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o m p l m e n t 2

    I d e : g a r d e r u n b i t d e s i g n e , m a i s r e p r s e n t e r x c o m m e 2N x ( o u N e s t l e

    n o m b r e d e b i t s ) .

    E x e m p l e ( a v e c 3 b i t s , d o n c 2N = 8) :

    B i n . N o n s i g n S i g n

    0 0 0 0 0

    0 0 1 1 1

    0 1 0 2 2

    0 1 1 3 3

    1 0 0 4 4 = 8 - 4 - 4

    1 0 1 5 5 = 8 - 3 - 3

    1 1 0 6 6 = 8 - 2 - 2

    1 1 1 7 7 = 8 - 1 - 1

    E x e m p l e : 1 0 1 v a u t 5 e n n o n s i g n , e t 5 =

    8 - 3 , d o n c a r e p r s e n t e - 3 .

    A v a n t a g e s :

    r e p r s e n t a t i o n u n i q u e ( t o u s l e s n o m b r e s d e

    - 4 3 s o n t r e p r s e n t s d ' u n e s e u l e f a o n )

    o r d r e r e s p e c t , s a u f l e s a u t d e 3 - 4 ;

    c a l c u l s i n d p e n d a n t s d u s i g n e : a + (b

    a u r a l a m m e r e p r s e n t a t i o n q u e a+(2N

    b).

    P r a t i q u e m e n t t o u s l e s p r o g r a m m e s u t i l i s e n t

    c e t t e r e p r s e n t a t i o n .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    20/68

    20/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P a s s a g e d e k k

    T e c h n i q u e p o u r t r o u v e r l a r e p r s e n t a t i o n d e k s u r N b i t s :

    1 . o n c r i t k ;

    2 . o n i n v e r s e t o u s l e s b i t s ;

    ( e n n o n s i g n : (2N 1) k )

    3 . o n a j o u t e 1 .

    ( e n n o n s i g n : 2N k )

    0 0 1

    1 1 0

    1 1 0

    1 1 0 0

    1 1 100

    0

    1 10 0 0

    Inversion

    +1

    = 44

    = 211 = (28 1) 44

    = 212 = 28 44

    R e p r s e n t a t i o n d e - 4 4 s u r 8 b i t s

    C e t t e t e c h n i q u e p e r m e t t o u j o u r s d ' o b t e n i r l ' o p p o s d ' u n n o m b r e ( m m e s ' i l e s t

    n g a t i f a u d b u t ) .

    http://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    21/68

    21/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x t e n s i o n d ' u n n o m b r e s i g n

    L a r e p r s e n t a t i o n d ' u n n o m b r e s i g n d p e n d d u n o m b r e d e b i t s u t i l i s s .

    P o u r a u g m e n t e r l e n o m b r e d e b i t s r e p r s e n t a n t u n n o m b r e s i g n , i l f a u t a j o u t e r

    l e b i t d e s i g n e g a u c h e d u n o m b r e a u t a n t d e f o i s q u e n c e s s a i r e .

    E x e m p l e : p a s s a g e d e 8 1 6 b i t s .

    u n n o m b r e p o s i t i f ( p a r e x e m p l e 4 4 , r e p r s e n t p a r 0 0 1 0 1 1 0 0 ) , s e r a t e n d u p a r d e s

    0 ( d ' o 0 0 0 0 0 0 0 0 0 0 1 0 1 1 0 0 ) .

    u n n o m b r e n g a t i f ( p a r e x e m p l e - 4 4 , r e p r s e n t p a r 1 1 0 1 0 1 0 0 ) , s e r a t e n d u p a r

    d e s 1 ( d ' o 1 1 1 1 1 1 1 1 1 1 0 1 0 1 0 0 ) .

    N o t e : s i l e n o m b r e e s t n o n s i g n , l ' e x t e n s i o n s e f a i t t o u j o u r s e n a j o u t a n t d e s 0 . O n

    d o i t d o n c a v o i r d e u x o p r a t i o n s d ' e x t e n s i o n s q u i p e u v e n t d o n n e r d e s

    r s u l t a t s d i r e n t s .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    22/68

    22/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    I n t e r v a l l e s d e r e p r s e n t a t i o n

    U n e n t i e r s i g n r e p r s e n t s u r N b i t s i r a d e 2N1 2N1 1.

    U n n o m b r e 8 b i t s i r a d e - 1 2 8 1 2 7 .

    U n n o m b r e 1 6 b i t s d e - 3 2 7 6 8 0 3 2 7 6 7 .

    U n n o m b r e 3 2 b i t s d e - 2 1 4 7 4 8 3 6 4 8 2 1 4 7 4 8 3 6 4 7 .

    U n n o m b r e 6 4 b i t s d e e n v i r o n 9 1018 9 1018 .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    23/68

    23/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o d a g e d e s r e l s

    M a t h m a t i q u e m e n t , o n u t i l i s e c o m m u n m e n t u n s p a r a t e u r d c i m a l ( l a v i r g u l e ) .

    E n b a s e 1 0 :

    akak1 . . . a0 , b1 . . . bl = ak.10k + ak1.10

    k1 + . . . + a0

    +b1.101 + b2.10

    2 + . . . + bl.10l

    E n b a s e n :

    (akak1 . . . a0 , b1 . . . bl)n = ak.nk + ak1.n

    k1 + . . . + a0

    +b1.n1 + b2.n

    2 + . . . + bl.nl

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    24/68

    24/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x e m p l e s

    (0, 75)8 =78

    + 582

    = 0, 953125

    (2A, 1C)15 = 2 15 + 10 +1

    15+ 12

    152= 40, 12

    (2, 3)14 = 2 +3

    14= 2, 2142857142857142857 . . . 142857 . . .

    C e r t a i n s n o m b r e s r e p r s e n t a b l e s d e f a o n n i e d a n s u n e b a s e n e l e s o n t p a s d a n s

    u n e a u t r e ( m a i s l e s c h i r e s s u c c e s s i f s s o n t p r i o d i q u e s ) .

    C o n v e n t i o n : p o u r s i m p l i e r , o n r e p r s e n t e l a s u i t e i n n i e d e c h i r e e n s o u l i g n a n t

    s a p r i o d e : 314 = 0, 2142857.

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    25/68

    25/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P a s s a g e d e l a b a s e 10 l a b a s e n

    A v e c u n i q u e m e n t l a p a r t i e f r a c t i o n n a i r e , o n p e u t f a c t o r i s e r l e s 1 / n :

    (0, b0 . . . bl)n =1

    n (b0 +

    1

    n(b1 +

    1

    n. . .))

    =

    1

    n (b

    0 + ( machin ))

    . . . a v e c l e m a c h i n s t r i c t e m e n t i n f r i e u r 1 .

    D o n c l e p r e m i e r c h i r e a p r s l a v i r g u l e e s t l a p a r t i e e n t i r e d u n o m b r e

    m u l t i p l i p a r n

    .

    L e n c o r e , o n p e u t o b t e n i r t o u s l e s c h i r e s s u c c e s s i f s e n r p t a n t l a m u l t i p l i c a t i o n .

    http://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    26/68

    26/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    R e c e t t e

    1 . O n c o m m e n c e p a r c o n v e r t i r l a p a r -

    t i e e n t i r e .

    2 . O n m u l t i p l i e l a p a r t i e f r a c t i o n n a i r e

    p a rn

    .

    3 . L a p a r t i e e n t i r e e s t u n n o u v e a u

    c h i r e .

    4 . O n r e t i r e l a p a r t i e e n t i r e e t o n

    r e v i e n t l ' t a p e 2 , t a n t q u e l e

    n o m b r e e s t n o n n u l .

    Conversion de 24,32 en base 5

    0,32 * 5 = 1 ,6

    0,6 * 5 = 3 ,0 fini

    24 = (44)5

    D o n c 24, 32 = (44, 13)5

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    27/68

    27/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    A u t r e e x e m p l e

    O n v e u t r e p r s e n t e r 0 , 1 4 e n b a s e 1 6 :

    0, 14 16 = 2, 24. O n p r e n d 2 , r e s t e 0 , 2 4 .

    0, 24 16 = 3, 84. O n p r e n d 3 , r e s t e 0 , 8 4 .

    0, 84 16 = 13, 44. O n p r e n d D ( p o u r 1 3 ) , r e s t e 0 , 4 4 .

    0, 44 16 = 7, 04. O n p r e n d 7 , r e s t e 0 , 0 4 .

    0, 04 16 = 0, 64. O n p r e n d 0 , r e s t e 0 , 6 4 .

    0, 64 16 = 10, 24. O n p r e n d A ( p o u r 1 0 ) , r e s t e 0 , 2 4 .

    0, 24 16 = 3, 84. O n p r e n d 3 , r e s t e 0 , 8 4 .

    . . . o n e s t r e v e n u l a s e c o n d e t a p e .

    D o n c 0, 14 = (0, 2 3D70A)16

    L e n c o r e , l a c o n v e r s i o n p e u t n e j a m a i s s ' a r r t e r . O n d e v r a d o n c f a i r e a t t e n t i o n

    r e p r e r l e m o m e n t o o n b o u c l e .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    28/68

    28/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    N o t a t i o n s c i e n t i q u e , f o r m e e x p o n e n t i e l l e n o r m a l i -

    s e

    O n a p p e l l e n o t a t i o n s c i e n t i q u e ( o u f o r m e e x p o n e n t i e l l e n o r m a l i s e ) l a r e p r -

    s e n t a t i o n d e s r e l s l ' a i d e d e d e u x l m e n t s :

    u n n o m b r e

    xa p p e l m a n t i s s e a v e c u n s e u l c h i r e , d i r e n t d e 0 , g a u c h e

    d e l a v i r g u l e ;

    u n e x p o s a n t

    k( q u i e s t u n e n t i e r r e l a t i f ) .

    L e n o m b r e r e l r e p r s e n t t a n t a l o r s x 10k ( o u , e n b a s e b q u e l c o n q u e , x bk ) .

    E x e m p l e : 0, 00425 = 4, 25 103 ; (34, 222)5 = (3, 4222)5 51

    .

    E n b i n a i r e ( o n p a r l e d e f o r m e e x p o n e n t i e l l e b i n a i r e n o r m a l i s e ) , l e c h i r e

    g a u c h e d e l a v i r g u l e p o u r l a m a n t i s s e e s t t o u j o u r s u n 1 ( s a u f p o u r 0 l u i - m m e ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    29/68

    29/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    R e p r s e n t a t i o n s u r o r d i n a t e u r

    L a p l u p a r t d e s s y s t m e s r e p r s e n t e n t l e s r e l s s o u s f o r m e e x p o n e n t i e l l e n o r m a l i s e

    ( o n p a r l e d e n o m b r e v i r g u l e s o t t a n t e s o u s i m p l e m e n t d e o t t a n t s ) .

    O n a c c o r d e u n b i t d e s i g n e , u n n o m b r e d e b i t s x s p o u r l ' e x p o s a n t e t u n n o m b r e

    d e b i t s x s p o u r l a m a n t i s s e .

    Signe Exposant Mantisse

    N o u s t u d i e r o n s s p c i q u e m e n t i c i l a r e p r s e n t a t i o n d n i e p a r l a n o r m e I E E E 7 5 4 ,

    l a p l u s s t a n d a r d ( I E E E = I n s t i t u t e o f E l e c t r i c a l a n d E l e c t r o n i c s E n g i n e e r s , I n c . ,

    f o n d e n 1 9 6 3 ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    30/68

    30/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    M a n t i s s e b i t c a c h

    C o m m e l e p r e m i e r c h i r e d e l a m a n t i s s e v a u t t o u j o u r s 1, i l n ' e s t p a s n c e s s a i r e d e

    l ' a j o u t e r . O n c r i r a d o n c u n i q u e m e n t l a p a r t i e f r a c t i o n n a i r e d e l a m a n t i s s e , o n p a r l e

    d e m a n t i s s e b i t c a c h .

    E x e m p l e : r e p r s e n t a t i o n d e 1, 01101123 . L e b i t d e s i g n e v a u t 0 e t l a m a n t i s s e ( i c i

    s u r 9 b i t s ) s ' c r i t 011011000.

    Exposant0 0 0 01 1 1 1 0 0

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    31/68

    31/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x p o s a n t b i a i s

    S i l ' e x p o s a n t e s t r e p r s e n t s u r t b i t s , o n r e p r s e n t e r a l ' e x p o s a n t e s o u s u n e f o r m e

    d c a l e

    q = e + 2t1

    1. O n p a r l e d ' e x p o s a n t b i a i s (

    2t1

    1e s t a p p e l l e b i a i s

    d e l a r e p r s e n t a t i o n ) .

    E x e m p l e : r e p r s e n t a t i o n d e 1, 01101123 , a v e c u n e x p o s a n t s u r 4 b i t s . O n r e p r s e n t e

    d o n c q = 3 + 23 1 = 10 = (1010)4 .

    0 0 01 1 1 1 0 00 1 0 1 0

    C o m m e q d o i t t r e c o m p r i s e n t r e 0 e t 2t 1, i l f a u t q u e e s o i t e n t r e 2t

    1 + 1 e t

    2t1 .

    http://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    32/68

    32/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    L i m i t e s d e l a r e p r s e n t a t i o n

    U n e x p o s a n t t r o p g r a n d o u t r o p p e t i t n e p e u t p a s t r e r e p r s e n t , c e q u i l i m i t e l e s

    o t t a n t s p o s s i b l e s e n d e u x z o n e s .

    0

    ( n g a t i f s ) ( p o s i t i f s )

    e x p o s a n t s

    t r o p g r a n d s

    e x p o s a n t s

    t r o p g r a n d s

    r e p r s e n t a b l e

    e x p o s a n t s

    t r o p p e t i t s

    r e p r s e n t a b l e

    P r c i s i o n E x p o s a n t M a n t i s s e L i m i t e i n f . L i m i t e S u p .

    S i m p l e ( 3 2 b i t s ) 8 b i t s 2 3 b i t s 1, 2 1038 3, 4 10+38

    D o u b l e ( 6 4 b i t s ) 1 1 b i t s 5 2 b i t s 2, 2 10308 1, 8 10+308

    C o m m e l a m a n t i s s e e s t n i e , o n a a u s s i d e s e r r e u r s d ' a r r o n d i .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    33/68

    33/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C a s p a r t i c u l i e r s

    A n d ' a m l i o r e r l a r e p r s e n t a t i o n , l a n o r m e p r v o i t q u e l q u e s c a s p a r t i c u l i e r s :

    S i l ' e x p o s a n t e t l a m a n t i s s e s o n t 0 , a l o r s l e n o m b r e r e p r s e n t e s t 0 . A v e c l e b i t

    d e s i g n e 1 , o n a - 0 .

    Q u a n d t o u s l e s b i t s d ' e x p o s a n t s s o n t 0 , o n n e p r e n d p l u s e n c o m p t e l e b i t

    c a c h ( o n p a r l e d e n o m b r e s d n o r m a l i s s ) , c e q u i p e r m e t d ' t e n d r e u n p e u l a

    r e p r s e n t a t i o n v e r s l e s p e t i t s n o m b r e s .

    S i t o u s l e s b i t s d ' e x p o s a n t s 1 e t q u e l a m a n t i s s e e s t 0 , o n r e p r s e n t e l ' i n n i

    ( r e s p e c t i v e m e n t p l u s o u m o i n s l ' i n n i ) .

    S i t o u s l e s b i t s d ' e x p o s a n t s s o n t 1 e t q u e l a m a n t i s s e n ' e s t p a s 0 , c e l a r e p r s e n t e

    p a s u n n o m b r e ( o u N a N , n o t a n u m b e r ) . C e l a s e r t p o u r l e s c a l c u l s i n c o r r e c t s

    ( d i v i s i o n s p a r z r o . . . ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    34/68

    34/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o n c l u s i o n ( c o d a g e )

    1 . U n n o m b r e , d a n s l ' o r d i n a t e u r , e s t r e p r s e n t l ' a i d e d ' u n g r o u p e d e l d a n s

    u n f o r m a t b i n a i r e :

    u n e t e n s i o n n o n n u l l e r e p r s e n t e u n 1 ;

    u n e t e n s i o n n u l l e r e p r s e n t e u n 0 .

    00

    1

    1

    (1001)2 = 9

    2 . P o u r l e s n o m b r e s r e l a t i f s , r e p r s e n t a t i o n e n c o m p l m e n t 2 .

    3 . P o u r l e s n o m b r e s n o n e n t i e r s , u n e r e p r s e n t a t i o n v i r g u l e o t t a n t e .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    35/68

    35/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C i r c u i t s l o g i q u e s

    N o u s a v o n s v u c o m m e n t l ' o r d i n a t e u r r e p r s e n t e l e s n o m b r e s . L a q u e s t i o n e s t m a i n -

    t e n a n t : c o m m e l ' o r d i n a t e u r m a n i p u l e c e s n o m b r e s ?

    U n c i r c u i t l o g i q u e e s t u n e b o i t e q u i p r e n d d e s e n t r e s ( b i n a i r e s ) e t r e n v o i e

    d e s s o r t i e s ( b i n a i r e s ) .

    Entrees

    0 1 0 1

    Sorties

    http://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    36/68

    36/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x e m p l e : a d d i t i o n n e u r 4 b i t s

    C e c i r c u i t p r e n d 8 e n t r e s ( 2 e n t r e s d e 4 l s , c h a c u n e r e p r s e n t a n t u n n o m b r e s u r

    4 b i t s ) , e t d i s p o s e d e 5 s o r t i e s , d o n n a n t l a s o m m e d e s d e u x n o m b r e s e n e n t r e s .

    1

    0

    01

    1

    1

    0

    0

    1 0 0 1

    + 1 1 0 0

    1 0 1 0 1

    1

    0

    0

    1

    0

    01

    1

    0

    1

    1

    1

    0

    +

    0 1 1 1

    0 1 0 0

    1 0 1 1

    1

    1

    1

    0

    0

    ( s o i t , e n b a s e 1 0 , 9 + 12 = 21 ) ( o u 7 + 4 = 11 )

    E n b i n a i r e ,

    U n o r d i n a t e u r p o u r r a i t a l o r s t r e u n g r a n d c i r c u i t l o g i q u e .

    A u t r e e x e m p l e : m m o i r e l m e n t a i r e

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    37/68

    37/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    O n d i p o s e d e d e u x e n t r e s : u n e d o n n e e t u n e c o m m a n d e , e t u n e s o r t i e .

    c o m m a n d e 0 : l a s o r t i e n e c h a n g e p a s .

    c o m m a n d e 1 : l a s o r t i e p r e n d l a v a l e u r e n d o n n e .

    0 ou1

    0

    ? 0 0

    01

    1

    111

    0

    0 ou 1

    donnee

    commande

    sortie

    0 ou 1

    0

    L o g i q u e s c o m b i n a t o i r e e t s q u e n t i e l l e

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    38/68

    38/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    L e s c i r c u i t s l o g i q u e s c o m b i n a t o i r e s s o n t d e s c i r c u i t s o l e s v a l e u r s d e s o r t i e s n e

    d p e n d e n t q u e d e s v a l e u r s d ' e n t r e s a u m m e i n s t a n t . E x e m p l e : a d d i t i o n n e u r .

    L e s c i r c u i t s l o g i q u e s s q u e n t i e l s s o n t d e s c i r c u i t s o l e s v a l e u r s d e s o r t i e s d -

    p e n d e n t e n p l u s d ' u n t a t i n t e r n e d u c i r c u i t ( o n p e u t r e p r s e n t e r c e t t a t p a r u n e

    r t r o a c t i o n ) . E x e m p l e : m m o i r e .

    ei sjei sj

    qk

    L o g i q u e c o m b i n a t o i r e L o g i q u e s q u e n t i e l l e

    sj = f(..., ei,...) sj = f(..., ei,...,qk,...)qk = g(..., ei,...,qk,...)

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    39/68

    39/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    L o g i q u e c o m b i n a t o i r e

    L a t a b l e d e v r i t d ' u n c i r c u i t l o g i q u e c o m b i n a t o i r e e s t u n t a b l e a u d o n n a n t l e s

    v a l e u r s d e s o r t i e s e n f o n c t i o n d e s v a l e u r s p o s s i b l e s d ' e n t r e s .

    E x e m p l e : u n m u l t i p l e x e u r ( q u i p e r m e t d e c h o i s i r u n e e n t r e , i c i s = ec ) .

    c

    se0

    e1

    e0 e1 c s

    0 0 0 0

    0 0 1 0

    0 1 0 0

    0 1 1 1

    e0 e1 c s

    1 0 0 1

    1 0 1 0

    1 1 0 1

    1 1 1 1

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    40/68

    40/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P o r t e s l o g i q u e s

    C e s o n t d e s c i r c u i t s l o g i q u e s l m e n t a i r e s .

    D e s s i n N o m , n o t a t i o n T a b l e d e v r i t

    sb

    aP o r t e O U ( O R )

    s = a b o u s = a + b

    s = 1 s i a O U b s o n t 1 .

    a b s a b s

    0 0 0 1 0 1

    0 1 1 1 1 1

    sb

    aP o r t e E T ( A N D )

    s = a b o u s = a.b

    s = 1 s i a E T b s o n t 1 .

    a b s a b s

    0 0 0 1 0 0

    0 1 0 1 1 1

    se

    P o r t e N O N ( N O T ) o u i n v e r s e u r

    s = eo u

    s = es

    e s t l ' i n v e r s e d e e

    .

    e s

    0 1

    1 0

    P o r t e s l o g i q u e ( s u i t e )

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    41/68

    41/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    D e s s i n N o m , n o t a t i o n T a b l e d e v r i t

    b

    a

    sP o r t e N O N O U ( N O R )

    s = (a b) o u s = a + b

    a b s a b s

    0 0 1 1 0 0

    0 1 0 1 1 0

    b

    as

    P o r t e N O N E T ( N A N D )

    s = (a b)o u

    s = a.b

    a b s a b s

    0 0 1 1 0 1

    0 1 1 1 1 0

    b

    as

    P o r t e O U e x c l u s i f ( X O R )

    s = a b

    a b s a b s

    0 0 0 1 0 1

    0 1 1 1 1 0

    L a p o r t e O U e x c l u s i f s e v o i t f r q u e m m e n t m a i s n ' e s t p a s v r a i m e n t u n e p o r t e l -

    m e n t a i r e .

    U t i l i s a t i o n d e s p o r t e s l o g i q u e s

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    42/68

    42/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    T o u t c i r c u i t l o g i q u e c o m b i n a t o i r e p e u t t r e o b t e n u e n c o m b i n a n t d e s p o r t e s l m e n -

    t a i r e s , c o m m e u n c i r c u i t l e c t r i q u e .

    E x e m p l e : o n p e u t r e p r o d u i r e n o t r e m u l t i p l e x e u r , i c i v r i d a n s l e c a s

    e0 = 1,

    e1 = 0 e t c = 0.

    c

    e1

    1

    N O T

    0

    0

    1

    s

    1

    0

    A N D

    A N D

    1

    1

    e0

    O R

    O R

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    43/68

    43/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    t u d e m a t h m a t i q u e : l ' a l g b r e d e B o o l e

    L ' a l g b r e d e B o o l e ( o u a l g b r e b o o l e n n e ) f o r m a l i s e l e s c a l c u l s d e c i r c u i t s c o m -

    b i n a t o i r e s e t l e s r a i s o n n e m e n t s l o g i q u e s .

    L ' a l g b r e e s t d n i e p a r u n e n s e m b l e d e d e u x v a l e u r s {0, 1} ( o u {faux, vrai}) e t

    t r o i s o p r a t e u r s , l e + ( l e o u ) , l e . ( l e e t ) e t l e ( l e n o n ) .

    N o t e : p a r c o n v e n t i o n , l ' o p r a t e u r . e s t p r i o r i t a i r e s u r l ' o p r a t e u r +.

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    44/68

    44/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P r o p r i t s d u E T

    1.a = a ( i d e n t i t ) ;

    0.a = 0 ( n u l l i t ) ;

    a.a = a ( i d e m p o t e n c e ) ;

    a.b = b.a ( c o m m u t a t i v i t ) ;

    (a.b).c = a.(b.c) ( a s s o c i a t i v i t ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    45/68

    45/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P r o p r i t s d u O U

    0 + a = a ( i d e n t i t ) ;

    1 + a = 0 ( n u l l i t ) ;

    a + a = a ( i d e m p o t e n c e ) ;

    a + b = b + a ( c o m m u t a t i v i t ) ;

    (a + b) + c = a + (b + c) ( a s s o c i a t i v i t ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    46/68

    46/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    A u t r e s p r o p r i t s

    D i s t r i b u t i v i t :

    a . ( b + c ) = a . b + a . c

    a + ( b . c ) = ( a + b ) . ( a + c )

    A b s o r p t i o n :

    a . ( a + b ) = a

    a + a . b = a

    A v e c l a n g a t i o n :

    a = a ;

    a + a = 1 ( l o i d ' i n v e r s i o n ) ;

    a.a = 0( l o i d ' i n v e r s i o n ) .

    L o i s d e M o r g a n

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    47/68

    47/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P o u r t o u t a

    ,b

    :

    a.b = a + b ,

    e t

    a + b = a.b.

    a b a b a + b a.b a.b a + b

    0 0 1 1 1 1 1 1

    0 1 1 0 0 0 1 1

    1 0 0 1 0 0 1 1

    1 1 0 0 0 0 0 0

    L e s l o i s d e M o r g a n p e r m e t t e n t d e d p l a c e r l e s o p r a t e u r s N O N d a n s l e c a l c u l .

    P a r e x e m p l e :

    (a.b) + b.c = a.b.b.c = (a + b).b.c

    C a l c u l b o o l e n

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    48/68

    48/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    O n p e u t a l o r s e x p r i m e r l a s o r t i e d ' u n c i r c u i t l o g i q u e c o m b i n a t o i r e l ' a i d e d ' u n e

    f o r m u l e b o o l e n n e . P a r e x e m p l e , p o u r l e m u l t i p l e x e u r , l a f o r m u l e c o r r e s p o n d

    n o t r e c i r c u i t t a i t :

    s = (e0 + c).c + (e0 + c).e1

    L e s p r o p r i t s v u e s a u p a r a v a n t p e r m e t t e n t d ' o b t e n i r d e s c i r c u i t s q u i v a l e n t s .

    1 . P a r f a c t o r i s a t i o n , s = (e0 + c).(e1 + c) , c e q u i d o n n e u n c i r c u i t p l u s s i m p l e .

    2 . E n d v e l o p p a n t , l e c a l c u l e s t p l u s c o m p l e x e :

    s = e0.c + c.c + e0.e1 + c.e1 ( d e v e l o p p e m e n t )

    = e0.c + e0.e1 + c.e1 ( c a r c.c = 0)

    = e0.c + e0.e1.(c + c) + c.e1 ( c a r c + c = 1)

    = e0.c.(1 + e1) + c.e1.(1 + e0) ( d v e l o p p e m e n t p u i s f a c t o r i s a t i o n )

    = e0.c + c.e1 ( c a r 1 + a = 1) ,

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    49/68

    49/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    M u l t i p l e x e u r s i m p l i

    c

    s

    e1

    e0

    N O T

    O R

    A N D

    A N D

    c

    e1

    e0

    N O T

    O R

    A N D

    s

    O R

    e0.c

    e1.c

    e0 + c

    e1 + c

    s = e0.c + e1.c s = (e0 + c).(e1 + c)

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    50/68

    50/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    B i l a n

    1 . O n p e u t m a n i p u l e r l e s d o n n e s b i n a i r e s l ' a i d e d e c i r c u i t s l o g i q u e s , s q u e n -

    t i e l s e t c o m b i n a t o i r e s .

    2 . C e s c i r c u i t s s o n t c o n s t r u i t s p a r t i r d e p o r t e s l o g i q u e s .

    3 . L ' a l g b r e d e B o o l e p e r m e t d e f a i r e l e s c a l c u l s r e l a t i f s a u x c i r c u i t s l o g i q u e s .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    51/68

    51/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    A r c h i t e c t u r e

    U n o r d i n a t e u r d o i t c o n t e n i r :

    1 . u n i m m e n s e c i r c u i t l o g i q u e c o m b i n a t o i r e q u i f a i t l e s c a l c u l s ;

    2 . u n e m m o i r e ( c i r c u i t l o g i q u e s q u e n t i e l ) p o u r d c r i r e s o n t a t ;

    3 . u n e h o r l o g e p o u r s y n c h r o n i s e r l e s o p r a t i o n s .

    4 . e t c ' e s t ( p r e s q u e ) t o u t !

    Horloge Entrees/Sorties(ecran, clavier...)

    MemoireUnite de calcul

    A r c h i t e c t u r e ( s u i t e )

    http://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    52/68

    52/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P o u r a v o i r u n e m a c h i n e p o l y v a l e n t e , o n u t i l i s e l e m o d l e d e m a c h i n e s p r o -

    g r a m m e e n r e g i s t r : l e p r o g r a m m e e x c u t e r s e t r o u v e d a n s l a m m o i r e s o u s

    l a f o r m e d ' i n s t r u c t i o n s s i m p l e s .

    D o n c , p a s d e d i r e n c e a p r i o r i e n t r e i n s t r u c t i o n s e t d o n n e s ( c o n t r a i r e m e n t l a

    m a c h i n e d e B a b b a g e ) .

    Memoire

    linstructionDecodage de

    Traitement de

    linstruction, calculs

    ProcesseurDonnees du programm

    Code du programme

    Lit la memoire...

    Additionne ...Range en memoire...........

    +123.232

    "Cours de S1"

    ......

    "Ceci est une phrase."

    http://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.htmlhttp://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    53/68

    53/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    L e p r o c e s s e u r

    L e c i r c u i t q u i e x c u t e l e s i n s t r u c t i o n s e s t a p p e l p r o c e s s e u r . U n p r o c e s s e u r d o i t

    c o m p r e n d r e e n p a r t i c u l i e r :

    1 . u n e u n i t d e c o n t r l e ( o u u n i t d e c o m m a n d e ) q u i d c o d e e t i n t e r p r t e l e s

    i n s t r u c t i o n s ;

    2 . u n e u n i t a r i t h m t i q u e e t l o g i q u e ( U A L ) q u i f a i t l e s c a l c u l s ( a d d i t i o n s ,

    s o u s t r a c t i o n s , c o m p a r a i s o n s . . . ) .

    3 . u n e p e t i t e m m o i r e i n t e r n e , a p p e l l e s r e g i s t r e s .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    54/68

    54/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P r o c e s s e u r ( s u i t e )

    Unite de

    controle

    U.A.L.

    Registres

    Interface memoire

    Instructions

    Memoire

    Bus

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    55/68

    55/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    B u s

    U n b u s e s t u n e n s e m b l e d e l i g n e s ( d e l s ) , q u i p e r m e t d e t r a n s m e t t r e u n e d o n n e

    d ' u n l m e n t l ' a u t r e :

    a u s e i n m m e d u p r o c e s s e u r ;

    o u e n t r e l e p r o c e s s e u r e t l a m m o i r e .

    U n b u s p e u t t r e m o n o d i r e c t i o n n e l o u b i d i r e c t i o n n e l .

    E x e m p l e d e f o n c t i o n n e m e n t

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    56/68

    56/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    1 . U n r e g i s t r e , l e c o m p t e u r d e p r o g r a m m e c o n t i e n t l ' a d r e s s e d e l ' i n s t r u c t i o n

    l i r e . L e c o n t e n u d e c e t t e a d r e s s e e s t d e m a n d l a m m o i r e .

    2 . C e c o n t e n u e s t p l a c d a n s u n r e g i s t r e , l e r e g i s t r e d ' i n s t r u c t i o n . L e c o m p t e u r

    d e p r o g r a m m e e s t m i s j o u r ( a v a n c d e 1 ) .

    3 . L ' i n s t r u c t i o n e s t d c o d e .

    4 . L ' u n i t d e c o n t r l e f a i t l e s o p r a t i o n s c o r r e s p o n d a n t e s l ' i n s t r u c t i o n ( e n

    f o n c t i o n d e l ' t a p e 3 ) , p a r e x e m p l e :

    l e c t u r e s / c r i t u r e s s u r d e s r e g i s t r e s ;

    l e c t u r e s / c r i t u r e s e n m m o i r e ;

    c a l c u l s n u m r i q u e s .

    C e c i e s t r p t i n d n i m e n t .

    L e s i n s t r u c t i o n s

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    57/68

    57/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    L e s i n s t r u c t i o n s s o n t c r i t e s e n b i n a i r e , d a n s l e l a n g a g e m a c h i n e ( o n p a r l e a u s s i

    d e j e u d ' i n s t r u c t i o n ) .

    L ' a s s e m b l e u r e s t l a t r a d u c t i o n ( h u m a i n e ) d u l a n g a g e m a c h i n e d a n s d e s s y m -

    b o l e s ( p r e s q u e ) c o m p r h e n s i b l e s p o u r l ' h o m m e .

    E x e m p l e d ' i n s t r u c t i o n ( s u r 1 6 b i t s ) e t s a t r a d u c t i o n :

    00 0 0 0 000 001 1 1 1 1 1

    0 1 1 = 3

    R 3

    0 1 0 = 2 R 20 0 1 = 1

    R 1

    0 1 0 0 a d d i t i o n d e 2 r e g i s t r e s

    1 0 0

    i n s t r u c t i o n s a r i t h m t i q u e s , l o g i q u e s , r a n g e m e n t s , c h a r g e m e n t s

    l ' i n s t r u c t i o n 1 0 0 0 1 0 0 0 1 1 0 1 0 0 0 1 s i g n i e A D D R 1 , R 2 , R 3 ( s o i t R 1 = R 2 + R 3 ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    58/68

    58/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x e m p l e s d ' i n s t r u c t i o n s ( e n a s s e m b l e u r )

    I n s t r u c t i o n a r i t h m t i q u e :

    A D D R 1 , R 2 , R 3 ( a j o u t e r R 2 e t R 3 , m e t t r e l e r s u l t a t d a n s R 1 )

    I n s t r u c t i o n d e c h a r g e m e n t / r a n g e m e n t :

    L D R 1 , [ R 2 + 2 ] ( c h a r g e r d a n s R 1 l a v a l e u r l ' a d r e s s e m m o i r e ( R 2 + 2 ) )

    S T [ R 2 + 2 ] , R 1 ( s a u v e r l ' a d r e s s e m m o i r e ( R 2 + 2 ) l a v a l e u r d a n s R 1 )

    B r a n c h e m e n t s :

    B 6 ( a v a n c e r l e c o m p t e u r d e p r o g r a m m e d e 6 )

    L ' e n s e m b l e d e s d i r e n t e s i n s t r u c t i o n s e s t u n l a n g a g e a p p e l l ' a s s e m b l e u r d u p r o -

    c e s s e u r .

    D e s c r i p t i o n d e l ' a s s e m b l e u r

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    59/68

    59/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    L a s t r u c t u r e d u l a n g a g e m a c h i n e i m p o s e d e s c o n t r a i n t e s s u r l ' a s s e m b l e u r . E x e m p l e :

    a d d i t i o n d ' u n e c o n s t a n t e s i g n e u n r e g i s t r e , r s u l t a t d a n s u n a u t r e r e g i s t r e .

    0 01 1 0

    1 0 1 0 0

    i n s t r u c t i o n A D D I

    l a c o n s t a n t e s i g n e

    r e g i s t r e s o u r c e

    r e g i s t r e d e s t i n a t i o n

    c h a q u e r e g i s t r e n ' e s t r e p r q u e p a r 3 b i t s 8 r e g i s t r e s m a x i m u m ( d e R 0 R 7 ) ;

    l a c o n s t a n t e n ' a q u e 5 b i t s , d o n c v a d e - 1 6 1 5 ( p a s p o s s i b l e p a r c e t t e i n s -

    t r u c t i o n d ' a j o u t e r - 4 0 ) .

    O n p e u t n o t e r c e t t e i n s t r u c t i o n A D D I R d , R s 1 , s i m m 5 ( s i m m 5 s i g n i a n t s i g n s u r

    5 b i t s ) .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    60/68

    60/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x e m p l e d e p r o g r a m m e

    O n d i s p o s e d e 8 r e g i s t r e s d e 1 6 b i t s , a u d p a r t t o u s 0 , e t d ' u n e m m o i r e d e 216

    c a s e s d e 1 6 b i t s , a d r e s s e s d e 0 6 5 5 3 5 .

    L a m m o i r e c o n t i e n t ( p a r t i r d e l ' a d r e s s e 0 ) l e s i n s t r u c t i o n s s u i v a n t e s :

    0 ) A D D I R 1 , R 1 , 1 0

    1 ) S T [ R 0 + 1 0 ] , R 1

    2 ) B - 3

    C e p r o g r a m m e p l a c e s u c c e s s i v e m e n t l e s v a l e u r s 1 0 , 2 0 , 3 0 , . . . l ' a d r e s s e 1 0 .

    L e s i n d i c a t e u r s d ' t a t s

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    61/68

    61/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    U n p r o g r a m m e d o i t p o u v o i r a v o i r d e s b r a n c h e m e n t s c o n d i t i o n n e l s , p o u r f a i r e

    q u e l q u e c h o s e s i . . . , o u j u s q u ' . . . .

    O n u t i l i s e d e s i n d i c a t e u r s d ' t a t s ( q u i s o n t l e s b i t s d ' u n r e g i s t r e s p c i a l , l e r e -

    g i s t r e d ' t a t r c c ) m o d i s p a r c e r t a i n e s o p r a t i o n s a r i t h m t i q u e s .

    E x e m p l e :

    i n d i c a t e u r z r o ( n o t p a r e x e m p l e r c c [ z ] ) , q u i v a u t 1 s i l e r s u l t a t d e l ' o p r a t i o n

    e s t 0 .

    i n d i c a t e u r n g a t i f ( n o t r c c [ n ] ) q u i v a u t 1 s i l e r s u l t a t d e l ' o p r a t i o n ( v u e n

    s i g n ) e s t n g a t i f .

    A i n s i , a v e c A D D . R 1 , R 2 , R 3 , l a n d e l ' a d d i t i o n :

    r c c [ z ] v a u t 1 s i

    R2 + R3 = 0, e t 0 s i n o n ;

    r c c [ n ] v a u t 1 s i R2 + R3 < 0, e t 0 s i n o n .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    62/68

    62/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    I n s t r u c t i o n s d e b r a n c h e m e n t s c o n d i t i o n n e l s

    C e s b r a n c h e m e n t s m o d i e n t l e c o m p t e u r d ' i n s t r u c t i o n s i l ' i n d i c a t e u r d ' t a t l a

    b o n n e v a l e u r .

    E x e m p l e s :

    B E Q - 9 a j o u t e - 9 a u c o m p t e u r d ' i n s t r u c t i o n s i r c c [ z ] v a u t 1 ;

    B G T - 9 a j o u t e - 9 a u c o m p t e u r d ' i n s t r u c t i o n s i r c c [ z ] v a u t 0 e t r c c [ n ] v a u t 0 .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    63/68

    63/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    E x e m p l e

    E x c u t e r 5 f o i s u n c o d e p a r t i c u l i e r ( e n s u p p o s a n t R 0 = 0 ) :

    0 ) A D D I R 1 , R 0 , 5

    1 ) . . .

    . . .

    1 4 ) . . .

    1 5 ) A D D I . R 1 , R 1 , - 1

    1 6 ) B G T - 1 6

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    64/68

    64/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    I n t e r r u p t i o n , s o u s - p r o g r a m m e s

    D e u x m c a n i s m e s p l u s c o m p l e x e s :

    L e s i n t e r r u p t i o n s s o n t d e s v e n e m e n t s q u i a r r t e n t t e m p o r a i r e m e n t l ' e x -

    c u t i o n d u p r o g r a m m e e n l a n a n t u n a u t r e c o d e . L ' e m p l a c e m e n t e t l e c o n t e x t e e n

    a t t e n t e e s t c o n s e r v . E x e m p l e : a p p u i s u r u n e t o u c h e .

    L e s s o u s - p r o g r a m m e s p e r m e t t e n t d ' e x c u t e r u n c o d e u n a u t r e e m p l a c e m e n t

    m m o i r e , e n g a r d a n t e n m m o i r e l e l i e u d ' a p p e l d u s o u s - p r o g r a m m e p o u r p o u v o i r

    y r e v e n i r . E x e m p l e : a p p e l d ' u n e f o n c t i o n s g n r i q u e .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    65/68

    65/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    C o m p l m e n t s s u r l ' a r c h i t e c t u r e

    D i r e n c e e n t r e R I S C e t C I S C :

    l e s p r e m i e r s p r o c e s s e u r s t a i e n t d e s C I S C : j e u d ' i n s t r u c t i o n s l a r g e s e t c o m p l e x e s

    ( s i m p l i e l a t c h e d u p r o g r a m m e u r ) ;

    p u i s s o n t v e n u s l e s R I S C : j e u d ' i n s t r u c t i o n s r e s t r e i n t , m a i s p e r m e t l e s o p t i m i s a -

    t i o n s ( p i p e - l i n e , c a c h e ) e t p l u s r a p i d e .

    A c t u e l l e m e n t , l a d i s t i n c t i o n n ' e x i s t e p l u s v r a i m e n t : l e s p r o c e s s e u r s c u m u l e n t l e

    t o u t .

    C a r t e m r e

    C a r t e p r i n c i p a l e d e l ' o r d i n a t e u r .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    66/68

    66/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    Emplacementprocesseur

    Emplacement memoire

    Connecteurs E/S

    Connecteursextensions

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    67/68

    67/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    P r i p h r i q u e s

    O n d i s t i n g u e :

    1 . L e s p r i p h r i q u e s d e s t o c k a g e s : m m o i r e ( R A M ) , d i s q u e s d u r s , l e c t e u r s d e

    d i s q u e t t e s , c l U S B , C D / D V D . . .

    2 . L e s p r i p h r i q u e s d ' e n t r e s : c l a v i e r , s o u r i s , s c a n n e r . . .

    3 . L e s p r i p h r i q u e s d e s o r t i e : c r a n ( c a r t e v i d o ) , i m p r i m a n t e , h a u t - p a r l e u r s

    ( c a r t e s o n ) . . .

    O n p e u t a u s s i a j o u t e r l e s p r i p h r i q u e s d e c o m m u n i c a t i o n : c a r t e r s e a u , m o d e m . . .

    http://www.mechanik.tu-darmstadt.de/index.html
  • 7/29/2019 1-Codage, circuits logique, architecture.pdf

    68/68

    68/67I n t r o d u c t i o n l ' i n f o r m a t i q u e ( S 1 I M P )

    B o u q u i n , s i t e w e b

    A l a b i b l i o t h q u e u n i v e r s i t a i r e :

    I n i t i a t i o n l ' i n f o r m a t i q u e : p r o g r a m m a t i o n , a l g o r i t h m i q u e , a r c h i t e c t u r e , H e n r i - P i e r r e

    C h a r l e s , E y r o l l e s , 1 9 9 9 .

    ( n e s u i t p a s e x a c t e m e n t l e c o u r s )

    P a g e w e b :

    h t t p : / / d o e l a n - g w . u n i v - b r e s t . f r : 8 0 8 0 / ~ d m a s s e / c o u r s / a r c h i . p d f

    http://www.mechanik.tu-darmstadt.de/index.html