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.
Decode-and-forward (DF) and compress-and-forward (CF) are well-known strategies to transmit information over the relay channel. There are several methods which generalize these strategies to relay networks, among them, the unified CF-DF strategy is one with relatively good performance and less complexity. In this method the nodes are divided into two groups: DF relay nodes and CF relay nodes, where...
Extensive studies have demonstrated the effectiveness of constructing capacity-approaching codes by block Markov superposition transmission (BMST). However, to achieve high performance, BMST codes typically require large encoding memories and large decoding window sizes, which result in increased decoding complexity and decoding latency. To address this issue, we introduce the recursive BMST (rBMST),...
In this paper, a Space-Time Block Code (STBC) based on the Golden number, Golden code is proposed for a massive MIMO-RFID systems. Based on channel modelling for massive MIMO-RFID system, the proposed space-time code is applied to the tag side. Simulation results show that the proposed code for massive MIMO-RFID systems outperforms Alamouti code while simplifying the receiver's complexity. The Bit...
This work analyses the actual throughput of the Discrete Sine Transform (DST) stage in a realistic HEVC encoder, which executes the rate-distortion optimization algorithm to achieve high compression quality. Then, a low complexity DST factorization, where all the integer multiplications are substituted with add-and-shift operations, is exploited to design an efficient 1D-DST core. The proposed 1D-DST...
This paper proposes a fast algorithm based on depth map segmentation for the depth coding of 3D video coding to reduce the coding complexity of the depth map. The proposed algorithm segments the depth map into different regions by modifying automatic thresholding technique. We also propose the search range adjustment according to the classification of the coding tree unit (CTU). The early termination...
Compared with H.264/AVC, H.265/HEVC achieves better image quality at the same coding bit rate, but requires more complexity in its coding process. In this paper, we propose a fast inter/intra decision method that can reduce the required encoding time with very little increase in required rate and PSNR degradation. We also introduce the weighted sampling and adaptive threshold condition to determine...
Owing to their capacity-achieving performance and low encoding and decoding complexity, polar codes have drawn much research interests recently. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two common approaches for decoding polar codes. SCD is sequential in nature while BPD can run in parallel. Thus BPD is more attractive for low latency applications. However BPD...
In this paper, a fast intra Coding Unit (CU) size decision framework based on keypoint detection on Graphic Processing Unit (GPU) is proposed. In this framework, firstly the original frames are sent to GPU and then keypoint detection is conducted with numerous threads, which is able to avoid bringing in additional computational complexity even in realtime systems. Then, based on the keypoint distribution,...
This paper presents a complexity reduction technique for 3D High Efficiency Video Coding (3D-HEVC) using Rate-Distortion (RD) list reduction in the depth maps intra-frame prediction. In the 3D-HEVC standardization, the HEVC intra-frame prediction was inherited from texture to depth maps. However, considering depth maps simpler behavior than texture, the intra-frame prediction contains an unnecessary...
Distributed storage systems (DSSs) are widely employed in data centers and sensing networks to resist storage node failures. Structured redundancy is introduced to DSS by various coding schemes to efficiently account for failures of storage nodes. The allocation of the coded data blocks to storage nodes is another factor that impacts the data reliability. In this paper, we investigate the coding and...
In this paper, we propose a design of spatially coupled repeat-accumulate (SC-RA) codes over a three-phase bidirectional relay. The channels between the nodes are assumed binary input additive white Gaussian noise (BIAWGN) channels, while decode-and-forward (DF) relaying is considered at the relay. We present low complexity density evolution analysis for the proposed bidirectional relay code, which...
Designing ultra-low latency coding algorithms has been the key concern for the development of live video system. In the current video coding standards, the capacities of frame memory and bus bandwidth are the major aspects that affect the performance of encoder and decoder. To address this issue, this paper proposes a low-latency reference frame compression algorithm, which utilizes spatial correlation...
Channel coding is a fundamental building block in any communications system. High performance codes, with low complexity encoding and decoding are a must-have for future wireless systems, with requirements ranging from the operation in highly reliable scenarios, utilizing short information messages and low code rates, to high throughput scenarios, working with long messages, and high code rates. We...
As the software development community makes it easier to contribute to open source projects, the number of commits and pull requests keep increasing. However, this exciting growthrenders it more difficult to only accept quality contributions. Recent research has found that both technical and social factors predictthe success of project contributions on GitHub. We take this question a step further,...
In the fast moving world of smart urban conglomerates, emergency services need to move even faster through the crowded infrastructure. Providing the emergency crew with a route that avoids congestions can save valuable travel time. It is challenging to compute such a route fast enough for practical usage while taking into consideration traffic fluctuations, uncertainties, and unpredictable user behaviour...
As the successor of H.264, High Efficient Video Coding (HEVC) standard includes various novel techniques, including Coding Tree Unit (CTU) structure and additional angular modes used in intra coding. These new techniques promote the coding efficiency on one hand, while increasing the computational complexity significantly on the other hand. In this paper, we propose a fast intra block partitioning...
This paper concerns optimization of encoding in HEVC. A novel method is proposed in which encoding modes, e.g. coding block structure, prediction types and motion vectors, are selected basing on noise-reduced version of the input sequence, while the content, e.g. transform coefficients, are coded basing on the unaltered input sequence. Although the proposed scheme involves encoding of two versions...
Polar code has become a major milestone in information theory field in recent times. Researchers are still observing more efficient encoding and decoding structures. In this study, a new WIB based structure is proposed which reduces the computational complexity of WIB introduced as an early termination method for BP polar decoder in literature. Both proposed and WIB methods are implemented with VHDL...
We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi-kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes...
The H.264 video coding standard can greatly outperform other previous coding standards in both PSNR and visual quality. This efficiency is achieved by using several powerful coding techniques. One important technique is the variable block-size mode prediction. However, this feature results in extremely high computational complexity when the rate distortion optimization (RDO) technique is used. In...
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.