Parallel sorting networks are widely employed in hardware implementations for sorting due
to their high data parallelism and low control overhead. In this paper, we propose an energy …

High-throughput and low-latency sorting is a key requirement in many applications that deal
with large amounts of data. This paper presents efficient techniques for designing high …

Sorting data is needed in many application domains. Traditionally, the data is read from
memory and sent to a general-purpose processor or application-specific hardware for …

Scalar fields arise in every scientific application. Existing scalar visualization techniques
require that the user infers the global scalar structure from what is frequently an insufficient …

Accelerating sorting using dedicated hardware to fully utilize the memory bandwidth for Big
Data applications has gained much interest in the research community. Recently, parallel …

Recently accelerating sorting using FPGA has been of growing interest in both industry and
academia. However, the supported size of data set is usually small for FPGA-only sorting …

In this paper, a robust channel estimator for high-mobility space-time block code-orthogonal
frequency division multiplexing (STBC-OFDM) systems is proposed and applied in IEEE …

This article proposes a novel comparison-free hardware sorting engine that sorts unique-bit
elements (irrespective of signed and unsigned) consuming linear sorting latency of clock …

Sorting networks of fixed I/O size p have been used, thus far, for sorting a set of p elements.
Somewhat surprisingly, the important problem of using such a sorting network for sorting …

This paper proposes a novel compare free hardware sorting engine that sorts N numerous
data elements in approximately N clock cycles and detects the largest element in the 1st …