US5001418A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for compressing data-vectors for a circuit board testing machine
Assignee: Agilent Technologies Inc
•
Filing: 1989-12-06
•
Granted: 1991-03-19
•
Expires: 2009-12-06
Abstract
Abstract Disclosed is a method for compressing sequences of data-vectors, which sequences are to be used for testing circuit boards with the aid of a circuit board testing machine. The method involves an initial compression of the data-vector sequence followed by a so-called K-T transformation of the remaining data-vectors. The initial compression involves eliminating redundant data-vectors from the initial sequence and retaining only the unique data-vectors together with sequencing information indicating where in the initial sequence each unique-data vector occurred. The K-T transformation involves a bitwise logical exclusive-OR operation (XOR) whereby the remaining data-vector sequence is K-T transformed thereby further compressing the sequence without losing any of the original sequence information.
Inventors
- 👤 Kenneth E. Posse
- 👤 Kevin W. Keirn
- 👤 Michael A. Lassner
- 👤 George L. Booth
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 16:16
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/008; G06F; G06F11/00; G06F11/22; G06F11/26; G06F11/273; G06F11/277; H; H03; H03M; H03M7/00; H03M7/30
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
172 words
A method for compressing a predetermined set of binary data-vectors, said data-vectors to be used as executable input information in circuit board testing, said method comprising the steps of: (a) electronically reading said set; (b) identifying the unique data-vectors within said set; (c) creating a first subset of said set consisting of said unique data-vectors; (d) testing said first subset to determine if the number of unique data-vectors in said first subset exceeds a predetermined value; (e) jumping to step h if said number exceeds said value; (f) storing said first subset; (g) executing said first subset and exiting said method; (h) performing a K-T transformation operation on said first subset to produce a second subset of K-T transform vectors; (i) retaining the unique transform vectors within said second subset; (j) creating a third subset of second subset consisting of said unique transform vectors and index information indicating the position in said second subset of said unique transformvectors; (k) storing said third subset; (l) executing said third subset and exiting said method.
Claim 2
Independent Claim
172 words
A method for compressing a predetermined set of binary data-vectors, said data-vectors to be used as executable input information in circuit board testing, said method comprising the steps of: (a) electronically reading said set; (b) identifying the unique data-vectors within said set; (c) creating a first subset of said set consisting of said unique data-vectors; (d) testing said first subset to determine if the number of unique data-vectors in said first subset exceeds a predetermined value; (e) jumping to step h if said number exceeds said value; (f) storing said first subset; (g) executing said first subset and exiting said method; (h) performing a K-T transformation operation on said first subset to produce a second subset of K-T transform vectors; (i) retaining the unique transform vectors within said second subset; (j) creating a third subset of second subset consisting of said unique transform vectors and index information indicating the position in said second subset of said unique transformvectors; (k) storing said third subset; (l) executing said third subset and exiting said method.
Claim 3
Dependent Claim
28 words
A method, as in claim 1, wherein said K-T transformation comprises the step of applying a bit-wise logical exclusive-OR gating operation to the data-vectors of said first subset.
Claim 4
Dependent Claim
107 words
An improved method for compressing a previously created first subset of a set of binary data-vectors, wherein said data-vectors are to be used as executable input information in circuit board testing and wherein said first subset is created from the unique data-vectors in said set of binary data-vectors, said improvement comprising the steps of: transforming said data-vectors in said first subset by a K-T transformation operation to produce a second subset comprising K-T transform vectors; identifying the unique K-T transform vectors within said second subset; and retaining the unique K-T transform vectors within said second subset, thereby creating a third subset of said unique K-T transform vectors.
Claim 5
Dependent Claim
107 words
An improved method for compressing a previously created first subset of a set of binary data-vectors, wherein said data-vectors are to be used as executable input information in circuit board testing and wherein said first subset is created from the unique data-vectors in said set of binary data-vectors, said improvement comprising the steps of: transforming said data-vectors in said first subset by a K-T transformation operation to produce a second subset comprising K-T transform vectors; identifying the unique K-T transform vectors within said second subset; and retaining the unique K-T transform vectors within said second subset, thereby creating a third subset of said unique K-T transform vectors.
Claim 6
Dependent Claim
45 words
The method of claim 3, wherein said step of retaining the unique K-T transform vectors within said second subset comprises the step of determining sequencing information relating to the sequence of said unique K-T transform vectors and including said sequencing information in said third subset.
Claim 7
Dependent Claim
64 words
The method of claim 3, further comprising the steps of determining the number of data-vectors in said first subset, comparing such data-vector number to a predetermined number and eliminating the steps of transforming to form a second subset, identifying unique transforms within the second subset and forming a third subset, if said comparison indicates that said data-vector number does not exceed said predetermined number.
Claim 8
Dependent Claim
33 words
The method of claim 3, wherein said step of transforming said data-vectors in said first subset by a K-T transformation operation comprises the step of applying the data-vectors to an exclusive OR gate.
References Cited (Backward Citations)
US3584145A
Cited
US4254400A
Cited
US4426731A
Cited
US4439858A
Cited
US4652814A
Cited
US4698672A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-03-18 | 1994-09-17 | 1995-03-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-03-18 | 1998-09-17 | 1999-03-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-03-18 | 2002-09-17 | 2003-03-19 | $7700.00 | Window Closed / Lapsed |