Fixed-Point Arithmetic: An Introduction
STechnical ReferenceFixed-Point Arithmetic: An Introduction1 (13) YatesAugust 23, 2007 11:05PA5 Arithmetic: An IntroductionRandy YatesAugust 23, 2007ss i g n a lp r o c e s s i n gs y s t e m using LATEX2 Digital Signal LabsPublic InformationsTechnical ReferenceFixed-Point Arithmetic: An Introduction2 (13) YatesAugust 23, 2007 11:05PA5 Introduction32 Fixed-Point Binary Unsigned Fixed-Point Rationals . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . 43 The Operations of One s Complement and Two s Complement54 Signed Two s Complement Fixed-Point Rationals55 Fundamental Rules of Fixed-Point Unsigned Wordlength . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Signed Wordlength.
them (at first glance, anyway) as positive integers (i.e., the natural binary representation, defined in the next section). However, the meaning of an N-bit binary word depends entirely on its interpretation, i.e., on the representation set and the mapping we choose to use.
Download Fixed-Point Arithmetic: An Introduction
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: