Hierarchical Parallel Evaluation of a Hamming Code
نویسندگان
چکیده
منابع مشابه
Hierarchical Parallel Evaluation of a Hamming Code
The Hamming code is a well-known error correction code and can correct a single error in an input vector of size n bits by adding log n parity checks. A new parallel implementation of the code is presented, using a hierarchical structure of n processors in log n layers. All the processors perform similar simple tasks, and need only a few bytes of internal memory.
متن کاملPerformance assessment of Hamming Code
Hamming codes can detect up to two simultaneous bit errors, and correct single-bit errors; thus, reliable communication is possible when the Hamming distance between the transmitted and received bit patterns is less than or equal to one. By contrast, the simple parity code cannot correct errors, and can only detect an odd number of errors. We will analyze hamming code with simulations (using Ha...
متن کاملHamming Code for Multiple Sources
We consider Slepian-Wolf (SW) coding of multiple sources and extend the packing bound and the notion of perfect code from conventional channel coding to SW coding with more than two sources. We then introduce Hamming Codes for Multiple Sources (HCMSs) as a potential solution of perfect SW coding for arbitrary number of terminals. Moreover, we study the case with three sources in detail. We pres...
متن کاملA parallel adaptive P3M code with hierarchical particle reordering
We discuss the design and implementation of HYDRA OMP a parallel implementation of the Smoothed Particle Hydrodynamics–Adaptive PM (SPH-APM) code HYDRA. The code is designed primarily for conducting cosmological hydrodynamic simulations and is written in Fortran77+OpenMP. A number of optimizations for RISC processors and SMP-NUMA architectures have been implemented, the most important optimizat...
متن کاملParallel Hierarchical Evaluation of Tranitive Closure Queries
This paper presents a new approach to parallel computation of transitive closure queries using a semantic data fragmentation. We assume that tuples of a large base relation denote edges in a graph, which models a transportation network; we propose a fragmentation algorithm which produces the partitioning of the base relation into several fragments such that any fragment corresponds to a subgrap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2017
ISSN: 1999-4893
DOI: 10.3390/a10020050