US4831570A - Method of and circuit for generating bit-order modified binary signals - Google Patents

Method of and circuit for generating bit-order modified binary signals Download PDF

Info

Publication number
US4831570A
US4831570A US06/935,465 US93546586A US4831570A US 4831570 A US4831570 A US 4831570A US 93546586 A US93546586 A US 93546586A US 4831570 A US4831570 A US 4831570A
Authority
US
United States
Prior art keywords
signal
carry
reverse
address
index
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.)
Expired - Lifetime
Application number
US06/935,465
Other languages
English (en)
Inventor
Shigeshi Abiko
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Texas Instruments Inc
Original Assignee
Texas Instruments Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Texas Instruments Inc filed Critical Texas Instruments Inc
Assigned to TEXAS INSTRUMENTS INCORPORATED, 13500 NORTH CENTRAL EXPRESSWAY, DALLAS, TEXAS 75265 A CORP. OF DE. reassignment TEXAS INSTRUMENTS INCORPORATED, 13500 NORTH CENTRAL EXPRESSWAY, DALLAS, TEXAS 75265 A CORP. OF DE. ASSIGNMENT OF ASSIGNORS INTEREST. Assignors: TEXAS INSTRUMENTS JAPAN, LTD., A COMPANY OF JAPAN
Application granted granted Critical
Publication of US4831570A publication Critical patent/US4831570A/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

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
    • G06F7/5055—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination in which one operand is a constant, i.e. incrementers or decrementers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
    • 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/501—Half or full adders, i.e. basic adder cells for one denomination
    • G06F7/503—Half or full adders, i.e. basic adder cells for one denomination using carry switching, i.e. the incoming carry being connected directly, or only via an inverter, to the carry output under control of a carry propagate signal
    • 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/3808—Details concerning the type of numbers or the way they are handled
    • G06F2207/3852—Calculation with most significant digit first

Definitions

  • the present invention generally relates to the processing of digital signals for generating signals with bit orders or patterns modified from those of the supplied binary signals. More particularly, the present invention relates to a method of generating binary signals with the orders or patterns of bits re-arranged or shuffled on the basis of, typically, a fast Fourier transform algorithm and also to a bit-order modifiable signal processor circuit adapted to put such a method into practice.
  • Digital signal processors are finding increasingly expanding practical applications in converting supplied analog signals into digital versions and further converting the resultant digital signals back into analog ones after the processing of the digital signals is complete.
  • Such practical applications of digital signal processors include the processing of signals in high-speed modem circuitries for communication systems and equipment, compression of data for the analysis and synthesis of sound information using linear prediction coding technologies, analysis of signal waveforms in sound recognition systems, execution of fast Fourier transform algorithms generation and modification of signals required for various computer-aided operation control systems, and processing of data for use n computer graphics technologies.
  • a prime object of the present invention is to meet such a demand.
  • a method of generating binary signals comprising, (a) storing in first memory means a binary index signal consisting of a sequence of a predetermined number of bits, (b) storing in second memory means a binary base signal consisting of a sequence of the predetermined number of bits, (c) adding together the index signal and the base signal for producing an initial output signal representative of the arithmetic sum of the index and base signals during an initial cycle of signal generating operation, (d) tentatively storing the initial output signal in the second memory means and adding the initial output signal to the index signal for producing an output signal differing in bit pattern from the initial output signal during the cycle of signal generating operation immediately subsequent to the initial cycle and tentatively storing the last named output signal in the second memory means, and (e) thereafter adding together the index signal from the first memory means and the output signal produced during each of the successive cycles of signal generating operation for producing another output signal differing in bit pattern from each of the output signals produced during the immediately preceding cycle of signal generating
  • a bit-order modifiable signal generator circuit comprising (a) an adder circuit comprising the combination of a binary multi-stage adder/subtractor and a forward-reverse selective carry propagation network, the multi-stage adder/subtractor having functions to carry out both a forward arithmetic addition from the least significant bits forward and a reverse arithmetic addition from the most significant bits backward selectively under the control of the forward/reverse selective carry propagation network, (b) an index register operable for having programmably yet fixedly stored therein a binary index signal consisting of a sequence of a predetermined number of bits, and (c) a signal register operable for having programmably yet fixedly stored therein a binary base signal consisting of a sequence of the predetermined number of bits, (d) the adder circuit being responsive to the index signal output from the index register and to a binary signal output from the signal register for producing an output signal representative of the arithmetic sum of
  • FIG. 1 is a block diagram showing the general circuit arrangement of a prior-art bit-order reversible address generator circuit provided on a DSP semiconductor chip;
  • FIG. 2 is a circuit diagram schematically showing an example a bit-order reversible multiplexer network which forms part of the prior-art address generator circuit shown in FIG. 1;
  • FIG. 3 is a block diagram showing the general circuit arrangement of a carry propagation network incorporated in a binary adder circuit of a bit-order reversible address generator embodying one aspect of the present invention
  • FIG. 4 is a block diagram similar to FIG. 3 but shows an alternative form of carry propagation network which may be incorporated in a binary adder circuit of the bit-order reversible address generator embodying one aspect of the present invention
  • FIG. 5 is a view showing an example of the MOSFET circuit arrangement operable as a carry-over circuit in the carry propagation network shown in FIG. 4;
  • FIG. 6 is a circuit diagram schematically showing the detailed circuit arrangement of the carry propagation network shown in FIG. 4, viz., the arrangement in which the bidirectional carry propagator forming part of the network is used in combination with the carry-over circuit illustrated in FIG. 5;
  • FIG. 7 is a circuit diagram showing a MOSFET transfer-gate circuit which may implement the carry-kill selector included in the bidirectional carry propagator shown in FIG. 6;
  • FIG. 8 is a block diagram schematically showing a bit-order reversible address generator circuit embodying the present invention, the circuit using the forward-reverse selective carry propagation network of FIG. 3 or FIG. 4;
  • FIGS. 9a and 9b are views showing the forward-carry and reverse-carry binary addition rules, respectively, which are used in producing modified address signals in the bit-order reversible address generator circuit shown in FIG. 8;
  • FIG. 10a is a view showing an example of the procedure to perform a succession of forward-carry binary additions for each interaction of the successive cycles of address generating operation in the address generator circuit shown in FIG. 8;
  • FIG. 10b is a view showing an example of the procedure to perform a succession of reverse-carry binary additions for each interaction of the successive cycles of address generating operation in the address generator circuit shown in FIG. 8.
  • FFT algorithm 8-point radix-two fast Fourier transform algorithm
  • address signals expressed in the form of three-bit sequences x(k) with normal bit orders on, for example, a time axis are converted into address signals of reversed bit orders on a frequency axis by the reversal of the order in which the bits of each of the given bit sequences in terms of time.
  • Each of these bit-order reversible address generation techniques may be realized by having recourse to software approaches encompassing the algorithm of Table 1 or Table 2 on a general-purpose DSP semiconductor chip.
  • address generation techniques may be realized by means of hardware configurations incorporating the circuit arrangements of FIGS. 1 and 2 on a special-purpose DSP semiconductor chip.
  • the circuit arrangements herein shown are assumed to be operable for the reversal of the bit orders of three-bit address signals on the basis of an 8-point radix-two FFT algorithm.
  • the circuit shown in FIG. 1 includes an index counter 10 for supplying normal bit-order three-bit address signals x(k) to a three-input, three-output bit-order reversible multiplexer 12.
  • an index counter 10 for supplying normal bit-order three-bit address signals x(k) to a three-input, three-output bit-order reversible multiplexer 12.
  • each of the normal bit-order address signals x(k) can thus be reversed in the order of bits by means of the bit-order reversible multiplexer 12.
  • the resultant signals X(k) with reversed bit orders are supplied to a binary adder circuit 14.
  • To this adder circuit 14 is also supplied from an address register 16 a base address signal provided by, for example, the starting normal bit-order address signal x(0).
  • FIG. 2 schematically shows a typical circuit topology of the bit-order reversible multiplexer 12.
  • the bit-order reversible multiplexer 12 consists of three logic-signal steering sections 12a, 12b and 12c each having two inputs and one output.
  • One input to the first steering section 12a and one input to the third steering section 12c are jointly connected to an input line 18a for the most significant bit (MSB) and, likewise, the other input to the first steering section 12a and the other input to the third steering section 12c are jointly connected to an input line 18c for the least significant bit (LSB) of the supplied normal bit-order data signal x(k).
  • Both of the two inputs to the second steering section 12b are connected to a line 18b for the bit intervening between the most and least significant bits of the address signal x(k).
  • the outputs of the first and third steering sections 12a and 12c are connected to output lines 20a and 20c for the most and least significant bits, respectively, of the output signal X(k).
  • the output of the second steering section 12b is connected to an output line 20b for the non-reversed intermediate bit of the address signal X(k).
  • Such a bit-order reversible multiplexer could be used on a special-purpose DSP semiconductor chip but is operable merely for the reversal of data of a fixed bit length and not for the handling of data with any desired number of bits.
  • a known bit-order reversible multiplexer represented by the multiplexer shown in FIG. 2 requires a large wiring and interconnect area on the semiconductor chip, which therefore could not be designed and fabricated with the design rules used for the fabrication of large-scale integrated (LSI) circuits.
  • LSI large-scale integrated
  • the present invention contemplates provision of a novel method of generating address signals selectively having modified or non-modified bit orders and a bit-order modifiable address generator circuit to put the method into practice on, for example, a general-purpose DSP semiconductor chip.
  • a novel address generation technique and the circuit to carry out the technique in accordance with the present invention method will make it possible to have any binary signals or sequences of bits modified into any desired bit patterns such as, for example, bit-order reversed sequences of bits fast and programmably without having recourse to the use of any extra special-purpose signal modifying means.
  • FIG. 3 shows a forward/reverse selective carry propagation network which may form part of a bit-order reversible address generator circuit embodying the present invention.
  • the carry propagation network designated in its entirety by reference numeral 22, comprises two, forward and reverse, signal carry chains 24 and 26 arranged separately of each other.
  • the forward-carry chain 24 extends from a carry-in line C IN (f) to a carry-out line C OUT (f) through a forward-carry propagator 28 having two control terminals.
  • the reverse-carry chain 26 extends from a carry-in line C IN (r) to a carry-out line C OUT (r) through a reverse-carry propagator 30 having two control terminals.
  • One of the control terminals of the forward-carry propagator 28 and one of the control terminals of the reverse-carry propagator 30 are jointly connected to a first input line A, and the other control terminals of the forward-carry and reverse-carry propagators 28 and 30 are jointly connected to a second input line B.
  • the carry propagation network 22 shown in FIG. 3 further comprises a forward-carry/reverse-carry selector 32 which is operative to provide a choice between the carry-forward and carry-reverse modes of operation in the address generator circuit embodying the present invention.
  • a forward-carry/reverse-carry selector 32 which is operative to provide a choice between the carry-forward and carry-reverse modes of operation in the address generator circuit embodying the present invention.
  • a carry is thus propagated from a less significant bit to a more significant bit or conversely from a more significant bit to a less significant bit in the address signal to be generated, thus establishing a carry-propagate mode of operation in the carry-propagation network 22.
  • Each of the signal carry chains 24 and 26 is precharged during the precharge mode of operation thus produced in the carry-propagation network 22.
  • Table 3 below is the truth table showing the results of the logic operations which thus proceed in the shown carry propagation network 22.
  • C in FIG. 3 is a carry-over signal which dictates the forward or reverse carry in the more significant or less significant bit or stage of the circuit.
  • FIG. 4 is shown another form of forward/reverse selective carry propagation network 34 which may also form part of a bit-order reversible address generator circuit according to the present invention.
  • the carry propagation network 34 herein shown features a single carry chain which is operable for both carry-forward and carry-reverse modes of operation.
  • the single carry chain extends through a bidirectional carry propagator 36 provided between carry lines 40 and 42 respectively leading rearwardly and forwardly from the carry propagator 36.
  • the bidirectional carry propagator 36 has two control terminals, one of which is connected to a first input line A and the other of which is connected to a second input line B.
  • a forward-carry/reverse-carry selector 38 is connected across the bidirectional carry propagator 36 through the lines 40 and 42 and is operative to select the direction in which a carry is to be propagated through the carry propagation network 34.
  • Carry-in and carry-out lines are thus provided by the reverse-directed carry line 40 and forward-directed carry line 42, respectively, when a forward carry mode of operation is selected by the selector 38.
  • carry-in and carry-out lines are provided by the forward-directed carry line 42 and reverse-directed carry line 40, respectively, when a reverse carry mode of operation is selected by the selector 38.
  • Each of the forward/reverse selective carry propagation networks 22 and 34 hereinbefore described with reference to FIGS. 3 and 4 can be implemented by a transistor circuitry of metal-oxide-semiconductor field-effect transistor (MOSFET) configuration advantageously for its potential high-speed performance and to enable the memory system to operate efficiently.
  • MOSFET metal-oxide-semiconductor field-effect transistor
  • the carry propagation network 22 of the type shown in FIG. 3 can be implemented readily by fabricating the forward-carry/reverse-carry selector 32 in the form of a MOSFET circuit combined with known carry propagators used as the forward-carry and reverse-carry propagators 28 and 30 of the carry propagation network 22.
  • Each of the bidirectional carry propagator 36 and the forward-carry/reverse-carry selector 38 of the carry propagation network 34 shown in FIG. 4 can also be easily realized by a combination of MOSFET devices.
  • a MOSFET device is an inherently bi-directional device with the direction of current being dependent upon the relationship
  • FIG. 5 shows an example of a carry-over circuit of MOSFET configuration for use in the carry propagation network 34 shown in FIG. 4.
  • the carry-over circuit represented in its entirety by reference numeral 44, is well known in the art as Manchester carry chain and extends through a pass transistor 46 from a carry-in line C IN to a carry-out line C OUT .
  • the carry-propagate signal P is effective in creating the carry-propagate mode of operation in the address generator circuit under consideration.
  • the carry-kill signal K is effective in creating the carry-kill mode of operation and is thus exclusive in effect to the carry-propagate signal P.
  • a carry forward to the immediately upper bit or backward to the immediately lower bit is allowed to pass through the pass transistor 46.
  • the carry-kill signal K when present at the gate of the carry-kill control transistor 50, is predominant over a carry toward the most significant bit or a carry toward the least significant bit.
  • FIG. 6 shows an example of the MOSFET circuit arrangement operable as the bidirectional carry propagator 24 with which the carry-over circuit 44 thus constructed may be used together to form the carry propagation network 34 shown in FIG. 4.
  • the bidirectional carry propagator 36 comprises a parallel combination of a two-input logic exclusive-OR gate 54 and a two-input logic NOR gate 56, each has its two inputs connected to input lines A and B.
  • the logic exclusive-OR gate 54 has its output connected to the gate of a pass transistor 58 provided between the forward-carry and reverse-carry lines F and R of the bidirectional carry chain shown in FIG. 4.
  • the pass transistor 58 has one of its source/drain terminals connected to the reverse-directed carry line 40 and the other of the source/drain terminals connected to the forward-directed carry line 42.
  • the transistor 58 receives a carry-propagate signal P in the presence of a logic "1" bit on one input terminal of the exclusive-OR gate 54 and a logic "0" bit on the other input terminal of the gate 54.
  • the logic NOR gate 56 has its output connected to one control terminal of a carry-kill selector 60 which has output terminal connected to the gate of a carry-kill control transistor 62.
  • the carry-kill control transistor 62 is shown having its source/drain terminals connected between the forward-directed carry line 42 and ground and receives a carry-kill signal K in the presence of logic "0" bits concurrently on both of the two input terminals of the NOR gate 56.
  • the two input terminals of the carry-kill selector 60 which include the input terminal connected to the output of the NOR gate 56 are connected to carry-kill control lines 64 and 66 as shown.
  • the carry-kill control line 64 leads to the input terminal of the carry-kill selector of the lower bit or stage of the circuit and the carry-kill control line 66 leads to the input terminal of the carry-kill selector of the upper bit or stage of the circuit.
  • the forward-carry/reverse-carry selector 38 has its input terminals connected to the signal carry chain across the pass transistor 58.
  • the pass transistor 58 on the signal carry chain has its gate connected, to one input terminal of a two-input logic exclusive-OR gate 68, and the other input terminal of which is connected to the carry selector 38.
  • Each of the forward-carry/reverse-carry and carry-kill selectors 38 and 60 forming part of the bidirectional carry propagator 36 are constructed and arranged as hereinbefore described by a MOSFET transfer-gate circuit, the simplified circuit topology of which is shown in FIG. 7.
  • the transfer-gate circuit of FIG. 7 comprises first and second transistors 70 and 72 each having its source/drain terminals connected between a common node 74 and lines 76 and 78, respectively.
  • the gates of the transistors 70 and 72 are connected to the first and second input lines A and B as in that the logic signals to appear on the lines 76 and 78 are exclusive to each other so that either the first input line A or the second input line B is selected to be active depending upon the logical relationship between the signals to be applied to the lines 76 and 78.
  • FIG. 8 shows the general circuit topology of a bit-order reversible address generator circuit embodying the present invention.
  • the address generator circuit herein shown is assumed to be operable for generating four-bit address signals and may use either of the forward/reverse selective carry propagation networks 22 and 34 shown in FIG. 3 and FIG. 4, respectively.
  • the address generator circuit comprises a bit-order reversible binary adder circuit 80 which is, by way of example, assumed to be provided by the combination of a known type of multi-stage adder/subtractor (not shown) used in a conventional bit-order reversible address generator and the forward/reverse selective carry propagation network 22 or 34 of FIG. 3 or FIG. 4.
  • the multi-stage adder/subtractor herein used have functions to carry out both a forward arithmetic addition from the least significant bits forward and a reverse arithmetic addition from the most significant bits backward.
  • the forward/reverse selective carry propagation network 22 or 34 selects one of these two modes of addition.
  • the binary adder circuit 80 is connected on its input side to output terminals of a four-bit index register 82 through bus lines A and on its output side to input terminals of a four-bit address register 84.
  • the address register 84 in turn is operative to provide a bit-order reversed or non-reversed address signal as an output signal of the address generator circuit herein shown.
  • the bit-order reversed or non-reversed address signal thus output from the address register 84 is fed back to and referenced by the adder circuit 80 through bus lines B.
  • the bus lines A and B herein shown correspond to the input and output lines A and B, respectively, which have been shown in FIGS. 3, 4, 6 and 7.
  • the index signal from the index register 82 and the address signal generated by the address register 84 and fed back to the adder circuit 80 thus correspond to the previously mentioned addend and augend for the generation of a modified address signal.
  • the adder circuit 80 is operative to supply an output address signal to the address register 84 as the output from the exclusive-OR gate 68 of the circuit shown in FIG. 6.
  • bit sequences X(k) of four-bit length with normal bit orders on a time axis are used as data vectors in carrying out a 16-point radix-two FFT algorithm.
  • the forward-carry/reverse-carry selector 32 of the network 22 shown in FIG. 3 or the forward-carry/reverse-carry selector 38 of the network 34 shown in FIG. 4 is first assumed to be conditioned to select the forward carry for performing a succession of binary arithmetic additions from the least significant adder stage or bit onward as exemplified in FIG. 9a.
  • Such additions proceed successively as shown in FIG.
  • a modifier index address representative of the decimal number corresponding to one half of the number of the sample points set in the FFT algorithm in use is loaded into the index register 82.
  • the sample points of the FFT algorithm herein being herein assumed to be 16 in number
  • the bit sequence (1000) representative of the decimal number "8" is loaded as a fixed modifier index address into the index register 82.
  • the forward-carry/reverse-carry selector 22 of the network 22 shown in FIG. 3 or the forward-carry/reverse-carry selector 38 of the network 34 shown in FIG. 4 is now conditioned to select the reverse carry for performing a succession of binary arithmetic additions from the most significant adder stage or bit downward as exemplified in FIG. 9b.
  • the successive add operations proceed as shown in FIG.
  • the bit-order reversible adder circuit 80 of the address generator circuit can be realized by mere addition of the forward/reverse selective carry propagation network 22 or 34 of FIG. 3 or FIG. 4 to a known type of adder/subtractor configuration which forms part of a conventional general-purpose address generator circuit.
  • Such a bit-order reversible adder circuit 80 is operable for the generation of both bit-order reversed and non-reversed addresses by iterations of simple arithmetic additions according to ordinary forward or backward binary addition rules. Generation of the bit-order reversed or non-reversed addresses is effected selectively under the control of the forward-carry/reverse-carry selector 32 forming part of the network 22 shown in FIG. 3 or the forward-carry/reverse-carry selector 38 included in the network 34 shown in FIG. 4.
  • bit-order reversed addresses can be generated quickly and efficiently simply by feeding back the address output from the address register 84 to the binary adder circuit 80 during each cycle of address generating operation.
  • the modifier index address to be loaded into the index register 82 and used as the addend in the arithmetic addition can be selected arbitrarily from among the various candidates which are equal in number to the sample points set in the FFT algorithm used.
  • the index address to be loaded into the index register 82 can thus be selected from among the total of sixteen candidates (0000), (0001), (0010), (1111) for the generation of both the bit-order reversed addresses and nonreversed addresses.
  • the bit patterns of the address signals can therefore be programmably modified by selection of any of the sixteen index addresses without having recourse to the provision of any extra hardware configurations.
  • the number of the candidates available for the selection of the index address is dictated merely by the number of the sample points to be used in the FFT algorithm to be executed.
  • the number of the bits to form each of the address signals to be generated by the address generation circuit embodying the present invention can be selected arbitrarily by selection of the sample points to be used in the FFT algorithm.
  • the index address to be used in performing the bit-order reversed address generation is selected to be representative of the decimal number corresponding to one half of the number of the sample points set in the FFT algorithm to be used.
  • Such an index address may however be substituted by an address selected depending upon the used rules of allocation of the data to the memory array.
  • one first (1/1) of the number of the sample points of the FFT algorithm used, viz., the point number of the FFT algorithm per se may be used as the decimal number to represent the modifier index address.
  • the improved address generation techniques according to the present invention can b implemented readily and economically by a hardware structure which may be composed of a sufficiently small number of semiconductor devices on, typically, a general-purpose DSP chip.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Mathematical Optimization (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Discrete Mathematics (AREA)
  • Algebra (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • Complex Calculations (AREA)
US06/935,465 1985-12-23 1986-11-26 Method of and circuit for generating bit-order modified binary signals Expired - Lifetime US4831570A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP60-290093 1985-12-23
JP60290093A JP2610417B2 (ja) 1985-12-23 1985-12-23 アドレス信号生成方法及びその回路

Publications (1)

Publication Number Publication Date
US4831570A true US4831570A (en) 1989-05-16

Family

ID=17751704

Family Applications (1)

Application Number Title Priority Date Filing Date
US06/935,465 Expired - Lifetime US4831570A (en) 1985-12-23 1986-11-26 Method of and circuit for generating bit-order modified binary signals

Country Status (4)

Country Link
US (1) US4831570A (ja)
EP (1) EP0227427B1 (ja)
JP (1) JP2610417B2 (ja)
DE (1) DE3689356T2 (ja)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4972358A (en) * 1989-06-08 1990-11-20 General Electric Company Computation of discrete fourier transform using recursive techniques
US4974188A (en) * 1988-12-09 1990-11-27 The Johns Hopkins University Address sequence generation by means of reverse carry addition
US5048021A (en) * 1989-08-28 1991-09-10 At&T Bell Laboratories Method and apparatus for generating control signals
US5134579A (en) * 1989-09-05 1992-07-28 Sony Corporation Digital adder circuit
US5177691A (en) * 1990-11-30 1993-01-05 General Electric Company Measuring velocity of a target by Doppler shift, using improvements in calculating discrete Fourier transform
US5224065A (en) * 1990-12-29 1993-06-29 Nec Corporation Arithmetic operation unit having bit inversion function
US5233553A (en) * 1991-03-06 1993-08-03 Chips And Technologies, Inc. Apparatus for performing modulo arithmetic with three-port adder
US5270955A (en) * 1992-07-31 1993-12-14 Texas Instruments Incorporated Method of detecting arithmetic or logical computation result
US5309381A (en) * 1991-04-10 1994-05-03 Ricoh Company, Ltd. Probability estimation table apparatus
US5450560A (en) * 1992-12-21 1995-09-12 Motorola, Inc. Pointer for use with a buffer and method of operation
US5473556A (en) * 1992-04-30 1995-12-05 Sharp Microelectronics Technology, Inc. Digit reverse for mixed radix FFT
US5682342A (en) * 1994-04-26 1997-10-28 Nec Corporation High-speed counter
US5875121A (en) * 1996-08-06 1999-02-23 Hewlett-Packard Company Register selection system and method
US6131108A (en) * 1998-03-31 2000-10-10 Lsi Logic Corporation Apparatus, and associated method, for generating multi-bit length sequences

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH01180633A (ja) * 1988-01-12 1989-07-18 Mitsubishi Electric Corp 加算器
US5027310A (en) * 1989-09-08 1991-06-25 Zilog, Inc. Carry chain incrementer and/or decrementer circuit

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3731284A (en) * 1971-12-27 1973-05-01 Bell Telephone Labor Inc Method and apparatus for reordering data
US3748451A (en) * 1970-08-21 1973-07-24 Control Data Corp General purpose matrix processor with convolution capabilities
US4393457A (en) * 1981-03-26 1983-07-12 Advanced Micro Devices, Inc. Method and apparatus for sequencing addresses of a fast Fourier transform array
US4602350A (en) * 1981-10-13 1986-07-22 Trw Inc. Data reordering memory for use in prime factor transform

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4181976A (en) * 1978-10-10 1980-01-01 Raytheon Company Bit reversing apparatus
JPS5965376A (ja) * 1982-10-05 1984-04-13 Nippon Telegr & Teleph Corp <Ntt> アドレス制御回路

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3748451A (en) * 1970-08-21 1973-07-24 Control Data Corp General purpose matrix processor with convolution capabilities
US3731284A (en) * 1971-12-27 1973-05-01 Bell Telephone Labor Inc Method and apparatus for reordering data
US4393457A (en) * 1981-03-26 1983-07-12 Advanced Micro Devices, Inc. Method and apparatus for sequencing addresses of a fast Fourier transform array
US4602350A (en) * 1981-10-13 1986-07-22 Trw Inc. Data reordering memory for use in prime factor transform

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4974188A (en) * 1988-12-09 1990-11-27 The Johns Hopkins University Address sequence generation by means of reverse carry addition
US4972358A (en) * 1989-06-08 1990-11-20 General Electric Company Computation of discrete fourier transform using recursive techniques
US5048021A (en) * 1989-08-28 1991-09-10 At&T Bell Laboratories Method and apparatus for generating control signals
US5134579A (en) * 1989-09-05 1992-07-28 Sony Corporation Digital adder circuit
US5177691A (en) * 1990-11-30 1993-01-05 General Electric Company Measuring velocity of a target by Doppler shift, using improvements in calculating discrete Fourier transform
US5224065A (en) * 1990-12-29 1993-06-29 Nec Corporation Arithmetic operation unit having bit inversion function
US5233553A (en) * 1991-03-06 1993-08-03 Chips And Technologies, Inc. Apparatus for performing modulo arithmetic with three-port adder
US5309381A (en) * 1991-04-10 1994-05-03 Ricoh Company, Ltd. Probability estimation table apparatus
US5473556A (en) * 1992-04-30 1995-12-05 Sharp Microelectronics Technology, Inc. Digit reverse for mixed radix FFT
US5270955A (en) * 1992-07-31 1993-12-14 Texas Instruments Incorporated Method of detecting arithmetic or logical computation result
US5508950A (en) * 1992-07-31 1996-04-16 Texas Instruments Incorporated Circuit and method for detecting if a sum of two multibit numbers equals a third multibit constant number prior to availability of the sum
US5600583A (en) * 1992-07-31 1997-02-04 Texas Instruments Incorporated Circuit and method for detecting if a sum of two multidigit numbers equals a third multidigit number prior to availability of the sum
US5450560A (en) * 1992-12-21 1995-09-12 Motorola, Inc. Pointer for use with a buffer and method of operation
US5682342A (en) * 1994-04-26 1997-10-28 Nec Corporation High-speed counter
US5875121A (en) * 1996-08-06 1999-02-23 Hewlett-Packard Company Register selection system and method
US6131108A (en) * 1998-03-31 2000-10-10 Lsi Logic Corporation Apparatus, and associated method, for generating multi-bit length sequences

Also Published As

Publication number Publication date
EP0227427A3 (en) 1990-04-04
DE3689356T2 (de) 1994-06-16
EP0227427B1 (en) 1993-12-01
JPS62147569A (ja) 1987-07-01
JP2610417B2 (ja) 1997-05-14
DE3689356D1 (de) 1994-01-13
EP0227427A2 (en) 1987-07-01

Similar Documents

Publication Publication Date Title
US4831570A (en) Method of and circuit for generating bit-order modified binary signals
US5546545A (en) Rotating priority selection logic circuit
US4682303A (en) Parallel binary adder
US6411980B2 (en) Data split parallel shifter and parallel adder/subtractor
US7509368B2 (en) Sparse tree adder circuit
JPH08110853A (ja) 高速桁上げ回路
US4758974A (en) Most significant digit location
US4441158A (en) Arithmetic operation circuit
US20060059222A1 (en) Logic entity with two outputs for efficient adder and other macro implementations
US8429213B2 (en) Method of forcing 1&#39;s and inverting sum in an adder without incurring timing delay
US5964827A (en) High-speed binary adder
US4503511A (en) Computing system with multifunctional arithmetic logic unit in single integrated circuit
JPH0580985A (ja) Ｍを法として長い整数を乗算するための算術ユニツト及びそのような乗算デバイスを具えるｒ．ｓ．ａ．変換器
US7024445B2 (en) Method and apparatus for use in booth-encoded multiplication
US5402368A (en) Computing unit and digital signal processor using the same
US7016932B2 (en) Adders and adder bit blocks having an internal propagation characteristic independent of a carry input to the bit block and methods for using the same
US5270962A (en) Multiply and divide circuit
US5875125A (en) X+2X adder with multi-bit generate/propagate circuit
US3234371A (en) Parallel adder circuit with improved carry circuitry
US4677584A (en) Data processing system with an arithmetic logic unit having improved carry look ahead
CN116149605A (zh) 模数乘法电路与计算模数乘法的方法
US5944772A (en) Combined adder and logic unit
JPH0217828B2 (ja)
US7284029B2 (en) 4-to-2 carry save adder using limited switching dynamic logic
US7386583B2 (en) Carry generator based on XOR, and conditional select adder using the carry generator, and method therefor

Legal Events

Date Code Title Description
AS Assignment

Owner name: TEXAS INSTRUMENTS INCORPORATED, 13500 NORTH CENTRA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:TEXAS INSTRUMENTS JAPAN, LTD., A COMPANY OF JAPAN;REEL/FRAME:004637/0288

Effective date: 19861105

STCF Information on status: patent grant

Free format text: PATENTED CASE

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

FPAY Fee payment

Year of fee payment: 12