Compositional technique for synthesising multi-phase regular arrays

We describe a high-level design method to synthesize multi-phase regular arrays. The method is based on deriving component designs using classical regular (or systolic) array synthesis techniques and composing these separately evolved component design into a unified global design. Similarity transformations ar e applied to component designs in the composition stage in order to align data ow between the phases of the computations. Three transformations are considered: rotation, re ection and translation. The technique is aimed at the design of hardware components for high-throughput embedded systems applications and we demonstrate this by deriving a multi-phase regular array for the 2-D DCT algorithm which is widely used in many vide ocommunications applications.

Space partitioning for scalable K-means

K-Means is a popular clustering algorithm which adopts an iterative refinement procedure to determine data partitions and to compute their associated centres of mass, called centroids. The straightforward implementation of the algorithm is often referred to as `brute force' since it computes a proximity measure from each data point to each centroid at every iteration of the K-Means process. Efficient implementations of the K-Means algorithm have been predominantly based on multi-dimensional binary search trees (KD-Trees). A combination of an efficient data structure and geometrical constraints allow to reduce the number of distance computations required at each iteration. In this work we present a general space partitioning approach for improving the efficiency and the scalability of the K-Means algorithm. We propose to adopt approximate hierarchical clustering methods to generate binary space partitioning trees in contrast to KD-Trees. In the experimental analysis, we have tested the performance of the proposed Binary Space Partitioning K-Means (BSP-KM) when a divisive clustering algorithm is used. We have carried out extensive experimental tests to compare the proposed approach to the one based on KD-Trees (KD-KM) in a wide range of the parameters space. BSP-KM is more scalable than KDKM, while keeping the deterministic nature of the `brute force' algorithm. In particular, the proposed space partitioning approach has shown to overcome the well-known limitation of KD-Trees in high-dimensional spaces and can also be adopted to improve the efficiency of other algorithms in which KD-Trees have been used.

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.