Senior Fitness - Exercise and Nutrition for Aging Men and Women
FREE Article Feed for your website.
Home Ownership Magazine
Party Planning Information
Article Marketing Resources
Bio-Medical Research Article Database
Informative Articles on Life, Love and Happiness
Tutorials on Business to Writing
Famous Quotes from Famous People
Song Lyric Information
New US Patent Information
Comprehensive List of Content by Category
Online Auctions and Shopping Related Articles
Article Search
Most Recent Articles
Title: Data packet queue handling method and system
Patent Number: 7,437,489 Issued on 10/14/2008 to Chen

Title: Interface for car-mounted devices
Patent Number: 7,437,488 Issued on 10/14/2008 to Ito,   et al.

Title: Storage medium array controller, a storage medium array apparatus, a storage medium drive, a method of controlling a storage medium array, and a signal-bearing medium embodying a program of a
Patent Number: 7,437,487 Issued on 10/14/2008 to Chikamichi

Title: Configurable measurement interface coupled to a front-end subsystem and a back-end subsystem for receiving a set of bootstrap information
Patent Number: 7,437,486 Issued on 10/14/2008 to Burch,   et al.

Title: Method and apparatus for synchronization of two computer systems
Patent Number: 7,437,485 Issued on 10/14/2008 to Kruglikov,   et al.

Title: Method for optimizing synchronization
Patent Number: 7,437,484 Issued on 10/14/2008 to Auriemma,   et al.

Title: System and method for transferring a compressed data file to a peripheral device
Patent Number: 7,437,483 Issued on 10/14/2008 to Goossen,   et al.

Title: Method and apparatus for facilitating client server communications over a network
Patent Number: 7,437,482 Issued on 10/14/2008 to Jungck

Title: Methods and apparatus for utilizing user software to communicate with network-resident services
Patent Number: 7,437,481 Issued on 10/14/2008 to Bond,   et al.

Title: Communication protocol for wireless data exchange via a packet transport based system
Patent Number: 7,437,480 Issued on 10/14/2008 to Oueslati,   et al.

Title: Position identifier management apparatus and method, mobile computer, and position identifier processing method
Patent Number: 7,437,479 Issued on 10/14/2008 to Ishiyama,   et al.

Title: Priority control device
Patent Number: 7,437,478 Issued on 10/14/2008 to Yokota,   et al.

Title: SCSI-based storage area network having a SCSI router that routes traffic between SCSI and IP networks
Patent Number: 7,437,477 Issued on 10/14/2008 to Kuik,   et al.

Title: Optimizing flooding of information in link-state routing protocol
Patent Number: 7,437,476 Issued on 10/14/2008 to Zinin,   et al.

Title: Method and apparatus for utilizing an audibly coded signal to conduct commerce over the internet
Patent Number: 7,437,475 Issued on 10/14/2008 to Philyaw

Title: Proxy-less packet routing between private and public address realms
Patent Number: 7,437,474 Issued on 10/14/2008 to Iyer,   et al.

Title: Packet switch and method thereof dependent on application content
Patent Number: 7,437,473 Issued on 10/14/2008 to Lu,   et al.

Title: Interactive broadband server system
Patent Number: 7,437,472 Issued on 10/14/2008 to Rose

Title: Tunneling IPv6 packets
Patent Number: 7,437,470 Issued on 10/14/2008 to Fernandes,   et al.

Title: Virtual network element framework and operating system for managing multi-service network equipment
Patent Number: 7,437,469 Issued on 10/14/2008 to Ellanti,   et al.

Title: Method and system for secure URL-based access control
Patent Number: 7,437,468 Issued on 10/14/2008 to Yamamoto,   et al.

Title: Printing system and method of setting same, information processing apparatus and storage medium
Patent Number: 7,437,467 Issued on 10/14/2008 to Kato

Title: Wire protocol for a media server system
Patent Number: 7,437,466 Issued on 10/14/2008 to Bolosky,   et al.

Title: Method of optimizing calls set up in a private telecommunication network including two subnetworks using the QSIG protocol and the session initialization protocol, respectively
Patent Number: 7,437,465 Issued on 10/14/2008 to Rousseau

Title: Systems and methods for providing asynchronous messaging
Patent Number: 7,437,464 Issued on 10/14/2008 to Xu,   et al.

Title: Method and means for providing scheduling for a videoconferencing network in a manner to ensure bandwidth
Patent Number: 7,437,463 Issued on 10/14/2008 to Valletutti,   et al.

Title: Method for zoning data storage network using SAS addressing
Patent Number: 7,437,462 Issued on 10/14/2008 to Marks,   et al.

Title: Load balancing apparatus and method
Patent Number: 7,437,461 Issued on 10/14/2008 to Sugizaki

Title: Service placement for enforcing performance and availability levels in a multi-node system
Patent Number: 7,437,460 Issued on 10/14/2008 to Chidambaran,   et al.

Title: Calculation of service performance grades in a multi-node environment that hosts the services
Patent Number: 7,437,459 Issued on 10/14/2008 to Chidambaran,   et al.

Title: Systems and methods for providing quality assurance
Patent Number: 7,437,458 Issued on 10/14/2008 to Stewart,   et al.

Title: Regulating concurrent logins associated with a single account
Patent Number: 7,437,457 Issued on 10/14/2008 to Eisendrath,   et al.

Title: Object reference generating device, object reference generating method and computer readable recording medium for recording an object reference generating program
Patent Number: 7,437,456 Issued on 10/14/2008 to Miyamoto

Title: Remotely monitoring network utilizing expression containing combination object and multiple independent objects
Patent Number: 7,437,453 Issued on 10/14/2008 to Xiang,   et al.

Title: System and method for collecting desired information for network transactions at the kernel level
Patent Number: 7,437,451 Issued on 10/14/2008 to Tang,   et al.

Title: Method and device for function selection of a control unit
Patent Number: 7,437,448 Issued on 10/14/2008 to Kohler,   et al.

Title: System and methods for host naming in a managed information environment
Patent Number: 7,437,445 Issued on 10/14/2008 to Roytman,   et al.

Title: Administering devices with domain state objects
Patent Number: 7,437,443 Issued on 10/14/2008 to Bodin,   et al.

Title: Using deltas for efficient policy distribution
Patent Number: 7,437,441 Issued on 10/14/2008 to Drew,   et al.

Title: Peer-to-peer networking framework application programming interfaces
Patent Number: 7,437,440 Issued on 10/14/2008 to Manion,   et al.

Title: System and method for the hybrid harvesting of information from peripheral devices
Patent Number: 7,437,439 Issued on 10/14/2008 to Hardcastle,   et al.

Title: System and method for energy efficient data prefetching
Patent Number: 7,437,438 Issued on 10/14/2008 to Mogul,   et al.

Title: Server, device, client, information processing method of server, information processing method of device, information processing method of client, information processing program, and memory me
Patent Number: 7,437,436 Issued on 10/14/2008 to Higuchi

Title: XML-based template language for devices and services
Patent Number: 7,437,434 Issued on 10/14/2008 to Zintel,   et al.

Title: Method for batch registration of integrated digital loop carrier subscriber using program loaded data of exchange, and element management system server for the same
Patent Number: 7,437,433 Issued on 10/14/2008 to Kang

Title: Client device configuration with configuration services providers
Patent Number: 7,437,432 Issued on 10/14/2008 to Bodin,   et al.

Title: Method for downloading an icon corresponding to a hierarchical directory structure from a directory service
Patent Number: 7,437,431 Issued on 10/14/2008 to San Andres,   et al.

Title: Network linking using index modulated on data
Patent Number: 7,437,430 Issued on 10/14/2008 to Rhoads

Title: Method and apparatus for bouncing electronic messages
Patent Number: 7,437,422 Issued on 10/14/2008 to Fuisz

Title: Polyoptimizing genetic algorithm for finding multiple solutions to problems
Patent Number: 7,437,336 Issued on 10/14/2008 to Grefenstette

Title: Method and system for providing an energy cost estimation for a water distribution network
Patent Number: 7,437,333 Issued on 10/14/2008 to Herrin,   et al.

Title: Mailing machine including methods and systems to reduce weighing errors when operating in a differential weighing mode
Patent Number: 7,437,332 Issued on 10/14/2008 to Jacobson,   et al.

Title: Point-of-sale activation of media device account
Patent Number: 7,437,329 Issued on 10/14/2008 to Graves

Title: Method and system for buyer centric dispute resolution in electronic payment system
Patent Number: 7,437,327 Issued on 10/14/2008 to Lam,   et al.

Title: Securities trading simulation
Patent Number: 7,437,326 Issued on 10/14/2008 to Slowik,   et al.

Title: System and method of tracking bill payment methods
Patent Number: 7,437,324 Issued on 10/14/2008 to Goodwin, III,   et al.

Title: Managing investment assets
Patent Number: 7,437,322 Issued on 10/14/2008 to McCracken,   et al.

Title: Process for organizing business and other contacts for multiple users
Patent Number: 7,437,320 Issued on 10/14/2008 to Davidson,   et al.

Title: Method for on-line parts ordering
Patent Number: 7,437,319 Issued on 10/14/2008 to Brownell

Title: Systems and methods for electronic off-line catalog
Patent Number: 7,437,318 Issued on 10/14/2008 to Yuen,   et al.

Title: Merchandise sales system for selling merchandise produced by printing image data on a printing medium
Patent Number: 7,437,315 Issued on 10/14/2008 to Myoki,   et al.

Title: Method and system for referencing trading agreements
Patent Number: 7,437,314 Issued on 10/14/2008 to Borenstein,   et al.

Title: Methods, computer-readable media, and apparatus for offering users a plurality of scenarios under which to conduct at least one primary transaction
Patent Number: 7,437,313 Issued on 10/14/2008 to Mussman

Title: Method for context personalized web browsing
Patent Number: 7,437,312 Issued on 10/14/2008 to Bhatia,   et al.

Title: Third party contract depository for E-commerce transactions
Patent Number: 7,437,310 Issued on 10/14/2008 to Dutta

Title: Talent management system and methods for reviewing and qualifying a workforce utilizing categorized and free-form text data
Patent Number: 7,437,309 Issued on 10/14/2008 to Magrino,   et al.

Title: Methods for estimating the seasonality of groups of similar items of commerce data sets based on historical sales date values and associated error information
Patent Number: 7,437,308 Issued on 10/14/2008 to Kumar,   et al.

Title: Method of relating multiple independent databases
Patent Number: 7,437,307 Issued on 10/14/2008 to Walsh,   et al.

Title: Customer buying pattern detection in customer relationship management systems
Patent Number: 7,437,306 Issued on 10/14/2008 to Bayer,   et al.

Title: System and method for project preparing a procurement and accounts payable system
Patent Number: 7,437,304 Issued on 10/14/2008 to Barnard,   et al.

Title: Method and system for implementing and tracking cost-saving measures in hospitals and compensating physicians
Patent Number: 7,437,303 Issued on 10/14/2008 to Werblin

Title: System for managing healthcare related information supporting operation of a healthcare enterprise
Patent Number: 7,437,302 Issued on 10/14/2008 to Haskell,   et al.

Title: Coding of stereo signals
Patent Number: 7,437,299 Issued on 10/14/2008 to Aarts,   et al.

Title: Systems and methods for predicting consequences of misinterpretation of user commands in automated systems
Patent Number: 7,437,297 Issued on 10/14/2008 to Chaar,   et al.

Title: Speech recognition dictionary creation apparatus and information search apparatus
Patent Number: 7,437,296 Issued on 10/14/2008 to Inoue,   et al.

Method and system for rapid identification of multiple input systems Number:7,143,015 from the United States Patent and Trademark Office (PTO) owispatent

Home    Author Login    Submit Article    Article Search    Add Your Link    Edit Your Link    Contact Us    Advertising    Disclaimer

   

 
Web LinkGrinder.com

Top Breaking News
     Greek, Cypriot Leaders Resume Unification Talks in Nicosia by Nathan Morley
     Indonesia Tobacco Sales Grow, Raising Health Fears
     South Korea Allows Top Defector to Travel Overseas by VOA News

Title: Method and system for rapid identification of multiple input systems

Abstract: The disclosure describes techniques for determining the response characteristics of a system. One such technique includes applying a series of M vector probe input signal sets of a form {overscore (V)}.sub.m x(t) to the system, wherein {overscore (V)}.sub.m is an m-th column of a matrix V and x(t) is a scalar input signal. The response signals {overscore (y)}.sub.t are measured and a single-input system {overscore (F)}.sub.m(z) is determined by considering the approximate relationship {overscore (y)}.sub.z.apprxeq.{overscore (F)}.sub.m(z)x(z), where {overscore (F)}.sub.m(z) is an m-th column of a matrix F(z). The system characteristics can be determined from the relationship H(z)=F(z)V.sup.-1, where V.sup.-1 denotes the right-matrix-inverse of the matrix V. The matrix V may be a matrix with mutually orthogonal rows, or may have entries consisting of plus one and minus one values, or may be a portion of a Hadamard matrix.

Patent Number: 7,143,015 Issued on 11/28/2006 to Preuss


Inventors: Preuss; Robert D. (Sagamore Beach, MA)
Assignee: BBN Technologies Corp. (Cambridge, MA)
Appl. No.: 10/289,765
Filed: November 7, 2002


Current U.S. Class: 703/2 ; 700/32
Current International Class: G06F 17/10 (20060101)
Field of Search: 703/2,14,17 700/28,29,31,34,32


References Cited [Referenced By]

U.S. Patent Documents
6519738 February 2003 Derby
6532256 March 2003 Miller
6560493 May 2003 Dahleh et al.
6801086 October 2004 Chandrasekaran
Primary Examiner: Paladini; Albert W.
Attorney, Agent or Firm: Fish & Neave IP Group Ropes & Gray LLP

Government Interests



REFERENCE TO GOVERNMENT FUNDING

The U.S. Government has a paid-up license in this invention and the right in limited circumstances to require the patent owner to license to others on reasonable terms as provided for by the terms of Contract No. N00024-91-C-4355 awarded by Naval Sea Systems Command.
Claims



What is claimed is:

1. A method of determining characteristics of a system H(z) having multiple inputs, the method comprising: applying to the system a series of vector probe input signal sets, each vector probe input signal set being formed using a column of a matrix V and a scalar input signal; measuring a response signal of the system; determining a single-input system {overscore (F)}.sub.m(z) by considering an approximate relationship where a z-transform of the scalar input signal applied to the single-input system yields a z-transform of the response signal of the system; determining a multiple-input system F(z) as the system whose m-th column is the determined single-input system {overscore (F)}.sub.m(z); obtaining a right-matrix-inverse of the matrix V; and multiplying the multiple-input system F(z) by the right-matrix-inverse of the matrix V to determine the characteristics of the system H(z).

2. The method of claim 1, comprising choosing rows of the matrix V to be mutually orthogonal.

3. The method of claim 1, comprising choosing entries in the matrix V to consist of plus one and minus one values.

4. The method of claim 3, comprising choosing rows of the matrix V to be mutually orthogonal.

5. The method of claim 4, wherein choosing the matrix V comprises choosing the matrix V as N rows of a Hadamard matrix with dimension M.times.M, where N is the number of multiple input signals of the system and M.gtoreq.N.

6. The method of claim 5, wherein choosing the matrix V comprises choosing M as a whole number power of 2.

7. The method of claim 6, wherein determining the system characteristics comprises using a Fast Hadamard Transformation.

8. The method of claim 6, wherein determining the single-input system comprises: correlating the input signals with themselves and with the output signals to obtain a set of normal equations; and solving the set of normal equations.

9. The method of claim 8, wherein solving comprises using a technique taken from a list of techniques comprising a Cholesky decomposition method and a preconditioned conjugate gradient method.

10. The system of claim 9, wherein determining the system characteristics comprises using a Fast Hadamard Transformation.

11. The system of claim 1, wherein determining the system characteristics comprises using a Fast Hadamard Transformation.

12. The method of claim 1, wherein determining the single-input system comprises: correlating the input signals with themselves and with the output signals to obtain a set of normal equations; and solving the set of normal equations.

13. The method of claim 12, wherein solving comprises using a technique taken from a list of techniques comprising a Cholesky decomposition method and a preconditioned conjugate gradient method.

14. A computer program, disposed on a computer readable medium, for determining characteristics of a system H(z) having multiple inputs, the computer program including instructions for causing a processor to: apply to the system a series of vector probe input signal sets, each vector probe input signal set being formed using a column of a matrix V and a scalar input signal; measure a response signal of the system; determine a single-input system {overscore (F)}.sub.m(z) by considering an approximate relationship where a z-transform of the scalar input signal applied to the single-input system yields a z-transform of the response signal of the system; determine a multiple-input system F(z) as the system whose m-th column is the determined single-input system {overscore (F)}.sub.m(z); obtain a right-matrix-inverse of the matrix V; and multiply the multiple-input system F(z) by the right-matrix-inverse of the matrix V to determine the characteristics of the system H(z).

15. The computer program of claim 14, wherein the computer program includes instructions for causing the processor to choose entries in the matrix V to consist of plus one and minus one values.

16. The computer program of claim 15, wherein the computer program includes instructions for causing the processor to choose rows of the matrix V to be mutually orthogonal.

17. The computer program of claim 16, wherein the computer program includes instructions for causing the processor to choose the matrix V as N rows of a Hadamard matrix with dimension M.times.M, where N is the number of multiple input signals of the system and M.gtoreq.N.

18. The computer program of claim 17, wherein the computer program includes instructions for causing the processor to choose M as a whole number power of 2.

19. The computer program of claim 18, wherein the computer program includes instructions for causing the processor to determine the system characteristics using a Fast Hadamard Transformation.

20. The computer program of claim 19, wherein the computer program includes instructions for causing the processor to: correlate the input signals with themselves and with the output signals to obtain a set of normal equations; and solve the set of normal equations.

21. The computer program of claim 20, wherein the computer program includes instructions for causing the processor to use a technique for solving the set of normal equations taken from a list of techniques comprising a Cholesky decomposition method and a preconditioned conjugate gradient method.

22. A system for determining characteristics of a multiple input system H(z), the system comprising: means for applying to the system a series of vector probe input signal sets, each vector probe input signal set being formed using a column of a matrix V and a scalar input signal; means for measuring a response signal of the system; means for determining a single-input system {overscore (F)}.sub.m(z) by considering an approximate relationship where a z-transform of the scalar input signal applied to the single-input system yields a z-transform of the response signal of the system; means for determining a multiple-input system F(z) as the system whose m-th column is the determined single-input system {overscore (F)}.sub.m(z); means for obtaining a right-matrix-inverse of the matrix V; and means for multiplying the multiple-input system F(z) by the right-matrix-inverse of the matrix V to determine the characteristics of the system H(z).
Description



FIELD OF THE INVENTION

The methods and systems relate to identifying system parameters, and more particularly to methods and systems for rapidly identifying parameters for multiple input systems.

BACKGROUND

Mathematical models of systems can be used in a wide variety of disciplines. These mathematical models can be used to predict how a system will react in different environments and can be used to improve the system. One approach to mathematical modeling may be known as "white box" modeling. In this approach, the laws governing a system are represented mathematically. For example, for a physical system, the law of gravity may be represented in the model. The outputs of the system may be determined by applying the mathematical model to the inputs. Sometimes, however, system behavior is too complex to be easily modeled using the "white box" approach.

Another approach to mathematical modeling may be known as system identification (SysId). System identification may include mathematical modeling of systems from experimental data and may be applied in many engineering areas, e.g., communications, mechanical engineering, or geophysical engineering for purposes such as spectral analysis, fault detection, adaptive filtering, linear prediction, and pattern recognition. SysId techniques may also find application in fields such as biology, environmental sciences and econometrics.

In SysId, a system can be treated as a black box, i.e., inputs can be applied to an unknown system, and a corresponding (noise corrupted) output signal from that system can be observed. These input and output signals may then be used, together with a mathematical model of the system, to estimate the model parameters that best characterize the system. When the system has N input channels, traditionally one may repeat the experiment N times with a different input channel selected to be active for each repetition.

SUMMARY OF THE INVENTION

A method, system and/or computer program disposed on a computer readable medium for determining characteristics of a system H(z) having multiple inputs may comprise applying a series of M vector probe input signal sets of a form {overscore (V)}.sub.mx(t) to the system, wherein {overscore (V)}.sub.m is an m-th column of a matrix V and x(t) is a scalar input signal, measuring response signals of the system, {overscore (y)}.sub.t, determining a single-input system {overscore (F)}.sub.m(z), by considering the approximate relationship {overscore (y)}.sub.z.apprxeq.{overscore (F)}.sub.m(z)x(z), where {overscore (F)}.sub.m(z) is an m-th column of a matrix F(z) and determining the system characteristics from the relationship H(z)=F(z)V.sup.-1, where V.sup.-1 denotes the right-matrix-inverse of the matrix V. The matrix V may be a matrix with mutually orthogonal rows and may have entries consisting of plus one and minus one values.

The matrix V may be chosen as N rows of a Hadamard matrix with dimension M.times.M, where N is the number of multiple input signals of the system and M.gtoreq.N. M may be chosen as a whole number power of 2 such that the system characteristics may be determined using a Fast Hadamard Transformation. The single-input system may be determined by correlating the input signals with themselves and with the output signals to obtain a set of normal equations and then solving the set of normal equations. Various known methods may be used to solve the set of normal equations, such as, but not limited to, using a Cholesky decomposition method or a preconditioned conjugate gradient method.

BRIEF DESCRIPTION OF THE DRAWINGS

The following figures depict certain illustrative embodiments in which like reference numerals refer to like elements. These depicted embodiments are to be understood as illustrative and not as limiting in any way.

FIG. 1 shows a diagram illustrating inputs applied to a system and the resulting responses;

FIG. 2 shows a flowchart for determining the response characteristics of a system;

FIG. 3 shows a flowchart for choosing a matrix used in the process of FIG. 2; and

FIG. 4 shows a diagram of a computer platform suitable for determining response characteristics of a system.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 depicts a system 112 having unknown characteristics. To determine the characteristics of the system 112, a collection of actuators 104 may operate on the system 112 in accordance with input signals 100 processed by digital-to-analog converters 102, where a series of input signal 100, converter 102 and actuator 104 can form an input channel to system 112. As an example, the system 112 may be a structure operated upon by a set of actuators, or shakers, 104 that may amplify a converted input signal 100 and shake the structure at an intensity commensurate to the input signal 100. Because the digital-to-analog converters 102 and actuators, or amplifiers, 104 have practical range limitations, the level of the input signal 100 may be limited so as to avoid signal distortion or damage to the converters 102, amplifiers 104, or other components.

FIG. 1 also depicts sensors 106 that may monitor the response of the system 112 to the input 100. To continue the example, these sensors 106 can detect the vibrational response of the structure, or system 112, to shakers 104. As shown, these sensors 106 can feed analog/digital converters 108 that can convert these responses to digital output signals 110.

By analyzing the system's 112 response 110 to a given set of inputs 100, a relationship can be established between a given input 100 and a given output 110. One method to determine such relationships may be to apply a zero input signal 100 to all but one of the actuators 104. That is, a single, scalar input signal 100 can be applied to one of the actuators 104 and zero input signals can be applied to the remaining actuators 104, and the responses 110 of the sensors 106 to the single non-zero input signal 100 can be measured. This process can be repeated until each of the different input signals 100 have been cycled through and applied. This traditional technique can take an NT amount of time to perform, where N can be the number of inputs to system 112 and T can be the duration over which an input signal 100 may be applied to the system 112. Further, this technique can apply a total of PNT units of energy to the system 112 over the duration NT, where P can be the amount of power imparted by the non-zero valued input.

An approach, or method can be described herein that applies non-zero input signals 100 to multiple actuators 104 simultaneously. Such input signals 100 can be considered a set of vector probe signals {overscore (x)}.sub.t, wherein a vector probe signal {overscore (x)}.sub.t may be composed of N scalar signals x.sub.1, x.sub.2, . . . , x.sub.N. The application of sets of vector probe signals {overscore (x)}.sub.t can result in the application of a large amount of energy into system 112, that can increase the ratio between the output 110 and measurement noise (e.g., measurement error that an actuator 104 or sensor 106 may introduce) or some other source of noise, such as an external interference. For example, using M sets of vector probe signals {overscore (x)}.sub.t with N components of power P for T units of time may apply, over MT units of time, a total of MPNT units of energy into system 112, in comparison to the N scalar input signals 100, which may apply, over NT units of time, a total of PNT units of energy, as noted previously. That is, each component (x.sub.1, x.sub.2, . . . , x.sub.N) of the vector probe signal {overscore (x)}.sub.t can impart the same amount of energy into system 112 as the single, scalar input single 100 applied at one of the actuators 104.

Thus, better measurements can be obtained due to the higher Signal to Noise Ratio (SNR). Alternatively, by reducing the vector probe duration to T/M from T units of time, a total of MPNT/M=PNT units of energy may be put into system 112 in MT/M=T units of time. Thus, the same measurement fidelity can be obtained in only T units of time when using M vector probe signals instead of NT units of time using the N scalar input signals.

In greater detail, the system's 112 response 110 to the inputs 100 can be compactly represented using z-transforms and vector notation according to: {overscore (y)}.sub.z=H(z){overscore (x)}.sub.z+ .sub.z. [1] Here

.infin..infin..times..times..times. ##EQU00001## is the z-transform of {overscore (y)}.sub.t, and {overscore (y)}.sub.t is the known vector of output signals 110 at time t;

.infin..infin..times..times. ##EQU00002## is the z-transform of {overscore (x)}.sub.t, and {overscore (x)}.sub.t is the known vector of input signals 100 at time t; and

.infin..infin..times..times..times. ##EQU00003## is the z-transform of .sub.t, and .sub.t is an unknown vector of noise signals introduced by the measurement process, external interference, and/or other factors.

In Equation [1], H(z) is a transfer matrix which represents a mathematical model of the contribution of a vector of input signals, {overscore (x)}.sub.t, to a vector of output signals, {overscore (y)}.sub.t. The embodiments described hereafter may provide methods to estimate the parameters of H(z) from the known vector of input signals {overscore (x)}.sub.t and the known vector of output signals {overscore (y)}.sub.t. In some cases, the mathematical model will be chosen to be that of a finite impulse response (FIR) dynamic system with response duration K, i.e.,

.function..times..times..times. ##EQU00004## Here H.sub.k represents the k-th matrix of parameters to be estimated, for k=0, 1, . . . , K-1.

Vector probes obtained from M fixed direction vectors, each with N components, may be considered. The fixed direction vectors can form the columns of an N.times.M real valued matrix, V, such that {overscore (V)}.sub.m is the m-th column of V. The vector of input signals, {overscore (x)}.sub.t, can be expressed as the multiplication of a vector {overscore (V)}.sub.m by the scalar signal x(t): {overscore (x)}.sub.t={overscore (V)}.sub.mx(t) [6] where M is a number of sets of inputs applied to the system 112 and m is the m-th set of inputs within the M sets.

Substituting Equation [6] into Equation [1] yields: {overscore (y)}.sub.z={overscore (F)}.sub.m(z)x(z)+ .sub.z. [7] where

.function..infin..infin..times..times..function..times. ##EQU00005## is the z-transform of the scalar signal x(t) and {overscore (F)}.sub.m(z)=H(z){overscore (V)}.sub.m. [9]

The known input signals 100 and output signals 110 can allow measurement of the single-input system {overscore (F)}.sub.m(z). Measurement of the single-input system {overscore (F)}.sub.m(z) can be accomplished by methods used by those of skill in the art when applying x(t) to the n-th input of H(z), while holding the other inputs at zero, to measure {overscore (H)}.sub.n(z). For example, one may consider the difference {overscore (y)}.sub.z-{overscore (F)}.sub.m(z)x(z) and use the known method of least squares to obtain {overscore (F)}.sub.m(z). For example, if H(z) is a Finite Impulse Response (FIR) system, as provided in Equation [5], and if the system 112 is supposed to have R output signals then the r-th component of {overscore (F)}.sub.m(z) can be a FIR system with scalar coefficients f.sub.r,m,k and the coefficient of z.sup.-t for the r-th component of the difference {overscore (y)}.sub.z-{overscore (F)}.sub.m(z)x(z) may be equated to e.sub.t to yield an overdetermined linear system of equations:

.function..times..times..times..function. ##EQU00006## where y.sub.r(t) is the r-th component of {overscore (y)}.sub.t. Then the least squares method can be used to obtain the coefficients f.sub.r,m,k for k=0, 1, . . . , K-1 that minimize

.times..times. ##EQU00007## when the vector probe is applied for T units of time or, in an alternative,

.times..times. ##EQU00008## when the vector probe is applied for only T/M units of time.

As may be well known by those skilled in the art, there can be many methods for solving such least squares minimization problems. One such method that can be used includes first forming a set of normal equations by correlating the signal x(t) with itself and with y.sub.r(t). Then, to obtain the coefficients f.sub.r,m,k for k=0, 1, . . . , K-1, one can solve these normal equations by any one of a variety of methods such as the Cholesky decomposition method or the preconditioned conjugate gradient (PCG) method. Repeating for r=0, 1, . . . , R-1 yields all the coefficients of {overscore (F)}.sub.m(z). Then, repeating for m=0, 1, 2, . . . , M-1, and placing {overscore (F)}.sub.m(z) in the m-th column of a matrix F(z), the matrix system F(z)=H(z)V can be measured. To recover H(z), one can compute H(z)=F(z)V.sup.-1 [11] where V.sup.-1 is the right-matrix-inverse of the matrix V. Thus, H(z) may be expressed as a function of measurable values, i.e., the matrix F(z) and the right-matrix-inverse of the matrix V. It can be understood that in order to use the right-matrix-inverse of V, V can be chosen to be a matrix of rank N with M.gtoreq.N columns.

The above can provide an approach requiring very little additional computation over the traditional approach previously identified. Identifying the columns of {overscore (F)}.sub.m(z) may generally require less computational effort than if one used a scalar probe to measure the column {overscore (H)}.sub.n(z) of H(z). This is especially true when each vector probe signal is applied for a duration of T/M units of time to identify a column {overscore (F)}.sub.m(z) while, for the same overall measurement fidelity, the scalar probe used to identify a column {overscore (H)}.sub.n(z) is applied for a duration of T units of time. The additional computation that may be required in multiplying F(z) by V.sup.-1 can be seen to be trivial in this context. Thus, the advantages noted previously for the M vector probe signals as compared to the N scalar input signals may be realized without additional computation cost and, in some cases, with lower overall computational cost.

The choice for the matrix V may depend on the particular system 112 under analysis and the characteristics being determined. For example, if V=W, where W is a real scalar multiple of an N.times.M matrix with orthonormal rows, and if the same scalar signal x(t) is used to generate each of the vector probes in Equation [6] for m=0, 1, . . . , M-1, then the energy will be distributed equally in different directions. This can be seen by supposing that {overscore (q)} can be any vector direction with N components and unit length so that {overscore (q)}.sup.T{overscore (q)}=1. As will be understood by one skilled in the art, the symbol {overscore (q)}.sup.T indicates the transpose of the column vector {overscore (q)}. Then, if PT is the energy in the scalar signal x(t), the total energy applied in direction {overscore (q)} by the vector probes can be

.function..times..times..times..times..times..times..times..times..times..- times. ##EQU00009##

Now, since V=Wand W is a real scalar multiple, say .alpha., of an N.times.M matrix with orthonormal rows

.times..times..times..alpha..times. ##EQU00010## where I is the N.times.N identity matrix. Consequently, since {overscore (q)} has unit length, the total energy applied in direction {overscore (q)} is E({overscore (q)})=.alpha..sup.2PT [14] regardless of what direction {overscore (q)} has been selected.

The matrix V can also be chosen to direct an amount of energy determined by .lamda..sub.n into N orthonormal directions {overscore (q)}.sub.n for n=0, 1, . . . , N-1. To do so, one may define an N.times.N diagonal matrix L whose n-th diagonal entry is .lamda..sub.n and an N.times.N orthogonal matrix Q whose n-th column is {overscore (q)}.sub.n and choose V=QLW. Now the energy directed in the direction {overscore (q)}.sub.n can be given by:

.function..times..times..times..times..times..times..times..times..times..- times..times..times..times..times..lamda..times..alpha..times. ##EQU00011## so that this amount of energy is determined by the chosen value .lamda..sub.n as desired. As will be understood by one skilled in the art, the construction V=QLW is effectively a singular value decomposition of V wherein the orthonormal direction vectors {overscore (q)}.sub.n are effectively the left singular vectors of V and the corresponding values .lamda..sub.n are effectively the singular values of V. As will also be understood by one skilled in the art, the scalar input signal x(t) may be chosen to preferentially put different amounts of energy in different frequency regions or it may be chosen to be `white` so that an equal amount of energy is applied in different frequency regions. In Equation [6], the scalar signals x(t) used with different columns of V can differ in duration, T (or T/M), as well as, for example, in terms of the amount of energy contained within different frequency regions. In other words, scalar signals x(t) varying by shape as well as duration may be employed with different columns of V when practicing embodiments of the invention.

V may also be chosen to maximize the amount of energy applied to the system 112. If the scalar input signal x(t) can be taken as having the maximum energy that may be input into any one of the channels of system 112, it can be seen that inputting x(t) or -x(t) into each of the channels may maximize the total energy input into system 112. Thus, by choosing the columns of V to consist of plus one values or minus one values (+1 or -1), the maximum energy may be input to the channels when the multiplication operation denoted by Equation [6] is performed. It can be understood that, for some systems 112, it may be desirable to vary the energy inputs to the channels such that V may consist of values in addition to plus ones and minus ones.

However, for those systems where both equal amounts of energy applied in different frequency regions and maximum energy input may be desired, V may form N rows of an M.times.M Hadamard matrix, i.e., a non-singular, orthogonal matrix having only +1 and -1 values. An example of a 2.times.2 Hadamard matrix may include values of:

##EQU00012## A Hadamard matrix can be recursively defined such that a 4.times.4 Hadamard matrix, for example, may include values of:

##EQU00013## As may be known, Hadamard matrices may be of certain discrete sizes, e.g., the Hadamard matrices of dimension less than 100 may include only those with dimensions of 2.times.2, 4.times.4, 8.times.8, 12.times.12, 16.times.16, 20.times.20, 24.times.24, 28.times.28, 32.times.32, 36.times.36, 40.times.40, 44.times.44, 48.times.48, 52.times.52, 56.times.56, 60.times.60, 64.times.64, 68.times.68, 72.times.72, 76.times.76, 80.times.80, 84.times.84, 88.times.88, 92.times.92, and 96.times.96.

If a system 112 has, for example, N=27 input channels one may observe that there is no Hadamard matrix of dimension 27.times.27. In this situation, V may be chosen as the first N=27 rows of a larger, say 32.times.32, Hadamard matrix with the number of columns of V set to M=32. Alternatively, for this twenty-seven input example, V may be chosen as the first N=27 rows of a 28.times.28 Hadamard matrix with the number of columns of V set to M=28. Regardless of whether V is chosen to be a portion of a 32.times.32 Hadamard matrix or a 28.times.28 Hadamard matrix, the use of vector probes based on this choice for V can apply the maximum energy input to the system 112 with an equal amount of energy being applied in any direction.

In choosing the dimension for the Hadamard matrix to be used, it may be noted that, for Hadamard matrices formed by tensor products, e.g., matrices recursively defined from the 2.times.2 Hadamard matrix shown at Equation [16], the use of a technique well-known in the art as the Fast Hadamard Transform (FHT) can speed operations with Hadamard matrices such that the computational cost of applying the right-matrix-inverse in accordance with Equation [11] may be lessened.

Thus for the example twenty-seven input system 112, the 32.times.32 (2.sup.5.times.2.sup.5) Hadamard matrix may be chosen such that V can be a 27.times.32 partition of the Hadamard matrix. As provided above, the energy spread may be equal in different directions. The plus ones and minus ones of the Hadamard matrix can provide for maximum energy input to the channels and the 2.sup.5.times.2.sup.5 dimension can allow for the use of the FHT technique.

FIG. 2 can illustrate a process 200 for determining system response characteristics using the approach described above. A matrix V is first chosen (202) such that the process 200 may apply a series of M vector probe signals to the system in accordance with Equation [6]. At 204, m is first set to 0. The m-th set of vector probes may then be applied (206). For each vector probe m, the system responses may be measured (208) and the least squares procedure may be used to determine {overscore (F)}.sub.m(z) (210), as shown at Equations [7], [8], and [9] and {overscore (F)}.sub.m(Z) may be used to populate the matrix F(z), by placing F(z) in the m-th column of F(z) (212). If m<M-1 (214), then m may be incremented (216) and process 200 may return to 206. When F(z) is fully populated, i.e., when the m=M-1, F(z) may be multiplied by the right-matrix-inverse of V (218) to determine the characteristics of the system H(z), as shown at Equation [11].

FIG. 3 can illustrate the process 202 for choosing the matrix V. A decision may first be made (252) as to whether it is desired to input the maximum amount of energy into system 112. If yes, plus ones and minus ones may be used as the components of matrix V (254). It may then be decided (256) if an equal energy distribution may be desired. If yes, the matrix V may be configured with mutually orthonormal rows (258). If it is determined (260) that both the maximum energy criteria and the equal energy distribution criteria may be desired, V may be a portion of a Hadamard matrix (264). If neither criteria may be desired, or only one of the above criteria may be desired, as determined at 260, then the matrix V may be chosen to meet the desired criteria as determined from 252 and 256 and/or other system requirements, as indicated at 262.

When V may be a portion of a Hadamard matrix, it may be found that a Hadamard matrix conforming in size to the number of system 112 inputs N may not exist. A Hadamard matrix of size M.times.M may be chosen, where M.gtoreq.N, and V may be chosen as N rows of the M.times.M Hadamard matrix (264). When the Fast Hadamard Transform (FHT) technique may be used, as determined at 266, then M may be taken as 2.sup.p, where p is a whole number, and V may be chosen as an N.times.M partition of the 2.sup.p.times.2.sup.p Hadamard matrix (268).

The process 200 of FIG. 2, including the process 202 of FIG. 3, may be implemented by a processor controlled device 300. FIG. 4 illustrates a device 300 suitable for executing instructions 310 implementing techniques described above. The device 300 includes a processor 306, volatile memory 308, and non-volatile memory 312. The memory 308, 312 may store data 314 corresponding to the input and output values, the matrix V and its inverse, and the resulting data for H(z).

The memory 312 may also include instructions 310. The instructions 310 can be transferred, in the course of operation, from the non-volatile memory 312 to the volatile memory 308 and processor 306 for execution. The instructions 310 may output system input values, as indicated at 302, and receive system output values, as indicated at 304, during system testing. The device 300 may communicate with a user via a monitor or other input/output device 316 such as a keyboard, mouse, microphone, and so forth. Additionally, the device 300 may feature a network connection 318.

The techniques described herein may not be limited to a particular hardware or software configuration; they may find applicability in many computing or processing environments. The techniques may be implemented in hardware or software, or a combination thereof. Preferably, the techniques are implemented in computer programs.

The computer programs may be implemented in high level procedural language (e.g., MATLAB.RTM., The MathWorks, Inc., Natick, Mass.) or an object oriented programming language to communicate with a computer system. However, the programs can be implemented in assembly or machine language, if desired. In any case the language may be compiled or interpreted language.

The computer programs can be stored on a storage media or device(s) (e.g., CD-ROM, hard disk, or magnetic disk) that are readable by a general or special purpose programmable computer for configuring and operating the computer when the storage medium or device is read by the computer to perform the procedures described herein. The system may also be considered to be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner.

Additionally, while described in conjunction with an example of a shaken physical structure, the approaches described may be applied to a wide variety of systems such as biological, signal processing, and so forth. Other embodiments are within the scope of the following claims.

*


Free Web Sudoku Puzzles.
Solve with your browser.
1   6   7 8      
  8           1  
  5   9          
      2 3   9 8  
  3   1   9   5  
  2 7   6 5      
          6   4  
  1           9  
      5 1   8   2
What is it?



Add Your Site · Terms Of Service · Privacy Policy


DISCLAIMER
Linkgrinder is a free service that searches the Internet and indexes all files found so that you may search quickly and easily for shared files. These files are created and made available individually by users whose identity we are not aware of and who we have no control over. In essence we function like a search engine tool; these files ARE NOT STORED OR SERVED BY OUR NETWORK. We are not responsible for any materials obtained by using our service. We do not monitor any of the contents of these files. These files may contain viruses, illegal materials, materials inappropriate for minors, offensive files and the like. BY USING OUR SERVICE, YOU ASSUME FULL RESPONSIBILITY FOR DOWNLOADING THESE MATERIALS AND WILL INDEMNIFY US FOR ANY DAMAGES THAT MAY BE INCURRED.

For More Specific Information VIEW OUR TERMS OF SERVICE.

Thank you and Enjoy!