The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Mar. 12, 1985

Filed:

Jan. 18, 1982
Applicant:
Inventor:

Klein S Gilhousen, San Diego, CA (US);

Assignee:

M/A-Com Linkabit, Inc., San Diego, CA (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F / ;
U.S. Cl.
CPC ...
364900 ;
Abstract

A self-shifting last-in-first-out stack for a data processing system, including a plurality of parallel linear arrays of data storage cells interconnected for enabling stored data to be shifted to or from an adjacent cell within the same array. The parallel (n)th cells from the top of the stack in the respective arrays define the (n)th word level in the stack. The stack further includes a control circuit having a linear array of control cells corresponding to the liner arrays of data storage cells, with each (n)th control cell in the array from the top of the stack being connected to the corresponding word level of data storage cells and its adjacent word levels of data storage cells for sensing the storage states of the corresponding word level of data storage cells and its adjacent word levels of data storage cells, and in response to the sensed states, for causing stored data to be shifted from each cell of the (n)th word level into the cells of the (n+1)th word level whenever the (n)th word level is full, the (n+1) word level is empty and the (n-1) word level is full; and for causing stored data to be shifted into each cell of the (n)th word level from the cells of the (n+1)th word level whenever the (n)th word level is empty, the (n+1)th word level is full and the (n-1)th word level is empty, wherein n is an integer greater than one.


Find Patent Forward Citations

Loading…