Spreading function and scattering function, Advanced Statistics

Assignment Help:

1)  Consider an antenna with a pattern:

G(θ,φ) = sinn(θ/θ0) cos(θ/θ0)   where θ0 = Π/1.5

(a) What is the 3-dB bandwidth?

(b) What is the 10-dB beam width?

(c) What is the directivity?

2)  Let  the  transmit  antenna  be  a  vertical λ/2  dipole,  and  the  receive  antenna  a  vertical λ/20 dipole.

(a) What are the radiation resistances at TX and RX?

(b) Assuming ohmic losses due to Rohmic = 10 Ω, what is the radiation efficiency?

3)  Explain the  difference  between  spreading  function  and  scattering  function.  Give examples  of  situations  where  the  information  contained  in  the  time  frequency correlation function RH(Δt, Δf) can be useful.

4)  The coherence  time Tc gives measure of how  long a channel can be considered  to be constant,  and  can  be  approximated  as  the  inverse  of  the  Doppler  spread. Obtain  an estimate of coherence time in Figure 6.7 of Molisch text.

5)  In  a  CDMA  system,  the  signal  is  spread  over  a  large  bandwidth  by  multiplying  the transmitted  symbol  by  a  sequence  of  short  pulses,  also  called  chips.  The  system bandwidth  is thus determined by the duration of a chip.  If the chip duration  is 0.26 μs and  the maximum excess delay  is 1.3 μs,  into how many delay bins do  the multipath components  fall?  If  the  maximum  excess  delay  is  100  ns,  is  the  CDMA  systems wideband or narrowband?

6)  For the COST 207 channel models (created for GSM evaluations),

(a)  Find the rms delay spread of the COST 207 environments RA, TU.

(b) What is the coherence bandwidth of the RA and TU channels?

(c)  Could two different function PDPs have the same rms delay spread?


Related Discussions:- Spreading function and scattering function

Lagrange multipliertest, The Null Hypothesis - H0:  There is autocorrelatio...

The Null Hypothesis - H0:  There is autocorrelation The Alternative Hypothesis - H1: There is no autocorrelation Rejection Criteria: Reject H0 (n-s)R 2 > = (1515 - 4) x (0.

Occam''s razor, Occam's razor  is an early statement of the parsimony princ...

Occam's razor  is an early statement of the parsimony principle, which was given by William of Occam (1280-1349) namely 'entia non sunt multiplicanda praeter necessitatem'; which m

Empirical bayes method, The procedure in which the prior distribution is re...

The procedure in which the prior distribution is required in the application of Bayesian inference, it is determined from empirical evidence, namely same data for which the posteri

Reciprocal transformation, Reciprocal transformation is a transformation o...

Reciprocal transformation is a transformation of the form y =1/x, which is specifically useful for certain types of variables. Resistances, for instance, become conductances, and

Group divisible design, Group visible design is an arrangement of the v mn ...

Group visible design is an arrangement of the v mn treatments in b blocks such that: * Each block comprises k distinct treatments k5v; * Each treatment is replicated r number

Particlefilters, Particlefilters is a simulation method for tracking movin...

Particlefilters is a simulation method for tracking moving target distributions and for reducing computational burden of the dynamic Bayesian analysis. The method uses a Markov ch

Epidemic curve, The plot of the number of cases of the disease against the ...

The plot of the number of cases of the disease against the time period. A large and sudden increase corresponds to an epidemic. The example of this is shown in the figure drawn bel

Clustered data, Clustered data : The term applied to both the data in whic...

Clustered data : The term applied to both the data in which the sampling units are grouped into the clusters sharing some common feature, for instance families or geographical reg

Explain time series, Time series : The values of a variable recorded, gener...

Time series : The values of a variable recorded, generally at a regular interval, over the long period of time. The observed movement and fluctuations of several such series are

Hill-climbing algorithm, Hill-climbing algorithm is  an algorithm which is ...

Hill-climbing algorithm is  an algorithm which is made in use in those techniques of cluster analysis which seek to find the partition of n individuals into g clusters by optimizin

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd