The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete memoryless channels (DMCs). Here we extend the study to memoryless channels with general alphabets and to channels with memory with possibly ...

In this paper, we explore the impacts of utilizing intelligent reflecting surfaces (IRS) in a power-splitting based simultaneous wireless information and power transfer (PS-SWIPT) system and compare its performance with the traditional decode and forward relaying system. To analyze a more practical system, it is also assumed that the receiving nodes are subject to decoding cost, and they are on...

In this correspondence we present a new method to convert the maximum-likelihood soft-decision decoding problem for linear block codes into a graph search problem where generalized Dijkstra’s algorithm can still be applied to the decoding procedure. The cost assigned to every branch in the graph is based on a generalization of Wagner rule which is an equivalent form of the maximum-likelihood de...

This document describes an RTP payload format for the ReducedComplexity Decoding Operation (RCDO) for H.264 Baseline profile bitstreams, as specified in ITU-T Recommendation H.241. RCDO reduces the decoding cost and resource consumption of the video processing. The RCDO RTP payload format is based on the H.264 RTP payload format.

A new decoding algorithm that consists of two decoding stages to reduce the computational complexity of maximum likelihood decoding for parallel combinatory high-compaction multicarrier modulation is proposed. The first decoding stage is responsible for a preliminary decision that serves to roughly find candidate messages using the QRD-M algorithm, and the second decoding stage is responsible f...

Color barcodes enable higher information density with respect to traditional black and white barcodes. Existing technologies use small color palettes and display the colors in the palette in the barcode itself for easy and robust decoding. This solution comes at the cost of reduced information density due to the fact that the displayed reference colors cannot be used to encode information. We i...

Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for 5 generation wireless communication standards. Successive-cancellation (SC) decoding of polar codes has mediocre error-correction performance on short to moderate codeword lengths: the SC-Flip decoding algorithm is one of the solutions that have been proposed to o...

This paper proposes an efficient memory mapping and a frame memory compression for an HDTV decoder LSI using Direct RambusTM DRAM (DRDRAM). DRDRAM is employed to achieve high memory bandwidth required for HDTV decoding at the minimum memory cost. Proposed memory mapping achieves high memory bandwidth sufficient for HDTV decoding even in the worst case and no costly line buffers are required in ...

An efficient decoding algorithm for segmental HMMs (SHMMs) is proposed with multi-stage pruning. The generation by SHMMs of a feature trajectory for each state expands the search space and the computational cost of decoding. It is reduced in three ways: pre-cost partitioning, start-node (SN) beam pruning, and conventional endnode (EN) beam pruning. Experiments show that partitioning cuts comput...