Browsing by Subject "Efficient computation"

Now showing 1 - 3 of 3

Open Access
An efficient computation model for coarse grained reconfigurable architectures and its applications to a reconfigurable computer
(IEEE, 2010-07) Atak, Oğuzhan; Atalar, Abdullah
The mapping of high level applications onto the coarse grained reconfigurable architectures (CGRA) are usually performed manually by using graphical tools or when automatic compilation is used, some restrictions are imposed to the high level code. Since high level applications do not contain parallelism explicitly, mapping the application directly to CGRA is very difficult. In this paper, we present a middle level Language for Reconfigurable Computing (LRC). LRC is similar to assembly languages of microprocessors, with the difference that parallelism can be coded in LRC. LRC is an efficient language for describing control data flow graphs. Several applications such as FIR, multirate, multichannel filtering, FFT, 2D-IDCT, Viterbi decoding, UMTS and CCSDC turbo decoding, Wimax LDPC decoding are coded in LRC and mapped to the Bilkent Reconfigurable Computer with a performance (in terms of cycle count) close to that of ASIC implementations. The applicability of the computation model to a CGRA having low cost interconnection network has been validated by using placement and routing algorithms. © 2010 IEEE.
Open Access
Fundamental structure of Fresnel diffraction: natural sampling grid and the fractional Fourier transform
(Optical Society of America, 2011-06-29) Özaktaş, Haldun M.; Arik, S. O.; Coskun, T.
Fresnel integrals corresponding to different distances can be interpreted as scaled fractional Fourier transformations observed on spherical reference surfaces. We show that by judiciously choosing sample points on these curved reference surfaces, it is possible to represent the diffracted signals in a nonredundant manner. The change in sample spacing with distance reflects the structure of Fresnel diffraction. This sampling grid also provides a simple and robust basis for accurate and efficient computation, which naturally handles the challenges of sampling chirplike kernels.
Open Access
Scalable linkage across location enhanced services
(CEUR-WS, 2017-08) Basık, Fuat
In this work, we investigate methods for merging spatio-temporal usage and entity records across two location-enhanced services, even when the datasets are semantically different. To address both effectiveness and efficiency, we study this linkage problem in two parts: model and framework. First we discuss models, including κ-l diversity- a concept we developed to capture both spatial and temporal diversity aspects of the linkage, and probabilistic linkage. Second, we aim to develop a framework that brings efficient computation and parallelization support for both models of linkage.