Posts
Feb, 20
Implementation of LTE Mini receiver on GPUs
Long Term Evolution (LTE) is the latest standard for cellular mobile communication. To fully exploit the available spectrum, LTE utilizes feedback. Since the radio channel is varying in time, the feedback calculation is latency sensitive. In our upcoming LTE measurement with the Vienna Multiple Input Multiple Output (MIMO) Testbed, a low latency feedback calculation is […]
Feb, 20
Model-Driven Tile Size Selection for DOACROSS Loops on GPUs
DOALL loops are tiled to exploit DOALL parallelism and data locality on GPUs. In contrast, due to loop-carried dependences, DOACROSS loops must be skewed first in order to make tiling legal and exploit wavefront parallelism across the tiles and within a tile. Thus, tile size selection, which is performance-critical, becomes more complex for DOACROSS loops […]
Feb, 20
A Code Optimization Framework for Performance Portability of GPU Kernels onto Custom Accelerators
The shift toward parallel computing has resulted into a growing interest in computing systems with heterogeneous processing modules. Reconfigurable devices are often employed in such heterogeneous systems due to their low power and parallel processing benefits. An important issue in the programmability of these systems is the need for a single programming interface. Recent works […]
Feb, 20
Introducing ‘Bones’: A Parallelizing Source-to-Source Compiler Based on Algorithmic Skeletons
Recent advances in multi-core and many-core processors requires programmers to exploit an increasing amount of parallelism from their applications. Data parallel languages such as CUDA and OpenCL make it possible to take advantage of such processors, but still require a large amount of effort from programmers. A number of parallelizing source-to-source compilers have recently been […]
Feb, 20
Review: Kd-tree Traversal Algorithms for Ray Tracing
In this paper we review the traversal algorithms for kd-trees for ray tracing. Ordinary traversal algorithms such as sequential, recursive, and those with neighbour-links have different limitations, which led to several new developments within the last decade. We describe algorithms exploiting ray coherence and algorithms designed with specific hardware architecture limitations such as memory latency […]
Feb, 18
GPU Parallel Statistical and Cube Test Analysis of the SHA-3 Finalist Candidate Hash Functions
The 256-bit versions of the SHA-3 finalist candidate hash functions – BLAKE, Grostl, JH, Keccak, and Skein – were subjected to statistical tests to attempt to disprove the hypothesis that the output bits are uniformly distributed, independent, binary random variables. The hash functions were also subjected to cube tests to attempt to disprove the hypothesis […]
Feb, 18
Exploiting Segmentation for Robust 3D Object Matching
While Iterative Closest Point (ICP) algorithms have been successful at aligning 3D point clouds, they do not take into account constraints arising from sensor viewpoints. More recent beam-based models take into account sensor noise and viewpoint, but problems still remain. In particular, good optimization strategies are still lacking for the beam-based model. In situations of […]
Feb, 18
Performance Portability with the Chapel Language
It has been widely shown that high-throughput computing architectures such as GPUs offer large performance gains compared with their traditional low-latency counterparts for many applications. The downside to these architectures is that the current programming models present numerous challenges to the programmer: lower-level languages, loss of portability across different architectures, explicit data movement, and challenges […]
Feb, 18
Cone-beam Computed tomography image reconstruction based on GPU
As so long, three-dimensional cone-beam computed tomography(CBCT) image reconstruction is a hot issue in medical imaging field. Often the computation operation of CBCT reconstruction is huge and the reconstruction time is long. Now with the development of computer technology, especially the rapid development of Graphics Processing Unit (GPU) based general-purpose computing technology enables fast CBCT […]
Feb, 17
Bayesian Image Restoration Using A Large-scale Total Patch Variation Prior
Edge-preserving Bayesian restorations using nonquadratic priors are often inefficient in restoring continuous variations and tend to produce block artifacts around edges in ill-posed inverse image restorations. To overcome this, we have proposed a spatial adaptive (SA) prior with improved performance. However, this SA prior restoration suffers from high computational cost and the unguaranteed convergence problem. […]
Feb, 17
Proposition for propagated occupation grids for non-rigid moving objects tracking
Autonomous navigation among humans is, however simple it might seems, a difficult subject which draws a lot a attention in our days of increasingly autonomous systems. From a typical scene from a human environment, diverse shapes, behaviours, speeds or colours can be gathered by a lot of sensors and a generic mean to perceive space […]
Feb, 17
Joint-MAP Tomographic Reconstruction with Patch Similarity Based Mixture Prior Model
Tomographic reconstruction from noisy projections do not yield adequate results. Mathematically, this tomographic reconstruction represents an ill-posed problem due to information missing caused by the presence of noise. Maximum a posteriori (MAP) or Bayesian reconstruction methods offer possibilities to improve the image quality as compared with analytical methods in particular by introducing a prior to […]