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

Binary arithmetic and logic manipulator

Assignee: International Business Machines Corp
•
Filing: 1968-10-14
•
Granted: 1971-06-08
•
Expires: 1988-10-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A programmable binary arithmetic and logic manipulator which comprises a rectangular array of (M) (N+1) logic cells and N+1 columnar control cells. The columnar control cells are designated as U and V and are binary stages capable of assuming binary one or binary zero states. These columnar control cells control the overall operation performed by each column. Associated with each cell are a pair of binary stages designated X and Y respectively, which in conjunction with the columnar control cells U and V define the outputs D and E of a cell as functions of the cell inputs A, B and C. The output lines D and E of each cell are used as inputs to adjacent cells or, at the edges of the array, as inputs to external logic or additional arrays. Each column can be selected by a storage position U as an arithmetic or logical operation. In addition, each column can be selected by a storage position V as (1) their AND and OR function when used with U as a logical operation or (2) as a binary input to the column when used with U as an arithmetic operation. Input C may be connected externally to input B or may instead be connected externally to another array or to external logic. Each logical cell contains a circuit whereby the logic statements for each output line are as follows: D X(YC+YB)+X(UA+UC(YB+YB)) E X(YB+YC)+X (UV+UC+UC) (YB+YB))+(UC(YB+YB)) +(UVC

Inventors

  • 👤 Davey Malaby
  • 👤 Michael A Wesley

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-22 20:35
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/57; G06F7/575; G06F7/02; H; H03; H03K; H03K19/00; H03K19/02; H03K19/173; H03K19/177; H03K19/17704; H03K19/17724; H03K19/17728

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 271 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the output E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determined by said U and V stages, said X and Y stages each being capable of assuming opposite binary states; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-CN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+X(UA+UC(YB+YB)) E X(YB+YC)+X ((UV+UC+UC)(YB+ YB))+(UC(YB+YB))+(UVC)
Claim 2
Dependent Claim 271 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the output E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determined by said U and V stages, said X and Y stages each being capable of assuming opposite binary states; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-CN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+X(UA+UC(YB+YB)) E X(YB+YC)+X ((UV+UC+UC)(YB+ YB))+(UC(YB+YB))+(UVC)
Claim 3
Dependent Claim 334 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1 columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the output E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determined by said U and V stages, said X and Y stages each being capable of assuming opposite binary states; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-CN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+XUA+UC(YB+YB)) E X(YB+YC)+X ((UV+UC+UC)(YB+ YB))+(UC(YB+YB))+(UVC) means for connecting the respective V stages, the U stages and the X and Y stages in series arrangement to enable said last named arrangement to be operated as a shift register in the column; and means for applying an input to each of said columns for respectively shifting the contents of said V, U, X and Y stages in the columns.
Claim 4
Dependent Claim 334 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1 columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the output E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determined by said U and V stages, said X and Y stages each being capable of assuming opposite binary states; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-CN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+XUA+UC(YB+YB)) E X(YB+YC)+X ((UV+UC+UC)(YB+ YB))+(UC(YB+YB))+(UVC) means for connecting the respective V stages, the U stages and the X and Y stages in series arrangement to enable said last named arrangement to be operated as a shift register in the column; and means for applying an input to each of said columns for respectively shifting the contents of said V, U, X and Y stages in the columns.
Claim 5
Dependent Claim 397 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1 columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the output E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states, one binary state of said U stage resulting in an arithmetic operation for a column, the opposite binary state of said U stage resulting in a logical operation for said column, one binary state of said V stage resulting in the addition of a binary ''''1'''' to a column when the state of said U stage results in an arithmetic operation, the opposite binary state of said V stage in said arithmetic operation resulting in the addition of a binary ''''0'''' to a column, one binary state of said V stage resulting in an AND operation when the state of said U stage results in a logical operation, the opposite binary state of said V stage during said logical operation resulting in an OR operation; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determinEd by said U and V stages, said X and Y stages each being capable of assuming opposite binary states; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-CN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+X(UA+UC(YB+YB)) E X(YB+YC)+X ((UV+UC+UC)(YB+ YB))+(UC(YB+YB))+(UVC)
Claim 6
Dependent Claim 397 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1 columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the output E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states, one binary state of said U stage resulting in an arithmetic operation for a column, the opposite binary state of said U stage resulting in a logical operation for said column, one binary state of said V stage resulting in the addition of a binary ''''1'''' to a column when the state of said U stage results in an arithmetic operation, the opposite binary state of said V stage in said arithmetic operation resulting in the addition of a binary ''''0'''' to a column, one binary state of said V stage resulting in an AND operation when the state of said U stage results in a logical operation, the opposite binary state of said V stage during said logical operation resulting in an OR operation; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determinEd by said U and V stages, said X and Y stages each being capable of assuming opposite binary states; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-CN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+X(UA+UC(YB+YB)) E X(YB+YC)+X ((UV+UC+UC)(YB+ YB))+(UC(YB+YB))+(UVC)
Claim 7
Dependent Claim 413 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1 columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the output E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determined by said U and V stages, said X and Y stages each being capable of assuming opposite binary states, one binary state of said X stage resulting in a care operation in a cell controlled thereby, the opposite binary state of said X stage resulting in a don''t care operation in said cell, one binary state of said Y stage when the state of its corresponding X stage results in a care operation causing the selection of the true value of the B input to said cell, the opposite binary state of said Y stage during said care operation causing the selection of the complement of the B input to said cell, one binary state of said Y stage when the state of its corresponding X stage results in a don''t care operation causing a transfer operation in said cell, the opposite binary state of said Y stage during said don''t care operation causing a pass operation in said cell; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-CN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+X(UA+UC(YB+YB)) E E X(YB+YC)+X ((UV+UC+UC)(YB+YB)+(UC(YB+YB))+(UVC)
Claim 8
Dependent Claim 413 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1 columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the output E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determined by said U and V stages, said X and Y stages each being capable of assuming opposite binary states, one binary state of said X stage resulting in a care operation in a cell controlled thereby, the opposite binary state of said X stage resulting in a don''t care operation in said cell, one binary state of said Y stage when the state of its corresponding X stage results in a care operation causing the selection of the true value of the B input to said cell, the opposite binary state of said Y stage during said care operation causing the selection of the complement of the B input to said cell, one binary state of said Y stage when the state of its corresponding X stage results in a don''t care operation causing a transfer operation in said cell, the opposite binary state of said Y stage during said don''t care operation causing a pass operation in said cell; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-CN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+X(UA+UC(YB+YB)) E E X(YB+YC)+X ((UV+UC+UC)(YB+YB)+(UC(YB+YB))+(UVC)
Claim 9
Dependent Claim 538 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1 columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the oUtput E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states, one binary state of said U stage resulting in an arithmetic operation for a column, the opposite binary state of said U stage resulting in a logic operation for said column, one binary state of said V stage resulting in the addition of a binary ''''1'''' to a column when the state of said U stage results in an arithmetic operation, the opposite binary state of said V stage in said arithmetic operation resulting in the addition of a binary ''''0'''' to a column, one binary state of said V stage resulting in an AND operation when the state of said U stage results in a logical operation, the opposite binary state of said V stage during said logical operation resulting in an OR operation; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determined by said U and V stages, said X and Y stages each being capable of assuming opposite binary states, one binary state of said X stage resulting in a care operation in a cell controlled thereby, the opposite binary state of said X stage resulting in a don''t care operation in said cell, one binary state of said Y stage when the state of its corresponding X stage results in a care operation causing the selection of the true value of the B input to said cell, the opposite binary state of said Y stage during said care operation causing the selection of the complement of the B input to said cell, one binary state of said Y stage when the state of its corresponding X stage results in a don''t care operation causing a transfer operation in said cell, the opposite binary state of said Y stage during said don''t care operation causing a pass operation in said cell; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-DN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+X(UA+UC(YB+YB)) E X(YB+YC)+X ((UV+UC+UC)(YB+ YB))+(UC(YB+YB))+(UVC)
Claim 10
Dependent Claim 538 words
A programmable logic and arithmetic manipulating arrangement comprising: a rectangular array of cells which define N+1 columns of said cells and M rows of said cells, the output D of each cell in a row being applied as an input B to the next cell to the right in said row, the oUtput E of each cell in a column being applied as an input C to the next lower cell in said column; a first storage stage U and a second storage stage V connected to each of said columns for determining the operation to be performed by each column, said U and V stages each being capable of assuming opposite binary states, one binary state of said U stage resulting in an arithmetic operation for a column, the opposite binary state of said U stage resulting in a logic operation for said column, one binary state of said V stage resulting in the addition of a binary ''''1'''' to a column when the state of said U stage results in an arithmetic operation, the opposite binary state of said V stage in said arithmetic operation resulting in the addition of a binary ''''0'''' to a column, one binary state of said V stage resulting in an AND operation when the state of said U stage results in a logical operation, the opposite binary state of said V stage during said logical operation resulting in an OR operation; a third storage stage X and a fourth storage stage Y connected to each of said cells for determining the operations to be performed by each of said cells in accordance with the operation determined by said U and V stages, said X and Y stages each being capable of assuming opposite binary states, one binary state of said X stage resulting in a care operation in a cell controlled thereby, the opposite binary state of said X stage resulting in a don''t care operation in said cell, one binary state of said Y stage when the state of its corresponding X stage results in a care operation causing the selection of the true value of the B input to said cell, the opposite binary state of said Y stage during said care operation causing the selection of the complement of the B input to said cell, one binary state of said Y stage when the state of its corresponding X stage results in a don''t care operation causing a transfer operation in said cell, the opposite binary state of said Y stage during said don''t care operation causing a pass operation in said cell; means for applying respective B1-BM inputs to each of the cells in the leftmost column of said array; means for applying A1-AM respective inputs to the cells comprising each row in said array; means for applying respective C0-DN inputs to each of the cells in the topmost row of said array; said array being operative to produce respective D1-DM outputs from the cells comprising the rightmost column of said array and E0-EN respective outputs from the cells comprising the lowermost row of said array; said cells each comprising a circuit for producing the following D and E outputs: D X(YC+YB)+X(UA+UC(YB+YB)) E X(YB+YC)+X ((UV+UC+UC)(YB+ YB))+(UC(YB+YB))+(UVC)
Claim 11
Dependent Claim 52 words
An arrangement as defined in claim 5 wherein there are included a plurality of said arrays, the D1-DM outputs of an array being the B1-BM inputs to an array horizontally adjacent to said array, the E0-EN outputs of an array being the C0-CN inputs to an array horizontally adjacent to said array.
Claim 12
Dependent Claim 25 words
An arrangement as defined in claim 5 wherein said A and B inputs are tied together and said C and V inputs are tied together.
Claim 13
Dependent Claim 29 words
An arrangement as defined in claim 5 wherein there are included a plurality of said arrays, the E0-EN outputs of an array being the A1-AM inputs to another array.

References Cited (Backward Citations)

US3261000A Cited
US3371320A Cited
US3454310A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1974-06-07 1974-12-07 1975-06-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1978-06-07 1978-12-07 1979-06-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1982-06-07 1982-12-07 1983-06-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag