Two simplified MAP algorithms for iterative decoding of turbo codes are presented. By using a parameter “decoding depth”, our algorithms do not require computation of the aposteriori probability of each decoded information bit throughout the entire trellis, thus reduce the computational complexity and decoding delay considerably. One of the algorithms can achieve the performance very close to t...

This correspondence describes an approach to reducing the computational cost of document image decoding by viewing it as a heuristic search problem. The kernel of the approach is a modi ed dynamic programming (DP) algorithm, called the iterated complete path (ICP) algorithm, that is intended for use with separable source models. A set of heuristic functions are presented for decoding formatted ...

Viterbi decoder is a common module in communication system, which has the requirement of low power and low decoding latency. The conventional register exchange (RE) algorithm and memory-based trace-back (TB) algorithm cannot meet both constraints of power and decoding latency. In this paper, we propose a new Survivor Memory Unit (SMU) algorithm, named State Exchange (SE) algorithm. The SE algor...

The MPEG audio standard has recently gained popularity for compressing high quality audio signals. In general, modifying or mixing MPEG signals requires decoding the MPEG signals into time-domain signals, processing the time-domain signals, and re-encoding the processed signals. In this paper, we present a psychoacoustically-based method for processing MPEG signals that eliminates signiicant po...

Parallel decoding based on multiple models has been studied to cover various conditions and speakers at a time on a speech recognition system. However, running many recognizers in parallel applying all models causes the total computational cost to grow in proportion to the number of models. In this paper, an efficient way of finding and pruning unpromising decoding processes during search is pr...

ABSTRACT H.264 as a new-generation video coding algorithm is becoming increasingly important for international broadcasting standards such as DVB-H and DMB. In comparison to its predecessors MPEG-2 and MEPG-4 SP/ASP, H.264 achieves improved compression efficiency at the cost of increased computational complexity. Real-time execution of the H.264 decoding process poses a large challenge on mobil...

In this paper, we propose joint cooperative beamforming and jamming schemes in decode-and-forward (DF) relay networks for physical layer secrecy. In DF relay networks, only the relays decoding the message from the source correctly have to join in the forwarding phase and the relays with decoding error are not utilized sufficiently. Taking this property into consideration, we let the relays deco...

Error correction coding (ECC) has become one of the most important tasks of flash memory controllers. The gate count of the ECC unit is taking up a significant share of the overall logic. Scaling the ECC strength to the growing error correction requirements has become increasingly difficult when considering cost and area limitations. This work presents a configurable encoding and decoding archi...

A bit-slice microprocessor-based real-time decoder has been proposed in this paper. A microprocessor-based architecture is preferable because of its programmability, availability, low cost and simplicity of design. Two strategies are adapted to increase throughput of the decoder for real-time decoding. First, bit-slice microprocessors are used and ALU word length is chosen to be equal to that o...

We study stabilization of a discrete-time scalar unstable plant over a noisy communication link, where the plant is perturbed at each time by an unknown, but bounded, additive disturbance. In order to have a simple encoding and decoding strategy, we restrict the observer/encoder to be nearly memoryless in that the channel inputs can only depend on the last sample taken of the plant state, while...