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:
Nov. 27, 2012

Filed:

Oct. 02, 2008
Applicants:

Markus Pueschel, Pittsburgh, PA (US);

Peter A. Milder, Pittsburgh, PA (US);

James C. Hoe, Pittsburgh, PA (US);

Inventors:

Markus Pueschel, Pittsburgh, PA (US);

Peter A. Milder, Pittsburgh, PA (US);

James C. Hoe, Pittsburgh, PA (US);

Assignee:

Carnegie Mellon University, Pittsburgh, PA (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 17/50 (2006.01);
U.S. Cl.
CPC ...
Abstract

Computer-implemented systems and methods that provide an efficient technique for performing a large class of permutations on data vectors of length 2, n>1, implemented with streaming width 2(where 1≦k≦n−1). The technique applies to any permutation Q on 2datawords that can be specified as a linear transform, i.e., as an n×n bit matrix (a matrix containing only 1s and 0s) P on the bit level. The relationship between Q and P is as follows: If Q maps (dataword) i to (dataword) j, then the bit representation of j is the bit-matrix-vector product of P with the bit representation of i. Given such a permutation specified by the matrix P and given the streaming width (k), an architectural framework (or datapath) is calculated to implement the permutation.


Find Patent Forward Citations

Loading…