Min-Sum Algorithm with Maximum Average Mutual Information Quantization

نویسندگان

  • Zhengkang Chen
  • Huisheng Zhang
  • Lixin Li
  • Nan Qi
چکیده

The specific methods of the maximum average mutual information quantization are analyzed and deduced. With this method to quantify the initial message, the variable messages and check messages are converted into integers. Then the min-sum decoding algorithm based on integer arithmetic is implemented. Simulation results demonstrate that the decoding performance of min-sum algorithm based on integer with 7-bit maximum average mutual information quantization is almost the same as that of min-sum algorithm based on integer with 8-bit uniform quantization. Meanwhile, all the variables in the algorithm are fixed-length integers, so it is convenient for hardware implementation. Although the decoding performance is slightly worse than that of the sum-product decoding algorithm, the decoding time is greatly reduced. So it is very convenient for future generation communication.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additive non-Gaussian noise attacks on the scalar Costa scheme (SCS)

The additive attack public mutual information game is explicitly solved for one of the simplest quantization based watermarking schemes, the scalar Costa scheme (SCS). It is a zero-sum game played between the embedder and the attacker, and the payoff function is the mutual information. The solution of the game, a subgame perfect nash equilibrium, is found by backward induction. Therefore, the B...

متن کامل

Graph-based iterative decoding algorithms for parity-concatenated trellis codes

In this paper, we construct parity-concatenated trellis codes in which a trellis code is used as the inner code and a simple parity-check code is used as the outer code. From the Tanner–Wiberg–Loeliger (TWL) graph representation, several iterative decoding algorithms can be derived. However, since the graph of the parity-concatenated code contains many short cycles, the conventional min-sum and...

متن کامل

Efficient Hardware Implementation of Min-sum with Conditional Correction for Ldpc Decoding

The LDPC decoder complexity is largely influenced by interconnect and storage requirements. Recent research shows that Min-Sum decoding algorithm with conditional correction achieves performance that of ideal Sum of Products algorithm within 0.2 dB with 4 bits of uniform quantization is applied on check node and bit node messages. This paper presents a transformation for the Min-Sum with condit...

متن کامل

A new hybrid system based on MMI-neural networks for the RM speech recognition task

We present a hybrid speech recognition system for speaker independent continuous speech recognition. The system combines a novel information theory based neural network (NN) paradigm and discrete Hidden Markov models (HMMs) including State-of-the-Art techniques like state clustered triphones. The novel NN type is trained by an algorithm based on principles of self-organization that achieves max...

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013