Tools for regularizing Array Designs

This paper makes a contribution in bridging the theory and practice of the polyhedral model for designing parallel algorithms. Although the theory of polyhedral model is well developed, designers of massively parallel algorithms are unable to benefit from the theory due to the lack of software tools that incorporate the wide range of transformations that are possible in the model. The Uniformization tool that we developed was the first to integrate a number of techniques and to completely automate the transformation step allowing designers to explore a wide range of feasible designs from high-level specifications.

Towards self-ware via swarm-array computing

The work reported in this paper proposes Swarm-Array computing, a novel technique inspired by swarm robotics, and built on the foundations of autonomic and parallel computing. The approach aims to apply autonomic computing constructs to parallel computing systems and in effect achieve the self-ware objectives that describe self-managing systems. The constitution of swarm-array computing comprising four constituents, namely the computing system, the problem/task, the swarm and the landscape is considered. Approaches that bind these constituents together are proposed. Space applications employing FPGAs are identified as a potential area for applying swarm-array computing for building reliable systems. The feasibility of a proposed approach is validated on the SeSAm multi-agent simulator and landscapes are generated using the MATLAB toolkit.

Achieving intelligent agents and its feasibility in swarm-array computing

The work reported in this paper proposes ‘Intelligent Agents’, a Swarm-Array computing approach focused to apply autonomic computing concepts to parallel computing systems and build reliable systems for space applications. Swarm-array computing is a robotics a swarm robotics inspired novel computing approach considered as a path to achieve autonomy in parallel computing systems. In the intelligent agent approach, a task to be executed on parallel computing cores is considered as a swarm of autonomous agents. A task is carried to a computing core by carrier agents and can be seamlessly transferred between cores in the event of a predicted failure, thereby achieving self-* objectives of autonomic computing. The approach is validated on a multi-agent simulator.

Uniformization tool for systolic array designs

The paper is concerned with the uniformization of a system of affine recurrence equations. This transformation is used in the design (or compilation) of highly parallel embedded systems (VLSI systolic arrays, signal processing filters, etc.). We present and implement an automatic system to achieve uniformization of systems of affine recurrence equations. We unify the results from many earlier papers, develop some theoretical extensions, and then propose effective uniformization algorithms. Our results can be used in any high level synthesis tool based on polyhedral representation of nested loop computations.

A square-planar nickel(II) monoradical complex with a bis(salicylidene)diamine ligand

The new square-planar Ni-II-N2O2 complex [Ni(L-Me)] (1(Me)), where L-Me, stands for the dianionic phenolato form of N,N'bis(3,5-di-tert-butyl-salicylidene)-4,5-dimethyl-1,2-phenyl- enediamine ((LH2)-L-Me), has been synthesised and fully characterised. X-ray crystallography was also used for the characterisation. The electrochemical one-electron oxidation of 1(Me) produces the thermally stable (within the temperature range 10-295 K) cationic species (1(Me))(+). The UV/Vis and X-band EPR experimental data, supported by DFT calculations, indicate that (1(Me))(+), is best described as a Ni-II monoradical complex and, thus, does NOT exist in a Ni-III ground state, in contrast to its demethylated counterpart [Ni(L-H)](+) (1(H))(+) below 170 K.

Strongly nucleophilic RhI centre in square-planar complexes with terdentate (κ3) 2,2′:6′,2′′-terpyridine ligands: crystallographic, electrochemical and density functional theoretical studies

Rh-I-terpyridine complexes have been unambiguously formed for the first time. The 2,21:6',2"-terpyridine (tpy), 4'-chloro-2,2':6',2"-terpyridine (4'-Cl-tpy) and 4'-(tert-butyldimethylsilyl-ortho-carboranyl)-2,2':6',2"-terpyridine (carboranyl-tpy) ligands were used for successful syntheses and characterisation of the corresponding Rh-I complexes with halide coligands, [Rh(X)(4'-Y-terpyridine)] (X = Cl, Y = H, Cl, carboranyl; X = Br, Y = H). All four neutral Rh-tpy complexes are square planar, with Rh-X bonds in the plane of the 4'-Y-terpyridine ligands. Full characterisation of these dark blue, highly air-sensitive compounds was hampered by their poor solubility in various organic solvents. This is mainly due to the formation of pi-stacked aggregates, as evidenced by the crystal structure of [Rh(Cl)(tpy)]; in addition, [Rh(Cl)(carboranyl-tpy)] merely forms discrete dimers. The (bonding) properties of the novel Rh-I-terpyridine complexes have been studied with single-crystal X-ray diffraction, (time-dependent) density functional theoretical (DFT) calculations, far-infrared spectroscopy, electronic absorption spectroscopy and cyclic voltammetry. From DFT calculations, the HOMO of the studied Rh-I-terpyridine complexes involves predominantly the metal centre, while the LUMO resides on the terpyridine ligand. Absorption bands of the studied complexes in the visible region (400-900 nm) can be assigned to MLCT and MLCT/XLCT transitions. The relatively low oxidation potentials of [Rh(X)(tpy)] (X = Cl, Br) point to a high electron density on the metal centre. This makes the Rh-I-terpyridine complexes strongly nucleophilic and (potentially) highly reactive towards various (small) substrate molecules containing carbon-halide bonds.

Exploring carrier agents in swarm-array computing

How can a bridge be built between autonomic computing approaches and parallel computing systems? The work reported in this paper is motivated towards bridging this gap by proposing a swarm-array computing approach based on ‘Intelligent Agents’ to achieve autonomy for distributed parallel computing systems. In the proposed approach, a task to be executed on parallel computing cores is carried onto a computing core by carrier agents that can seamlessly transfer between processing cores in the event of a predicted failure. The cognitive capabilities of the carrier agents on a parallel processing core serves in achieving the self-ware objectives of autonomic computing, hence applying autonomic computing concepts for the benefit of parallel computing systems. The feasibility of the proposed approach is validated by simulation studies using a multi-agent simulator on an FPGA (Field-Programmable Gate Array) and experimental studies using MPI (Message Passing Interface) on a computer cluster. Preliminary results confirm that applying autonomic computing principles to parallel computing systems is beneficial.

A cluster-based implementation of a fault-tolerant parallel reduction algorithm using swarm-array computing

Recent research in multi-agent systems incorporate fault tolerance concepts. However, the research does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely ‘Intelligent Agents’. In the approach considered a task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The agents hence contribute towards fault tolerance and towards building reliable systems. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

Infrared filters for space-flight focal plane array applications

Infrared filters and coatings have been employed on many sensing radiometer instruments to measure the thermal emission profiles and concentrations of certian chemical constituents found in planetary atmospheres. The High Resolution Dynamics Limb Sounder ( HIRDLS) is an example of the most recent developments in limb-viewing radiometry by employing a cooled focal plane detector array to provide simultaneous multi-channel monitoring of emission from gas and aerosols over an altitude range between 8 - 70 km. The use of spectrally selective cooled detectors in focal plane arrays has simplified the optical layout of radiometers, greatly reducing the number of components in the optical train. this has inevitably led to increased demands for the enviromnetal durability of the focal plane filters because of the need to cut sub-millimeter sizes, whilst maintaining an optimal spectral performance. Additionally the remaining refractive optical elements require antireflection coatings which must cover the entire spectral range of the focal plane array channels, in this case 6 to 18µm, with a minimum of reflection and absorption. This paper describes the optical layout and spectral design requirements for filteriong in the HIRDLS instrument, and reports progress on the manufacturing and testing of the sub-millimetre sized cooled filters. We also report on the spectral and environmental performance of prototype wideband antireflection coatings which satisfy the requirements above.

High-performance infrared filters for the HIRDLS 21-channel focal plane detector array

The High Resolution Dynamics Limb Sounder is described, with particular reference to the atmospheric measurements to be made and the rationale behind the measurement strategy. The demands this strategy places on the filters to be used in the instrument and the designs to which this leads to are described. A second set of filters at an intermediate image plane to reduce "Ghost Imaging" is discussed together with their required spectral properties. A method of combining the spectral characteristics of the primary and secondary filters in each channel are combined together with the spectral response of the detectors and other optical elements to obtain the system spectral response weighted appropriately for the Planck function and atmospheric limb absorption. This method is used to demonstrate whether the out-of-band spectral blocking requirement for a channel is being met and an example calculation is demonstrated showing how the blocking is built up for a representative channel. Finally, the techniques used to produce filters of the necessary sub-millimetre sizes together with the testing methods and procedures used to assess the environmental durability and establish space flight quality are discussed.

Detecting the number of signals using antenna array: a single threshold solution

A new approach is presented to identify the number of incoming signals in antenna array processing. The new method exploits the inherent properties existing in the noise eigenvalues of the covariance matrix of the array output. A single threshold has been established concerning information about the signal and noise strength, data length, and array size. When the subspace-based algorithms are adopted the computation cost of the signal number detector can almost be neglected. The performance of the threshold is robust against low SNR and short data length.

Adaptive least mean square CDMA detection with Gram–Schmidt pre-processing

The Gram-Schmidt (GS) orthogonalisation procedure has been used to improve the convergence speed of least mean square (LMS) adaptive code-division multiple-access (CDMA) detectors. However, this algorithm updates two sets of parameters, namely the GS transform coefficients and the tap weights, simultaneously. Because of the additional adaptation noise introduced by the former, it is impossible to achieve the same performance as the ideal orthogonalised LMS filter, unlike the result implied in an earlier paper. The authors provide a lower bound on the minimum achievable mean squared error (MSE) as a function of the forgetting factor λ used in finding the GS transform coefficients, and propose a variable-λ algorithm to balance the conflicting requirements of good tracking and low misadjustment.

Parallel pipelined array architectures for real-time histogram computation in consumer devices

The real-time parallel computation of histograms using an array of pipelined cells is proposed and prototyped in this paper with application to consumer imaging products. The array operates in two modes: histogram computation and histogram reading. The proposed parallel computation method does not use any memory blocks. The resulting histogram bins can be stored into an external memory block in a pipelined fashion for subsequent reading or streaming of the results. The array of cells can be tuned to accommodate the required data path width in a VLSI image processing engine as present in many imaging consumer devices. Synthesis of the architectures presented in this paper in FPGA are shown to compute the real-time histogram of images streamed at over 36 megapixels at 30 frames/s by processing in parallel 1, 2 or 4 pixels per clock cycle.