US4831571A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Barrel shifter for rotating data with or without carry
Assignee: Toshiba Corp
•
Filing: 1987-08-10
•
Granted: 1989-05-16
•
Expires: 2007-08-10
Abstract
Abstract In a barrel shifter, carry-including rotation operation is implemented only by hardware in such a way that: an N-bit data is shifted by a given shift count through selectors in response to shift signals to obtain a 2N-bit shifted data; a carry is inserted behind a least significant bit of the shifted data through AND gates responsive to a carry signal and a carry rotate signal; and logical sums of each of N lower significant bits of the sN-bit shifted data and each of (shifted by one bit in the higher significant direction) (N-1) higher significant bits thereof are found through selectors and OR gates in response to a carry rotate signal to obtain an N-bit rotated data with carry.
Inventors
- 👤 Takeji Tokumaru
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 22:42
CPC Classifications
G; G06; G06F; G06F5/00; G06F5/01; G06F5/015
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
158 words
A barrel shifter comprising: (a) shifting means for selectively shifting an N-bit input data by a given shift count in response to a plurality of shift signals indicative of a shift count in combination and outputting a 2N-bit output data; (b) ANDing means connected to said shifting means for ANDing a carry signal and a first carry rotate signal to insert a a carry bit behind a least significant bit position of the shifted N-bit output in cooperation with the shift signals; and (c) ORing means connected to said shifting means for finding logical sums of each of N lower significant bits and each of N higher significant bits in response to a rotate signal R to obtain an N-bit rotated data without carry, and logical sums of each of N lower significant bits and each of (N-1) higher significant bits in response to a second carry rotate signal CR to obtain an N-bit rotated data with carry.
Claim 2
Dependent Claim
158 words
A barrel shifter comprising: (a) shifting means for selectively shifting an N-bit input data by a given shift count in response to a plurality of shift signals indicative of a shift count in combination and outputting a 2N-bit output data; (b) ANDing means connected to said shifting means for ANDing a carry signal and a first carry rotate signal to insert a a carry bit behind a least significant bit position of the shifted N-bit output in cooperation with the shift signals; and (c) ORing means connected to said shifting means for finding logical sums of each of N lower significant bits and each of N higher significant bits in response to a rotate signal R to obtain an N-bit rotated data without carry, and logical sums of each of N lower significant bits and each of (N-1) higher significant bits in response to a second carry rotate signal CR to obtain an N-bit rotated data with carry.
Claim 3
Dependent Claim
285 words
A barrel shifter for shifting an N-bit data, which comprises: (a) a plurality of parallel-connected selectors each having first series-connected selector elements connected to each bit of the N-bit data for shifting the N-bit data in response to one of shift signals and second series-connected selector elements also connected to each bit of the N-bit data for directly outputting the N-bit data without shift in response to one of inverted shift-signals; (b) a plurality of ANDing means each connected to one of said first series-connected selector elements for inserting a carry bit behind a least significant bit of the shifted N-bit output in response to an AND product of a carry signal and a first carry rotate signal in cooperation with the shift signals; (c) two parallel-connected selectors each having third series-connected selector elements connected to a first plurality of outputs of one of the parallel-connected selectors for outputting (N-1) higher significant bits in response to a second carry rotate signal and fourth series-connected selector elements connected to a second plurality of outputs of the same one of the parallel-connected selectors for outputting N higher significant bits in response to a rotate signal; and (d) ORing means connected to said two parallel-connected selectors for outputting an N-bit rotated data without carry by finding logical sums of each of N lower significant bits and each of N higher significant bits outputted from said fourth series-connected selector elements in response to the rotate signal and for outputting an N-bit rotated data including a carry by finding logical sums of each of N lower significant bits and each of (N-1) higher significant bits outputted from said third series-connected selector elements in response to the second carry rotate signal.
Claim 4
Dependent Claim
285 words
A barrel shifter for shifting an N-bit data, which comprises: (a) a plurality of parallel-connected selectors each having first series-connected selector elements connected to each bit of the N-bit data for shifting the N-bit data in response to one of shift signals and second series-connected selector elements also connected to each bit of the N-bit data for directly outputting the N-bit data without shift in response to one of inverted shift-signals; (b) a plurality of ANDing means each connected to one of said first series-connected selector elements for inserting a carry bit behind a least significant bit of the shifted N-bit output in response to an AND product of a carry signal and a first carry rotate signal in cooperation with the shift signals; (c) two parallel-connected selectors each having third series-connected selector elements connected to a first plurality of outputs of one of the parallel-connected selectors for outputting (N-1) higher significant bits in response to a second carry rotate signal and fourth series-connected selector elements connected to a second plurality of outputs of the same one of the parallel-connected selectors for outputting N higher significant bits in response to a rotate signal; and (d) ORing means connected to said two parallel-connected selectors for outputting an N-bit rotated data without carry by finding logical sums of each of N lower significant bits and each of N higher significant bits outputted from said fourth series-connected selector elements in response to the rotate signal and for outputting an N-bit rotated data including a carry by finding logical sums of each of N lower significant bits and each of (N-1) higher significant bits outputted from said third series-connected selector elements in response to the second carry rotate signal.
Claim 5
Independent Claim
123 words
A method of rotating an N-bit data with carry, which comprises the following steps of: (a) shifting a data by a given shift count in response to shift signals to obtain a 2N-bit shifted data; (b) inserting a carry bit behind a least significant bit of the shifted data in response to a carry signal and a carry rotate signal; (c) finding logical sums of each of N lower significant bits of the 2N-bit shifted data and each of (N-1) higher significant bits of the 2N-bit shifted data in response to another carry rotate signal to obtain an N-bit rotated data with carry bit; and (d) storing a bit before a most significant bit of the carry rotated data in a carry flip-flop.
Claim 6
Independent Claim
123 words
A method of rotating an N-bit data with carry, which comprises the following steps of: (a) shifting a data by a given shift count in response to shift signals to obtain a 2N-bit shifted data; (b) inserting a carry bit behind a least significant bit of the shifted data in response to a carry signal and a carry rotate signal; (c) finding logical sums of each of N lower significant bits of the 2N-bit shifted data and each of (N-1) higher significant bits of the 2N-bit shifted data in response to another carry rotate signal to obtain an N-bit rotated data with carry bit; and (d) storing a bit before a most significant bit of the carry rotated data in a carry flip-flop.
Claim 7
Dependent Claim
32 words
The method of claim 3, wherein a relationship between carry-including rotate count Lc and rightward carry-including rotate count Rc is expressed as Lc=N-Rc-1 where N denotes the number of input data bits.
Claim 8
Independent Claim
182 words
A method of rotating an N-bit data with or without carry, which comprises the following steps of: (a) shifting a data by a given shift count in response to shift signals to obtain a 2N-bit shifted data; (b) when the N-bit data is rotated without carry, finding logical sums of each of N lower significant bits of the 2N-bit shifted data and each of N higher significant bits of the 2N-bit shifted data in response to a rotate signal to obtain an N-bit rotated data without carry; (c) when the N-bit data is rotated with carry, inserting a carry behind a least significant bit of the shifted data in response to a carry signal and a carry rotate signal; (d) finding logical sums of each of N lower significant bits of the 2N-bit shifted data and each of (N-1) higher significant bits of the 2N-bit shifted data in response to another carry rotate signal to obtain an N-bit rotated data with carry; and (e) storing a bit before a most significant bit of the rotated data with carry in a carry flip-flop.
Claim 9
Independent Claim
182 words
A method of rotating an N-bit data with or without carry, which comprises the following steps of: (a) shifting a data by a given shift count in response to shift signals to obtain a 2N-bit shifted data; (b) when the N-bit data is rotated without carry, finding logical sums of each of N lower significant bits of the 2N-bit shifted data and each of N higher significant bits of the 2N-bit shifted data in response to a rotate signal to obtain an N-bit rotated data without carry; (c) when the N-bit data is rotated with carry, inserting a carry behind a least significant bit of the shifted data in response to a carry signal and a carry rotate signal; (d) finding logical sums of each of N lower significant bits of the 2N-bit shifted data and each of (N-1) higher significant bits of the 2N-bit shifted data in response to another carry rotate signal to obtain an N-bit rotated data with carry; and (e) storing a bit before a most significant bit of the rotated data with carry in a carry flip-flop.
Claim 10
Dependent Claim
33 words
The method of claim 5, wherein a relationship between leftward carry-excluding rotate count L and rightward carry-excluding rotate count R is expressed as L=N-R where N denotes the number of input data bits.
References Cited (Backward Citations)
US3961750A
Cited
US4345316A
Cited
US4383304A
Cited
US4509144A
Cited
US4472788A
Cited
US4396994A
Cited
US4583197A
Cited
US4653019A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-05-15 | 1992-11-14 | 1993-05-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-05-15 | 1996-11-14 | 1997-05-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-05-15 | 2000-11-14 | 2001-05-16 | $7700.00 | Window Closed / Lapsed |