← Back to Patent Explorer
US4122534A Expired / Lapsed US ⏱️ 0.0 years remaining

Parallel bidirectional shifter

Assignee: Nortel Networks Ltd
•
Filing: 1977-06-17
•
Granted: 1978-10-24
•
Expires: 1997-06-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A circuit for shifting a binary data word having N-bits any number up to N-1 positions left or right is described. A shifting network having a plurality of levels for shifting a binary word a predetermined number of positions in only one predetermined direction is cross-connected to a register such that the register stores the mirror image of the binary word appearing at the output of the shifting network. The output of the register is connected back to the input of the shifting network. By passing an input data word twice through the device, it can be shifted left or right any number of positions.

Inventors

  • 👤 Caesar Cesaratto

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 12:41
CPC Classifications
G; G06; G06F; G06F5/00; G06F5/01; G06F5/015

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 118 words
A parallel bidirectional shifter circuit for shifting a binary data word having N-bits any number up to N-1 positions left or right, comprising, a shifting network for shifting a binary data word any number up to N-1 positions in one predetermined direction, the shifting network having N output leads; and a data register having N storage locations and N input leads, the output leads of the shifting network being cross-connected to the input leads of the register such that a binary word loaded therein from the shifting network is the mirror image of the binary word appearing at the output of the network, the ouput of the register being connected back to the input of the shifting network.
Claim 2
Dependent Claim 118 words
A parallel bidirectional shifter circuit for shifting a binary data word having N-bits any number up to N-1 positions left or right, comprising, a shifting network for shifting a binary data word any number up to N-1 positions in one predetermined direction, the shifting network having N output leads; and a data register having N storage locations and N input leads, the output leads of the shifting network being cross-connected to the input leads of the register such that a binary word loaded therein from the shifting network is the mirror image of the binary word appearing at the output of the network, the ouput of the register being connected back to the input of the shifting network.
Claim 3
Dependent Claim 174 words
A parallel bidirectional shifter circuit for shifting a binary data word having N-bits any number up to N-1 positions left or right comprising, a shifting network having a plurality of shifting levels each comprising a plurality of gates; the gates at each level of the network being logically connected to the gates at the previous level for shifting a binary data word at the output thereof a predetermined number of positions in one predetermined direction, said gates at each level being also logically connected to the gates at the previous level for transmitting a binary data word at the output thereof without positional shift; means for receiving signals for controlling the operation of said gates at each level; and a data register having its input cross-connected to the output of the shifting network such that a binary word loaded in the register from the network is the mirror image of the binary data word appearing at the output thereof, the output of the register being connected back to the input of the shifting network.
Claim 4
Dependent Claim 174 words
A parallel bidirectional shifter circuit for shifting a binary data word having N-bits any number up to N-1 positions left or right comprising, a shifting network having a plurality of shifting levels each comprising a plurality of gates; the gates at each level of the network being logically connected to the gates at the previous level for shifting a binary data word at the output thereof a predetermined number of positions in one predetermined direction, said gates at each level being also logically connected to the gates at the previous level for transmitting a binary data word at the output thereof without positional shift; means for receiving signals for controlling the operation of said gates at each level; and a data register having its input cross-connected to the output of the shifting network such that a binary word loaded in the register from the network is the mirror image of the binary data word appearing at the output thereof, the output of the register being connected back to the input of the shifting network.
Claim 5
Dependent Claim 26 words
A shifter circuit as defined in claim 2 wherein each of the gates at each level of the shifting network is a dual-input data select gate.
Claim 6
Dependent Claim 103 words
A shifter circuit as defined in claim 3 and further comprising, a plurality of input and output terminals for connection to input and output data buses respectively and wherein each storage element of the data register includes a dual-input data select gate having a first input connected to one of said input terminals, a second input cross-connected to the shifting network, and an output connected to the input of the storage element, the output of each storage element being also connected to a respective one of said output terminals, and means for receiving signals for controlling the operation of the data select gates.
Claim 7
Dependent Claim 41 words
A shifter circuit as defined in claim 4 and further comprising means for receiving signals for controlling the loading of an input data word into said data register and for circulating said word twice through the shifting network and data register.
Claim 8
Independent Claim 155 words
A method of shifting an input binary data word having N-bits any desired number up to N-1 positions left or right using a shifting network adapted to shift a binary word any number up to N-1 positions in only one predetermined direction, comprising the steps of: passing the input binary word through the shifting network a first time to impart to it a first positional shift in said one direction, interchanging the relative position of the bits in the binary word resulting from the first pass to form the mirror-image thereof, passing the mirror-image word through the switching network to impart to it a second positional shift in said one direction, and interchanging the relative position of the bits in the binary word resulting from the second pass through the network to form the mirror-image thereof whereby the second formed mirror-image word reflects the desired positional shift left or right of the original binary word.
Claim 9
Independent Claim 155 words
A method of shifting an input binary data word having N-bits any desired number up to N-1 positions left or right using a shifting network adapted to shift a binary word any number up to N-1 positions in only one predetermined direction, comprising the steps of: passing the input binary word through the shifting network a first time to impart to it a first positional shift in said one direction, interchanging the relative position of the bits in the binary word resulting from the first pass to form the mirror-image thereof, passing the mirror-image word through the switching network to impart to it a second positional shift in said one direction, and interchanging the relative position of the bits in the binary word resulting from the second pass through the network to form the mirror-image thereof whereby the second formed mirror-image word reflects the desired positional shift left or right of the original binary word.

References Cited (Backward Citations)

US3535694A Cited
US3790960A Cited
US3914744A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1981-10-23 1982-04-24 1982-10-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1985-10-23 1986-04-24 1986-10-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1989-10-23 1990-04-24 1990-10-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag