Browse Prior Art Database

Shifting/Rotation Algorithm Using Logic Arrays

IP.com Disclosure Number: IPCOM000081829D
Original Publication Date: 1974-Aug-01
Included in the Prior Art Database: 2005-Feb-28
Document File: 2 page(s) / 54K

Publishing Venue

IBM

Related People

Finger, WC: AUTHOR [+3]

Abstract

The system shown in the figure is composed of three separate arrays: a rotate array, a shift array and a high-bit detect array. The system has N inputs (I(1), I(2)... I(N)), and performs 0 through N-1 bit shift/rotate left operations. Therefore, the size of each array is N X N crosspoints. Each crosspoint represents an AND gate. The wire pattern in the arrays is highly regular. (Image Omitted)

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 2

Shifting/Rotation Algorithm Using Logic Arrays

The system shown in the figure is composed of three separate arrays: a rotate array, a shift array and a high-bit detect array. The system has N inputs (I(1), I(2)... I(N)), and performs 0 through N-1 bit shift/rotate left operations. Therefore, the size of each array is N X N crosspoints. Each crosspoint represents an AND gate. The wire pattern in the arrays is highly regular.

(Image Omitted)

1

Page 2 of 2

2

[This page contains 5 pictures or other non-text objects]