Approximate closed-form solutions of realistic true proportional navigation guidance using the Adomian decomposition method

Approximate closed-form solutions of the non-linear relative equations of motion of an interceptor pursuing a target under the realistic true proportional navigation (RTPN) guidance law are derived using the Adomian decomposition method in this article. In the literature, no study has been reported on derivation of explicit time-series solutions in closed form of the nonlinear dynamic engagement equations under the RTPN guidance. The Adomian method provides an analytical approximation, requiring no linearization or direct integration of the non-linear terms. The complete derivation of the Adomian polynomials for the analysis of the dynamics of engagement under RTPN guidance is presented for deterministic ideal case, and non-ideal dynamics in the loop that comprises autopilot and actuator dynamics and target manoeuvre, as well as, for a stochastic case. Numerical results illustrate the applicability of the method.

High-Rate, Multisymbol-Decodable STBCs From Clifford Algebras

It is well known that space-time block codes (STBCs) obtained from orthogonal designs (ODs) are single-symbol decodable (SSD) and from quasi-orthogonal designs (QODs) are double-symbol decodable (DSD). However, there are SSD codes that are not obtainable from ODs and DSD codes that are not obtainable from QODs. In this paper, a method of constructing g-symbol decodable (g-SD) STBCs using representations of Clifford algebras are presented which when specialized to g = 1, 2 gives SSD and DSD codes, respectively. For the number of transmit antennas 2(a) the rate (in complex symbols per channel use) of the g-SD codes presented in this paper is a+1-g/2(a-9). The maximum rate of the DSD STBCs from QODs reported in the literature is a/2(a-1) which is smaller than the rate a-1/2(a-2) of the DSD codes of this paper, for 2(a) transmit antennas. In particular, the reported DSD codes for 8 and 16 transmit antennas offer rates 1 and 3/4, respectively, whereas the known STBCs from QODs offer only 3/4 and 1/2, respectively. The construction of this paper is applicable for any number of transmit antennas. The diversity sum and diversity product of the new DSD codes are studied. It is shown that the diversity sum is larger than that of all known QODs and hence the new codes perform better than the comparable QODs at low signal-to-noise ratios (SNRs) for identical spectral efficiency. Simulation results for DSD codes at variousspectral efficiencies are provided.

On exact solutions of the unsteady navierstokes equationsâ the vortex with instantaneous curvilinear axis

The unsteady pseudo plane motions have been investigated in which each point of the parallel planes is subjected to non-torsional oscillations in their own plane and at any given instant the streamlines are concentric circles. Exact solutions are obtained and the form of the curve , the locus of the centers of these concentric circles, is discussed. The existence of three infinite sets of exact solutions, for the flow in the geometry of an orthogonal rheometer in which the above non-torsional oscillations are superposed on the disks, is established. Three cases arise according to whether is greater than, equal to or less than , where is angular velocity of the basic rotation and is the frequency of the superposed oscillations. For a symmetric solution of the flow these solutions reduce to a single unique solution. The nature of the curve is illustrated graphically by considering an example of the flow between coaxial rotating disks.

A class of exact solutions for the flow of a micropolar fluid

The flow of a micropolar fluid in an orthogonal rheometer is considered. It is shown that an infinite number of exact solutions characterizing asymmetric motions are possible. The expressions for pressure in the fluid, the components of the forces and couples acting on the plates are obtained. The effect of microrotation on the flow is brought out by considering numerical results for the case of coaxially rotating disks.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), nonorthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time (ST) code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the orthogonal and the nonorthogonal amplify-and-forward (NAF) protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Moreover our code construction for the OAF protocol incurs less delay. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. The variable-NSDF protocol is shown to improve on the DMT of the best previously known static protocol when the number of relays is greater than two. Also included is a DMT optimal code construction for the NAF protocol.

Microprocessor-based polynomial generator

A new method of generating polynomials using microprocessors is proposed. The polynomial is generated as a 16-bit digital word. The algorithm for generating a variety of basic 'building block' functions and its implementation is discussed. A technique for generating a generalized polynomial based on the proposed algorithm is indicated. The performance of the proposed generator is evaluated using a commercially available microprocessor kit.

A cryptographic system based on finite field transforms

In this paper, we develop a cipher system based on finite field transforms. In this system, blocks of the input character-string are enciphered using congruence or modular transformations with respect to either primes or irreducible polynomials over a finite field. The polynomial system is shown to be clearly superior to the prime system for conventional cryptographic work.

The machinability of a cast aluminium alloy-graphite particle composite

The microstructure of a cast Al---Si alloy-graphite particle composite is examined using optical and analytical scanning electron microscopy. Specimens containing different percentages of graphite were machined by orthogonal planning with 25° and 45° rake angle tools at both 6.5 and 13.2 m min−1. The machining forces are reported and the chip-rake-face friction coefficients and shear flow stresses are calculated. It is shown that the reduction in machining forces with increasing graphite content is due mostly to a decrease in the shear flow stress rather than to lower chip-rake-face friction. Both the polished and the machined surfaces of the composite are rougher than those of the simple alloy, apparently owing to the greater porosity, the tearing out of graphite particles, or the opening of cracks at the graphite particles in the wake of the tool.

Finite element analysis of laminated anisotropic thin-walled open-section beams

A finite element analysis of thin-walled open-section laminated anisotropic beams is presented herein. A two-noded, 8 degrees of freedom per node thin-walled open-section laminated anisotropic beam finite element has been developed and used. The displacements of the element reference axes are expressed in terms of one-dimensional first order Hermite interpolation polynomials and line member assumptions are invoked in the formulation of the stiffness matrix. The problems of: 1. (a) an isotropic material Z section straight cantilever beam, and 2. (b) a single-layer (0°) composite Z section straight cantilever beam, for which continuum solutions (exact/approximate) are possible, have been solved in order to evaluate the performance of the finite element. Its applicability has been shown by solving the following problems: 3. (c) a two-layer (45°/−45°) composite Z section straight cantilever beam, 4. (d) a three-layer (0°/45°/0°) composite Z section straight cantilever beam.

A laminated anisotropic curved beam and shell stiffening finite element

The details of development of the stiffness matrix of a laminated anisotropic curved beam finite element are reported. It is a 16 dof element which makes use of 1-D first order Hermite interpolation polynomials for expressing it's assumed displacement state. The performance of the element is evaluated considering various examples for which analytical or other solutions are available.

A study on the nature of the compound layer formed during the ion nitriding of En40B steel

Commercial-grade En40B steel has been ion nitrided in the temperature range 475–550°C in a 25%N2–75%H2 gas mixture. The nature of the compound layer formed was studied by the X-ray diffraction technique and optical metallography. It was observed that the structure of the compound layer gradually transforms from a predominantly epsilon (Porson) nitride to a predominantly γ′ nitride structure with increasing treatment time. Optical metallography studies on sections orthogonal to the nitrided surface showed that, after about 5 h of treatment, the thickness of the compound layer decreases with further increase in treatment time.

Reverse Channel Training For Reciprocal Mimo Systems With Spatial Multiplexing

This paper investigates the problem of designing reverse channel training sequences for a TDD-MIMO spatial-multiplexing system. Assuming perfect channel state information at the receiver and spatial multiplexing at the transmitter with equal power allocation to them dominant modes of the estimated channel, the pilot is designed to ensure an stimate of the channel which improves the forward link capacity. Using perturbation techniques, a lower bound on the forward link capacity is derived with respect to which the training sequence is optimized. Thus, the reverse channel training sequence makes use of the channel knowledge at the receiver. The performance of orthogonal training sequence with MMSE estimation at the transmitter and the proposed training sequence are compared. Simulation results show a significant improvement in performance.

Application of partition method to vibration problems of plates

The “partition method” or “sub-domain method” consists of expressing the solution of a governing differential equation, partial or ordinary, in terms of functions which satisfy the boundary conditions and setting to zero the error in the differential equation integrated over each of the sub-domains into which the given domain is partitioned. In this paper, the use of this method in eigenvalue problems with particular reference to vibration of plates is investigated. The deflection of the plate is expressed in terms of polynomials satisfying the boundary conditions completely. Setting the integrated error in each of the subdomains to zero results in a set of simultaneous, linear, homogeneous, algebraic equations in the undetermined coefficients of the deflection series. The algebraic eigenvalue problem is then solved for eigenvalues and eigenvectors. Convergence is examined in a few typical cases and is found to be satisfactory. The results obtained are compared with existing results based on other methods and are found to be in very good agreement.

The transient response of certain third-ordernon-linear systems

In this paper a method of solving certain third-order non-linear systems by using themethod of ultraspherical polynomial approximation is proposed. By using the method of variation of parameters the third-order equation is reduced to three partial differential equations. Instead of being averaged over a cycle, the non-linear functions are expanded in ultraspherical polynomials and with only the constant term retained, the equations are solved. The results of the procedure are compared with the numerical solutions obtained on a digital computer. A degenerate third-order system is also considered and results obtained for the above system are compared with numerical results obtained on the digital computer. There is good agreement between the results obtained by the proposed method and the numerical solution obtained on digital computer.

Microprocessor-based polynomial generator

A new method of generating polynomials using microprocessors is proposed. The polynomial is generated as a 16-bit digital word. The algorithm for generating a variety of basic 'building block' functions and its implementation is discussed. A technique for generating a generalized polynomial based on the proposed algorithm is indicated. The performance of the proposed generator is evaluated using a commercially available microprocessor kit.