Y otra mas, las excepciones, algo relacionado con el infinito y -infinito, que eso en google por lo menos en lo que he buscado no encontrado mucho.
P.D: Si lo se, tal vez en el IEEE 754 como tal venga explicado, pero es que a mi lo unico que me van a pedir es convierte 2.34 a binario en 32 o 64... y el IEEE essss muuuyyyyy tocho y en ingles... (y los apuntes no aparecen..)
--
formatting link
La pagina de es.ciencia.electronica
Saludos.
"RooT" escribió en el mensaje news:d8buu0$5pk$ snipped-for-privacy@news.ya.com...
Siento rayaros pero es que me toi volviendo loquisimo y mañana me plantan el
> examen, realmente no creo que sea muy importante(1 punto maximo) pero es que
> google no me ayuda, demasiada teoria de aplicaciones y gilipolleces y yo lo
> unico que quiero es una simple explicacion.
>
> Precision simple: 32 bits, 1 de signo, 8 de exponente y 23 de mantisa.
> Precision doble: 64 bits, 1 de signo, 16 de exponente y 47 de mantisa.
>
> La formula, -1^bitsigno * mantisa + 2^(exponente-1)
>
> Es correcto todo esto ?
>
>
> Una manita que alguno lo sabe para un pobre estudiante :D
>
> --
>
formatting link
La pagina de es.ciencia.electronica
>
> Saludos.
>
>
The real formats support signed representations of infinities. These values are encoded with a biased exponent of all ones and a significand of
1{ }00..00; if the infinity is in a register, it is tagged special.
A programmer may code an infinity, or it may be created by the NPX as its masked response to an overflow or a zero divide exception. Note that depending on rounding mode, the masked response may create the largest valid value representable in the destination rather than infinity.
The signs of the infinities are observed, and comparisons are possible. Infinities are always interpreted in the affine sense; that is, -l < (any finite number) < +l. Arithmetic on infinities is always exact and, therefore, signals no exceptions, except for the invalid operations specified in Table 3-4.
Table 3-4. Infinity Operands and Results
Key to symbols used in this table X Zero or nonzero positive oprand. Y Nonzero positive operand.
Sign of original infinity operand.
-* Compliment of sign of original infinity operand. $ Sign of original operand. # Sign of the original Y operand. h Exclusive OR of signs of operands.
Operation Operands Result
Addition +l plus +l +l -l plus -l -l +l plus -l Invalid Operation -l plus +l Invalid Operation ql plus qX *l qX plus ql *l Subtraction +l minus -l +l -l minus +l -l +l minus +l Invalid Operation -l minus -l Invalid Operation ql minus qX *l qX minus ql -*l Multiplication ql * ql hl ql * qY, qY * ql hl q0 * ql, ql * q0 Invalid Operation Division ql v ql Invalid Operation ql v qX hl qX v ql h0 ql v q0 hl FSQRT -l Invalid Operation +l +l FPREM, FPREM1 ql rem ql Invalid Operation ql rem qX Invalid Operation qX rem ql $X, Q = 0 FRNDINT ql *l FSCALE ql scaled by --l Invalid Operation ql scaled by +l *l ql scaled by qX *l q0 scaled by -l q0 Sign of original zero operand.
q0 scaled by lI Invalid Operation qY scaled by +l #l qY scaled by -l #0 FXTRACT ql ST = *l, ST(1) = +l Compare +l : +l +l = +l -l : -l -l = -l +l : -l +l > -l -l : +l -l < +l +l : qX +l > X -l : qX -l < X qX : +l X < +l qX : -l X > +l FTST +l +l > 0 -l -l < 0 FPATAN ql v qX *c/2 qY v +l #0 qY v -l #c ql v +l *c/4 ql v -l *3c/4 ql v q0 *c/2 +0 v +l +0 +0 v -l +c -0 v +l -0 -0 v -l -c F2XM1 +l +l -l -1 FYL2X, FYL2XP1 ql * log(1) Invalid Operation ql * log(Y>1) *l ql * log(0
ElectronDepot website is not affiliated with any of the manufacturers or service providers discussed here.
All logos and trade names are the property of their respective owners.