Signal processingalgorithms and architectures can use dynamic reconfiguration to exploit variations in signal statistics with the objectives of improved performance and reduced power consumption. Parameters provide a...
详细信息
ISBN:
(纸本)0780370414
Signal processingalgorithms and architectures can use dynamic reconfiguration to exploit variations in signal statistics with the objectives of improved performance and reduced power consumption. Parameters provide a simple and formal way to characterize incremental changes to a computation and its computing mechanism. This paper examines five parameterized computations which are typically implemented in hardware for a wireless multimedia terminal: 1) motion estimation, 2) discrete cosine transform, 3) Lempel-Ziv lossless compression, 4) 3D graphics light rendering and 5) Viterbi decoding, Each computation is examined for the capability of dynamically adapting the algorithm and architecture parameters to variations in their respective input signals. Dynamically reconfigurable low-power implementations of each computation are currently underway.
The choice of an appropriate architecture for parallel imageprocessing can have a large impact on the efficiency and the ease of implementation of vision algorithms. A shared-memory MIMD architecture may be effective...
详细信息
ISBN:
(纸本)0818606622
The choice of an appropriate architecture for parallel imageprocessing can have a large impact on the efficiency and the ease of implementation of vision algorithms. A shared-memory MIMD architecture may be effective for higher-level algorithms that require nonlocal communication between image elements. In such a machine, processor allocation and synchronization are key issues. Techniques are presented for allocation and synchronization of processors in the New York University Ultracomputer, using the fetch-and-add primitive. This scheme is applied to implement a parallel connected-component algorithm. It is concluded that the method allows a high degree of parallelism with relative ease of programming.
image and video compression plays a major role in multimedia transmission. Specifically the discrete cosine transform (DCT) is the key tool employed in a vast variety of compression standards such as H.265/HEVC due to...
详细信息
ISBN:
(纸本)9781628410266
image and video compression plays a major role in multimedia transmission. Specifically the discrete cosine transform (DCT) is the key tool employed in a vast variety of compression standards such as H.265/HEVC due to its remarkable energy compaction properties. Rapid growth in digital imaging applications, such as multimedia and automatic surveillance that operates with limited bandwidths has led to extensive development of video processing systems. The main objective of this paper is to discuss some DCT approximations equipped with fast algorithms which require minimum addition operations and zero multipliers or bit-shifting operations leading to significant reductions in chip area and power consumption compared to conventional DCT algorithms. We provide complete design details for several k x k, k = 8, 16 blocked 2-D algorithms for DCT computation with video evaluation using HEVC software encoder. Custom digitalarchitectures are proposed, simulated and implemented on Xilinx FPGAs and verified in conjunction with software models.
The proceedings contain 35 papers. The topics discussed include: error resilience in nano-electronic digital circuits and systems;thermal camera cores - present and future;application of evolutionary algorithm to sign...
ISBN:
(纸本)9788362065233
The proceedings contain 35 papers. The topics discussed include: error resilience in nano-electronic digital circuits and systems;thermal camera cores - present and future;application of evolutionary algorithm to signal analysis in frequency domain;implementation of a fixed-point 2D Gaussian filter for imageprocessing based on FPGA;a centerline-based algorithm for estimation of blood vessels radii from 3D raster images;the renal vessel segmentation for facilitation of partial nephrectomy;robustness analysis of automatic speech signal recognition system against factors degrading speech signal;voice pathologies identification - speech signals, features and classifiers evaluation;simple object coordination tracking based on background modeling;complexity reduced turbo differential decoding based on layered LDPC decoding;a hybrid relaying protocol for wireless cooperative networks based on the log-likelihood ratio;and application of auto calibration and linearization algorithms to improve sound quality of computer devices.
Residue number system (RNS) is an alternative method of number representation, it is basically different from weighted number system such as decimal and binary. The RNS is based on modular arithmetic. The RNS system h...
Residue number system (RNS) is an alternative method of number representation, it is basically different from weighted number system such as decimal and binary. The RNS is based on modular arithmetic. The RNS system has attracted many researchers in the last decade. The researchers have been focused on the theory of improving the RNS system and applying the RNS in some application areas, such as digital signal processing, fast fourier transform (FFT), digital filter, and imageprocessing. The RNS system is inherently parallel, modular, and fault isolating. In addition, the main advantage of RNS system is the carry free operation in modular arithmetic operation: addition, subtraction, and multiplication. On the other hand, in non-modular operation such as, magnitude comparison, sign detection, and overflow detection are very slow and time consuming. Therefore, the RNS system is not widely used. Also the implementation of the RNS algorithms require efficient modular adders, and modular multipliers. This dissertation presents algorithms and implementation techniques that improve the RNS non-modular operations. New methods are proposed for sign detection, RNS to Binary and Binary to RNS converters, number comparison, and overflow detection. These methods are based on chinese remainder theorem ii (CRT ii). Also in this dissertation new design architectures for modulo 2n-a adders and modulo 2n-a multipliers are presented, where a = 1 or 2m + 1 and m < n.
作者:
Pachowicz, P.W.Institute for Control
Systems Engineering and Telecommunication Academy of Mining and Metallurgy al.Mickiewicza 30 Cracow30-059 Poland
The idea of a co-processor to process distributed or marked local image data is described, The architecture, format of instruction and time effects for some algorithms are pointed out. Time effects for image processin...
详细信息
This paper presents a novel image encryption algorithm that leverages the chaotic properties of the Chen system, the cryptographic strength of OpenSSL, and the mathematical robustness of the Fibonacci Q-Matrix. The pr...
详细信息
The authors describe efficient ways of computing digital multicolor polygonal masks in general-purpose pipeline processors and then present their applications in typical digital visual inspection tasks. Polygonal colo...
详细信息
ISBN:
(纸本)0818606622
The authors describe efficient ways of computing digital multicolor polygonal masks in general-purpose pipeline processors and then present their applications in typical digital visual inspection tasks. Polygonal color mask computation is based on efficient computation of coordinate-reference gray-level images (ramps) and other simple general-purpose architectural features such as pixel-by-pixel logical operations and lookup tables. These procedures are highly parallel and can be efficiently implemented in pipeline processors. In addition, some parallel hardware can dramatically increase the efficiency of implementation. Applications of these color masks are discussed, namely, position-dependent segmentation and computation of accurate pixel or object position with respect to user-defined zones. The proposed algorithms offer accuracy, efficiency in pipeline processors, and flexibility. They are also attractive for software-based implementation.
The research presented here focuses on the general problem of finding tools and methods to compare and evaluate parallel architectures in this particular field: the computer vision. As there are several different para...
详细信息
ISBN:
(纸本)0819419230
The research presented here focuses on the general problem of finding tools and methods to compare and evaluate parallel architectures in this particular field: the computer vision. As there are several different parallel architectures proposed for machine vision, some means of comparison between them are necessary in order to employ the most suitable architecture for a given application. 'Benchmarks' are the most popular tools for machine speed comparison, but do not give any information on the most convenient hardware structures for implementation of a given vision problem. This paper tries to overcome this weakness by proposing a definition of the concept of a tool for the evaluation of parallel architecture (more general than a benchmark), and provides a characterization of the chosen algorithms. Taken into account different ways to process data, it is necessary to consider two different classes of machines: MISD and (MIMD, SPMD, SIMD) offering different programming models, thus leading to two classes of algorithms. Consequently, two algorithms, one for each class are proposed: 1) the extraction of connected components, and 2) a parallel region growing algorithm with data reorganization. The second algorithm tests the capabilities of the architecture to support the following: i) pyramidal data structures (initial region step), ii) a merge procedure between global and global information (adjacent regions to the growing region), and iii) a parallel merge procedure between local and global information (adjacent points to the growing region).
作者:
Martinex, K.Pearson, D.E.Univ of Essex
Dep of Electrical Engineering Science Colchester Engl Univ of Essex Dep of Electrical Engineering Science Colchester Engl
Consideration is given to the trade-off between algorithmic complexity and processing speed in primitive extraction for low data-rate visual communication. Initial experiments with serially-implemented algorithms on a...
详细信息
ISBN:
(纸本)0903748592
Consideration is given to the trade-off between algorithmic complexity and processing speed in primitive extraction for low data-rate visual communication. Initial experiments with serially-implemented algorithms on an MC68000 processor indicated the need for a high degree of parallelism in order to meet the requirements of real-time, moving-picture data rates. However, insight gained by trials on CLIP4, which typically showed speed gains of 40%, points to window-based architectures implemented using look-up tables.
暂无评论