The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Data conversion operations are important and essential part of floating point units in a processor and typical instructions include conversion between various precisions, integer to floating point and vice versa, floating point to fixed point and vice versa etc. Besides few processors have instructions to round and truncate data, sign injections, move data between co-processors registers and general...
Floating point operations are important and essential part of many scientific and engineering applications. Floating point coprocessor (FPU) performs operations like addition, subtraction, division, square root, multiplication, fused multiply and accumulate and compare. Floating point operations are part of ARM, MIPS, and RISC-V etc. instruction sets. The FPU can be a part of hardware or be implemented...
To satisfy the growing demands on real-time video decoders for high frame resolutions, novel GPU parallel algorithms are proposed herein for fully compliant HEVC de-quantization, inverse transform and intra prediction. The proposed algorithms are designed to fully exploit and leverage the fine grain parallelism within these computationally demanding and highly data dependent modules. Moreover, the...
A 4K and Main-10 HEVC video decoder LSI is fabricated in a 28nm CMOS process. It adopts a block-concealed processor (BcP) to improve the visual quality and a bandwidth-suppressed processor (BsP) is newly designed to reduce 30% and 45% of external data accesses in playback and gaming scenario, respectively. It features fully core scalable (FCS) architecture which lowers the required working frequency...
The partial-inverse approach is further developed to decoding interleaved Reed-Solomon codes and subfield-evaluation codes beyond half the minimum distance. The resulting decoding algorithm is new, and its decoding capability is shown to be state-of-the-art.
Stabilizer codes are a fundamental class of error-correcting codes for quantum information that allow for syndrome decoding in the quantum domain. One of the substantial challenges in quantum error correction is that the quantum gates that perform error correction themselves are faulty in practice, which makes fault-tolerant implementation a vital component. Recently, a coding theoretic technique...
Arikan introduced polar codes in 2009 and proved that they achieve the symmetric capacity, under low-complexity successive cancellation decoding, of any binary-input discrete memoryless channel. Arikan's construction is based on the Kronecker product of 2-by-2 matrices and it was extended to larger matrices by Şaşoğlu et al. in 2010. In this paper, we construct cyclic polar codes based on a mixed-radix...
In this paper, we provide an efficient way to predict iterative belief propagation (BP) decoding thresholds of randomly punctured low-density parity-check (LDPC) code ensembles on the binary-input additive white Gaussian noise channel (AWGNC), given only the BP threshold of the mother code ensemble on the binary erasure channel (BEC) and the code design rate. We show that the predictions are accurate...
The performance of the original successive cancellation decoder of short-length polar codes is inferior to that of the maximum-likelihood decoder. Existing sphere decoding algorithms of polar codes have a high computational complexity even for short lengths. This is because, when exploring the tree defined by the generator matrix of the code, existing algorithms employ loose branching conditions and...
It is well known that cooperation between users in a communication network can lead to significant performance gains relative to the same network without cooperation. One common model which has been studied recently is the two users degraded broadcast channel (BC) with cooperating decoders. It can be viewed as a special case of the relay-broadcast channel (RBC), where the link from the relay to the...
We here provide a method for systematic encoding of the Multiplicity codes introduced by Kopparty, Saraf and Yekhanin in 2011. The construction is built on an idea of Kopparty. We properly define information sets for these codes and give detailed proofs of the validity of Kopparty's construction, that use generating functions. We also give a complexity estimate of the associated encoding algorithm.
The objective of low-delay codes is to protect communication streams from erasure bursts by minimizing the time between the packet erasure and its reconstruction. Previous work has concentrated on the constant-delay scenario, where all erased packets need to exhibit the same decoding delay. We consider the case of heterogeneous delay, where the objective is to minimize the average delay across the...
Quantum codes excel at correcting local noise but fail to correct leakage faults that excite qubits to states outside the computational space. Aliferis and Terhal have shown that an accuracy threshold exists for leakage faults using gadgets called leakage reduction units (LRUs). However, these gadgets reduce the threshold and increase experimental complexity, and the costs have not been thoroughly...
Han-Kobayashi achievable region forms the best known inner bound for a general discrete memoryless interference channel. We show that the capacity region can be strictly larger than the Han-Kobayashi region for some channel realizations, and hence the strict sub-optimality of Han-Kobayashi achievable region.
A packing lemma is proved using a setting where the channel is a binary-input discrete memoryless channel (X,w(y|x),Y ), the code is selected at random subject to parity-check constraints, and the decoder is a joint typicality decoder. The ensemble is characterized by (i) a pair of fixed parameters (H,q) where H is a parity-check matrix and q is a channel input distribution and (ii) a random parameter...
This paper proposes a new efficient bypass coding scheme (EBCS) based on Logarithmic Binary Arithmetic Coding (LBAC). The bypass coding model is used to encode a symbol which has equal probability (0.5). The percentage of the bypass coding model is about 25 in CABAC of H.265/HEVC. The proposed EBCS provides a hardware-efficient design that can significantly increase the processing speed, and it has...
Entropy coding is an integral part of most data compression systems. Huffman coding (HC) and arithmetic coding (AC) are two of the most widely used coding methods. HC can process a large symbol alphabet at each step allowing for fast encoding and decoding. However, HC typically provides suboptimal data rates due to its inherent approximation of symbol probabilities to powers of 1 over 2. In contrast,...
Wireless Sensor Networks (WSNs) are increasingly deployed in office blocks, residential areas and also industrial locations, thanks to advantages in terms of flexibility and scalability. Nowadays available wireless fieldbuses are widely adopted for process monitoring and offer performance comparable with the wired counterparts, despite they still are more sensitive to interference from external sources...
As the state-of-the-art video coding standard, High Efficiency Video Coding (HEVC) has been finalized in January 2013. To support the coding of multiple views and associated depth data, the development of the HEVC extension for 3D video coding is also about to be finalized. New coding unit (CU) level coding tools are added to the HEVC design to improve the compression capabilities for both video views...
The latest High Efficiency Video Coding (HEVC) achieves significant compression performance improvement over Advanced Video Coding (AVC). The high compression efficiency of HEVC together with the wide availabilities of H.264/AVC decoders necessitates transcoding between these two technologies. In this paper, we propose a novel algorithm for software-based HEVC to H.264/AVC transcoding. By utilizing...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.