Non-Coherent Capacity and Reliability of Sparse Multipath Channels in the Wideband Regime

Size: px
Start display at page:

Download "Non-Coherent Capacity and Reliability of Sparse Multipath Channels in the Wideband Regime"

Transcription

1 Non-Coherent Capacity an Reliability of Sparse Multipath Channels in the Wieban Regime Gautham Hariharan an Abar M Sayee Department of Electrical an Computer Engineering University of Wisconsin-Maison gauthamh@caewisceu, abar@engrwisceu Abstract In contrast to the prevalent assumption of rich multipath in information theoretic analysis of wireless channels, physical channels exhibit sparse multipath, especially at large banwiths We propose a moel for sparse multipath faing channels an present results on the impact of sparsity on non-coherent capacity an reliability in the wieban regime A ey implication of sparsity is that the statistically inepenent egrees of freeom in the channel, that represent the elay- Doppler iversity affore by multipath, scale at a sub-linear rate with the signal space imension (time-banwith prouct) Our analysis is base on a training-base communication scheme that uses short-time Fourier (STF) signaling waveforms Sparsity in elay-doppler manifests itself as time-frequency coherence in the STF omain From a capacity perspective, sparse channels are asymptotically coherent: the gap between coherent an non-coherent extremes vanishes in the limit of large signal space imension without the nee for peay signaling From a reliability viewpoint, there is a funamental traeoff between channel iversity an learnability that can be optimize to maximize the error exponent at any rate by appropriately choosing the signaling uration as a function of banwith I INTRODUCTION Recent avances in the emerging areas of ultra-wieban communication systems an wireless sensor networs have renewe the search for a complete unerstaning of the funamental performance limits in the wieban/low SNR regime The impact of multipath signal propagation, which leas to faing, on the capacity an reliability of wieban channels, epens critically on nowlege of the channel state information (CSI) at the receiver The seminal wor in [] best illustrates this: with perfect CSI at the receiver, pea-power limite QPSK achieves secon-orer optimality, whereas with no receiver CSI, peay signals are necessary to even achieve first-orer optimality, although they fail to be secon-orer optimal Motivate by the fact that channel learning can brige this gap an the sharp cut-off, the authors in [2] stuy wieban capacity by assuming a coherence time scaling with SNR of the form T coh = SNR µ, µ > 0 () However there is no explanation for why such scaling laws shoul hol in practice Accurate moeling of the channel characteristics in time an frequency, as a function of physical multipath characteristics, is critical in analyzing the performance of channel learning schemes an the impact of CSI on the performance limits While most existing results assume rich multipath, there is growing experimental evience (eg [3], [4]) that physical channels exhibit a sparse structure at wie banwiths an when we coe over long signaling urations In this paper, we use a virtual representation [5] for physical multipath channels to present a framewor for moeling sparsity The virtual representation uniformly samples multipath in elay an Doppler at a resolution commensurate with the signaling banwith an signaling uration, respectively Uner this representation, the virtual channel This wor was partly supporte by the NSF uner grant #CCF coefficients represent the DoF in elay an Doppler Sparse channels correspon to a sparse set of virtual coefficients an a ey implication is the sub-linear scaling of the number of inepenent egrees of freeom (DoF) with signal space imensions This is contrast to rich multipath, where the DoF scale linearly We consier signaling over orthogonal short-time Fourier (STF) basis functions that serve as approximate eigenfunctions for unersprea channels an provie a natural mechanism to relate sparsity in elay-doppler to coherence in time-frequency With no receiver CSI a priori, we consier training-base communication schemes an investigate the wieban ergoic capacity uner the assumption that the time-frequency coherence imension N c scales with SNR accoring to N c = SNR µ, µ > 0 (2) It is observe that the coherence requirements for achieving capacity are share between both time an frequency: the coherence banwith, W coh, increases with banwith, W (ue to sparsity in elay), an the coherence time, T coh, increases with signaling uration T (ue to sparsity in Doppler) As a result, the scaling requirements on T coh with W neee in [2] for first- an secon-orer optimality are replace by scaling requirements on N c = T coh W coh This leas to ramatically relaxe requirements on T coh scaling with banwith/snr compare to those assume in [2] In particular, sparse multipath channels are asymptotically coherent; that is, for a sufficiently large but fixe banwith, the conitions for firstan secon-orer optimality can be achieve by simply maing the signaling uration sufficiently large accoring to T T δ 2 m W δ W µ +δ 2 (3) P µ Equation (3) relates the signaling parameters (T,W,P ), as a function of the channel parameters (T m,w,δ,δ 2) in orer for the relationship (2) to hol between N c an SNR at any esire value of µ (in particular, µ > for first-orer optimality an µ > 3 for seconorer optimality) The asymptotic coherence of sparse channels also eliminates the nee for peay signaling that has been emphasize in existing results [6], [] for increasing the spectral efficiency of non-coherent communication schemes Our investigation of the reliability of sparse channels is through ranom coing error exponents [7] For training-base communication schemes, our results reveal a funamental learnability versus iversity traeoff in sparse channels At any transmission rate less than the coherent capacity, there is an optimal choice of signal parameters (as a function of channel parameters) that optimizes the traeoff an yiels the largest error exponent

2 2 II SYSTEM SETUP A Sparse Multipath Channel Moeling A physical iscrete multipath channel can be moele as h(τ, ν) = X n r(t) = X n β nδ(τ τ n)δ(ν ν n) β nx(t τ n)e j2πνnt + w(t) (4) where h(τ, ν) is the elay-doppler spreaing function of the channel, β n, τ n [0, T m] an ν n [ W /2, W /2] enote the complex path gain, elay an Doppler shift associate with the n-th path T m an W are the elay an Doppler spreas respectively an w(t) is aitive white Gaussian noise (AWGN) We assume a sufficiently unersprea channel, T mw In this paper we use a virtual representation [5], [8] for time- an frequency-selective multipath channels that captures the channel characteristics in terms of resolvable paths an greatly facilitates system analysis from a communication-theoretic perspective The virtual representation uniformly samples the multipath in elay an Doppler at a resolution commensurate with signaling banwith W an signaling uration T, respectively [5], [8] DOPPLER DOPPLER W /2 0 - W /2 /W (a) /T T m MULTIPATH MULTIPATH W f Coherence Subspace T (b) T coh W coh Basis Functions t y(t) = h l,m T mw X l=0 X TW /2 X m= TW /2 h l,m x(t l/w)e j2πmt/t (5) n S τ,l S ν,m β n (6) The sample representation (5) is linear an is characterize by the virtual elay-doppler channel coefficients {h l,m } Each h l,m consists of the sum of gains of all paths whose elays an Doppler shifts lie within the (l, m)-th elay-doppler resolution bin as shown in Fig (a) Distinct h l,m s correspon to approximately isjoint subsets of paths an are hence approximately statistically inepenent (ue to inepenent path gains an phases) In this wor, we assume that the channel coefficients {h l,m } are perfectly inepenent We also assume Rayleigh faing in which {h l,m } are zero-mean Gaussian ranom variables an the channel statistics are thus characterize by the power in the virtual channel coefficients Ψ(l, m) = E[ h l,m 2 ] (7) which is a measure of the (sample) elay-doppler power spectrum Let D enote the number of ominant non-zero channel coefficients The parameter D reflects the statistically inepenent egrees of freeom (DoF) in the channel an also signifies the elay-doppler iversity affore by the channel It can be boune as D = D TD W D max = D T,maxD W,max D T,max = TW, D W,max = T mw (8) where D T,max enotes the maximum number of resolvable paths in Doppler (maximum Doppler or time iversity) an D W,max enotes maximum number of resolvable paths in elay (maximum elay or frequency iversity) In rich multipath, D T = D T,max an D W = D W,max an each elay-doppler resolution bin in Fig (a) is populate by a path In this case D scales linearly with the signal space imensions, N = TW However, recent measurement campaigns [3], [4] for UWB channels show that ominant channel coefficients get sparser in the elay omain as the banwith increases As we consier large banwiths an/or long signaling urations, the resolution of paths in both elay For which Ψ(l, m) > γ for some prescribe threshol γ > 0 (c) Fig (a) Delay-oppler sampling commensurate with signaling uration an banwith (b) Time-frequency coherence subspaces in STF signaling (c) Illustration of the training-base communication scheme in the STF omain One imension in each coherence subspace (ar squares) represent the training imension an the remaining imensions are use for communication an Doppler omains gets finer, leaing to the scenario in Fig (a) where the elay-doppler resolution bins are sparsely populate with paths, ie D < D max Thus physical multipath channels get sparser with increasing W ue to fewer than D W,max resolvable elays an with increasing T ue to fewer than D T,max resolvable Doppler shifts We moel such sparse behavior with a sub-linear scaling in D T an D W with T an W : D T (TW ) δ, D W (T mw) δ 2, δ, δ 2 [0, ] (9) where {δ i} represent channel sparsity; smaller the value of {δ i}, the slower (sparser) the growth in the resolvable paths in the corresponing omain This implies that the elay-doppler DoF, D = D TD W, scale sub-linearly with the number of signal space imensions N Note that with perfect CSI at the receiver, D reflects the elay- Doppler iversity affore by the channel, whereas with no CSI, it reflects channel uncertainty B Orthogonal Short-Time Fourier Signaling We consier signaling using an orthonormal short-time Fourier (STF) basis [9], [0] that is a natural generalization of orthogonal frequency-ivision multiplexing (OFDM) for time-varying channels An orthogonal STF basis for the signal space is generate from a fixe prototype waveform g(t) via time an frequency shifts: φ l,m (t) = g(t lt o)e j2πwot where T ow o = l = 0,, N T, m = 0,, N W N T = T T o, N W = W W o an N = N TN W (0) The N transmitte symbols x l,m are moulate onto the STF basis x(t) = X l,m x l,m φ l,m (t)

3 3 For a signaling uration T an banwith W, the basis functions span the signal space with imension equal to N = TW The receive signal in (4) is projecte onto the STF basis functions to yiel the receive symbols r l,m = r, φ l,m = X, m x l, m + w l,m () l,m h l,m;l Equivalently, we can represent the system in STF-omain using an N-imensional matrix system equation r = SNR Hx + w (2) where w represents the aitive noise vector whose entries are ii CN(0, ) The N N matrix consists of the channel coefficients {h l,m;l, m } in () The parameter SNR represents the transmit energy per moulate symbol an for a given transmit power P equals SNR = P W (E[ x 2 ] = ) In this wor, our focus is on the wieban regime, where SNR 0 For sufficiently unersprea channels, the parameters T o an W o can be matche to T m an W so that the STF basis waveforms serve as approximate eigenfunctions of the channel [0], [9] Thus the N N channel matrix H is approximately iagonal In this wor, we will assume that H is exactly iagonal, that is, h H = iag h, h,nc, h 2, h 2,Nc {z } {z } Subspace Subspace 2 h D, h D,Nc {z } Subspace D i (3) Furthermore, the iagonal entries of H in (3) amit an intuitive bloc faing interpretation in terms of time-frequency coherence subspaces [9] illustrate in Fig (b) The signal space is partitione as N = TW = N cd (4) where D represents the number of statistically inepenent timefrequency coherence subspaces (elay-doppler iversity), reflecting the DoF in the channel (see (8)), an N c represents the imension of each coherence subspace, which we will refer to as the timefrequency coherence imension In the bloc faing moel in (3), the channel coefficients over the i-th coherence subspace h i, h i,nc are assume to be ientical, h i, whereas the coefficients across ifferent coherence subspaces are inepenent an ue to the stationarity of the channel statistics across time an frequency, ientically istribute Thus, the D istinct STF channel coefficients, {h i}, are ii zero-mean Gaussian ranom variables (Rayleigh faing) with variance E[ h i 2 ] = Using the DoF scaling for sparse channels in (9), the coherence imension of each coherence subspace can be compute as T coh = T D T = T N c = T coh W coh = T W δ W δ W δ 2 T δ 2 m, W coh = W D W = W δ 2 T δ 2 m (5) ı = N c,min (6) T mw where T coh is the coherence time an W coh is the coherence banwith of the channel, as illustrate in Fig (b) Note that δ = δ 2 = correspons to a rich multipath channel in which N c = N c,min = /(T mw ) is constant an D = D max increases linearly with N = TW This is the assumption prevalent in existing wors In contrast, for sparse channels, (δ, δ 2) (0, ), an both N c an D increase sub-linearly with N In terms of channel parameters, N c increases with ecreasing T mw as well as with smaller δ i In terms of signaling parameters, N c can be increase by increasing T an/or W On the other han, when the channel is rich, N c epens only on T mw an oes not scale with T or W In this paper, our focus is on computing the sparse channel capacity an reliability an, as we will see later, both metrics turn out to be functions only of the parameters N c an SNR Furthermore, in the wieban limit they critically epen on the following relation between N c an SNR N c = where > 0 is a constant SNR µ, µ > 0 (7) C Training-Base Communication Using STF Signaling We use the bloc faing moel inuce by STF signaling to stuy the impact of time-frequency coherence on channel capacity an reliability in sparse multipath channels Within the non-coherent regime, we focus our attention on a communication scheme in which the transmitte signals inclue training symbols to enable coherent etection Although it is argue in [2] that training-base schemes are sub-optimal from a capacity point of view, the restriction to training schemes is motivate by practical consierations We provie an outline of the training-base communication scheme, aapte from [2], suitable to STF signaling (see [] for etails) The total energy available for training an communication is PT, of which a fraction η is use for training an the remaining fraction ( η) is use for communication Since the quality of the channel estimate over one coherence subspace epens only on the training energy an not on the number of training symbols [2], our scheme uses one signal space imension in each coherence subspace for training an the remaining (N c ) for communication, as illustrate in Fig (c) We consier minimum mean square error (MMSE) estimation uner which the channel estimation performance is measure in terms of the resulting mean square error (MSE) III ERGODIC CAPACITY OF THE TRAINING-BASED COMMUNICATION SCHEME We first characterize the coherent capacity of the wieban channel with perfect CSI at the receiver The coherent capacity per imension (in bps/hz) is efine as E ˆlog C coh (SNR) = sup 2 et `I N + HQH H Q: Tr(Q) TP N where P enotes transmit power an H is the iagonal channel matrix in (3) with the iagonal elements following the bloc-faing structure Due to the iagonal nature of H, the optimal Q is also iagonal In particular, uniform power allocation Q = TP N IN = SNR I N achieves capacity an we have P D i= C coh (SNR) = E ˆlog 2 ` hi 2 + TP N D (a) = E ˆlog 2 ` 2 + SNR h (8) where (a) follows since {h i} are ii with h representing a generic ranom variable, N = TW an SNR = P = TP W N The next proposition provies a lower boun to the coherent capacity in the low SNR regime [] Proposition : The coherent capacity, C coh (SNR), satisfies C coh log 2 (e) `SNR SNR 2 (9) Moreover the capacity converges to the lower boun in the limit of SNR 0 The lower boun in Proposition shows that the minimum energy per bit necessary for reliable communication is given by E b N 0 = min log e (2) an the wieban slope S 0 =, the two funamental metrics of spectral efficiency in the wieban regime efine in []

4 4 In terms of the scaling law, N c =, µ > 0, as efine SNR µ in (7), we are intereste in computing the value of µ such that the training-base communication scheme achieves first- an seconorer optimality The result is summarize in the following theorem Theorem : The average mutual information of the training-base scheme, with the scaling law N c =, satisfies SNR h µ i I tr log 2 (e) SNR O SNR +µ 2 (20) In particular, the first- an secon-orer optimality conitions are met if an only if µ > an µ > 3, respectively Proof: Omitte for this version See [] for etails It can be seen that the coherence imension N c plays a critical role in etermining the capacity of the training an communication scheme Both channel an signaling parameters impact N c in sparse channels an for a given T mw an {δ i}, the signal space parameters T an W can be suitably chosen to obtain any esire value for N c Recalling the expression for W coh in (5), we note that W coh = W δ 2 (T m) δ 2 = P δ2 (T m) δ 2 SNR δ 2 (2) an thus W coh naturally scales with SNR Using (2) the expression for N c in (6) becomes () T = N c = T P δ 2 (W ) δ (T m) δ 2 SNR δ 2 (22) Equating (7) with (22) leas to the following canonical relationship W µ +δ 2 T δ 2 m W δ P µ (23) that relates the signaling parameters (T,W,P ), as a function of the channel parameters (T m,w,δ,δ 2) in orer for the relationship (7) to hol between N c an SNR = P/W Equations (7) an (23) are the two ey equations that capture the essence of the results in this paper A Discussion of Results on Ergoic Capacity In the context of existing results in [2] that assume rich multipath (δ = δ 2 = ), Theorem shows that the requirement on T coh is now the requirement on the coherence imension N c = T coh W coh Thus, the coherence cost is share in both time an frequency resulting in significantly weaene scaling requirements for T coh If we have W coh = O `W δ 2, then the T coh scaling requirement reuces to T coh = N c/w coh = O W 2+δ 2 (24) to achieve secon-orer optimality This is significantly less stringent than the T coh = O `W 3 require in the framewor of [2] Combining Theorem with (23) lea to scaling rules for the locus of points (T,W,P ) in orer to achieve a esire value of µ (Recall µ > for first-orer optimality an µ > 3 for secon-orer optimality) Specifically, log (T) = log δ µ δ W δ T δ 2 m + log (P) µ + δ2 δ log (W) (25) It is observe that smaller δ i s imply a slower scaling of T with W Conversely, for any system operating at a particular T an W, (25) can be use to etermine the effective value of µ as µ eff = ( δ) log(t/c) + ( δ2) log(p) log(w/p) + ( δ 2) (26) where c = T δ 2 m W δ Note that µ eff as T for sparse channels, which implies that first- an secon-orer optimality can be achieve by simply increasing T This is ue to the impact of sparsity in Doppler an in irect contrast to the case of rich multipath where the coherence requirement is inepenent of signaling uration We provie numerical illustration of the results by consiering the low SNR asymptote of the coherent capacity in (9) The coefficients of the first- an seconorer terms are λ = log 2 (e) an λ 2 = log 2 (e), respectively In Fig 2, we plot the numerically estimate values c an c 2 of λ an λ 2, respectively, for the training-base communication scheme, which are estimate using Monte-Carlo simulations We observe that for a large enough T such that µ eff > 3, the secon-orer constant c 2 λ 2 = log 2 (e) Also shown in the figure is the behavior of the first-orer constant an it is seen that c λ for a much smaller value of T since all we nee is µ > Contrary to the traitional emphasis on peay signaling to improve the spectral efficiency of non-coherent communication, our results imply that elay-doppler sparsity, along with a suitable choice of T, W an P as in (25) is sufficient to achieve a esire level of coherence with non-peay signaling schemes It is shown in [] that the T coh requirements for non-peay signals uner our framewor are still better than those for peay training-base communication schemes propose in [2] base on a rich multipath assumption c log 2 (e) W = GHz, P/N 0 = 40 B, T m W = 0 6, δ 2 = 04 c 2 log 2 (e) δ = 02 δ = 02 δ = 03 δ = 03 δ = 04 δ = Signaling uration T (secs) Fig 2 Convergence of the coefficients of the SNR an SNR 2 terms in capacity as a function of T IV RELIABILITY OF SPARSE MULTIPATH CHANNELS The reliability function of the channel is efine as [7] log Pe (N, R) E (R) = lim sup N N where P e (N, R) is the average probability of error over an ensemble of coes (ranom coing) in which each coewor spans the signal space imensions N = T W an communication taes place at transmission rate R For any finite N, while the ranom coing exponent E r(n, R) provies a lower boun to E(R), the spherepacing exponent E sp(n, R) is an upper boun to E(R) [7] We recall the ranom coing upper boun on P e [7] given by P e e N[Er(N,R)] (33) E r (N, R) = max max 0 ρ Q [Eo (N, ρ, Q) ρr] (34)

5 5 E tr r (N, R) = R cr = R max = K = 8 N >< c log + (Nc )K ( (K ) ǫ ) R o() 0 R R 2 cr N c log + (Nc )K ( (K ) ǫ )ρ ρ R o() R +ρ >: cr R R max 0 R > R max N c 2N c K ( (K ) ǫ ) [2+(N c )K ( (K ) ǫ )] N c N c K ` (K ) ǫ η ( η )(N csnr) 2 (N c )(+η N csnr)+( η )N csnr (30) η = NcSNR+Nc (N c 2)N csnr ρ = (2 + ) +»q + (Nc 2)NcSNR N csnr+n c q (2 + ) 2 + 4( + )( N cr ) 2( + ) = (N c )K ` (K ) ǫ (27) (28) (29) (3) (32) E o (N, ρ, Q) = N log E H» R y h R i q(x)p(y x,h) +ρ +ρ x x y (35) We compute the ranom coing error exponent in (34) for the training an communication scheme escribe in Sec II-C The result is summarize in the following theorem Theorem 2: The average probability of error for the training-base communication scheme is upper-boune by, P e e N[Etr r (N,R)] where Er tr (N, R) is given in (27) on the next page R max in (29) efines the maximum rate until which we have a non-zero error exponent (ecaying P e) The critical rate, R cr in (28) elineates the regime of the optimal parameter ρ that maximizes the exponent ρ = for 0 < R < R cr an ρ is given in (32) for R cr < R < R max The constant ǫ > 0 an is chosen very small (ǫ 0) so that the o() terms are negligible See [3] for more etails Note that the error exponent of the training an communication scheme in (27) epens only on SNR an N c = A Discussion of Results on Reliability SNR µ We investigate the behavior of the ranom coing exponent for ifferent values of µ as illustrate in Fig 3 for the given channel parameter set It is observe that for any transmission rate R, there exists an optimum value of µ = µ opt(r) for which the error exponent in (27) is maximum For any N, we formally efine µ opt(n, R) = arg max [Er (R, N, µ)] (36) µ ˆE tr r (N, R) in (27) explic- where we have written E r (R, N, µ) = itly as a function of µ to emphasize its epenance As we traverse from R = 0 to R = C coh (as in (8)), the optimal operating point at each rate is ictate by the value of µ opt in (36) an can be achieve by choosing T, W an P as in (23) Furthermore, the optimizing µ opt increases monotonically as we consier larger transmission rates In fact, using the results on capacity from Theorem, it follows that with µ =, we only obtain first-orer optimality an therefore the error exponent in Fig 3 is non-zero only for a fraction of the coherent capacity, C coh On the other han, at R = C coh, we woul require µ opt > 3 (secon-orer optimal) in orer to achieve a positive error exponent In Fig 4, we plot the error exponent in (27) as a function of the parameter µ for two ifferent transmission rates For each scenario, we observe that the error exponent is concave as a function of µ an is maximize at µ = µ opt Also illustrate in the figure is the error exponent with perfect CSI at the receiver that is an upper boun to Er tr (N, R) in (27) an ecreases monotonically with µ These plots reveal a funamental learnability versus iversity traeoff in sparse channels For any rate R, when µ < µ opt(r) (too little coherence), the system is in the learnability-limite regime an the error exponent of the training-base communication scheme is smaller ue to poor channel estimation performance On the other han when µ > µ opt(r) (too much coherence), we are in the iversity-limite regime an the hit taen by the error exponent here is ue to the inherent reuction in the egrees of freeom (DoF) (or elay-doppler iversity, D) The best exponent is obtaine at µ = µ opt(r), which emarcates the two regimes an escribes the optimal traeoff E r (N,R) / C coh µ = 09 µ = 08 W = 0 5 Hz, P/N 0 = 40 B, T m W = 0 6, δ = δ 2 = 05 µ = 0 N c = / SNR µ µ = µ = 2 µ = 3 µ = R / C coh Fig 3 Ranom coing error exponent versus rate for a sparse channel an for the training-base communication scheme Different curves correspon to ifferent values of µ in the ey relationship N c = SNR µ REFERENCES [] S Verú, Spectral Efficiency in the Wieban Regime, IEEE Trans Inform Theory, vol 48, no 6, pp , June 2002 [2] L Zheng, M Mear, an D N C Tse, Channel Coherence in the Low SNR Regime, Submitte, IEEE Trans Inform Theory, 2005 [3] A F Molisch, Ultrawieban Propagation Channels - Theory, Measurement an Moeling, IEEE Trans Veh Tech, vol 54, no 5, pp , Sept 2005

6 6 W = 0 5 Hz, P/N 0 = 40 B, T m W = 0 6, δ = δ 2 = R = 0, Perfect CSI R = 095 C coh, Perfect CSI R = 0, Training scheme R = 095 C coh, Training scheme E r (R, µ) / C coh µ Fig 4 Illustration of the learnability versus iversity traeoff for sparse channels The value of µ at which the maximum is attaine in each case efines µ opt(r) at the corresponing transmission rate R [4] R Saaane, D Aboutajine, A M Hayar, an R Knopp, On the Estimation of the Degrees of Freeom of Inoor UWB Channel, IEEE Veh Tech Conf (Spring), 2005 [5] A M Sayee an B Aazhang, Joint Multipath-Doppler Diversity in Mobile Wireless Communications, IEEE Trans Commun, pp 23 32, Jan 999 [6] R S Kenney, Faing Dispersive Communication Channels, Wiley InterScience, NY, 969 [7] R G Gallager, Information Theory an Reliable Communication, John Wiley an Sons Inc, 968 [8] A M Sayee an V V Veeravalli, Essential Degrees of Freeom in Space-Time Faing Channels, Proc 3th IEEE Intern Symp Pers Inoor, Mobile Raio Commun, vol 4, pp 52 56, Sept 2002 [9] K Liu, T Kaous, an A M Sayee, Orthogonal Time-Frequency Signaling over Doubly Dispersive Channels, IEEE Trans Inform Theory, vol 50, no, pp , Nov 2004 [0] W Koze, Aaptation of Weyl Heisenberg Frames to Unersprea Environments, in Gabor Analysis an Algorithm: Theory an Applications, H G Feichtinger an T Strohmer, Es Boston, MA, Birhäuser, pp , 997 [] V Raghavan, G Hariharan, an A M Sayee, Capacity of Sparse Multipath Channels in the Ultra-Wieban Regime, Submitte, IEEE Journal of Selecte Topics in Signal Proc, Dec 2006 [2] B Hassibi an B Hochwal, How Much Training is Neee in a Multiple Antenna Wireless Lin?, IEEE Trans Inform Theory, vol 49, no 4, pp , Apr 2003 [3] G Hariharan an A M Sayee, Minimum Probability of Error in Sparse Wieban Channels, 44th Annual Allerton Conference on Communication, Control an Computing, Sep 2006

Minimum Probability of Error in Sparse Wideband Channels

Minimum Probability of Error in Sparse Wideband Channels Minimum Probability of Error in Sparse Wideband Channels Gautham Hariharan and Abar M Sayeed Abstract This paper studies the impact of channel coherence and the role of channel state information CSI on

More information

Capacity Analysis of MIMO Systems with Unknown Channel State Information

Capacity Analysis of MIMO Systems with Unknown Channel State Information Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,

More information

Space-time Linear Dispersion Using Coordinate Interleaving

Space-time Linear Dispersion Using Coordinate Interleaving Space-time Linear Dispersion Using Coorinate Interleaving Jinsong Wu an Steven D Blostein Department of Electrical an Computer Engineering Queen s University, Kingston, Ontario, Canaa, K7L3N6 Email: wujs@ieeeorg

More information

Bandwidth expansion in joint source- channel coding and twisted modulation

Bandwidth expansion in joint source- channel coding and twisted modulation Banwith expansion in joint source- channel coing an twiste moulation Pål Aners Floor Tor A Ramsta Outline. Introuction to nonlinear mappings. Banwith expansion an Twiste moulation. Some history. Optimum

More information

An Analytical Expression of the Probability of Error for Relaying with Decode-and-forward

An Analytical Expression of the Probability of Error for Relaying with Decode-and-forward An Analytical Expression of the Probability of Error for Relaying with Decoe-an-forwar Alexanre Graell i Amat an Ingmar Lan Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France Email:

More information

Lower bounds on Locality Sensitive Hashing

Lower bounds on Locality Sensitive Hashing Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,

More information

Least-Squares Regression on Sparse Spaces

Least-Squares Regression on Sparse Spaces Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction

More information

Relative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation

Relative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation Relative Entropy an Score Function: New Information Estimation Relationships through Arbitrary Aitive Perturbation Dongning Guo Department of Electrical Engineering & Computer Science Northwestern University

More information

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments 2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor

More information

Topic 7: Convergence of Random Variables

Topic 7: Convergence of Random Variables Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information

More information

Leaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes

Leaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,

More information

A New Minimum Description Length

A New Minimum Description Length A New Minimum Description Length Soosan Beheshti, Munther A. Dahleh Laboratory for Information an Decision Systems Massachusetts Institute of Technology soosan@mit.eu,ahleh@lis.mit.eu Abstract The minimum

More information

Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Codes

Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Codes Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Coes Kaiann Fu an Achilleas Anastasopoulos Electrical Engineering an Computer Science Dept. University of Michigan, Ann Arbor, MI

More information

Throughput Optimal Control of Cooperative Relay Networks

Throughput Optimal Control of Cooperative Relay Networks hroughput Optimal Control of Cooperative Relay Networks Emun Yeh Dept. of Electrical Engineering Yale University New Haven, C 06520, USA E-mail: emun.yeh@yale.eu Ranall Berry Dept. of Electrical an Computer

More information

ensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y

ensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay

More information

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012 CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration

More information

Lower Bounds for the Smoothed Number of Pareto optimal Solutions

Lower Bounds for the Smoothed Number of Pareto optimal Solutions Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.

More information

On Characterizing the Delay-Performance of Wireless Scheduling Algorithms

On Characterizing the Delay-Performance of Wireless Scheduling Algorithms On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,

More information

arxiv: v1 [math.mg] 10 Apr 2018

arxiv: v1 [math.mg] 10 Apr 2018 ON THE VOLUME BOUND IN THE DVORETZKY ROGERS LEMMA FERENC FODOR, MÁRTON NASZÓDI, AND TAMÁS ZARNÓCZ arxiv:1804.03444v1 [math.mg] 10 Apr 2018 Abstract. The classical Dvoretzky Rogers lemma provies a eterministic

More information

On the Aloha throughput-fairness tradeoff

On the Aloha throughput-fairness tradeoff On the Aloha throughput-fairness traeoff 1 Nan Xie, Member, IEEE, an Steven Weber, Senior Member, IEEE Abstract arxiv:1605.01557v1 [cs.it] 5 May 2016 A well-known inner boun of the stability region of

More information

A LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM

A LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM Teor Imov r. ta Matem. Statist. Theor. Probability an Math. Statist. Vip. 81, 1 No. 81, 1, Pages 147 158 S 94-911)816- Article electronically publishe on January, 11 UDC 519.1 A LIMIT THEOREM FOR RANDOM

More information

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent

More information

Error Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation

Error Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation Error Floors in LDPC Coes: Fast Simulation, Bouns an Harware Emulation Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, an Martin J. Wainwright EECS Department University of

More information

Learning Automata in Games with Memory with Application to Circuit-Switched Routing

Learning Automata in Games with Memory with Application to Circuit-Switched Routing Learning Automata in Games with Memory with Application to Circuit-Switche Routing Murat Alanyali Abstract A general setting is consiere in which autonomous users interact by means of a finite-state controlle

More information

u!i = a T u = 0. Then S satisfies

u!i = a T u = 0. Then S satisfies Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace

More information

Wideband Fading Channel Capacity with Training and Partial Feedback

Wideband Fading Channel Capacity with Training and Partial Feedback Wideband Fading Channel Capacity with Training and Partial Feedback Manish Agarwal, Michael L. Honig ECE Department, Northwestern University 145 Sheridan Road, Evanston, IL 6008 USA {m-agarwal,mh}@northwestern.edu

More information

Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel

Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu

More information

Delay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy

Delay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy Delay Limite Capacity of A hoc Networks: Asymptotically Optimal Transmission an Relaying Strategy Eugene Perevalov Lehigh University Bethlehem, PA 85 Email: eup2@lehigh.eu Rick Blum Lehigh University Bethlehem,

More information

Correspondence. On the Average Near Far Resistance for MMSE Detection of Direct Sequence CDMA Signals with Random Spreading

Correspondence. On the Average Near Far Resistance for MMSE Detection of Direct Sequence CDMA Signals with Random Spreading IEEE TRANSACTIONS ON INFORMATION THEORY, VO. 45, NO. 6, SEPTEMBER 1999 2039 Corresponence On the Average Near Far Resistance for MMSE Detection of Direct Sequence CDMA Signals with Ranom Spreaing Upamanyu

More information

UNIFYING PCA AND MULTISCALE APPROACHES TO FAULT DETECTION AND ISOLATION

UNIFYING PCA AND MULTISCALE APPROACHES TO FAULT DETECTION AND ISOLATION UNIFYING AND MULISCALE APPROACHES O FAUL DEECION AND ISOLAION Seongkyu Yoon an John F. MacGregor Dept. Chemical Engineering, McMaster University, Hamilton Ontario Canaa L8S 4L7 yoons@mcmaster.ca macgreg@mcmaster.ca

More information

Analysis of Search Schemes in Cognitive Radio

Analysis of Search Schemes in Cognitive Radio Analysis of earch chemes in Cognitive Raio ing uo an umit Roy Department of Electrical Engineering University of Washington, eattle, WA 9895 Email: {luol,sroy}@u.washington.eu Abstract Cognitive Raio systems

More information

Math 342 Partial Differential Equations «Viktor Grigoryan

Math 342 Partial Differential Equations «Viktor Grigoryan Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite

More information

A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks

A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,

More information

Closed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device

Closed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device Close an Open Loop Optimal Control of Buffer an Energy of a Wireless Device V. S. Borkar School of Technology an Computer Science TIFR, umbai, Inia. borkar@tifr.res.in A. A. Kherani B. J. Prabhu INRIA

More information

Optimal Cooperative Spectrum Sensing in Cognitive Sensor Networks

Optimal Cooperative Spectrum Sensing in Cognitive Sensor Networks Optimal Cooperative Spectrum Sensing in Cognitive Sensor Networks Hai Ngoc Pham, an Zhang, Paal E. Engelsta,,3, Tor Skeie,, Frank Eliassen, Department of Informatics, University of Oslo, Norway Simula

More information

6 General properties of an autonomous system of two first order ODE

6 General properties of an autonomous system of two first order ODE 6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x

More information

Necessary and Sufficient Conditions for Sketched Subspace Clustering

Necessary and Sufficient Conditions for Sketched Subspace Clustering Necessary an Sufficient Conitions for Sketche Subspace Clustering Daniel Pimentel-Alarcón, Laura Balzano 2, Robert Nowak University of Wisconsin-Maison, 2 University of Michigan-Ann Arbor Abstract This

More information

Optimal CDMA Signatures: A Finite-Step Approach

Optimal CDMA Signatures: A Finite-Step Approach Optimal CDMA Signatures: A Finite-Step Approach Joel A. Tropp Inst. for Comp. Engr. an Sci. (ICES) 1 University Station C000 Austin, TX 7871 jtropp@ices.utexas.eu Inerjit. S. Dhillon Dept. of Comp. Sci.

More information

Generalization of the persistent random walk to dimensions greater than 1

Generalization of the persistent random walk to dimensions greater than 1 PHYSICAL REVIEW E VOLUME 58, NUMBER 6 DECEMBER 1998 Generalization of the persistent ranom walk to imensions greater than 1 Marián Boguñá, Josep M. Porrà, an Jaume Masoliver Departament e Física Fonamental,

More information

Lyapunov Functions. V. J. Venkataramanan and Xiaojun Lin. Center for Wireless Systems and Applications. School of Electrical and Computer Engineering,

Lyapunov Functions. V. J. Venkataramanan and Xiaojun Lin. Center for Wireless Systems and Applications. School of Electrical and Computer Engineering, On the Queue-Overflow Probability of Wireless Systems : A New Approach Combining Large Deviations with Lyapunov Functions V. J. Venkataramanan an Xiaojun Lin Center for Wireless Systems an Applications

More information

MASSIVE multiple-input multiple-output (MIMO) has

MASSIVE multiple-input multiple-output (MIMO) has IEEE SIGNAL PROCESSING LETTERS, VOL. 4, NO. 1, DECEMBER 017 1847 Spectral Efficiency uner Energy Constraint for Mixe-ADC MRC Massive MIMO Hessam Pirzaeh, Stuent Member, IEEE, an A. Lee Swinlehurst, Fellow,

More information

Image Denoising Using Spatial Adaptive Thresholding

Image Denoising Using Spatial Adaptive Thresholding International Journal of Engineering Technology, Management an Applie Sciences Image Denoising Using Spatial Aaptive Thresholing Raneesh Mishra M. Tech Stuent, Department of Electronics & Communication,

More information

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine

More information

IPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy

IPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy IPA Derivatives for Make-to-Stock Prouction-Inventory Systems With Backorers Uner the (Rr) Policy Yihong Fan a Benamin Melame b Yao Zhao c Yorai Wari Abstract This paper aresses Infinitesimal Perturbation

More information

Qubit channels that achieve capacity with two states

Qubit channels that achieve capacity with two states Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March

More information

LeChatelier Dynamics

LeChatelier Dynamics LeChatelier Dynamics Robert Gilmore Physics Department, Drexel University, Philaelphia, Pennsylvania 1914, USA (Date: June 12, 28, Levine Birthay Party: To be submitte.) Dynamics of the relaxation of a

More information

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,

More information

Introduction to the Vlasov-Poisson system

Introduction to the Vlasov-Poisson system Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its

More information

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische

More information

Monte Carlo Methods with Reduced Error

Monte Carlo Methods with Reduced Error Monte Carlo Methos with Reuce Error As has been shown, the probable error in Monte Carlo algorithms when no information about the smoothness of the function is use is Dξ r N = c N. It is important for

More information

Linear and quadratic approximation

Linear and quadratic approximation Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function

More information

Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets

Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Proceeings of the 4th East-European Conference on Avances in Databases an Information Systems ADBIS) 200 Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Eleftherios Tiakas, Apostolos.

More information

TDD Linear Precoding Methods for Next Generation Mobile Communication Systems

TDD Linear Precoding Methods for Next Generation Mobile Communication Systems MEE10:118 Master s Thesis Electrical Engineering with emphasis on Raio Communications TDD Linear Precoing Methos for Next Generation Mobile Communication Systems Author: Yuan Ding Email: ingyuan.hit@gmail.com

More information

Table of Common Derivatives By David Abraham

Table of Common Derivatives By David Abraham Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec

More information

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control 19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior

More information

Lecture 8: MIMO Architectures (II) Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH

Lecture 8: MIMO Architectures (II) Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH MIMO : MIMO Theoretical Foundations of Wireless Communications 1 Wednesday, May 25, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 20 Overview MIMO

More information

Analyzing Tensor Power Method Dynamics in Overcomplete Regime

Analyzing Tensor Power Method Dynamics in Overcomplete Regime Journal of Machine Learning Research 18 (2017) 1-40 Submitte 9/15; Revise 11/16; Publishe 4/17 Analyzing Tensor Power Metho Dynamics in Overcomplete Regime Animashree Ananumar Department of Electrical

More information

Calculus and optimization

Calculus and optimization Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in

More information

Convergence of Random Walks

Convergence of Random Walks Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner

More information

Decoding Delay and Outage Performance Analysis of Full-Duplex Decode-Forward Relaying: Backward or Sliding Window Decoding

Decoding Delay and Outage Performance Analysis of Full-Duplex Decode-Forward Relaying: Backward or Sliding Window Decoding Decoing Delay an Outage Performance Analysis of Full-Duplex Decoe-Forwar Relaying: Backwar or Sliing Winow Decoing Ahma Abu Al Haija Member IEEE an Chintha Tellambura Fellow IEEE Abstract High reliability

More information

Calculus of Variations

Calculus of Variations 16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t

More information

Slide10 Haykin Chapter 14: Neurodynamics (3rd Ed. Chapter 13)

Slide10 Haykin Chapter 14: Neurodynamics (3rd Ed. Chapter 13) Slie10 Haykin Chapter 14: Neuroynamics (3r E. Chapter 13) CPSC 636-600 Instructor: Yoonsuck Choe Spring 2012 Neural Networks with Temporal Behavior Inclusion of feeback gives temporal characteristics to

More information

Multiuser Capacity in Block Fading Channel

Multiuser Capacity in Block Fading Channel Multiuser Capacity in Block Fading Channel April 2003 1 Introduction and Model We use a block-fading model, with coherence interval T where M independent users simultaneously transmit to a single receiver

More information

Generalized Tractability for Multivariate Problems

Generalized Tractability for Multivariate Problems Generalize Tractability for Multivariate Problems Part II: Linear Tensor Prouct Problems, Linear Information, an Unrestricte Tractability Michael Gnewuch Department of Computer Science, University of Kiel,

More information

Logarithmic spurious regressions

Logarithmic spurious regressions Logarithmic spurious regressions Robert M. e Jong Michigan State University February 5, 22 Abstract Spurious regressions, i.e. regressions in which an integrate process is regresse on another integrate

More information

05 The Continuum Limit and the Wave Equation

05 The Continuum Limit and the Wave Equation Utah State University DigitalCommons@USU Founations of Wave Phenomena Physics, Department of 1-1-2004 05 The Continuum Limit an the Wave Equation Charles G. Torre Department of Physics, Utah State University,

More information

Math 115 Section 018 Course Note

Math 115 Section 018 Course Note Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of

More information

DETERMINING the information theoretic capacity of

DETERMINING the information theoretic capacity of IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 7, JULY 007 369 Transactions Letters Outage Capacity and Optimal Power Allocation for Multiple Time-Scale Parallel Fading Channels Subhrakanti

More information

Multiple Antennas in Wireless Communications

Multiple Antennas in Wireless Communications Multiple Antennas in Wireless Communications Luca Sanguinetti Department of Information Engineering Pisa University luca.sanguinetti@iet.unipi.it April, 2009 Luca Sanguinetti (IET) MIMO April, 2009 1 /

More information

Sturm-Liouville Theory

Sturm-Liouville Theory LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory

More information

Multi-edge Optimization of Low-Density Parity-Check Codes for Joint Source-Channel Coding

Multi-edge Optimization of Low-Density Parity-Check Codes for Joint Source-Channel Coding Multi-ege Optimization of Low-Density Parity-Check Coes for Joint Source-Channel Coing H. V. Beltrão Neto an W. Henkel Jacobs University Bremen Campus Ring 1 D-28759 Bremen, Germany Email: {h.beltrao,

More information

Optimum design of tuned mass damper systems for seismic structures

Optimum design of tuned mass damper systems for seismic structures Earthquake Resistant Engineering Structures VII 175 Optimum esign of tune mass amper systems for seismic structures I. Abulsalam, M. Al-Janabi & M. G. Al-Taweel Department of Civil Engineering, Faculty

More information

The Principle of Least Action

The Principle of Least Action Chapter 7. The Principle of Least Action 7.1 Force Methos vs. Energy Methos We have so far stuie two istinct ways of analyzing physics problems: force methos, basically consisting of the application of

More information

Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs

Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite

More information

On the Relationship Between Mutual Information and Bit Error Probability for Some Linear Dispersion Codes

On the Relationship Between Mutual Information and Bit Error Probability for Some Linear Dispersion Codes 9 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO., JANUARY 29 On the Relationship Between Mutual Information an Bit Error Probability for Some Linear Dispersion Coes Xianglan Jin, Jae-Dong Yang,

More information

7.1 Support Vector Machine

7.1 Support Vector Machine 67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to

More information

Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification

Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection an System Ientification Borhan M Sananaji, Tyrone L Vincent, an Michael B Wakin Abstract In this paper,

More information

How to Minimize Maximum Regret in Repeated Decision-Making

How to Minimize Maximum Regret in Repeated Decision-Making How to Minimize Maximum Regret in Repeate Decision-Making Karl H. Schlag July 3 2003 Economics Department, European University Institute, Via ella Piazzuola 43, 033 Florence, Italy, Tel: 0039-0-4689, email:

More information

A simple model for the small-strain behaviour of soils

A simple model for the small-strain behaviour of soils A simple moel for the small-strain behaviour of soils José Jorge Naer Department of Structural an Geotechnical ngineering, Polytechnic School, University of São Paulo 05508-900, São Paulo, Brazil, e-mail:

More information

Separation of Variables

Separation of Variables Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical

More information

Optimal Design of Phase Function in Generalized DFT

Optimal Design of Phase Function in Generalized DFT Optimal Design of Phase Function in Generalize DFT Ali N. Aansu, Hanan Agirman-Tosun an Mustafa U. Torun New Jersey Institute of Technology Department of Electrical & Computer Engineering University Heights,

More information

User Selection Criteria for Multiuser Systems With Optimal and Suboptimal LR Based Detectors REFERENCES. Jinho Choi and Fumiyuki Adachi

User Selection Criteria for Multiuser Systems With Optimal and Suboptimal LR Based Detectors REFERENCES. Jinho Choi and Fumiyuki Adachi IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 58, NO. 10, OCTOBER 2010 5463 REFERENCES [1] I. E. Telatar, Capacity of multi-antenna Gaussian channels, Eur. Trans. Telecommun., vol. 10, pp. 585 595, Nov.

More information

Node Density and Delay in Large-Scale Wireless Networks with Unreliable Links

Node Density and Delay in Large-Scale Wireless Networks with Unreliable Links Noe Density an Delay in Large-Scale Wireless Networks with Unreliable Links Shizhen Zhao, Xinbing Wang Department of Electronic Engineering Shanghai Jiao Tong University, China Email: {shizhenzhao,xwang}@sjtu.eu.cn

More information

Chapter 2 Lagrangian Modeling

Chapter 2 Lagrangian Modeling Chapter 2 Lagrangian Moeling The basic laws of physics are use to moel every system whether it is electrical, mechanical, hyraulic, or any other energy omain. In mechanics, Newton s laws of motion provie

More information

APPLICATION of compressed sensing (CS) in radar signal

APPLICATION of compressed sensing (CS) in radar signal A Novel Joint Compressive Single Target Detection an Parameter Estimation in Raar without Signal Reconstruction Alireza Hariri, Massou Babaie-Zaeh Department of Electrical Engineering, Sharif University

More information

4. Important theorems in quantum mechanics

4. Important theorems in quantum mechanics TFY4215 Kjemisk fysikk og kvantemekanikk - Tillegg 4 1 TILLEGG 4 4. Important theorems in quantum mechanics Before attacking three-imensional potentials in the next chapter, we shall in chapter 4 of this

More information

Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners

Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners Lower Bouns for Local Monotonicity Reconstruction from Transitive-Closure Spanners Arnab Bhattacharyya Elena Grigorescu Mahav Jha Kyomin Jung Sofya Raskhonikova Davi P. Wooruff Abstract Given a irecte

More information

THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE

THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE Journal of Soun an Vibration (1996) 191(3), 397 414 THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE E. M. WEINSTEIN Galaxy Scientific Corporation, 2500 English Creek

More information

Number of wireless sensors needed to detect a wildfire

Number of wireless sensors needed to detect a wildfire Number of wireless sensors neee to etect a wilfire Pablo I. Fierens Instituto Tecnológico e Buenos Aires (ITBA) Physics an Mathematics Department Av. Maero 399, Buenos Aires, (C1106ACD) Argentina pfierens@itba.eu.ar

More information

A. Incorrect! The letter t does not appear in the expression of the given integral

A. Incorrect! The letter t does not appear in the expression of the given integral AP Physics C - Problem Drill 1: The Funamental Theorem of Calculus Question No. 1 of 1 Instruction: (1) Rea the problem statement an answer choices carefully () Work the problems on paper as neee (3) Question

More information

arxiv: v2 [cond-mat.stat-mech] 11 Nov 2016

arxiv: v2 [cond-mat.stat-mech] 11 Nov 2016 Noname manuscript No. (will be inserte by the eitor) Scaling properties of the number of ranom sequential asorption iterations neee to generate saturate ranom packing arxiv:607.06668v2 [con-mat.stat-mech]

More information

FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction

FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number

More information

How Much Training and Feedback are Needed in MIMO Broadcast Channels?

How Much Training and Feedback are Needed in MIMO Broadcast Channels? How uch raining and Feedback are Needed in IO Broadcast Channels? ari Kobayashi, SUPELEC Gif-sur-Yvette, France Giuseppe Caire, University of Southern California Los Angeles CA, 989 USA Nihar Jindal University

More information

Non Orthogonal Multiple Access for 5G and beyond

Non Orthogonal Multiple Access for 5G and beyond Non Orthogonal Multiple Access for 5G and beyond DIET- Sapienza University of Rome mai.le.it@ieee.org November 23, 2018 Outline 1 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density

More information

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013 Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing

More information

Wireless Communications

Wireless Communications Wireless Communications Cannel Moeling Large Scale Hami Barami Electrical & Computer Engineering EM Spectrum Raio Wave l Raio wave: a form of electromagnetic raiation, create wenever a carge object accelerates

More information

Some Examples. Uniform motion. Poisson processes on the real line

Some Examples. Uniform motion. Poisson processes on the real line Some Examples Our immeiate goal is to see some examples of Lévy processes, an/or infinitely-ivisible laws on. Uniform motion Choose an fix a nonranom an efine X := for all (1) Then, {X } is a [nonranom]

More information

Equilibrium in Queues Under Unknown Service Times and Service Value

Equilibrium in Queues Under Unknown Service Times and Service Value University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University

More information