Optimal Power Allocation for the Proposed Asymmetric Turbo Code for 3G Systems

نویسنده

  • Mohammad Umar Siddiqi
چکیده

We proposed a new class of asymmetric turbo encoder for 3G systems that performs well in both “water fall” and “error floor” regions in [7]. In this paper, a modified (optimal) power allocation scheme for the different bits of new class of asymmetric turbo encoder has been investigated to enhance the performance. The simulation results and performance bound for proposed asymmetric turbo code with modified Unequal Power Allocation (UPA) scheme for the frame length, N=400, code rate, r=1/3 with Log-MAP decoder over Additive White Gaussian Noise (AWGN) channel are obtained and compared with the system with typical UPA and without UPA. The performance tests are extended over AWGN channel for different frame size to verify the possibility of implementation of the modified UPA scheme for the proposed asymmetric turbo code. From the performance results, it is observed that the proposed asymmetric turbo code with modified UPA performs better than the system without UPA and with typical UPA and it provides a coding gain of 0.4 to 0.52dB. Keywords—Asymmetric turbo code, Generator polynomial, Interleaver, UPA, WCDMA, cdma2000.

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

ثبت نام

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

منابع مشابه

A Modified Unequal Power Allocation (upa) Scheme for Performance Enhancement in Bit Repetition Turbo Codes in High Speed Downlink Packet Access (hsdpa) System

In this paper, a modified optimal power allocation scheme for different bits in turbo encoder has been proposed to improve the performance of Turbo Codes system in High Speed Downlink Packet Access (HSDPA) service. In a typical turbo code in HSDPA system, an encoder with code rate of 1/3 was used with bit repetition scheme or puncturing system to achieve code rate of 1/4. In this study, the aut...

متن کامل

Performance of JPEG Image Transmission Using Proposed Asymmetric Turbo Code

This paper gives the results of a simulation study on the performance of JPEG image transmission over AWGN and Rayleigh fading channels using typical and proposed asymmetric turbo codes for error control coding. The baseline JPEG algorithm is used to compress a QCIF (176×144) “Suzie” image. The recursive systematic convolutional (RSC) encoder with generator polynomials (1,D +D +1/D +D+1), that ...

متن کامل

Power Allocation Policies for Convolutional and Turbo Coded Systems over Fading Channels

In this paper we study adaptive power allocation (PA) policies for improving the performance of convolutional and turbo codes on fading channels. The transmitter has an average power constraint. The fading process can he continuous (e.g. Rayleigh distribution). Perfect channel state information at the transmitter (CSIT) and the receiver (CSIR) are assumed. For convolutional codes, we consider b...

متن کامل

FACTS Devices Allocation Using a Novel Dedicated Improved PSO for Optimal Operation of Power System

Flexible AC Transmission Systems (FACTS) controllers with its ability to directly control the power flow can offer great opportunities in modern power system, allowing better and safer operation of transmission network. In this paper, in order to find type, size and location of FACTS devices in a power system a Dedicated Improved Particle Swarm Optimization (DIPSO) algorithm is developed for de...

متن کامل

Employing a Multi-Criteria Approach under Bankruptcy Conditions for Optimal Allocation of Shared Water Resources through Using Asymmetric Nash Bargaining Method

Management based on the flexibility, fairness, and sustainability characteristics of water resources may play a key role in preventing the continuation of the crisis process as well as reducing water users’ conflict. In the present research, the framework for the optimal allocation of shared water resources was presented using a combination of bankruptcy concepts and asymmetric Nash bargaining....

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2008