Parallel circuit partitioning on a reduced array architecture

The physical design of a VLSI circuit involves circuit partitioning as a subtask. Typically, it is necessary to partition a large electrical circuit into several smaller circuits such that the total cross-wiring is minimized. This problem is a variant of the more general graph partitioning problem, and it is known that there does not exist a polynomial time algorithm to obtain an optimal partition. The heuristic procedure proposed by Kernighan and Lin1,2 requires O(n2 log2n) time to obtain a near-optimal two-way partition of a circuit with n modules. In the VLSI context, due to the large problem size involved, this computational requirement is unacceptably high. This paper is concerned with the hardware acceleration of the Kernighan-Lin procedure on an SIMD architecture. The proposed parallel partitioning algorithm requires O(n) processors, and has a time complexity of O(n log2n). In the proposed scheme, the reduced array architecture is employed with due considerations towards cost effectiveness and VLSI realizability of the architecture.The authors are not aware of any earlier attempts to parallelize a circuit partitioning algorithm in general or the Kernighan-Lin algorithm in particular. The use of the reduced array architecture is novel and opens up the possibilities of using this computing structure for several other applications in electronic design automation.

Narrowband Detection of Acoustic Source in Shallow Ocean using Vector Sensor Array

The problem of narrowband CFAR (constant false alarm rate) detection of an acoustic source at an unknown location in a range-independent shallow ocean is considered. If a target is present, the received signal vector at an array of N sensors belongs to an M-dimensional subspace if N exceeds the number of propagating modes M in the ocean. A subspace detection method which utilises the knowledge of the signal subspace to enhance the detector performance is presented in thisMpaper. It is shown that, for a given number of sensors N, the performance of a detector using a vector sensor array is significantly better than that using a scalar sensor array. If a target is detected, the detector using a vector sensor array also provides a concurrent coarse estimate of the bearing of the target.

High-Rate,2-Group ML-Decodable STBCs for 2(m) Transmit Antennas

A Space-Time Block Code (STBC) in K-variables is said to be g-Group ML-Decodable (GMLD) if its Maximum-Likelihood (ML) decoding metric can be written as a sum of g independent terms, with each term being a function of a subset of the K variables. In this paper, a construction method to obtain high-rate, 2-GMLD STBCs for 2(m) transmit antennas, m > 1, is presented. The rate of the STBC obtained for 2(m) transmit antennas is 2(m-2) + 1/2(m), complex symbols per channel use. The design method is illustrated for the case of 4 and 8 transmit antennas. The code obtained for 4 transmit antennas is equivalent to the rate-5/4 Quasi-Orthogonal design (QOD) proposed by Yuen, Guan and Tjung.

Modified linear prediction method for directions of arrival estimation of narrow-band plane waves

A modified linear prediction (MLP) method is proposed in which the reference sensor is optimally located on the extended line of the array. The criterion of optimality is the minimization of the prediction error power, where the prediction error is defined as the difference between the reference sensor and the weighted array outputs. It is shown that the L2-norm of the least-squares array weights attains a minimum value for the optimum spacing of the reference sensor, subject to some soft constraint on signal-to-noise ratio (SNR). How this minimum norm property can be used for finding the optimum spacing of the reference sensor is described. The performance of the MLP method is studied and compared with that of the linear prediction (LP) method using resolution, detection bias, and variance as the performance measures. The study reveals that the MLP method performs much better than the LP technique.

Rapid localization of damage using a circular sensor array and Lamb wave based triangulation

A damage detection and imaging methodology based on symmetry of neighborhood sensor path and similarity of signal patterns with respect to radial paths in a circular array of sensors has been developed It uses information regarding Limb wave propagation along with a triangulation scheme to rapidly locate and quantify the severity of damage without using all of the sensor data. In a plate like structure, such a scheme can be effectively employed besides full field imaging of wave scattering pattern from the damage, if present in the plate. This new scheme is validated experimentally. Hole and corrosion type damages have been detected and quantified using the proposed scheme successfully. A wavelet based cumulative damage index has been studied which shows monotonic sensitivity against the severity of the damage. which is most desired in a Structural Health Monitoring system. (C) 2010 Elsevier Ltd. All rights reserved.

A Cellular Array for Multivalued Logic Functions

An algebraic generalization of the well-known binary q-function array to a multivalued q-function array is presented. It is possible to associate tree-structure realizations for binary q-functions and multivalued q-functions. Synthesis of multivalued functions using this array is very simple

Controlled photoluminescence from self-assembled semiconductor-metal quantum dot hybrid array films

Thin films of hybrid arrays of cadmium selenide quantum dots and polymer grafted gold nanoparticles have been prepared using a BCP template. Controlling the dispersion and location of the respective nanoparticles allows us to tune the exciton-plasmon interaction in such hybrid arrays and hence control their optical properties. The observed photoluminescence of the hybrid array films is interpreted in terms of the dispersion and location of the gold nanoparticles and quantum dots in the block copolymer matrix.

Coplanar Capacitively Coupled Probe Fed Microstrip Antennas for Wideband Applications

The design and analysis of a coplanar capacitive fed microstrip antenna suspended above the ground plane is presented. It is demonstrated that the proposed approach can be used for designing antennas with impedance bandwidth of about 50% and a good gain to operate in various microwave bands. The model of the antenna incorporates the capacitive feed strip which is fed by a coaxial probe using equivalent circuit approach, and matches simulation and experimental results. The capacitive feed strip used here is basically a rectangular microstrip capacitor formed from a truncated microstrip transmission line and all its open ends are represented by terminal or edge capacitances. The error analysis was carried out for validity of the model for different design parameters. The antenna configuration can be used where unidirectional radiation patterns are required over a wide bandwidth.

Experimental investigation of three-layer electromagnetically coupled circular microstrip antennas

The broadband behaviour of a three-layer electromagnetically coupled circular microstrip antenna is investigated experimentally. The effects of interlayer spacings and the thickness of the parasitic layers on the impedance bandwidth, 3 dB beamwidth and pattern shape, are studied. Experiments show that this structure can provide a frequency bandwidth as high as 20% with a low crosspolarisation level and a moderately high gain.

A geodesic constant method for computing high-frequency mutual coupling between antennas on general quadric cylinders

A Geodesic Constant Method (GCM) is outlined which provides a common approach to ray tracing on quadric cylinders in general, and yields all the surface ray-geometric parameters required in the UTD mutual coupling analysis of conformal antenna arrays in the closed form. The approach permits the incorporation of a shaping parameter which permits the modeling of quadric cylindrical surfaces of desired sharpness/flatness with a common set of equations. The mutual admittance between the slots on a general parabolic cylinder is obtained as an illustration of the applicability of the GCM.

Analysis of conjugate laminar mixed convection cooling in a shrouded array of electronic components

The temperature variation in the insulation around an electronic component, mounted on a horizontal circuit board is studied numerically. The flow is assumed to be laminar and fully developed. The effect of mixed convection and two different types of insulation are considered. The mass, momentum and energy conservation equations in the fluid and conduction equation in the insulation are solved using the SIMPLER algorithm. Computations are carried out for liquid Freon and water, for different conductivity ratios, and different Rayleigh numbers. It is demonstrated that the temperature variation within the insulation becomes important when the thermal conductivity of the insulation is less than ten times the thermal conductivity of the cooling medium.

Recent advances in radar technology

The technical developments and advances that have taken place thus far are reviewed in those areas impacting future phased array active aperture radar systems. The areas covered are printed circuit antennas and antenna arrays, GaAs MMIC design and fabrication leading to affordable transmitter-receiver (T-R) modules, and novel hardware and software developments. The use of fiber-optic distribution networks to interconnect the monolithically integrated optical components with the T-R modules is discussed. Beamforming and sidelobe control techniques for active phased array systems are also examined.

An optimal parallel algorithm for sparse matrix bandwidth reduction on a linear array

A simple and efficient algorithm for the bandwidth reduction of sparse symmetric matrices is proposed. It involves column-row permutations and is well-suited to map onto the linear array topology of the SIMD architectures. The efficiency of the algorithm is compared with the other existing algorithms. The interconnectivity and the memory requirement of the linear array are discussed and the complexity of its layout area is derived. The parallel version of the algorithm mapped onto the linear array is then introduced and is explained with the help of an example. The optimality of the parallel algorithm is proved by deriving the time complexities of the algorithm on a single processor and the linear array.