## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

, as can be seen in the next sub section. On the other hand, in order to facilitate the computation of Mk (z,k) in the case of block-sub carriers assignment schemes, we present accurate approximations and tight lower bounds which are based on the Jensen’s inequality.

**A. Exact Expression of Mk(z,k) in case of Inter leaved sub carrier Assignment:
**

For the sake of performance analysis, we assume here that all sub carrier in the vicinity of sub carrier M are allocated to different users. This implies that at most one sub carrier from each set Ak may interface with sub carrier M. Let the index of this sub carrier be denoted by k. Then (14) reduces into a simpler expression shown in(15) which involves averages wrt two symbols only. Let Q(z)=[] , where he average is taken over the information symbols bk,k and bk ,k. Then(15) can be expressed as shown in (16). In the case of square M-QAM with Gray coding, Reb k n and Imb km are selected independently over the set {}

**B. Conditional Gaussian Approximation:
**

Exact evaluation of Mk (z,k) in case of block sub carrier assignment schemes involves a large number of discrete Rvs {bnk } for which exact averaging would require a large number of operations partiwlanly in case of high order modulations. In order to reduce the computational complexity required to compute (14) in case of block-sub carrier assignment schemes, we propose a new improved Gaussian approximation method. Let V,c= Now, when k is given, then Vkc become a sum of independent RVS. However, the set of c RVS{}

Therefore, we approximate he set of RVS{Vc,c=0,1,----c-1} by joint complex Gaussian RVS(conditioned on k) having zero becomes and (conditional) correlation given by

That is, exponent of (14) is approximated by a sum of L, Gaussian quadratic form. Now, using known results for the moment generating function of complex Gaussian quadratic form(e.g [21]), we arrive at the following closed form approximate expression for (14)

Where Ic is the cxc identity matrix and Ak is the correlation matrix (conditioned on k) of the jointly complex Gaussian vector {Vk.δk) which is valid for arbitrary sub carrier assignment schemes. A Lower Bound On Mk(Z.c-1} with elements defined in(19). is readily obtained by switching that the function exp(-z x) is convex ∀z.----Vk. Upper bounds on the exact bit and symbol error probabilities are then obtained when (z1) Is used in (13) instead of (14).δk) A lower band on Mk (z. . C. and therefore Jensen’s inequality can be involved to show the result in (z1). x>0. It is to be emphasized at this point that the proposed Gaussian approximation is distinctive from the classical Gaussian approximation methods which are commonly used in interface analysis in wireless systems.

when Tw=Tg=2Tmax. Result is diminished even in the case of the interleaved sub carrier assignments.2 and 3. We consider an OFDMA system without extended CPs. as for as the accuracy of the proposed approximations and bounds is concerned. and for several modulation orders.NUMERICAL EXAMPLES In this section we present some numerical and simulation result for the sake of numerical examples. respectively. Where | Ak| =1∀k. and plot the cutoff rate against the normalized maximum propagation delay (∆) for both interleaved and block sub carriers assignment schemes. Here. The total number of sub carriers is fixed at N=1024. respectively.ρk) which are given in (16). we consider a 50% loaded system with q=0. 2 and 3 for interleaved and blocked sub carrier assignment schemes. that the difference between the approximate and exact (or simulation). In fig 4. which show excellent match to the relevant simulation result.2 and 3. On the other hand. fig 2 and 3 reveal that the proposed upper bound on BER is in fact a tight upper bound. On the cutoff rate.and c=10. for the exact.5 in a multipath Rayleigh fading channel with exponential power-delay profiles.and the number of sub carriers in a block in the case of block-sub carrier assignment scheme is 10. one can see from figs. Firstly the accuracy of the new exact and approximate expressions of BER is investigated in Figs.01. and investigate the impact of he maximum propagation delay. The exact theoretical results are shown in fig. Here the average BER of QPAK is plotted against the normalized range of the useful signal ρ0. The theoretical results are evaluated by using (26). where γc=γ0e---. and for three different values of the normalized maximum propagation delay ∆∈{0. Both theoretical and simulation results are displayed in Figs . and therefore can be employed to provide an efficient and accurate method for performance evaluation of OFDMA with arbitrary sub carrier assignments. More interestingly. (20) and (21).01. and the bound.1}. . but with three different expressions of µk (Z. improved Gaussian approximation.2 for interleaved sub carrier assignment scheme. we fix he CP timeinterval at Tg=Tmax. Tk=c/c-1 Tmax∀k where the maximum delay spread is set at Tmax =t/10 and the path-loss exponent β=4.

- ms-08
- 10.1002_acs.896
- differentiated activities
- sp01ra02
- Engineering Mathematics - IIT
- Is as Complicated as Th2
- Lecture 3- Probability
- A Generalized Model for Evaluating Supply-Chain Delivery Performance
- Introduction and descriptive statistics - Vinjar Fønnebø.pdf
- Image Restoration 1
- MATH1041 Final Cheat Sheet
- Lecture 15 Statistical Analysis
- Parameter Estimation in Lapacian Noise
- 100.03.SuccessEquation
- 3Normal Dist Problemspdf
- 04111676
- SPC Sample
- SEG-1998-0204
- Lab_1_5_9
- Advanced Algebra II
- Resource Efficient LDPC Decoders for Multimedia Communication
- two population_hypothesis_ch4.pdf
- 2009 Traders Expo John Ehler
- Performance Analysis of Energy Efficient Channel Coding (ME-MCCDMA)-final
- Winter Lawn
- Normality Test in Excel
- Ldpc Thesis
- Owa010010 Wcdma Ran Overview Issue 1.13
- 10 21 unit plan - complex numbers
- 1471-2105-11-363.supp1

Skip carousel

- Tmp 8456
- tmp65F5.tmp
- tmpAF07.tmp
- tmp269C.tmp
- Named Entity Recognition for English Tweets using Random Kitchen Sink Algorithm
- commalds (1)
- OBoyle Aquinis 2012 Best and the Rest- Bell Curve
- Feature Subset Selection for High Dimensional Data Based On Clustering
- tmpA6A6.tmp
- tmp7FA7
- Heterogeneous Face Recognition Framework Using Multiple Filters for Person Identification
- tmpC387
- Smart Fire Detection System using Image Processing
- Personalized Gesture Recognition with Hidden Markove Model and Dynamic Time Warping
- tmpE2C4.tmp
- Taking risk out of systemic risk measurement
- tmpB098.tmp
- tmp911D.tmp
- tmp8F2A
- Approximation of Gaussian derivatives for UWB communication
- UT Dallas Syllabus for meco6315.501.10s taught by John Wiorkowski (wiorkow)
- Rough Set based Natural Image Segmentation under Game Theory Framework
- Multiple Person Tracking with Shadow Removal Using Adaptive Gaussian Mixture Model in Video Surveillance
- Image De-Noising using Wavelet Transform and Various Filters
- tmp6A1F.tmp
- wp16-15
- tmpF1E6.tmp
- tmp8F03
- tmp560
- frbclv_wp1986-08.pdf

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading