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.
In VoIP applications, packet loss, delay and delay jitter are inevitable and have a large impact on the perceived speech quality. Jitter buffers are commonly deployed to compensate for jitter in order to play out the received packets continuously. For mobile devices, due to limited battery power, computational complexity has to be kept to a minimum. In this paper, we propose a jitter buffer management...
An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by multidimensional DFT and linear recurrence relations from Grobner basis and is applied to erasure-and-error decoding and systematic encoding. The computational complexity...
Low Density Parity Check Codes (LDPC) give groundbreaking performance which is known to approach Shannon's limits for sufficiently large block length. Historically and recently, LDPC have been known to give superior performance than concatenated coding. In the following paper, a proposal to modify the standard Min-Sum (MS) algorithm for decoding LDPC codes is presented. This is done by introduction...
In the conventional Space-Time Block Code (STBC) scheme, system can't achieve the full diversity and full rate for more than two transmitting antennas. Thereafter, a Quasi-Orthogonal STBC (QOSTBC) has been provided to improve the diversity and full rate behavior for the STBC with more than two transmitting antennas. However, QOSTBC has the drawback of heavy computational burden for the receiver. This...
In this paper we introduce an integration framework for Control/Communication/Computation (3C) co-design based on the motivating example of fleet control of Autonomous Underwater Vehicles (AUVs) supervised by an Autonomous Surface Vehicle (ASV). Specifically, we address the problem of almost sure stability of an unstable system with multiple observations over the packet erasure channel with emphasize...
LT(Luby transform) encoding is widely used for rateless codes. But uniform choice of messages in the LT encoding process conflicts with the merit of BP(belief propagation) decoding. So more codeword symbols than expected are required for the reliable recovery of message symbols. Thus a new encoding scheme with non-uniform selection of messages that can decrease average overhead and computational complexity...
The computational complexity of H.264 video coding standard is two or three times higher than that of H.263 and MPEG-4. Especially, the operation of the entropy coding is one of the most time-consuming parts in the decoder. According to the characteristics of two-dimensional code table for CAVLC, a fast algorithm was proposed in H.264 decoder implementation, which enable different strategies to be...
In this paper, we propose a decoding algorithm for LDPC codes that achieves the MAP solution over the BEC. This algorithm, denoted as generalized tree-structured expectation propagation (GTEP), extends the idea of our previous work, the TEP decoder. The GTEP modifies the graph by eliminating a check node of any degree and merging this information with the remaining graph. The GTEP decoder upon completion...
Single-carrier frequency domain equalization (SC-FDE) has been standardized as an alternative of orthogonal frequency division multiplexing (OFDM) in IEEE 802.11ad and 802.15.3c. In addition, with the use of low density parity-check (LDPC) codes, multi-Giga bits transmission can be supported in 60-GHz millimeter-wave (mmW) WLAN/WPAN with desired decoding complexity. In this paper, we present and evaluate...
This paper is focused on the optimization of the computational efficiency of a multi-stream word recognition system. The aim of this work is to optimize the multi-stream decoding step in order to reduce the recognition time and the complexity to allow combining a large number of streams. Two different multi-stream decoding strategies are compared based on two-level and HMM-recombination algorithms...
In this work, we propose a simple but effective mesh-pull-based P2P video streaming system using Fountain codes with variable symbol sizes for video-on-demand services. The goal of the proposed system is to provide a stable video streaming service of high quality with a low computational complexity and short initial latency. Fountain codes are adopted in the proposed system to simplify the handshaking...
The paper presents an approach for lossless image compression in spatial domain for continuous-tone images using a novel concept of image folding. The proposed method uses the property of adjacent neighbor redundancy for prediction. In this method, column folding followed by row folding is applied iteratively on the image till the image size reduces to a smaller pre-defined value. For column folding,...
It is well known that although the conventional sphere decoder (SD) achieves optimal maximum likelihood (ML) performance at a reduced complexity compared to the naive ML detector, the SD computational complexity varies with signal noise ratio (SNR) and is high in the low SNR region. This paper proposes a new idea to overcome these drawback that reduces the complexity significantly at a negligible...
In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum--Likelihood (ML--) optimum detectors, which foresee an exhaustive search of the whole search space and have a complexity that linearly increases with the product of number of transmit--antenna, receive--antenna, and size of the modulation scheme. Three SDs specifically...
A new coding concept called credit-based variable-to-variable length (cbv2v) coding is proposed in this paper. A binary cbv2v code is constructed, and analysis of its performance shows that cbv2v coding can achieve much better trade-off among the coding delay, redundancy, and space complexity than does variable-to-variable length (v2v) coding. Specifically, let L be the total number of source words...
In this paper, a quantization scheme based on hard-decision partition and adaptive reconstruction levels is proposed for High Efficiency Video Coding (HEVC), the video coding standard currently under development, which has demonstrated approximately 40% bit saving compared to H.264/AVC. For each video frame, the residual signal after motion estimation is transformed and then quantized by a hard-decision...
An improved algebraic decoding algorithm (ADA) is presented to decode up to five possible errors in a binary systematic (47, 24, 11) quadratic residue (QR) code. The main idea of the improved ADA is to find out the new conditions in four-error and five-error cases and the smallest degree of the unknown syndrome polynomial in five-error case. Thus, the computational complexity in the finite field can...
In this paper we advocate a new technique for the fast identification of physical objects based on their physical unclonable features (surface microstructures). The proposed identification method is based on soft fingerprinting and consists of two stages: at the first stage the list of possible candidates is estimated based on the most reliable bits of a soft fingerprint and the traditional maximum...
This work discusses a fast generation procedure of authentication codes, for multimedia content cryptography, whose length (and computational complexity) can be tuned accordingly to the specific mobile application and service. In this work, we propose a digital algorithm to generate a pair of long (asymmetric) keys from one short primitive key. According to our results, the devised procedure provides...
The paper contributes to system level diagnostics by two new diagnostics algorithms for faulty units identification in regular computing systems from testing results. The developed algorithms are based on the symmetric diagnostics model at system level. Effectiveness and complexity of the implemented algorithms were evaluated by experiments over several regular computing architectures (hypercube,...
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.