GB2157032A - Digital parallel odder - Google Patents
Digital parallel odder Download PDFInfo
- Publication number
- GB2157032A GB2157032A GB08408992A GB8408992A GB2157032A GB 2157032 A GB2157032 A GB 2157032A GB 08408992 A GB08408992 A GB 08408992A GB 8408992 A GB8408992 A GB 8408992A GB 2157032 A GB2157032 A GB 2157032A
- Authority
- GB
- United Kingdom
- Prior art keywords
- groups
- bits
- stages
- added
- numbers
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/50—Adding; Subtracting
- G06F7/505—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/38—Indexing scheme relating to groups G06F7/38 - G06F7/575
- G06F2207/3804—Details
- G06F2207/386—Special constructional features
- G06F2207/3884—Pipelining
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Pure & Applied Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Mathematical Optimization (AREA)
- General Engineering & Computer Science (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
To add two binary numbers A & B in parallel the least significant bits of each number are added in a first sample period in adder unit 1, the output bits with carry being held in a latch 2. At the same time the most significant bits of each number are put through delays 3, 4 and added in unit 5 in a succeeding sample period, together with the carry from latch 2. The output bits in latch 2 are put through delay 6, so that they coincide with the outputs from unit 5. The input numbers are thus present for one sample period; two periods later the sum appears. Additions are performed at the full sample rate at the penalty of having the inputs delayed, whilst the internal carries have time to propagate right across the addition. <IMAGE>
Description
SPECIFICATION
Digital parallel adder
This invention relates to a method and apparatus for performing parallel addition of binary numbers occurring in isochronous data streams.
When two binary numbers, each represented by a number of bits, are required to be added in parallel and registered in a parallel latch, at a sample rate f,, the internal "carrys" in the addition must propagate right across the number of bits within one sample period I/f,. So-called "fast" look-ahead carry circuits are often used to speed-up this process, but still incur some delay.
According to the present invention there is provided a method of adding in a parallel form binary numbers occurring in isochronous data streams wherein the numbers are each divided into corresponding groups of bits of like significance which groups are added in parallel in separate stages operating in successive periods of time, each stage generating a carry which is applied as a carry input to the next operating stage wherein the corresponding groups of next most significance are added.
The invention also provides an apparatus for adding binary numbers occurring in isochronous data streams in parallel, including a plurality of parallel adder units each capable of adding only groups of bits which group each forms part only of a binary number, means for operating the adder units in successive periods of time, means for applying to the adder units in said successive periods of time corresponding groups of bits from the binary numbers such that successive groups applied in successive periods of time have increasing significance, and means for applying a carry from each adder unit as a carry input to the succeeding adder unit.
Embodiments of the invention will now be described with reference to the accompanying drawing which illustrates in schematic form an arrangement for parallel addition of two 8-bit binary numbers.
In the arrangement illustrated two eight-bit binary numbers A and B are presented in parallel for addition, the sum to be registered in a parallel latch. The sample rate of the system is f, and the carrys are required to be propagated right across the addition within one sample period (I/f,). However, provided that the delay incurred by each partial addition can be less than one sample period the additions of successive pairs of numbers can be performed at the sample rate f,.
The four least significant bits of each number A and B are presented, in a first sample period, for parallel addition in a 4-bit adder 1 with a carry output. The 4-bit plus carry outputs from adder 1 are put into a 5-bit latch 2. At the same time the four most significant bits of the two numbers A and B are put into skewing delays 3, 4 where they are delayed for one sample period. In the second sample period the outputs from delays 3 and 4 are presented to a second 4-bit adder 5, together with the carry output from latch 2. At the same time the sum outputs held in latch 2 are put into a linearising delay 6. Meanwhile, also in the second sample period, two new 8-bit numbers are presented for addition, and the four least significant bits of each going into adder 1 and the four most significant bits of each going into the delays 3 & 4.At the end of the second sample period the 8-bit sum of the first two numbers A & B is available, the four least significant bits coming from the linearising delay 6 and the four most significant bits from adder 5.
In the example given above the 8-bit inputs are present for one sample period and two periods later the 8- bit output appears, but new inputs are presented at the full sample rate and the resulting new outputs are calculated at the full sample rate f,.
The skewing delays 3 & 4 and the linearising delay 6 are required where the inputs are presented simultaneously in parallel. However, if the inputs, although in parallel form, are presented staggered in time, then no skewing delays may be required.
Similarly, if staggered outputs can be used for subsequent processing, then the linearising output delays can be eliminated.
Whilst the example given above refers only to the division of 8-bit numbers into two 4-bit groups, other arrangements can be contemplated within the scope of the invention. Thus, the input binary words can consist of larger or smaller numbers of bits and can be divided into greater or lesser groups, A 16-bit word can be divided in four 4-bit groups, the addition sum appearing after four sample periods. Conversely 8-bit input numbers can be divided into eight 1-bit groups, with the output appearing as eight parallel staggered bits over eight successive sample periods. This latter example has a useful application when successively summed pairs of numbers are required to be accumulated.
Alternatively, the second number to be added can be the sum of the previous addition. In this case the groups of bits forming the second number are already produced in a staggered or skewed form.
Thus only the group of the first number need to be put through skewing delays. The latch outputs are linearised as before for use by succeeding circuitry.
This is a particularly useful form of accumulation for certain digital-to-analogue conversion arrangements in the field of speech transmission.
Claims (12)
1. A method of adding in a parallel form binary numbers occurring in isochronous data streams wherein the numbers are each divided into corresponding groups of bits of like significance which groups are added in parallel in separate stages operating in successive period of time, each stage generating a carry which is applied as a carry input to the next operating stage wherein the corresponding groups of next most significance are added.
2. A method according to claim 1 wherein the bits in each of said numbers to be added are presented simultaneously and groups of greater sig nificance are delayed before addition in said successive stages, likewise the outputs of separate stages adding groups of lesser significance are delayed whereby carry outputs from the stages adding lesser significance groups are aligned in time with the delayed greater significance bits input to the succeeding stages and the outputs of all the stages are aligned in time.
3. A method according to claim 1 wherein the groups of bits in each of the said numbers to be added are presented sequentially in successive period of time whereby the bits of the addition output are generated in corresponding later successive periods of time.
4. A method according to claim 1, 2 or 3 wherein the binary numbers to be added are each comprised of an even number of bits and said groups into which said binary numbers are divided each comprise half the bits in a binary number.
5. A method according to claim 1, 2 or 3 wherein the groups into which said binary numbers are divided each comprise one bit only.
6. A method according to claim 1 wherein the bits in one of the numbers to be added are the outputs from the successive stages resulting from a preceding addition and are presented in successive periods of time and the bits of the other number to be added are presented simultaneously in parallel, the groups of the other number being delayed to be input to the stages in the same time periods as the groups of corresponding significance of the one number resulting from the previous addition.
7. A method of adding in parallel form binary numbers substanially as hereinbefore described.
8. An apparatus for adding binary numbers occurring in isochronous data streams in parallel, including a plurality of parallel adder units each capable of adding only groups of bits which group each forms part only of a binary number, means for operating the adder units in successive periods of time, means for applying to the adder units in said successive periods of time corresponding groups of bits from the binary numbers such that successive groups applied in successive periods of time have increasing significance, and means for applying a carry from each adder unit as a carry input to the succeeding adder unit.
9. Apparatus according to claim 8 wherein the bits of said numbers to be added are presented simultaneously, the apparatus including means for delaying successive groups of bits of increasing significance by successive periods of time whereby said delayed groups are presented for addition in respective stages in the periods in which said stages are operative for adding said groups, and means for delaying the outputs of stages wherein groups of lesser significance are added whereby carry outputs from said stages are presented to succeeding stages together with the delayed input groups of greater significance.
10. Apparatus according to claim 8 or 9 wherein the binary numbers to be added each comprise an even number of bits and said groups into which said binary numbers are divided each comprise half the bits in a binary number.
11. Apparatus according to claim 8 or 9 wherein the groups into which said binary numbers are divided each comprise one bit only.
12. Apparatus for adding binary numbers substantially as described with reference to the accompanying drawings.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB08408992A GB2157032A (en) | 1984-04-06 | 1984-04-06 | Digital parallel odder |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB08408992A GB2157032A (en) | 1984-04-06 | 1984-04-06 | Digital parallel odder |
Publications (2)
Publication Number | Publication Date |
---|---|
GB8408992D0 GB8408992D0 (en) | 1984-05-16 |
GB2157032A true GB2157032A (en) | 1985-10-16 |
Family
ID=10559313
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB08408992A Withdrawn GB2157032A (en) | 1984-04-06 | 1984-04-06 | Digital parallel odder |
Country Status (1)
Country | Link |
---|---|
GB (1) | GB2157032A (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2637398A1 (en) * | 1988-10-05 | 1990-04-06 | United Technologies Corp | IMPROVED ACCUMULATOR FOR COMPLEX NUMBERS |
US5101204A (en) * | 1990-03-26 | 1992-03-31 | Burr-Brown Corporation | Interpolation DAC and method |
USRE34660E (en) * | 1983-07-29 | 1994-07-12 | Burr-Brown Corporation | Apparatus and methods for digital-to-analog conversion using modified LSB switching |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB1033155A (en) * | 1961-11-14 | 1966-06-15 | Emi Ltd | Improvements relating to circuits for the transmission of digital code signals |
GB1088354A (en) * | 1965-06-01 | 1967-10-25 | Int Computers & Tabulators Ltd | Improvements in or relating to electronic adders |
GB2117147A (en) * | 1982-02-10 | 1983-10-05 | Sony Corp | Digital signal adder |
-
1984
- 1984-04-06 GB GB08408992A patent/GB2157032A/en not_active Withdrawn
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB1033155A (en) * | 1961-11-14 | 1966-06-15 | Emi Ltd | Improvements relating to circuits for the transmission of digital code signals |
GB1088354A (en) * | 1965-06-01 | 1967-10-25 | Int Computers & Tabulators Ltd | Improvements in or relating to electronic adders |
GB2117147A (en) * | 1982-02-10 | 1983-10-05 | Sony Corp | Digital signal adder |
Non-Patent Citations (4)
Title |
---|
IEEE TRANSACTIONS ON COMPUTERS * |
NO 2 FEB 73 * |
PP 113-116 * |
VOL C-22 * |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
USRE34660E (en) * | 1983-07-29 | 1994-07-12 | Burr-Brown Corporation | Apparatus and methods for digital-to-analog conversion using modified LSB switching |
FR2637398A1 (en) * | 1988-10-05 | 1990-04-06 | United Technologies Corp | IMPROVED ACCUMULATOR FOR COMPLEX NUMBERS |
GB2224377A (en) * | 1988-10-05 | 1990-05-02 | United Technologies Corp | Accumulator for complex numbers |
GB2224377B (en) * | 1988-10-05 | 1992-07-22 | United Technologies Corp | Accumulator for complex numbers |
US5101204A (en) * | 1990-03-26 | 1992-03-31 | Burr-Brown Corporation | Interpolation DAC and method |
Also Published As
Publication number | Publication date |
---|---|
GB8408992D0 (en) | 1984-05-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5271070A (en) | Multi-dimensional error diffusion technique | |
US4682303A (en) | Parallel binary adder | |
US5426598A (en) | Adder and multiplier circuit employing the same | |
EP0113391B1 (en) | Digital multiplier and method for adding partial products in a digital multiplier | |
US6211806B1 (en) | Efficient error correction in pipelined analog-to-digital converters | |
US5477480A (en) | Carry look ahead addition method and carry look ahead addition device | |
EP0155019B1 (en) | Logic adder circuit | |
US3956622A (en) | Two's complement pipeline multiplier | |
US6065033A (en) | Wallace-tree multipliers using half and full adders | |
US4774686A (en) | Serial digital signal processing circuitry | |
US4644491A (en) | Sign generation system for a carry save adder | |
GB2157032A (en) | Digital parallel odder | |
CA1290458C (en) | Bit-serial integrator circuitry | |
US6199090B1 (en) | Double incrementing, low overhead, adder | |
US5150321A (en) | Apparatus for performing serial binary multiplication | |
KR0147942B1 (en) | Booths recording circuit in a multiplier | |
US6004022A (en) | Product sum operation apparatus | |
US3656150A (en) | Code conversion system | |
JP3071607B2 (en) | Multiplication circuit | |
EP0214836A1 (en) | Carry select adder | |
JP2991788B2 (en) | Decoder | |
USRE37335E1 (en) | Ripple carry logic and method | |
GB1523889A (en) | Logical apparatus for multiplying serial binary operands with sign | |
JPS61289425A (en) | Multiplying circuit | |
JPH0520026A (en) | Parallel full adder |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WAP | Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1) |