A Method of Optimal Radio Frequency Assignment for Deep Space Missions

A method for determining optimal radio frequency channels for the Deep Space Network is described. Computer automated routines calculate interference-to-signal ratios over a given mission period and provide a quantitative assessment of the channels which could then be assigned to a new mission. This automated procedure reduces the analysis time considerably and effectively improves upon the accuracy of existing channel assignment techniques

A parallel VLSI architecture for a digital filter of arbitrary length using Fermat number transforms

A parallel architecture for computation of the linear convolution of two sequences of arbitrary lengths using the Fermat number transform (FNT) is described. In particular a pipeline structure is designed to compute a 128-point FNT. In this FNT, only additions and bit rotations are required. A standard barrel shifter circuit is modified so that it performs the required bit rotation operation. The overlap-save method is generalized for the FNT to compute a linear convolution of arbitrary length. A parallel architecture is developed to realize this type of overlap-save method using one FNT and several inverse FNTs of 128 points. The generalized overlap save method alleviates the usual dynamic range limitation in FNTs of long transform lengths. Its architecture is regular, simple, and expandable, and therefore naturally suitable for VLSI implementation

A VLSI pipeline design of a fast prime factor DFT on a finite field

A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q sub n). A pipeline structure is used to implement this prime factor DFT over GF(q sub n). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode Reed-Solomon codes. Such a pipeline fast prime factor DFT algorithm over GF(q sub n) is regular, simple, expandable, and naturally suitable for VLSI implementation. An example illustrating the pipeline aspect of a 30-point transform over GF(q sub n) is presented

The Mathematical Foundations of 3D Compton Scatter Emission Imaging

The mathematical principles of tomographic imaging using detected (unscattered) X- or gamma-rays are based on the two-dimensional Radon transform and many of its variants. In this paper, we show that two new generalizations, called conical Radon transforms, are related to three-dimensional imaging processes based on detected Compton scattered radiation. The first class of conical Radon transform has been introduced recently to support imaging principles of collimated detector systems. The second class is new and is closely related to the Compton camera imaging principles and invertible under special conditions. As they are poised to play a major role in future designs of biomedical imaging systems, we present an account of their most important properties which may be relevant for active researchers in the field

VLSI architectures for computing multiplications and inverses in GF(2-m)

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation

A comparison of VLSI architectures for time and transform domain decoding of Reed-Solomon codes

It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to find the error locator polynomial needed to decode a Reed-Solomon (RS) code. It is shown that this algorithm can be used for both time and transform domain decoding by replacing its initial conditions with the Forney syndromes and the erasure locator polynomial. By this means both the errata locator polynomial and the errate evaluator polynomial can be obtained with the Euclidean algorithm. With these ideas, both time and transform domain Reed-Solomon decoders for correcting errors and erasures are simplified and compared. As a consequence, the architectures of Reed-Solomon decoders for correcting both errors and erasures can be made more modular, regular, simple, and naturally suitable for VLSI implementation

A single chip VLSI Reed-Solomon decoder

A new VLSI design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous design is replaced by a time domain algorithm. A new architecture that implements such an algorithm permits efficient pipeline processing with minimum circuitry. A systolic array is also developed to perform erasure corrections in the new design. A modified form of Euclid's algorithm is implemented by a new architecture that maintains the throughput rate with less circuitry. Such improvements result in both enhanced capability and a significant reduction in silicon area, therefore making it possible to build a pipeline (31,15)RS decoder on a single VLSI chip

Particle Acceleration in Advection-Dominated Accretion Disks with Shocks: Green's Function Energy Distribution

The distribution function describing the acceleration of relativistic particles in an advection-dominated accretion disk is analyzed using a transport formalism that includes first-order Fermi acceleration, advection, spatial diffusion, and the escape of particles through the upper and lower surfaces of the disk. When a centrifugally-supported shock is present in the disk, the concentrated particle acceleration occurring in the vicinity of the shock channels a significant fraction of the binding energy of the accreting gas into a population of relativistic particles. These high-energy particles diffuse vertically through the disk and escape, carrying away both energy and entropy and allowing the remaining gas to accrete. The dynamical structure of the disk/shock system is computed self-consistently using a model previously developed by the authors that successfully accounts for the production of the observed relativistic outflows (jets) in M87 and \SgrA. This ensures that the rate at which energy is carried away from the disk by the escaping relativistic particles is equal to the drop in the radial energy flux at the shock location, as required for energy conservation. We investigate the influence of advection, diffusion, and acceleration on the particle distribution by computing the nonthermal Green's function, which displays a relatively flat power-law tail at high energies. We also obtain the energy distribution for the particles escaping from the disk, and we conclude by discussing the spectrum of the observable secondary radiation produced by the escaping particles.Comment: Published in Ap

A path planning control for a vessel dynamic positioning system based on robust adaptive fuzzy strategy

The thrusters and propulsion propellers systems, as well as the operating situations, are all well-known nonlinearities which are caused less accuracy of the dynamic positioning system (DPS) of vessels in the path planning control process. In this study, to enhance the robust performance of the DPS, we proposed a robust adaptive fuzzy control model to reduce the effect of uncertainty problems and disturbances on the DPS. Firstly, the adaptive fuzzy controller with adaptive law is designed to adjust the membership function of the fuzzy controller to minimize the error in path planning control of the vessel. Secondly, the H∞ performance of robust tracking is proved by the Lyapunov theory. Moreover, compared to the other controller, a simulation experiment comprising two case studies confirmed the efficiency of the approach. Finally, the results showed that the proposed controller reaches control quality, performance and stability