Patent US4914615A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4914615A Expired / Lapsed US ⏱️ 0.0 years remaining

Calculator of matrix products

Assignee: Nokia Bell Labs
•
Filing: 1987-09-04
•
Granted: 1990-04-03
•
Expires: 2007-09-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Apparatus and method for efficient multiplication of a matrix by a vector. The multiplication is realized by rearranging the matrix so that a plurality of adjacent columns form a set, and each set is characterized by a certain pattern in each column. One set contains columns of only a single +/-1 entry, another set contains columns with two +/-1 entries, and still another set contains columns with entries that are other than +/-1. Each of the sets is treated differently during the calculations in accordance with a maximal * cover approach, and a result is developed by multiplying each row in the rearranged matrix by a corresponding element of the vector to form partial results, and accumulating the partial results.

Inventors

  • 👤 Narendra K. Karmarkar
  • 👤 Kajamalai G. Ramakrishnan

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 02:02
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/16

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 182 words
A calculator for developing a product Bw, where B is a sparse matrix and w is a vector, comprising: means for entering signals representative of matrix B and vector w into said calculator; memory means responsive to said means for entering for storing matrix B in sets of columns where one set comprises columns with at least two of non-zero valued entries in each column, said sets being stored with row references to said entries of non-zero values; means for dividing each of said sets into subgroups of columns characterized by each column in each of said subgroups having a non-zero value in a common row; means, responsive to said means for dividing, for deleting from said memory means duplicate instances of said common row references, to form a reduced stored list of row references; means, responsive to said reduced stored list, for developing a product signal equal to ##EQU16## where each b i is a column in matrix B and each w i is an element of said vector w; and means for delivering said product signal out of said calculator.
Claim 2
Dependent Claim 182 words
A calculator for developing a product Bw, where B is a sparse matrix and w is a vector, comprising: means for entering signals representative of matrix B and vector w into said calculator; memory means responsive to said means for entering for storing matrix B in sets of columns where one set comprises columns with at least two of non-zero valued entries in each column, said sets being stored with row references to said entries of non-zero values; means for dividing each of said sets into subgroups of columns characterized by each column in each of said subgroups having a non-zero value in a common row; means, responsive to said means for dividing, for deleting from said memory means duplicate instances of said common row references, to form a reduced stored list of row references; means, responsive to said reduced stored list, for developing a product signal equal to ##EQU16## where each b i is a column in matrix B and each w i is an element of said vector w; and means for delivering said product signal out of said calculator.
Claim 3
Dependent Claim 95 words
The apparatus of claim 1 wherein said memory means comprises means for storing said B matrix in a list that groups said columns of said B matrix into sets, where one set represents columns that include a single entry of non-zero value and stores row references of said non-zero valued columns; another set represnets columns that contain two non-zero values of equal sign, and stores row references of said equal signed columns; and still another set represents columns that contain two non-zero values of opposite sign, and stores row references of said opposite signed columns;
Claim 4
Dependent Claim 204 words
Apparatus for developing a matrix product AD 2 A T w, where A is a matrix comprising columns a i , D is a diagonal matrix, and w is a vector, comprising: first means having a storage for storing said A matrix in a list that groups said columns of said A matrix into sets, where one set represents columns that include a single entry of non-zero value and stores row references of said non-zero valued columns; another set represents columns that contain two non-zero values of equal sign, and stores row references of said equal signed columns; and still another set represents columns that contain two non-zero values of opposite sign, and stores row references of said opposite signed columns; second means for dividing each of said sets into subgroups of columns characterized by each column in each of said subgroups having a non-zero value in a common row; third means responsive to said first means for deleting from storage duplicate instances of said common row references, to form a reduced stored list of row references; and fourth means, responsive to said reduced stored list, for evaluating ##EQU17## where d i is the element in the i th row of said D matrix.
Claim 5
Dependent Claim 204 words
Apparatus for developing a matrix product AD 2 A T w, where A is a matrix comprising columns a i , D is a diagonal matrix, and w is a vector, comprising: first means having a storage for storing said A matrix in a list that groups said columns of said A matrix into sets, where one set represents columns that include a single entry of non-zero value and stores row references of said non-zero valued columns; another set represents columns that contain two non-zero values of equal sign, and stores row references of said equal signed columns; and still another set represents columns that contain two non-zero values of opposite sign, and stores row references of said opposite signed columns; second means for dividing each of said sets into subgroups of columns characterized by each column in each of said subgroups having a non-zero value in a common row; third means responsive to said first means for deleting from storage duplicate instances of said common row references, to form a reduced stored list of row references; and fourth means, responsive to said reduced stored list, for evaluating ##EQU17## where d i is the element in the i th row of said D matrix.
Claim 6
Dependent Claim 107 words
The apparatus of claim 3 wherein said fourth means evaluates ##EQU18## with apparatus comprising: means for developing a dot product of each column in said A matrix, a i , with vector w to yield a scalar a i T w, where i is a summation index; means for multiplying said scalar with the diagonal entry in row i of said D matrix, d i , squared; means for developing a vector signal d i 2 (a i T w)a i ; and means for accumulating the vector signals developed by said means for developing a vector signal to produce a resultant vector from the sum ##EQU19##

References Cited (Backward Citations)

US3974481A Cited
US4744028A Cited
US4744026A Cited
US4744027A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-04-02 1993-10-02 1994-04-03 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-04-02 1997-10-02 1998-04-03 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-04-02 2001-10-02 2002-04-03 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag