Inertial transformation matrix generation

Abstract: An inertial transformation matrix generator generates a succession of Euler transformation matrices in inertial coordinates, and is useful for converting to inertial coordinates the responses of a sensor hard mounted on the hull of a craft (e.g., an aircraft). First (11), second (12) and third (13) rate-sensing gyros located proximately to said sensor are strapped down to the craft hull, and are oriented to sense the motion of the craft hull in three mutually orthogonal directions, for providing respective output signals indicative of components of craft hull motion in each of those three mutually orthogonal directions. The output signals of the gyros are digitized (14, 15, 16), and based on these digital signals successive incremental Euler transformation matrices are generated (22). Each successive incremental Euler transformation matrix (22) and a respective other matrix (24) are multiplied (23) together to generate a respective product matrix, said other matrix initially being an initialization matrix and thereafter being the previously calculated Euler transformation matrix. Each successive current Euler transformation matrix is formed from each successive product matrix, which is done in preferred embodiments of the invention by adding (25) to it at selected times a correction matrix derived by long term comparison of the matrices generated by the inertial transformation matrix generator and the inertial navigation system of the craft.

Description: The present invention relates to an inertial transformation matrix generator. An embodiment of the invention concerns a craft-borne detection system that provides continually sampled sensor data and is mounted in fixed position (hard-mounted) on the hull of a host craft and, more particularly, concerns converting all detected data to a common system of spatial coordinates in which craft motion between successive sampling times is compensated for. While the present invention will be described particularly in terms of an embodiment used in aircraft, the invention is useful in a number of other types of craft such as landcraft, watercraft, underseacraft and spacecraft. US-A-4244215 discloses an inertial transformation matrix generator for generating an Euler transformation matrix in inertial coordinates, for use in converting to inertial coordinates the responses of a craft-borne sensor, said inertial transformation matrix generator comprising: first, second and third rate-sensing gyros for providing respective output signals (Wα,Wβ,Wγ) indicative of components of craft hull motion in each of said three mutually orthogonal directions. The inertial frame of reference, to which detections are stabilized, is normally one of the inertial frames used for navigation by the host Inertial Navigation System (INS). One common reference frame is the NED (North, East, Down) reference frame, defined as a local vertical, north referenced coordinate system. The D axis is directed downward, the N axis is orthogonal to the D axis and is directed North. The E axis is orthogonal to both the N and D axes and is directed East. The other coordinate frame of reference of interest on a host aircraft is the coordinate frame to which the INS is referenced or aligned. One commonly used reference frame is the body coordinate system (Nose, Right-wing, Down). The x or nose axis points longitudinally through the aircraft along its waterline, the y or right-wing axis is orthogonal to the x axis and is directed out the right wing. The z or down axis is orthogonal to both the x and y axes and is directed out the bottom of the aircraft. As is known in the art, (see for example US-A-3 545 266), in the right-hand coordinate system, the Euler transformation matrix [Eα] for a rotation through an angle α about the z-axis is as follows: The Euler transformation matrix [Eβ] for a rotation through an angle β about the y axis is as follows: And, the Euler transformation {Eγ] matrix for a rotation through an angle γ about the x-axis is as follows: If the order of rotation were α, β, and then γ, the total transformation [T] in three dimensions would be the product of these three matrices. The order of this multiplication must be preserved. Once the angles of rotation between two coordinate systems are known, the transformation of a point in one coordinate system to the other is performed by matrix multiplication. Given two coordinates systems A and B, and knowing the Euler angles from A to B, the transformation of a point x′, y′, z′ in B's frame back to point x, y, z in A's frame is as follows: If there were three coordinate systems, A, B and C, and the Euler transformation matrix [E AB ] from A to B and the Euler transformation matrix [E BC ] from B to C are known, then it is possible to find the Euler transformation matrix [E AC ] from A to C as follows: [E AC ] = [E AB ] · [E BC ] (6) This method can be used to transform data from the sensor coordinate frame of reference to the aircraft frame of reference to the inertial coordinate system frame of reference. This method can also be used to update the transformation matrix from the sensor coordinate frame to the inertial reference frame. In such case, the Euler matrix [E AB ] would be the previous transformation, and the Euler matrix [E BC ] would be the incremental transformation. The current transformation would just be the multiplication of the two matrices per equation (6). Over the course of time continual updating of the Euler transformation can be done by matrix multiplying by a succession of incremental transformation matrices in a chain-serial matrix multiplication procedure. A conventional method used to stabilize detections is to mount the sensor on a stabilized platform. The platform is gimbaled to permit rotations around yaw, pitch and roll axes; and the position of the platform is maintained by three gyros. Electrical outputs of the gyros are proportional to the angles (or rates) through which the gimbals have moved. These gyro angles represent order-dependent rotations about each of the gimbal axes. In other words, these angles represent a rotation about the yaw axis, followed by a rotation about the pitch axis, followed by a rotation around the roll axis. These are the Euler angles of rotation, which can be used to form the Euler transformation matrices. For practical reasons detection systems often need to be hard-mounted to aircraft hulls as opposed to being mounted on stabilized platforms. Sensor data therefore includes the effects of any aircraft motion. To reduce the system false alarm rate to an acceptable level, potential threats must be tracked in an inertial coordinate system. Effects of aircraft motion must therefore be eliminated from the raw sensor data before tracking can be done. Three rate-integrating gyros located at the sensor and strapped down to the aircraft hull will be able to measure motion caused by aircraft maneuvers as well as motion caused by aircraft vibrations, flexure and turbulence. The angles measured by the strapped down gyros are not the Euler angles of rotation. In the prior art the Euler angles have been calculated proceeding with three simultaneous differential equations relating the gyro yaw, pitch and roll rates, and changing them to Euler rates. These are then integrated to form Euler angles. Then the Euler angles have been used to form a transformation matrix [T] per equation (4). This involves a large number of calculations. The invention is specified in the claims to which attention is invited. An embodiment of the invention avoids making so many calculations by deriving an incremental transformation matrix more directly, relying on small angle approximations. A first-order differential equation as set forth in equation (7), following, can be solved to find the transformation matrix T(t). T(t). T(t) = T(t)W(t) (7) The transformation matrix T(t), is a function of time, and so is the coefficient matrix W(t). The coefficient matrix W(t) is defined as follows. The elements of the W matrix are the rates measured by the three gyros. The solution to the differential equation (7) is T(t) = T(t o )Φ(t,t o ) (9) where Φ(t,to) is the transition matrix associated with the equation, given by (Refer to R.W. Brockett, Finite Dimensional Linear Systems , John Wiley & Sons, N.Y., 1970, pp.19-23). If τ = t-t o is small, i.e., |τ|<<1, then W(σ) is approximately constant for all t o ≦ σ ≦t. In this case Φ(t,t o ) can be approximated as follows: Truncating second-order and higher terms, we obtain the following: where I is the unit matrix and α,β,γ are the angles each gyro rotates through during the time τ. Therefore, to update a transformation T(t₁) to T(t₂) where t₂-t₁= τ , the following matrix multiplication is performed T(t₂) = T(t₁) T (13) where the incremental transformation matrix T is given by Each successive incremental Euler transformation matrix (T) and a respective other matrix (T(t₁)) are multiplied together to generate a respective product matrix (T(t₂)), said other matrix initially being an initialization matrix and thereafter being the previously calculated Euler transformation matrix. Each successive current Euler transformation matrix is formed from each successive product matrix, which is done in the embodiment of the invention by adding to it at selected times a correction matrix derived by long term comparison of the matrices generated by the inertial transformation matrix generator and the inertial navigation system of the craft. In the drawings: FIGURE 1 is a schematic diagram of a system having an inertial transformation matrix generator embodying the invention, for calculating Euler transformation matrices for converting sensor data to inertial coordinates. FIGURE 2 is a schematic diagram of a chain-matrix multiplier in an inertial transformation matrix generator embodying the invention in a preferred one of its forms. FIGURE 3 is a table of control signal values for the FIGURE 2 chain-serial matrix multiplier. FIGURE 4 comprising FIGURES 4a, 4b, 4c and 4d is a table of the contents of storage elements in first and third memories of the FIGURE 2 chain-serial matrix multiplier during an initial cycle and a continuing cycle of operation. FIGURE 5 is a table of the contents of other storage elements of the FIGURE 2 matrix multiplier (including those in its second memory) during a portion of successive cycles of operation. FIGURE 6 is a schematic diagram showing connections of the inertial navigation system to the inertial transformation matrix generator for referencing the inertial transformation matrix. FIGURE 7 is a diagram of information processing in a system including the inertial transformation matrix generator of the present invention. FIGURE 1 is a conceptual schematic diagram of the inertial transformation matrix generation (TMG) system for generating Euler transformation matrices that are used for transforming the aircraft sensor data to an inertial coordinate system in which the effects of aircraft motion are suppressed. A yaw sensing gyro 11 generates rate of yaw angle change information W α in analog form, which is converted to digital form by an analog-to-digital converter 14 and then is supplied to a digital multiplier 17, there to be multiplied by an increment of time Δt to generate a stream of α incremental yaw angles. A pitch-sensing gyro 12 generates rate of pitch angle change information W β in analog form which is converted to digital form by an analog-to-digital converter 15 and is then supplied to a digital multiplier 18, there to be multiplied by Δt to generate a stream of β incremental pitch angles. A roll-sensing gyro 13 generates rate of roll W γ in analog form, which is converted to digital form by an analog-to-digital converter 16 and is then supplied to a digital multiplier 19, there to be multiplied by Δt to generate a stream of γ incremental roll angles. The α, β and γ incremental angles are used to define the incremental Euler transformation matrix T of matrix equation (14), and a chain-serial matrix multiplier 21 uses a succession of these matrices to generate a succession of updated Euler transformation matrices per matrix equation (13). Chain-serial matrix multiplier 21 includes elements 22-26. Memory 22 stores incremental Euler transformation matrices and is written in accordance with the α, β and γ incremental Euler angles generated by multiplying analog-to-digital converters 17, 18 and 19. The previous Euler transformation matrix as read from memory 24 is multiplied in matrix multiplying means 23 by each successive one of these matrices to generate an updated Euler transformation matrix which is periodically corrected by adding correction terms in adder 25. The corrected updated Euler transformation matrix is temporarily stored in a memory 26 and is subsequently used for writing over memory 24. The initial Euler transformation matrix in memory 24 is supplied from the inertial navigation system. TMG system corrections for long-term drift between Euler transformation matrix generator and the inertial navigation system (INS) are made in the FIGURE 1 system by adding corrections to transformation matrix correction terms periodically using an adder 25, located after matrix multiplying means 23, the correction loop. The Euler transformation correction terms supplied to adder 25 are an error signal matrix generated by taking the Euler transform, as supplied from memory 24 in inertial transformation matrix generation (TMG) system, integrating it over time to suppress higher-frequency terms arising from vibration and airframe flexure so it is responsive only to low-frequency motion of the aircraft, and comparing it to the inertial navigation system (INS) transform which is also responsive only to low-frequency motion of the aircraft. Comparison is accomplished by matrix subtraction. There are at least four sources of error that afflict the transformation matrix generator and should be compensated for, which errors are listed in the following four paragraphs: 1) The gyro axes are not exactly mutually perpendicular, introduing error into the Euler transformation matrix. This error can be avoided by careful mechanical adjustments, but it may be more practical to provide for making an electrical correction. This error is a static error and is best compensated for by introducing a step of matrix multiplication by a fixed-value correction matrix. This correction, described in detail further on in this specification, is not shown in the FIGURE 1 system diagram. 2) The angles α, β and γ are approximated by products of gyro rate times a time increment, i.e., α = W α τ , β = W β τ , α = W γ τ This gives the correct angle only if the rate is constant over the time interval τ. Otherwise, an error in angle results, which is accumulated by the updating process. (3) The incremental transformation matrix is not a true Euler transformation matrix, but only becomes one as α, β and γ each approach zero. For nonzero values of α, β and γ, there is an approximation error which makes the matrix non-unitary. The Euler transformation matrix for transforming coordinates from one reference to a rotated one is by definition unitary -- that is, the matrix products of itself multiplied by its transpose and of its transpose multiplied by itself are equal to each other and to the unit matrix of similar order. This unit matrix is the square matrix I = (δ ij ) where each matrix element δ ij in row i and column j has a value equal to unity for i=j and otherwise equal to zero. The product of unitary matrices is unitary. So, theoretically, updating a Euler transformation matrix by multiplying it by successive incremental Euler transformation matrices should always result in a unitary matrix, presuming all matrices multiplied together have been unitary. However, in the transform matrix generator the incremental transformation matrix being per equation (13), the product of itself [T] and its transpose [T] T takes the following form: Therefore T is only approximately unitary, the approximation being better the smaller α, β and γ are. So with more violent maneuvering of the aircraft and the attendant larger values of α, β and γ the more quickly the updating procedure will cause an initially unitary Euler transformation matrix to depart from being unitary. (4) Each matrix multiplication introduces finite-wordlength arithmetic errors, which also accumulate from update step to update step. These errors accumulate more rapidly if the multiplication is done only with single precision (retaining the major product and suppressing the minor product), rather than with double precision (retaining both major and minor products in an accumulator with extended number of bits). Simply truncating the product to the major product, rather than following a rounding procedure, causes the errors to accumulate more rapidly. An original TMG constructed in accordance with the invention corrected the angles α, β and γ directly, based on estimated errors obtained by comparing TMG generated and INS generated matrices. The inverse of one of these matrices was matrix multiplied by the other to develop a product matrix having sin α, sin β and sin γ terms as elements thereof. These terms approximated as small angles represent the angular errors between the TMG generated and INS generated matrices. These deviations are low-pass filtered to generate the correction terms for the Euler angles α, β and γ. Errors were reasonably small as long as α, β and γ were small enough so that their squared values are less than one least significant bit of the system word length. Larger values of α, β and γ can lead to non-unitary and non-orthogonality errors if care is not taken when choosing gyro A/D scaling and TMG sample rates. In the original TMG, errors from the third-listed source were controlled by using a long wordlength, full-precision (or double-precision) multiplication with rounding, which entailed accumulation of double-length words. In the FIGURE 1 correction scheme, the angles α, β and γ are not corrected directly. Rather, the entire transformation matrix is corrected entry by entry using a closed-loop error feedback correction mechanism. This corrects for all four of the listed sources of error. The correction system keeps nudging the transformation matrix back to being unitary no matter how large α, β and γ get. Furthermore, single-precision multiplication,using truncation rather than rounding to provide arithmetic quantization, can be used without the problem of runaway accumulation of multiplier errors. Chain-serial matrix multiplier 21 may be one that uses a plurality of digital multipliers to perform element by element multiplications in parallel. Inventors D.S. Chan and D.A. Staver in a U.S. patent application 401,581 entitled "CHAIN-SERIAL MATRIX MULTIPLIERS" (RD 18827 (EP-A-89102918.3) describe general-purpose chain serial matrix multipliers as may be used for chain-serial matrix multiplier 21, in which a single digital multiplier is used on a time-division-multiplex basis to perform all element by element multiplications. Rather than using a general-purpose third-order matrix multiplier 21, a special-purpose third-order matrix multiplier, as also described in that U.S. patent application, is preferred for performing chain-serial matrix multiplication for the FIGURE 1 system. FIGURE 2 is a schematic diagram of this special-purpose chain-serial matrix multiplier for the FIGURE 1 system. FIGURE 3 is a table of the control signals used in the FIGURE 2 matrix multiplier. FIGURE 4 comprised of FIGURES 4a, 4b, 4c and 4d is a table describing the contents of temporary storage elements 401-419 in a first memory 41 and a third memory 43 of the FIGURE 2 matrix multiplier during its continuing operation. FIGURE 5 is a table describing the contents of temporary storage elements in a second memory 42 of the FIGURE 2 matrix multiplier and of temporary storage elements between a multiplier 40 in FIGURE 2 matrix multiplier and its second memory 42 during integration of gyro rate information. Multiplier 40 and ensuing sample-word-interval delay elements 420 and 421 are the equivalent of an actual pipeline multiplier having a two-word delay in generating major product. One of the design goals for the FIGURE 2 matrix multiplier was to develop most of the control signals using a simple binary counter. Accordingly, as can be discerned from the FIGURE 3 table of control signals, a 32-step operating cycle is used. Control signal C₁ and C₂ can be provided by the least significant bit and the most significant bit, respectively, of the count output signal of a five-stage binary up counter. Control signal C₄ can be simply generated by ANDing the most significant bit and the next most significant bit of the count output signal of the five-stage counter. Control signal C₃ can be generated by decoding the six and twelve counts from the binary counter and ORing the decoder output signals with control signal C₄. During the 32-step operating cycle a single digital multiplier 40 in the FIGURE 2 matrix multiplier is used on a time-division-multiplexed basis both to integrate the gyro rate information and to perform the multiplications associated with the matrix multiplication for updating the third-order Euler transformation matrix. The integration of gyro rate information takes place in steps 25-32 of the operating cycle. The elements of a preceding Euler matrix [E(t)] are defined as A, B, C, D, E, F, G, H, I, and each step of the chain-serial matrix multiplication to establish the current Euler matrix [E(t+Δt)] should be as follows: This chain-serial matrix multiplication is carried out during steps 1-18 of the operating cycle, with two steps of the operating cycle being taken up with generating each element of the new matrix, rather than three as chain-serial matrix multiplier. This is possible because the multiplications by unity-valued elements in the matrix [T] need not be carried out by the single digital multiplier 40. Rather, an element to be multiplied by such unity-valued element defines the product of such multiplication and is directly routed to an accumulator 44 following multiplier 40, rather than using multiplier 40 to perform these trivial "multiplications" on a pro forma basis. The multiplicand matrix is scanned in row major order once, multiplying the successive elements in each row by 1, α and -β respectively of a column vector of the multiplier matrix. One could arrange to rescan the multiplicand matrix in row major order twice again, multiplying the successive elements in each row by the column vector - α, 1 and γ respectively in the first rescanning and by the column vector β, -α and 1 respectively in the second rescanning. Rather than doing this, steps are taken to multiply the elements in the multiplicand matrix by the barrel-shifted column vector 1, γ and -α and then by the barrel-shifted column vector 1, β and -γ. This is made possible by providing compensatory barrel shifts in the positions of elements in the rows of the multiplicand matrix between each scanning in row major order and by considering the product matrix also to have corresponding barrel shifts in the positions of elements in its rows. These barrel shifts of elements in the columns of the multiplier matrix and in the rows of the multiplicand and product matrices are implementable using serial memories. When a complete matrix multiplication has been carried out, the three successive barrel shifts of elements in the rows of the product matrix during the matrix multiplication has restored the original positions of these elements. The initial loading of temporary sample storage elements 401-413 in first memory 41 of the FIGURE 2 matrix multiplier is made via the serial third memory 43 comprising temporary sample storage elements 412-418 and multiplexer 506, and via a temporary sample storage element 419 and a multiplexer 513 in an accumulator 44. FIGURES 4a and 4b are tables of temporary sample storage element conditions that obtain in the first and second halves respectively at the initial 32-step cycle of operation, during which this initial loading is done. Control signal C INITIAL applied to the multiplexer 513 is high the first twenty-one steps of the first 32-step operating cycle, conditioning multiplexer 513 to load the A-I elements of the initial multiplicand matrix from a double-buffer random-access memory 45. RAM 45 includes parallel load registers 451 into respective ones of which initial data samples A-I are asynchronously loaded, as shown, under control of decoder logic 450. RAM 45 also includes a parallel load register 452 into which Δt samples are asynchronously loaded, again under control of decoder logic 450. RAM 45 includes parallel-to-serial registers 453 to which the A-I initial data samples are parallelly loaded, which registers 453 are synchronously operated and connected to provide serial memory. RAM 45 also includes a register 426 connected to receive successive Δt samples and recirculate each of them in a synchronous serial memory operation. As will be described later on, registers 451 and 453 are also used to store correction data temporarily until such time as it is admitted into accumulator 44. RAM 45 has previously stored initialization data furnished from the inertial navigation system and now supplies them in the successive order XXXAXDXGXDXEXHXCXFXI during steps 1-21 of the initial 32-step operating cycle. After three don't-care samples, this sequence is the matrix samples in column major order alternating with don't care samples, the don't care values being indicated by X's. The one-sample delay afforded by temporary storage element 419 causes the alternate samples A, D, G, B, E, H, C, F AND I to be supplied to the input port of multiplexer 506 selected during odd-numbered steps for supplying signal to cascaded temporary sample storage elements 418, 417, 416, 415, 414 in the third memory 43. After that one passage through the cascaded temporary storage elements in third memory 43 the alternate samples are, however, fed back to the input port of multiplexer 506 selected during even-numbered steps for supplying signal to the cascaded storage elements 418, 417, 416, 415, 414 of third memory 43, to time interleave with their successors. After one passage through the cascaded temporary storage elements in third memory 43, the alternate samples are delayed an additional sample interval in each of the cascaded temporary sample storage elements 413 and 412 to arrive at input ports of multiplexers 505 and 504 not selected for connection to their output ports at the time those samples arrive. After that one passage through the cascaded temporary storage elements in third memory 43 the alternate samples are, however, fed back to the input port of multiplexer 506 selected during even-numbered steps for supplying signal to the cascaded storage elements 418, 417, 416, 415, 414 of third memory 43, to time interleave with their successors. After the second passage of these alternate samples through the cascaded temporary storage elements in third memory 43 to time interleave with the other initial samples and after one sample further delay in a clocked temporary storage element 413 these initial samples arrive at the input port of a multiplexer 505 selected at those times for connection to its output ports. The initial samples routed through multiplexer 505 to a clocked temporary storage element 410 are except for the final sample not selected by a multiplexer 504 for connection to its output port. The initial samples, after an additional sample delay in a clocked temporary sample storage element 412, arrive at the input port of multiplexer 504 selected to its output port during all the initial samples except the last I sample. A multiplexer 503 selects to its output port only during odd-numbered steps of the operating cycle its input port connected from the output port of multiplexer 504, so initial samples flow through multiplexer 504 to the cascaded temporary sample storage elements 409, 408, 407, 406 and 405 only after these samples have completed one recirculation through the serial third memory 43 so they reach multiplexer 503 on an odd-numbered step of the operating cycle. Similarly, a multiplexer 502 selects samples supplied from one-sample-delay clocked temporary sample storage element 405 only during odd-numbered steps of the operating cycle, so only initial samples recirculated through cascaded temporary storage elements 409, 408, 407, 406 and 405 are applied to cascaded clocked temporary storage elements 404, 403 and 402. Again similarly, a multiplexer 501 selects samples supplied from temporary storage element 402 only during odd-numbered steps of the operating cycle, which causes each successive sample so selected to appear twice in succession as applied to accumulator 430. After the first twenty-one steps of the first 32-step operating cycle, the control signal C INITIAL is low. So third memory 43 is loaded during successive operating cycles using updated matrix elements as accumulated by accumulator 44. Insofar as the third memory 43 and first memory 41 are concerned, loading of updated matrix elements takes place in these successive operating cycles much the same as loading of initial matrix elements takes place in the first operating cycle. Beginning with the twenty-fifth step of each operating cycle and continuing through its last step, the matrix elements to be temporarily stored in second memory 42 for use in the next 32-step operating cycle are generated. A multiplication factor, Δt, is loaded into temporary storage element 426 within the buffer RAM 45 during the twenty-fifth step and control signal C₄ applied to multiplexer 511 is high, conditioning multiplexer 511 to apply Δt (recirculated in temporary storage element 426) to multiplier 40 as multiplicand signal during steps 25-32. A multiplexer 516 is conditioned by C₄ being high to select to multiplier 40 as multiplier signal read-out from a double-buffer random-access memory 46 during steps 25-32. The α, β, and γ elements for the Euler transformation matrix are delivered from multiplier 40 as products via the cascade connection of temporary storage elements 420 and 421 during steps 28-30. During steps 25-32, control signal C₄ applied to multiplexer 512 is high, and control signal C₃ applied to multiplexers 508, 509 and 510 is high. Accordingly, multiplexers 508-510 and 512 are conditioned to include temporary sample storage elements 422, 423 and 424 in cascade connection with temporary storage elements 420 and 421. This permits the α, β and γ products to be shifted to positions in temporary storage elements 424, 423 and 422, respectively, for the beginning of the next operating cycle. A temporary sample storage element 425 receives as input signal the negative of the output signal from temporary storage element 423, as generated by elements 427, and so stores -β product as the beginning of the next operating cycle. FIGURES 4c and 4d show the samples stored in temporary storage elements 401-419 during each step of the first and second halves respectively of this next operating cycle. The matrix elements stored in temporary storage elements 402-409 at the beginning of this operating cycle are shown in the blocks representing these elements in FIGURE 2. Updated matrix element A′ that replaces the original matrix element A is calculated by inserting samples B and C into multiplier 40 following the first and second steps, respectively, to be multiplied by α and -β values, respectively. The major products of these multiplications are delayed one clock cycle to be clocked into temporary storage element 420 following the second and third steps and then into temporary storage element 421 following the third and fourth steps. Following the third step, adder 441 in the accumulator 440 receives as a first input signal the A sample from storage element 401, as selected by multiplexer 507 responding to control signal C₁ being high, and receives as a second signal the delayed product αB from storage element 421. The sum output signal from adder 441 is inserted into storage element 419. Following any even-numbered step, control signal C₁ is low, conditioning multiplexer 506 in third memory 43 to continue circulating samples already contained therein, rather than accepting a new sample being written thereinto. So, following the fourth step, adder 441 receives as a first input signal the sum output signal temporarily stored in storage element 419, as selected by multiplexer 507 responding to control signal C₁ being low. Adder 441 receives as its second input signal the delayed product -βC from storage element 421. Adder 441 delivers its sum output signal to storage element 419. Following the fifth step (or any odd-numbered step) control signal C₁ applied to multiplexer 506 is high, conditioning it to write the accumulation result temporarily stored in storage element 419 into the serial third memory 43. So the accumulation result A'=A+αB-βC is transferred from temporary storage element 419 to temporary storage element 420 between the fifth and sixth steps of the operating cycle. During the third step samples E and F have advanced to storage elements 405 and 406, and sample D has advanced to storage element 402. Samples E and F enter multiplier 40 following the third and fourth steps, respectively, to be multiplied by α and -β values respectively. The major products of these multiplications are delayed by one clock cycle to be clocked into storage element 420 following the fourth and fifth steps and then into temporary storage element 421 following the fifth and sixth steps. Following the third step, multiplexer 501 responding to control signal C₁ being high writes sample D into storage element 401. Following the fourth step, multiplexer 501 responding to control signal C₁ being low reads D sample to rewrite storage element 401. Following the fifth step, adder 441 receives via multiplexer 507 sample D from storage element 401 as one input signal and receives the delayed product αE from storage element 421 as its other input signal. Multiplexer 507 operates to circulate the sum signal inserted from adder 441 into storage element 419 back to adder 441 following the sixth step, to be added with the delayed product -βF read from storage element 421. Following the seventh step multiplexer 506 writes into third memory 43 the accumulation result D'=D+αE-βF until then temporarily stored in storage element 419. During the fifth step, samples H and I have advanced to storage elements 405 and 406, and sample G has advanced to storage element 402. Samples H and I enter multiplier 40 following the third and fourth steps, respectively, to be multiplied by α and -β values respectively. The major products of these multiplications are delayed by one clock cycle to be clocked into storage element 420 following the sixth and seventh steps and then into temporary storage element 421 following the seventh and eighth steps. Following the fifth step, multiplexer 501 responding to control signal C₁ being high writes sample G into storage element 401. Following the sixth step, multiplexer 501 responding to control signal C₁ being low reads sample G to rewrite storage element 401. Following the seventh step, adder 441 receives via multiplexer 507 sample G from storage element 401 as one input signal and receives the delayed product αH from storage element 421 as its other input signal. Multiplexer 507 operates to circulate the sum signal inserted from adder 441 into storage element 419 back to adder 431 following the eighth step, to be added with the delayed product -βI read from storage element 421. Following the ninth step multiplexer 506 writes into third memory 43 the accumulation result G'=G+αH-βI until then temporarily stored in storage element 419. As one may note from referring to FIGURE 5 table of temporary storage element conditions in second memory 42, control signal C₃ being high during the sixth step causes circulation of elements γ, α and β from temporary storage elements 422, 423 and 424, respectively to temporary storage elements 423, 424 and 422, respectively, following the twelfth step, to repose therein through the eighteenth step. Following the seventh step the negative of the value α that is stored in storage element 413 is written into storage element 425, to repose therein through the twelfth step. During the seventh step, samples C and A have advanced to storage elements 405 and 406, and sample D has advanced to storage element 402. Samples C and A enter multiplier 40 following the seventh and eighth steps, respectively to be multiplied by γ and -α values respectively. The major products of these multiplications are delayed by one clock cycle to be clocked into storage element 420 following the eighth and ninth steps and then into temporary storage element 421 following the ninth and tenth steps. Following the seventh step, multiplexer 501 responding to control signal C₁ being high writes sample B into storage element 401 as A sample is read out. Following the eighth step, multiplexer 501 responding to control signal C₁ being low reads sample B to rewrite storage element 401. Following the ninth step, adder 441 receives via multiplexer 507 sample B from storage element 401 as one input signal and receives the delayed product γC from storage element 421 as its other input signal. Multiplexer 507 operates to circulate the sum signal inserted from adder 441 into storage element 419 back to adder 441 following the tenth step, to be added with the delayed product -αA read from storage element 421. Following the eleventh step multiplexer 506 writes into third memory 43 the accumulation B'=B+γC-αA until then temporarily stored in storage element 419. During the ninth step, samples F and D have advanced to storage elements 405 and 406, and sample E has advanced to storage element 402. Samples F and D enter multiplier 40 following the ninth and tenth steps, respectively to be multiplied by γ and α values respectively. The major products of these multiplications are delayed by one clock cycle to be clocked into storage element 420 following the tenth and eleventh steps and then into temporary storage element 421 following the eleventh and twelfth steps. Following the ninth step, multiplexer 501 responding to control signal C₁ being high writes sample E into storage element 401. Following the tenth step, multiplexer 501 responding to control signal C₁ being low reads sample E to rewrite storage element 401. Following the eleventh step, adder 441 receives via multiplexer 507 sample E from storage element 401 as one input signal and receives the delayed product γF from storage element 421 as its other input signal. Multiplexer 507 operates to circulate the sum signal inserted from adder 441 into storage element 419 back to adder 441 following the twelfth step, to be added with the delayed product -αD read from storage element 421. Following the thirteenth step multiplexer 506 writes into third memory 43 the accumulation E'=E+γF-αD until then temporarily stored in storage element 419. During the eleventh step samples I and G have advanced to storage elements 405 and 406, and sample D has advanced to storage element 402. Samples I and G enter multiplier 40 following the eleventh and twelfth steps, respectively to be multiplied by γ and -α values respectively. The major products of these multiplications are delayed by one clock cycle to be clocked into storage element 420 following the twelfth and thirteenth steps and then into temporary storage element 421 following the thirteenth and fourteenth steps. Following the eleventh step, multiplexer 501 responding to control signal C₁ being high writes sample H into storage element 401. Following the twelfth step, multiplexer 501 responding to control signal C₁ being low reads sample H to rewrite storage element 401. Following the thirteenth step, adder 441 receives via multiplexer 507 sample H from storage element 401 as one input signal and receives the delayed product γI from storage element 421 as its other input signal. Multiplexer 507 operates to circulate the sum signal inserted from adder 441 into storage element 419 back to adder 441 following the sixth step, to be added with the delayed product -αG read from storage element 421. Following the seventh step multiplexer 506 writes into third memory the accumulation result H'=H+αI-γG temporarily stored in storage element 419. As one may note from referring to FIGURE 5 table of temporary storage element conditions in second memory 42, control signal C₃ being high during the twelfth step causes circulation of elements γ, α and β from temporary storage elements 422, 423 and 424, respectively, to temporary storage elements 423, 424 and 422, respectively, following the twelfth step, to repose therein through the eighteenth step. Following the thirteenth step the negative of the value γ that is stored in storage element 423 is written into storage element 425, to repose therein through the eighteenth step. During the thirteenth step samples A and B have advanced to storage elements 405 and 406, and sample C has advanced to storage element 402. Samples A and B enter multiplier 40 following the thirteenth and fourteenth steps, respectively to be multiplied by γ and -α values respectively. The major products of these multiplications are delayed by one clock cycle to be clocked into storage element 420 following the fourteenth and fifteenth steps and then into temporary storage element 421 following the fifteenth and sixteenth steps. Following the third step, multiplexer 501 responding to control signal C₁ being high writes sample C into storage element 401 Following the fourteenth step, multiplexer 501 responding to control signal C₁ being low reads D sample to rewrite storage element 401. Following the fifteenth step, adder 441 receives via multiplexer 507 sample C from storage element 401 as one input signal and receives the delayed product βA from storage element 421 as its other input signal. Multiplexer 507 operates to circulate the sum signal inserted from adder 441 into storage element 419 back to adder 441 following the sixteenth step, to be added with the delayed product -γB read from storage element 421. Following the seventeenth step multiplexer 506 writes into third memory 43 the accumulation result C'=C+βA-γB until then temporarily stored in storage element 419. During the fifteenth step samples D and E have advanced to storage elements 405 and 406, and sample F has advanced to storage element 402. Samples D and E enter multiplier 40 following the fifteenth and sixteenth steps, respectively to be multiplied by β and -γ values respectively. The major products of these multiplications are delayed by one clock cycle to be clocked into storage element 420 following the sixteenth and seventeenth steps and then into temporary storage element 421 following the seventeenth and eighteenth steps. Following the fifteenth step, multiplexer 501 responding to control signal C₁ being high writes sample F into storage element 401 out. Following the sixteenth step, multiplexer 501 responding to control signal C₁ being low reads sample F to rewrite storage element 401. Following the seventeenth step, adder 441 receives via multiplexer 507 sample F from storage element 401 as one input signal and receives the delayed product βD from storage element 421 as its other input signal. Multiplexer 507 operates to circulate the sum signal inserted from adder 441 into storage element 419 back to adder 441 following the eighteenth step, to be added with the delayed product -γE read from storage element 421. Following the nineteenth step multiplexer 506 writes into third memory 43 the accumulation result F'=F+βD-γE temporarily stored in storage element 419. During the seventeenth step samples G and H have advanced to storage elements 405 and 406, and sample I has advanced to storage element 402. Samples G and H enter multiplier 40 following the seventeenth and eighteenth steps, respectively to be multiplied by β and -γ values respectively. The major products of these multiplications are delayed by one clock cycle to be clocked into storage element 420 following the eighteenth and nineteenth steps and then into temporary storage element 421 following the nineteenth and twentieth steps. Following the seventeenth step, multiplexer 501 responding to control signal C₁ being high writes sample I into storage element 401. Following the eighteenth step, multiplexer 501 responding to control signal C₁ being low reads sample I to rewrite storage element 401. Following the nineteenth step, adder 441 receives via multiplexer 507 sample I from storage element 401 as one input signal and receives the delayed product βG from storage element 421 as its other input signal. Multiplexer 507 operates to circulate the sum signal inserted from adder 441 into storage element 419 back to adder 441 following the sixth step, to be added with the delayed product -γH read from storage element 421. Following the twenty-first step multiplexer 506 writes into third memory 43 the accumulation result I'=I+βG-γH until then temporarily stored in storage element 419. During the operations just described a multiplicand matrix element clocked out of temporary storage element 405 after being available as an input signal to multiplier 40 during an odd-numbered step of the operating cycle will not be recirculated to element 409 by reason of multiplexer 503 being conditioned by control signal C₁ being low to instead admit a new matrix element. C₂ is low during steps 1-16 of the operating cycle, conditioning multiplexers 504 and 505 to connect temporary storage element 410 in cascade connection after temporary storage elements 404-403, 402 and 411. Following step 1, sample I is clocked forward into storage element 409. The sample clocked out of storage element 405 after an odd-numbered step of the operating cycle is selected to storage element 404 by multiplexer 502 responding to C₁ having been high during the odd-numbered step. A multiplicand matrix element clocked out of storage element 405 during an even-numbered step of the operating cycle is selected back to storage element 409 by multiplexer 503 responding to control signal C₁ being low. Similarly, a multiplicand matrix element clocked out of storage element 402 during an even-numbered step of the operating cycle is selected back to storage element 404 by multiplexer 502 responding to control signal C₁ being low. The sample is thus preserved in the cascade connection of storage elements 404, 403, 402 even though that sample as it proceeds following the even-numbered step to storage element 411 will after being clocked through storage element 412 not be selected to storage element 409 but rather discarded by action of multiplexer 503. Output signal is shown in FIGURE 2 as being taken from the output of accumulator 44 and having some of the non-useful samples replaced with repeated useful samples. This replacement is done by a multiplexer 517 responding to control signal C₁ a temporary storage element 428 connected as a further serial memory. Alternately, output signal can be taken from the output port of any of the storage elements 413-418. The FIGURE 2 chain-serial matrix multiplier is adapted for entering inertial navigation system corrections at selected times using a further adder 442 in accumulator 44 Responsive to the normally low control signal C LOAD being high at appropriate times adder 441 output signals with corrections added to them in adder 442 are selected to third memory, 43 rather than adder 441 output signals without such corrections. These corrections are delivered from the same buffer RAM 45 used to load initial matrix data. As previously noted, these corrections correspond to the difference between the low-pass filtered inertial successive transformation matrices and the low-pass filtered successive inertial navigation system INS matrices. The low-pass filtering of a succession of matrices is a way of determining their average value over a period of time. Subtracting the average value of one succession of matrices from the average of another succession of matrices is a comparison procedure. Suppose the low-pass filtering of the succession of inertial transformation matrices and the low pass filtering of the succession of INS matrices is similar insofar as matrix supply rate and filter transfer characteristics are concerned. Then, because of the distributive properties of the convolution procedures, the inertial transformation matrix corrections can be generated instead by low-pass filtering the differences between the unfiltered inertial transformation matrices and the unfiltered INS matrices. This substantially reduces the complexity of the calculations. FIGURE 6 shows apparatus for doing this. INS matrix data from an inertial navigation system 600 are supplied as minuend input signal to a subtractor 601. Subtractor 601 receives as subtrahend input signal the output signal from the transformation matrix generator. The difference output signal is supplied as the input signal for a digital low-pass filter 610. A multiplexer 620 initially selects data descriptive of an initial INS matrix as write input signal to buffer memory 45 of the FIGURE 2 transformation matrix generator and thereafter selects the low-pass filter 610 response to buffer memory 45 as write input signal. (If the FIGURE 1 transform matrix generator is considered, rather than the FIGURE 2 transformation matrix generator, multiplexer 620 is not required. Instead, INS matrix data are directly supplied from inertial navigation system 600 to memory 24 for its initialization; and low-pass filter 610 response is recurrently applied as an addend to adder 25 by a tristate latch which otherwise supplies a zero addend to adder 25.). The digital low-pass filter 610 shown in FIGURE 6 is one designed to provide a roll-off response which in the sampled-data realm corresponds to the roll-off response that is provided by a simple resistor-capacitor (RC) filter in the continuous-data realm. As described by A.V. Oppenheim and R.W. Schafer in pages 195-198 and 206-211 of their book DIGITAL SIGNAL PROCESSING published in 1975 by Prentice-Hall Inc. of Englewood Cliffs, NJ, the technique of bilinear transformation may be used to convert the H(s) transfer function of the RC filter in the continuous complex-frequency s plane to the corresponding H(z) transfer function, as expressed in the z-transform used to describe sampled-data operation. The transfer function H(s) for a simple RC low pass filter is as follows. H(s) = (1 + sRC)⁻¹ = (1 + sτ)⁻¹ (15) The bilinear transform generates H(z) from H(s)) by making the following substitution for s, where T is the sampling interval. s = 2T⁻¹ (1 - z⁻¹) (1 + z⁻¹) ⁻¹ (16) This substitution results in equation (17) following. where µ = T(2τ + T)⁻¹ (18) ν = (2τ - T) (2τ + T)⁻¹ (19) For a continuous stream of sample words, the low-pass filter function described by equations (17), (18) and (19) would be provided by a low-pass filter configuration similar to that of filter 610, except for nine-word delay elements 611 and 615 being replaced by one-word delay elements, as may be described by one skilled in the art of digital design simply by inspecting the equations. The numerator of the fraction describing transfer function H(z) in equation (17) is a filter response zero provided by adding each sample word to its predecessor in an adder 612, then scaling the result by the factor µ in an analog multiplier element 613. The denominator of the fraction in equation (17) is a filter response pole provided by adding each sample word in an adder 614 to the preceding sum response of adder 614 as scaled by the factor ν in analog multiplier element 616. In low-pass filtering the difference matrix supplied from subtractor 601, sample words for corresponding position in the matrix occur only every ninth word if filter calculations are done sequentially (rather than in parallel) so delay elements 611 and 615 have to provide nine-word (rather than one-word) delay. Since analog multiplications by multipliers 613 and 616 are performed using fixed-value multipliers µ and ν, the multiplications can be performed without appreciable delay by table look-up from read-only memory. If other forms of multiplier are used which involve appreciable delay, the delay in multiplier 616 can provide a portion of the nine-word delay that delay element 615 would otherwise have to provide. The time constant τ = RC for low-pass filter 610 is long, typically of the order of a few seconds. Accordingly, it is practical to use a dedicated microprocessor, instead of the FIGURE 6 digital hardware, which microprocessor is conditioned by its programming to perform the matrix subtraction and low-pass filtering procedures. There are some simplifications made in FIGURE 1 with regard to how information from the rate-sensing gyros 11-13 can be actually processed to generate streams of incremental yaw, pitch and roll angles. The static error introduced by the gyro axes not beding exactly mutually perpendicular is a static error. It is desirable to compensate this error to reduce reliance on the feedback loop for correcting this error. Accordingly, the raw outputs α RAW , β RAW , γ RAW of the rate-sensing gyro as converted to digital form are preferably orthogonalized by an initial matrix multiplication as follows This is preferably done in matrix multiplier hardware located directly following the analog-to-digital converters 14, 15 and 16. The raw gyro rates α ˙ RAW , β ˙ RAW , γ ˙ RAW . and the processed gyro rates α ˙, β ˙, γ ˙ equation (20) are in a system that has been constructed using two's complement data each expressed in two-word, thirty-two-bit format. The azimuth correction (or yaw-correction) coefficients AZK₁, AZK₂, AZK₃; the elevation-correction (or pitch-correction) coefficients ELK₁, ELK₂, ELK₃; and the roll-correction coefficients RLK₁, RLK₂, RLK₃ are single-word, sixteen-bit two's complement data each in the range -2 -4, inclusive, to 2⁻⁴, exclusive. The raw gyro rates α ˙ RAW, β ˙ RAW , γ ˙ RAW are scaled by a scale factor k⁻¹ prior to analog-to-digital conversion better to utilize the range of the analog-to-digital converters 14-16 (and possibly to avoid the possibility of a product matrix with elements as large as or larger than unity). The processed gyro rates α ˙, β ˙, γ ˙ at are in actuality multiplied by kt rather than just incremental time t, to remove the k⁻¹ scale factor. Matrix multiplying errors may be reduced, thereby avoiding reliance on the feedback correction loop, also. This has been done by employing double-precision processing to thirty-two bits in matrix multiplying means and rounding the product to the nearest significant bit rather than truncating it. Reducing matrix multiplying errors by employing greater arithmetic precision facilitates the corrections for non-orthogonality of transformation matrices. In certain applications such as the control of missile flight that is completed in a short time there may be no need to correct for non-orthogonality of the T matrices that the inertial transformation matrix generator produces. Despite TMG matrix update rate being low enough that incremental angles evidence considerable error insofar as small angle approximations are concerned, the accumulated error may not be large enough at the end of the flight time to be of consequence. FIGURE 7 shows overall the processing of signals in a system using the inertial transform matrix generator of the invention to stabilize detection data from a sensor. A set 700 of gyros supplies a matrix 701 of raw gyro data that is orthogonalized by being matrix multiplied by an orthogonalizing matrix 702, per equation (20), to generate a matrix 703 of processed gyro data. The matrix 703 is processed in a processor 704 to generate the incremental Euler transform or matrix 705, which multiplies a previous TMG matrix 706 to form a product matrix to which a drift correction matrix 707 is added to generate the current TMG matrix 708. The product of the INS matrix 709 and a first boresight correction matrix 710 is the initialization value for previous TMG matrix 706, and this product matrix has the current TMG matrix 708 subtracted therefrom to generate an error matrix 711 supplied as input signal to a low-pass filter 712. The low-pass response of filter 712 provides the drift correction matrix 707. First boresight correction matrix 710 refers the initialization data in NED coordinates, or as translated from NED to body coordinates, to the actual positioning of the gyro axes. A second boresight correction matrix 713 compensates Cartesian-coordinate data x, y, z originating from a sensor 714 for the displacements between their reference axes and the gyro axes. The Cartesian-coordinate data are generated by a converter 715 responding to data from the sensor 714 and are multiplied by the current TMG matrix 708 to account for perturbations of the gyro positions respective to the aircraft body and are further multiplied by the second boresight correction to develop a description of sensor data in the coordinate system to which the gyros are referenced. A converter 716 converts these sensor data into polar coordinates of azimuth and elevation respective to the coordinate system in which the initialization data are expressed. The relationships of the sensor, gyro and INS coordinate systems by first and second boresight transforms is illustrated in the lower right corner of FIGURE 7. One skilled in the art of digital electronics systems design will be enabled by the foregoing disclosure to design a number of variations of the particular transformation matrix generation system particularly described, and this should be borne in mind when construing the scope of the ensuing claims, which are intended to provide protection for all such embodiments of the invention.

Claims: A system for use in converting to inertial coordinates the responses of a craft-borne, hard mounted sensor using an Euler transformation matrix comprising: first (1), second (12) and third (13) rate-sensing gyros, which in use are located proximate to said sensor, strapped down to said craft hull, and oriented to sense motion of the craft hull in three mutually orthogonal directions, for providing respective output signals (W α , W β , W γ ) indicative of components of craft hull motion in each of said three mutually orthogonal directions; an inertial transformation matrix generator for generating an Euler transformation matrix based on said output signals of said first, second and third gyros; an inertial navigation system providing a succession of inertial navigation system matrices; characterized in that said inertial transformation matrix generator comprises : means (22) for generating successive incremental Euler transformation matrices based on said output signals of said first, second and third gyros; means (23) for matrix multiplying together each successive said incremental Euler matrix and a respective other matrix to generate a respective product matrix, said other matrix initially being an initialization matrix from said inertial navigation system (600) and thereafter being the previously calculated Euler transformation matrix; means (26) for forming each successive current Euler transformation matrix from each successive product matrix. means (24) for periodically comparing the average values of successive ones of the generated Euler transformation matrices and of successive ones of the inertial navigation system matrices thereby to generate correction matrices; and means (25) for adding to the product matrix any concurrent correction matrix supplied from said means for periodically comparing averages, included within said means for forming each successive Euler transformation matrix from each successive product matrix. A system as set forth in Claim 1 wherein said means (24) for periodically comparing the average values of successive ones of the generated Euler transformation matrices and of successive ones of the inertial navigation system matrices comprises: means (601) for subtracting each element of the generated Euler transformation matrix from the corresponding element of inertial navigation system matrix to generate a respective one of a succession of difference matrices; and means (610) for low-pass filtering said difference matrices to generate said correction matrices. A system as set forth in Claim 1 or 2, wherein said means (23) for multiplying comprises: a multiplier (40) having first and second input ports and an output port; an accumulator (44) including therein said means for adding, having an input port to which the output port of said multiplier is connected and having an output port; a memory (41) for temporarily storing the incremental Euler transformation matrix, as written thereto from said gyros, and as read therefrom in an element by element scanning to the first input port of said multiplier; a memory (42) for temporarily storing said other matrix, as read therefrom in an element by element scanning to the second input port of said multiplier; and a memory (43) for temporarily storing said updated Euler transformation matrix, as written thereto from the output port of said accumulator, and as read therefrom as said previously calculated Euler transformation matrix for writing said memory for temporarily storing said other matrix. A system as set forth in Claim 1, 2 or 3 wherein said means for generating successive incremental Euler transformation matrices includes: means (17, 18, 19) for multiplying an orthogonalizing matrix by the digitized output signals of said first, second and third gyros, to compensate for any departure of the axes of said first, second and third gyros from mutual perpendicularity. A system as set forth in Claim 1, 2, 3 or 4 wherein said means for generating successive incremental Euler transformation matrices includes: means (17,18, 19) for multiplying an orthogonalizing matrix by the digitized output signals of said first, second and third gyros, to compensate for any departure of the axes of said first, second and third gyros from mutual perpendicularity. A system as set forth in any preceding claim, further comprising means for digitizing (14, 15, 16) the gyro output signals.

Inventors: CHAN DAVID SOKEUNG, CLARK NANCY MARIE, RAPIEJKO STEPHEN JAMES, STAVER DANIEL ARTHUR, CHAN, DAVID SOKEUNG, CLARK, NANCY MARIE, RAPIEJKO, STEPHEN JAMES, STAVER, DANIEL ARTHUR
Applicants: GEN ELECTRIC, GENERAL ELECTRIC COMPANY
Application year: 1990
Main classification: G01C21
IPC codes: B64C17, G06F7, B60R16, G01C21