On Galois-Division Multiple Access Systems: Figures of Merit and Performance Evaluation

A new approach to multiple access based on finite field transforms is investigated. These schemes, termed Galois-Division Multiple Access (GDMA), offer compact bandwidth requirements. A new digital transform, the Finite Field Hartley Transform (FFHT) requires to deal with fields of characteristic p, p \neq 2. A binary-to-p-ary (p \neq 2) mapping based on the opportunistic secondary channel is introduced. This allows the use of GDMA in conjunction with available digital systems. The performance of GDMA is also evaluated.Comment: 6 pages, 4 figures. In: XIX Simposio Brasileiro de Telecomunicacoes, 2001, Fortaleza, CE, Brazi

Fast algorithm for the 3-D DCT-II

Recently, many applications for three-dimensional (3-D) image and video compression have been proposed using 3-D discrete cosine transforms (3-D DCTs). Among different types of DCTs, the type-II DCT (DCT-II) is the most used. In order to use the 3-D DCTs in practical applications, fast 3-D algorithms are essential. Therefore, in this paper, the 3-D vector-radix decimation-in-frequency (3-D VR DIF) algorithm that calculates the 3-D DCT-II directly is introduced. The mathematical analysis and the implementation of the developed algorithm are presented, showing that this algorithm possesses a regular structure, can be implemented in-place for efficient use of memory, and is faster than the conventional row-column-frame (RCF) approach. Furthermore, an application of 3-D video compression-based 3-D DCT-II is implemented using the 3-D new algorithm. This has led to a substantial speed improvement for 3-D DCT-II-based compression systems and proved the validity of the developed algorithm

A DHT-Based Multicarrier Modulation System with Pairwise ML Detection

This paper presents a complex-valued discrete multicarrier modulation (MCM) system based on the real-valued discrete Hartley transform (DHT) and its inverse (IDHT). Unlike the conventional discrete Fourier transform (DFT), the DHT cannot diagonalize multipath fading channels due to its inherent properties, and this results in mutual interference between subcarriers of the same mirror-symmetrical pair. We explore this interference pattern in order to seek an optimal solution to utilize channel diversity for enhancing the bit error rate (BER) performance of the system. It is shown that the optimal channel diversity gain can be achieved via pairwise maximum likelihood (ML) detection, taking into account not only the subcarrier's own channel quality but also the channel state information of its mirror-symmetrical peer. Performance analysis indicates that DHT-based MCM can mitigate fast fading effects by averaging channel power gains of each mirror-symmetrical pair of subcarriers. Simulation results show that the proposed scheme has a substantial improvement in BER over the conventional DFT-based MCM system

Receiver architecture of the thousand-element array (THEA)

As part of the development of a new international radio-telescope SKA (Square Kilometre Array), an outdoor phasedarray prototype, the THousand Element Array (THEA), is being developed at NFRA. THEA is a phased array with 1024 active elements distributed on a regular grid over a surface of approximately 16 m2. The array is organised into 16 units denoted as tiles. THEA operates in the frequency band from 750 to 1500 MHz.\ud On a tile the signals from 64 antenna elements are converted into two independent RF beams. Two times 16 beams can be made simultaneously with full sensitivity by the real-time digital beam former of the THEA system. At the output of each tile the analog RF signal from a beam is converted into a 2 × 12-bit digital quadrature representation by a receiver system.\ud A double super-heterodyne architecture is used to mix the signal band of interest to an intermediate frequency of 210 MHz. The IF-signal is shifted to baseband by means of a partly digitally implemented I/Q mixer scheme. After a quadrature mixer stage, the I and Q signals are digitised by means of 12 bit A/D converters at 40 MS/s. Implementing a part of the mixing scheme digitally offers the flexibility to use different I/Q architectures, e.g. Hartley and Weaver mixer setups. This way the effect of RFI in different mixing architectures can be analyzed. After the digital processing, the samples are multiplexed, serialised and transported over fibres to the central adaptive digital beam former unit where the signals from all tiles are combined giving 32 beams.\ud This paper focuses on the design choices and the final implementation of the THEA system. In particular, the receiver architecture is addressed. A digital solution is presented, which enables switching between a Hartley and a Weaver based mixer scheme

Efficient Irregular Wavefront Propagation Algorithms on Hybrid CPU-GPU Machines

In this paper, we address the problem of efficient execution of a computation pattern, referred to here as the irregular wavefront propagation pattern (IWPP), on hybrid systems with multiple CPUs and GPUs. The IWPP is common in several image processing operations. In the IWPP, data elements in the wavefront propagate waves to their neighboring elements on a grid if a propagation condition is satisfied. Elements receiving the propagated waves become part of the wavefront. This pattern results in irregular data accesses and computations. We develop and evaluate strategies for efficient computation and propagation of wavefronts using a multi-level queue structure. This queue structure improves the utilization of fast memories in a GPU and reduces synchronization overheads. We also develop a tile-based parallelization strategy to support execution on multiple CPUs and GPUs. We evaluate our approaches on a state-of-the-art GPU accelerated machine (equipped with 3 GPUs and 2 multicore CPUs) using the IWPP implementations of two widely used image processing operations: morphological reconstruction and euclidean distance transform. Our results show significant performance improvements on GPUs. The use of multiple CPUs and GPUs cooperatively attains speedups of 50x and 85x with respect to single core CPU executions for morphological reconstruction and euclidean distance transform, respectively.Comment: 37 pages, 16 figure