Resource Allocation via Linear Programming for Fractional Cooperation
|
|
- Opal Preston
- 5 years ago
- Views:
Transcription
1 1 Resource Aocation via Linear Programming for Fractiona Cooperation Nariman Farsad and Andrew W Ecford Abstract In this etter, resource aocation is considered for arge muti-source, muti-reay networs empoying fractiona cooperation, in which each potentia reay ony aocates a fraction of its resources to reaying Using a Gaussian approximation, it is shown that the optimization can be posed as a inear program, where the reays use a demoduate-and-forward (F) strategy, and where the transmissions are protected ow-density paritychec (LDPC) codes This is usefu since existing optimization schemes for this probem are nonconvex I INTRODUCTION In wireess networs, spatia distribution of nodes generay resuts in independent fading on different ins This spatia distribution can be expoited in cooperative diversity [1], [2], where each node can assist its neighbours in transmitting information to a data sin In its simpest form, a cooperative system is a reay system consisting of three nodes: a source, a reay, and a destination The reay can use various cooperative schemes such as decode-and-forward (DF) [3] and demoduate-and-forward (F) [4], [5], to assist the source in transmitting its information bits to the destination In most wireess networs, a source node is typicay in radio range of mutipe reays Fractiona cooperation [6] is a ow-compexity cooperative scheme for such muti-reay systems, often used in conjunction with F (though it can aso be used with DF) Using this scheme, a arge number of reays forward a sma fraction of the source s transmission bits, so that the reaying cost is spread over a arge number of reays This scheme has good diversity order properties in fading channes A ey chaenge in fractiona cooperation is resource aocation, in which the system determines what fraction must be seected for transmission each reay This chaenge is exacerbated in systems with mutipe sources, a of which are competing for the same fractiona resource at the reays In ight of this chaenge, this etter maes two concusions: Resource aocation in mutipe-source, mutipe-reay fractiona cooperation networs can be posed as an instance of inear programming Our optimization minimizes the number of transmission bits (ie, energy), subject to the constraint that decoding at the destination is successfu Our approach is particuary usefu since Submitted to IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, September 27, 2010; revised Apri 2, 2011 and October 7, 2011; accepted January 20, 2012 Materia in this etter was presented in part at the IEEE Internationa Conference on Communications, Cape Town, South Africa, 2010 This wor was financiay supported a Discovery Grant from the Natura Sciences and Engineering Research Counci The authors are with the Department of Computer Science and Engineering, Yor University, 4700 Keee Street, Toronto, Ontario, Canada M3J 1P3 E-mais: nariman@cseyoruca, aecford@yoruca efficient optimization agorithms are not nown to exist for this probem; an earier approach, based on the union bound, resuted in nonconvex optimization [7] The optima resource aocations found our method are not, in genera, equivaent to seection: we give exampes in which mutipe sources and reays are assigned some fraction that is equa to neither its maximum nor minimum possibe contribution This suggests that there is not aways a best reay for a source using fractiona cooperation with F Our optimization strategy is simiar to the use of inear programming to optimize ow-density parity-chec (LDPC) codes [8]: a Gaussian approximation is used, which mae the objective and constraints a inear Reated wor aso incudes [9] [11], where extrinsic information transfer (EXIT) chart techniques [12] were used for code optimization for reays, not resource aocation A Channe Mode II SYSTEM MODEL Our system uses F aong with fractiona cooperation (the reader is directed to [6] for compete detais) In fractiona cooperation, instead of forwarding the entire source s transmission sequence the reay nodes seect a random portion of the source s transmission bits for reaying Because of this random seection, some of the source s transmission bits wi not be received at the destination The source empoys powerfu error correcting codes to encodes its transmission bits, there ensuring successfu reconstruction of its symbos at the destination despite the missing bits Furthermore, F is used for its ow compexity Consider s sources, r reays, and a singe destination, as in Figure 1 The r reays are shared amongst a s sources Let S i and R j represent the ith source and jth reay, respectivey Each source has a ength-n information sequence to transfer to the destination represented x (Si) = [x (Si) 1,x (Si) 2,,x n (Si) ], where x (Si) {0, 1} Each source encodes its information sequence using an LDPC code Let ρ 1,ρ 2,,ρ s be the code rates at each source Therefore, the codeword ready for transmission at the ith source is represented z (Si) = [z (Si) 1,z (Si) 2,,z m (Si) i ], where m i = n/ρ i is the ength of the codeword We assume a ins are independent additive white Gaussian noise (AWGN) channes, represented with their respective channe signa-to-noise ratio (SNR) (The channes are AWGN since the channe state information is assumed to be nown, but we wi consider cases where the SNR is random and arises from Rayeigh-distributed channe ampitudes) There are s
2 2 S 1 S 2 Fig 1 S s R 1 R 2 R r Muti-Source, Muti-reay mode source-to-destination (S-D) ins, r reay-to-destination (R-D) ins, and sr source-to-reay (S-R) ins We assume these communication ins use binary phase-shift eying (BPSK) for data moduation We define the function φ : {0,1} {+1, 1} as the moduation function where 0 is mapped to a +1 and 1 is mapped to -1 The S-D ins are therefore given y (Si,D) = φ(z (Si) )+n (Si,D), (1) where n (Si,D) is AWGN with variance σ(s 2 i,d) The channe SNRs for each of the s S-D ins are represented γ (Si,D) = 1/(2σ(S 2 i,d) ) The S-R ins are aso given D y (Si,Rj) = φ(z (Si) )+n (Si,Rj), (2) wheres i and R j correspond to the ith source and the jth reay respectivey and n (Si,Rj) is AWGN with variance σ(s 2 i,r j) Therefore, a the S-R ins can be represented sr channe SNRs, γ (Si,R j) = 1/(2σ(S 2 ) i,r j) In F, a reay first demoduates the signa received from a source With sight abuse of the inverse notation, the demoduation function is defined as φ 1 : R {0,1}, where { φ 1 0 if y 0 (y) =, (3) 1 otherwise Thus, the F process can be formuated as z (Si,Rj) = φ 1 (y (Si,Rj) ), (4) where z (Si,Rj) is the resuts of hard decisions (demoduation) for the jth reay assisting ith source Each reay then seects a fraction of the demoduated signa, re-encodes it using error correcting codes and transmits to the destination The vector b (Si,Rj) represents the demoduated bit positions seected for transmission to the destination: if b (Si,Rj) = 1, then the th bit is reayed; if b (Si,Rj) = 0, then the th bit is not reayed The vector b (Si,Rj), has a Hamming weight of m i ǫ (i,j), where ǫ (i,j) is the fraction to be forwarded the jth reay for the ithe source Thus, the reaying fraction ǫ (Si,R j) is defined as mi i=1 ǫ (Si,R j) = b(si,rj) (5) m i This random seection of bits is simiar to puncturing codes, and can be carried out using pseudorandom number generators Finay, transmission to the destination is encoded using a powerfu and capacity-approaching error-correcting code We wi consider two cases in the seque: first, we assume that decoding is successfu at the destination, with an energy cost equa to the in capacity; and second, we use a particuar punctured systematic repeat-accumuate (PSRA) code [6], with possibe decoding faiures If the code is decoded successfuy, the demoduated sequence resuting from the jth reay assisting ith source is avaiabe at the destination as y (Si,Rj,D) F = b (Si,Rj) φ(z (Si,Rj) ), (6) where is eement-wise mutipication of vectors, z (Si,Rj) is given equation (4), and y (Si,Rj,D) represents the resuts of demoduations avaiabe at the destination The eements of can tae three possibe vaues: +1 (representing a demoduated 0 bit), 1 (representing a demoduated 1 bit), and 0 (representing an unseected bit, ain to an erasure) y (Si,Rj,D) F B Fractiona Cooperation and Protoco Here we present a brief and simpe protoco for fractiona cooperation (A simiar protoco, minus the optimization, was impemented in hardware in [15]) 1) Each in is an orthogona channe The channe state information (CSI) of a the ins are nown to the destination, and the destination performs the optimization For each S-R in, the reay estimates the SNR γ (Si,R j) and informs the destination; for the S-D and each R-D in, the destination estimates the SNR The destination performs the optimization and transmits the required fractions ǫ (Si,R j), for each source S i, and the required R-D code rates, to every reay R j (This exchange is infrequent and invoves itte overhead if the environment is static or sow-moving) 2) Each source encodes its information using LDPC codes, and broadcasts the encoded codeword to the r reays, as we as the destination 3) (F) For each source S i, reay R j observes m i bits The reay demoduates symbos from S i, without decoding the underying codewords 4) (Fractiona Cooperation) For each source S i, R j seects m i ǫ (Si,R j) of the demoduated bits for reaying (noting that ǫ (Si,R j) is possi zero) We assume the reays use a pseudorandom number generator to randomy seect the symbos to be forwarded, with seed transmitted to the destination Note that, aside from nowedge of the seed at the destination, there is no coordination of the seection among reays themseves 5) The jth reay re-encodes the m i ǫ (Si,R j) bits using error correcting codes, at a rate specified the destination, and transmits the resuting codeword to the destination The destination then decodes each source s information
3 3 bits using the received signa from the r reays, and finay the source itsef III LINEAR PROGRAMMING MODEL In this section we present a inear programming mode that minimizes the number of transmission bits of a muti-source muti-reay system, described in the previous section, subject to the constraint of successfu transmission We consider the muti-reay, muti-source system, expained in section II, with r reays and s sources As is typica for anaysis of LDPC decoding, we assume that the sources transmit the a-zero codeword (ie, the a-(+1) channe codeword) For codes with asymptoticay ong boc ength, the convergence of LDPC decoding is soey dependent on the distribution of the channe og-ieihood ratio (LLR) [13], given for a bit x x = ogf Y (y x = 0)/f Y (y x = 1), where y represents a observations of x avaiabe to the receiver Letting γ (Si,D) represent the SNR on the ith S-D in, the vector of channe LLRs for a symbos on the S-D ins is cacuated as (Si,D) = 2y (Si,D) /σ 2 (S i,d) = 4γ (S i,d)y (Si,D), (7) and for the S-R ins as (Si,Rj,D) F = y (Si,Rj,D) F og [ ] 1, (8) where is the probabiity of demoduation error between the ith source and jth reay, given = 1 2 erfc( γ(si,r j)) (9) LLRs of independent observations of a symbo, such as those passed aong different reay ins, are additive Consequenty, the message LLR input to the iterative LDPC decoder of the ith source can be cacuated as (Si) F = (Si,D) + j=1 (Si,Rj,D) F (10) As is assumed in the EXIT chart iterature, in (10) we assume that the distribution of (Si) F can be approximated the Gaussian distribution (This assumption is reasonabe if the number of component messages r is sufficienty arge, but high accuracy is not essentia here: anaysis of LDPC decoding under this assumption is nown to be robust even if the true distribution is quite far from Gaussian; cf [8]) Furthermore, a property of Gaussian-distributed LLRs is that the distribution is symmetric [14], with variance equa to twice the mean Thus, we may use the mean of the LLR messages to represent their distribution, and hence to determine whether LDPC coding converges or not: this is the ey observation which aows us to use inear programming Assuming a symmetric Gaussian-distributed LLR, a minimum channe LLR mean is required for successfu decoding, written m min This vaue can be cacuated using EXIT chart anaysis, density evoution, or simuation Let m represent the mean of the channe LLR messages; then the constraint m m min (11) is (approximatey) sufficient to ensure successfu decoding This mean may be different for each source, so we wi write m (i) min to represent the minimum LLR for the ith source The foowing resut gives the cacuation of the input LLR mean to the decoder for F Proposition 1: For the system described in section II, assuming that the reays use F, the channe mean that is input to the iterative decoder for the ith source, S i, is given m (F) i =2γ (Si,D)+ (12) ǫ (Si,R j)(1 2 )og 1, j=0 where γ (Si,D) is the channe SNR between the ith source and the destination, is the probabiity of hard decision error at the reay given equation (9) andǫ (Si,R j) the fraction seected each reay Proof: Taing the expected vaue of (10), since we have assumed that the transmission bits over R-D ins are decoded successfuy, we have m (F) i = m (Si,D) + r j=0 m(si,rj) For the singe S-D in the channe LLR mean is cacuated as m (Si,D) = 2γ (Si,D), where γ (Si,D) is the channe SNR of the S-D in for the ith source, which gives the first term Now, depends on the crossover probabiity on the (S i,r j ) in, as we as the probabiity of seection ǫ (Si,R j) If a bits are reayed, = (1 2 )og 1 (13) In fractiona cooperation, unseected positions have zero LLR (ie an erasure) Thus, = ǫ (Si,R j)(1 2 )og 1, (14) and the proposition foows We are now ready to set up the inear program In our mode the objective is to minimize the number of transmitted bits (equivaent to minimizing energy) with the constraint of successfu decoding at the destination The objective variabes are ǫ (Si,R j), the forwarding fractions of reays Define the objective vector of ength sr, ǫ, as ǫ = Ț ǫ (1,1) ǫ (1,r) ǫ (2,1) ǫ (2,r) ǫ (s,1) ǫ (s,r) (15) representing the fractions that are seected for transmission each reay for each source The objective function gives the tota energy consumption of the system If F is used the reays, and theith source has a codeword of ength m i to transmit to the destination, the tota energy consists of the energy required for the sources to transmit (proportiona to m i for the ith source), pus the energy committed the reays to forward a fraction of each source (for the ith source and jth reay, proportiona to ǫ (Si,R j)m i /r i,j, where r i,j is the rate of the jth reay s code)
4 4 Thus, the objective function is given s s ǫ (Si,R f(ǫ) = m i + j)m i (16) r i,j i=0 Since in Section II we assumed that powerfu capacity approaching codes are used over the R-D ins to ensure successfu decoding at the destination, we can repace r i,j with the capacity of the corresponding channe We can aso omit terms not in ǫ since they have no effect on the optimization Therefore, the objective function becomes f(ǫ) = s ǫ (Si,R j)m i C(γ (Rj,D)), (17) where C(γ (Rj,D)) is the channe capacity between jth reay and the destination Note that f(ǫ) is inear in ǫ To derive the constraints for F, we define a variabe g (Si,Rj) as [ g (Si,R j) = (1 2 )og ] 1, (18) where the term on the right side is derived in equation (13), and represents the R-D in channe LLR mean before fractiona seection at the reays An s (sr) matrix, G SR, is defined such that the s rows of the matrix represent the sources, and the sr coumns represent the S-R channes The coumns are isted in the order of (S 1,R 1 ) (S 1,R r ) (S 2,R 1 ) (S 2,R r ) (S s,r r ), which represents the reays 1 through r forwarding for the first source, and then for the second source, and so on For the ith, row the ony nonzero eements are coumns (S i,r 1 ) to (S i,r r ), where the vaues are g (Si,R 1) to g (Si,R r) respectivey Therefore, using the row vector g i,sr = [g (Si,R 1),g (Si,R 2),,g (Si,R r)], the matrix G SR is then given g 1,SR 0 r 0 r 0 r g 2,SR 0 r G SR =, (19) 0 r 0 r g s,sr [m (1) min m (2) min where 0 r is a row vector of r zeros Let m min = m (s) min ] T represent the vector of minimum LLR means to ensure successfu decoding Aso et γ SD = [γ (S1,D) γ (S2,D) γ (Ss,D)] T represent the vector of S-D channe SNRs Then, from Proposition 1, the successfu decoding constraint may be stated in terms of ǫ as G SR ǫ m min 2γ SD, (20) Further constraints are required on ǫ to obtain a meaningfu resut, namey that 0 ǫ (Si,R j) ǫ (S i,r j), (21) where ǫ (S i,r j) 1 Additiona constraints may aso be added, depending on the appication Given the objective function in (17) and constraints in (20)-(21), the inear program may be stated competey as foows: Error Rate FER (EXIT 252) FER (Density 259) BER (EXIT 252) BER (Density 259) Vaue added to non zero εs Fig 2 Average frame error rate (FER) and bit error rate (BER) for 5 source, 50 reay system versus the vaue added to the non-zero fractions FER and BER are averaged over a 5 sources A sources use reguar (3,6) LDPC code with codeword ength of 10,000 The normaized SNR of a ins are derived from Rayeigh distributed random variabe Both EXIT chart threshod (m min = 252) and density evoution threshod (m min = 259) are considered Minimize subject to f(ǫ) = s ǫ (Si,R j)m i C(γ (Rj,D)) (22) G SR ǫ m min 2γ SD ; ǫ 0; ǫ ǫ, (23) where 0 is an a-zero vector the same ength as ǫ, and ǫ is the vector of ǫ (S i,r j) corresponding to ǫ IV RESULTS For a of our simuations we use a (3,6) reguar LDPC code at every source as we as a simiar codeword ength To iustrate the sensitivity of our method to an accurate vaue of m min, we present resuts deriving m min from both EXIT charts and density evoution: we have m min = 252 and m min = 259 for EXIT charts and density evoution, respectivey The codeword ength is 10,000 bits, and reported bit error rate (BERs) / frame error rates (FERs) are averaged over a sources For our first set of simuations, we consider a cooperative scheme with 5 sources and 50 reays, and we assume the reays transmission bits are perfecty decoded at the destination We use a channe where every in has an independent Rayeigh-distributed signa strength; thus, the channe SNRs γ on a the ins are independent, identicay χ 2 -distributed random variabes with two degrees of freedom For these resuts, we use f Γ (γ) = 1/01265exp( γ/01265), giving an average SNR of 898dB Aso, we setǫ (S i,r j) = 025 instead of 1 (ie, each reay may be unwiing to forward a the bits it receives), and add an extra constraint as 5 i=1 ǫ (S i,r j) 1 (ie, the reay s maximum reaying commitment does not exceed the equivaent of a singe source) Figure 2 shows the
5 5 TABLE I VALUES OF ǫ BASED ON EXIT CHART AND DENSITY EVOLUTION THRESHOLDS Reay S 1 (EXIT, Dens) S 2 (EXIT, Dens) S 3 (EXIT, Dens) S 4 (EXIT, Dens) S 5 (EXIT, Dens) R 4 (0 0 ) (0 025 ) (0 0 ) ( ) ( ) R 16 ( ) ( ) ( ) ( ) ( ) R 20 (0 025 ) (0 0 ) ( ) (0 0 ) ( ) R 26 ( ) ( ) ( ) ( ) ( ) R 32 ( ) ( ) (0 0 ) ( ) (0 0 ) R 38 ( ) ( ) ( ) ( ) ( ) 10 0 mode We see that the BER and FER waterfas start right at the predicted threshod Error Rate FER (EXIT 252) FER (Density 259) BER (EXIT 252) BER (Density 259) Vaue added to non zero εs Fig 3 Average frame error rate (FER) and bit error rate (BER) for 2 source, 7 reay system versus the vaue added to the non-zero fractions R-D ins transmission symbos are encoded using PSRA codes with rates seected based on the channe SNR FER and BER are averaged over the 2 sources A sources use reguar (3,6) LDPC code with codeword ength of 10,000 The normaized SNR of a ins are derived from Rayeigh distributed random variabe Both EXIT chart threshod (m min = 252) and density evoution threshod (m min = 259) are considered average BER and FER versus the vaue that is added to nonzero ǫ (Si,R j) that were obtained using the inear programming mode Tabe I iustrates the fractions cacuated our inear programming mode for the 5 source, 50 reay system considered in Figure 2 We observe that not a the reays are forwarding the maximum fraction of 025; for instance, the density evoution resuts for sources 1, 3, and 5 show fractions being spit among mutipe reays Thus, in genera, the optima strategy is not equivaent to reay seection For our second set of simuations, we consider a cooperative scheme with 2 sources and 7 reays Here, we use PSRA codes over reaistic R-D ins, where the code rates are seected based on the density evoution threshod of the PSRA code for a given channe SNR For these resuts, we use f Γ (γ) = exp( γ), giving an average SNR of 0dB Aso, we set ǫ (S i,r j) = 025, and add an extra constraint as 5 i=1 ǫ (S i,r j) 04 (ie, the reay s maximum reaying commitment does not exceed the equivaent of a 04 source) Figure 3 shows the average frame error rate (FER) and bit error rate (BER) of the system versus the vaue that is added to nonzero ǫ (Si,R j) that were obtained using the inear programming REFERENCES [1] A Sendonaris, E Erip, and B Aazhang, User cooperation diversitypart I: system description, IEEE Trans Commun, vo 51, pp , Nov 2003 [2] A Sendonaris, E Erip, and B Aazhang, User cooperation diversity, Part II: Impementation aspects and performance anaysis, IEEE Trans Commun, vo 51, pp , Nov 2003 [3] A Nosratinia, T Hunter, and A Hedayat, Cooperative communication in wireess networs, IEEE Commun Mag, vo 42, no 10, pp 68 73, October 2004 [4] D Chen and J N Laneman, Moduation and demoduation for cooperative diversity in wireess systems, IEEE Trans on Wireess Commun, vo 5, no 7, pp , Ju 2006 [5] J P K Chu and R S Adve, Impementation of co-operative diversity using message-passing in wireess sensor networs, in Proc IEEE Gobecom, St Louis, MO, pp , Dec 2005 [6] A W Ecford, J P K Chu, and R S Adve, Low compexity and fractiona coded cooperation for wireess networs, IEEE Trans Wireess Commun, vo 7, no 5, pp , May 2008 [7] J P K Chu, A W Ecford, and R S Adve, Optimization for fractiona cooperation in mutipe-source mutipe-reay systems, in Proc IEEE Internationa Conference on Communications, Dresden, Germany, Jun 2009 [8] M Ardaani and F R Kschischang, A more accurate one-dimensiona anaysis and design of LDPC codes, IEEE Trans Commun, vo 52, no 12, pp , Dec 2004 [9] P Razaghi and W Yu, Biayer ow-density parity-chec codes for decode-and-forward in reay channes, IEEE Trans Inform Theory, vo 53, no 10, pp , Oct 2007 [10] R Thobaben, On Distributed Codes with Noisy Reays, in Proc Asiomar Conference on Signas, Systems, and Computers, Pacific Grove, CA, USA, Oct 2008 [11] J Hu and T M Duman, LDPC codes over ergodic and non-ergodic reay channes, in Proc 44th Annua Aerton Conference on Communications, Contro, and Computing, Monticeo, IL, USA, Sep 2006 [12] S ten Brin, Convergence of iterative decoding, Eectron Lett, vo 35, no 10, pp , May 1999 [13] T J Richardson and R Urbane, The capacity of ow-density paritychec codes under message-passing decoding, IEEE Trans Inform Theory, pp , Feb 2001 [14] T J Richardson, M Shoroahi, and R Urbane, Design of capacityapproaching irreguar ow-density parity-chec codes, IEEE Trans Inform Theory, pp , Feb 2001 [15] A Cace, N Farsad, and A W Ecford, An experimenta study of fractiona cooperation in wireess mesh networs, in Proc 22nd Annua IEEE Symposium on Persona Indoor Mobie Radio Communications (PIMRC), Toronto, ON, pp , 2011
Resource Allocation via Linear Programming for Multi-Source, Multi-Relay Wireless Networks
Resource Aocation via Linear Programming for Muti-Source, Muti-Reay Wireess Networs Nariman Farsad and Andrew W Ecford Dept of Computer Science and Engineering, Yor University 4700 Keee Street, Toronto,
More informationRateless Codes for the Gaussian Multiple Access Channel
Rateess Codes for the Gaussian Mutipe Access Channe Urs Niesen Emai: uniesen@mitedu Uri Erez Dept EE, Te Aviv University Te Aviv, Israe Emai: uri@engtauaci Devavrat Shah Emai: devavrat@mitedu Gregory W
More informationEffect of Estimation Error on Adaptive L-MRC Receiver over Nakagami-m Fading Channels
Internationa Journa of Appied Engineering Research ISSN 973-456 Voume 3, Number 5 (8) pp. 77-83 Research India Pubications. http://www.ripubication.com Effect of Estimation Error on Adaptive -MRC Receiver
More informationA capacity-approaching coded modulation scheme for non-coherent fading channels
Louisiana State University LSU Digita Commons LSU Master's Theses Graduate Schoo 008 A capacity-approaching coded moduation scheme for non-coherent fading channes Youngjeon Cho Louisiana State University
More informationPROPORTIONAL FAIR SCHEDULING OF UPLINK SINGLE-CARRIER FDMA SYSTEMS
PROPORTIONAL FAIR SCHEDULING OF UPLINK SINGLE-CARRIER SYSTEMS Junsung Lim, Hyung G. Myung, Kyungjin Oh and David J. Goodman Dept. of Eectrica and Computer Engineering, Poytechnic University 5 Metrotech
More informationJoint Optimal Power Allocation and Relay Selection with Spatial Diversity in Wireless Relay Networks
Proceedings of SDR'11-WInnComm-Europe, 22-24 Jun 2011 Joint Optima Power Aocation and Reay Seection with Spatia Diversity in Wireess Reay Networks Md Habibu Isam 1, Zbigniew Dziong 1, Kazem Sohraby 2,
More informationA Low Complexity VCS Method for PAPR Reduction in Multicarrier Code Division Multiple Access
0 JOURNAL OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA, VOL. 5, NO., JUNE 007 A Low Compexity VCS Method for PAPR Reduction in Muticarrier Code Division Mutipe Access Si-Si Liu, Yue iao, Qing-Song Wen,
More informationChannel Division Multiple Access Based on High UWB Channel Temporal Resolution
Channe Division Mutipe Access Based on High UWB Channe Tempora Resoution Rau L. de Lacerda Neto, Aawatif Menouni Hayar and Mérouane Debbah Institut Eurecom B.P. 93 694 Sophia-Antipois Cedex - France Emai:
More informationTHE TRADEOFF BETWEEN DIVERSITY GAIN AND INTERFERENCE SUPPRESSION VIA BEAMFORMING IN
THE TRADEOFF BETWEEN DIVERSITY GAIN AND INTERFERENCE SUPPRESSION VIA BEAMFORMING IN A CDMA SYSTEM Yan Zhang, Laurence B. Mistein, and Pau H. Siege Department of ECE, University of Caifornia, San Diego
More informationUniversity of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): /GLOCOM.2003.
Coon, J., Siew, J., Beach, MA., Nix, AR., Armour, SMD., & McGeehan, JP. (3). A comparison of MIMO-OFDM and MIMO-SCFDE in WLAN environments. In Goba Teecommunications Conference, 3 (Gobecom 3) (Vo. 6, pp.
More informationFOR energy limited data networks, e.g., sensor networks,
578 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO., DECEMBER 009 An Optima Power Aocation Scheme for the STC Hybrid ARQ over Energy Limited Networks Hongbo Liu, Member, IEEE, Leonid Razoumov,
More informationRate-Allocation Strategies for Closed-Loop MIMO-OFDM
Rate-Aocation Strategies for Cosed-Loop MIMO-OFDM Joon Hyun Sung and John R. Barry Schoo of Eectrica and Computer Engineering Georgia Institute of Technoogy, Atanta, Georgia 30332 0250, USA Emai: {jhsung,barry}@ece.gatech.edu
More informationCAPACITY OF UNDERWATER WIRELESS COMMUNICATION CHANNEL WITH DIFFERENT ACOUSTIC PROPAGATION LOSS MODELS
CAPACITY OF UNDERWATER WIRELESS COMMUNICATION CHANNEL WITH DIFFERENT ACOUSTIC PROPAGATION LOSS MODELS Susan Joshy and A.V. Babu, Department of Eectronics & Communication Engineering, Nationa Institute
More informationDealing with Link Blockage in mmwave Networks: D2D Relaying or Multi-beam Reflection?
Deaing with Lin Bocage in mmwave etwors: DD Reaying or Muti-beam Refection? Mingjie Feng, Shiwen Mao Dept. Eectrica & Computer Engineering Auburn University, Auburn, AL 36849-5, U.S.A. Tao Jiang Schoo
More informationSecure Physical Layer Key Generation Schemes: Performance and Information Theoretic Limits
Secure Physica Layer Key Generation Schemes: Performance and Information Theoretic Limits Jon Waace Schoo of Engineering and Science Jacobs University Bremen, Campus Ring, 879 Bremen, Germany Phone: +9
More informationCo-channel Interference Suppression Techniques for STBC OFDM System over Doubly Selective Channel
Co-channe Interference Suppression Techniques for STBC OFDM System over Douby Seective Channe Jyoti P. Patra Dept. of Eectronics and Communication Nationa Institute Of Technoogy Rourkea-769008, India E
More informationRelays that Cooperate to Compute
Reays that Cooperate to Compute Matthew Nokeby Rice University nokeby@rice.edu Bobak Nazer Boston University bobak@bu.edu Behnaam Aazhang Rice University aaz@rice.edu Natasha evroye University of Iinois
More informationTransmit-Diversity-Assisted Space-Shift Keying for Colocated and Distributed/Cooperative MIMO Elements
2864 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL 60, NO 6, JULY 2011 Transmit-Diversity-Assisted Space-Shift Keying for Coocated and Distributed/Cooperative MIMO Eements Du Yang, Chao Xu, Student Member,
More informationIterative Transceiver Design for Opportunistic Interference Alignment in MIMO Interfering Multiple-Access Channels
Journa of Communications Vo. 0 No. February 0 Iterative Transceiver Design for Opportunistic Interference Aignment in MIMO Interfering Mutipe-Access Channes Weipeng Jiang ai Niu and Zhiqiang e Schoo of
More informationAvailability Analysis for Elastic Optical Networks with Multi-path Virtual Concatenation Technique
Progress In Eectromagnetics Research Symposium Proceedings, Guangzhou, China, Aug. 25 28, 2014 849 Avaiabiity Anaysis for Eastic Optica Networks with Muti-path Virtua Concatenation Technique Xiaoing Wang
More informationSatellite Link Layer Performance Using Two Copy SR-ARQ and Its Impact on TCP Traffic
Sateite Link Layer Performance Using Two Copy SR-ARQ and Its Impact on TCP Traffic Jing Zhu and Sumit Roy Department of Eectrica Engineering, University of Washington Box 352500, Seatte, WA 98195, USA
More informationCross-layer queuing analysis on multihop relaying networks with adaptive modulation and coding K. Zheng 1 Y. Wang 1 L. Lei 2 W.
www.ietd.org Pubished in IET Communications Received on 18th June 2009 Revised on 30th Juy 2009 ISSN 1751-8628 Cross-ayer queuing anaysis on mutihop reaying networks with adaptive moduation and coding
More informationBlind Multiuser Detection in Asynchronous DS-CDMA Systems over Nakagami-m Fading Channels
Bind Mutiuser Detection in Asynchronous DS-CDMA Systems over akagami-m Fading Channes Vinay Kumar Pamua JU Kakinada, Andhra Pradesh, India 533 003 pamuavk@yahoo.com ABSRAC his paper presents a technique
More informationPower Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks
roceedings of the 46th IEEE Conference on Decision and Contro New Oreans, LA, USA, Dec. 12-14, 27 FrB2.5 ower Contro and Transmission Scheduing for Network Utiity Maximization in Wireess Networks Min Cao,
More informationPerformance Measures of a UWB Multiple-Access System: DS/CDMA versus TH/PPM
Performance Measures of a UWB Mutipe-Access System: DS/CDMA versus TH/PPM Aravind Kaias and John A. Gubner Dept. of Eectrica Engineering University of Wisconsin-Madison Madison, WI 53706 akaias@wisc.edu,
More informationBER Performance Analysis of Cognitive Radio Physical Layer over Rayleigh fading Channel
Internationa Journa of Computer ppications (0975 8887) Voume 5 No.11, Juy 011 BER Performance naysis of Cognitive Radio Physica Layer over Rayeigh fading mandeep Kaur Virk Dr. B R mbedkar Nationa Institute
More informationEffect of Interfering Users on the Modulation Order and Code Rate for UWB Impulse-Radio Bit-Interleaved Coded M-ary PPM
Effect of Interfering Users on the Moduation Order and Code Rate for UWB Impuse-Radio Bit-Intereaved Coded M-ary PPM Ruben Merz and Jean-Yves Le Boudec EPFL, Schoo of Computer and Communication Sciences
More informationPerformance Comparison of Cyclo-stationary Detectors with Matched Filter and Energy Detector M. SAI SINDHURI 1, S. SRI GOWRI 2
ISSN 319-8885 Vo.3,Issue.39 November-14, Pages:7859-7863 www.ijsetr.com Performance Comparison of Cyco-stationary Detectors with Matched Fiter and Energy Detector M. SAI SINDHURI 1, S. SRI GOWRI 1 PG Schoar,
More informationSparse Beamforming Design for Network MIMO System with Per-Base-Station Backhaul Constraints
Sparse Beamforming Design for Networ MIMO System with Per-Base-Station Bachau Constraints Binbin Dai and Wei Yu Department of Eectrica and Computer Engineering University of Toronto, Toronto, Ontario M5S
More informationSparse Channel Estimation Based on Compressed Sensing for Massive MIMO Systems
Sparse Channe Estimation Based on Compressed Sensing for Massive MIMO Systems Chenhao Qi, Yongming Huang, Shi Jin and Lenan Wu Schoo of Information Science and Engineering, Southeast University, Nanjing
More informationBest Relay Selection Using SNR and Interference Quotient for Underlay Cognitive Networks
IEEE ICC 1 - Wireess Communications Symposium Best Reay Seection Using SNR and Interference Quotient for Underay Cognitive Networks Syed Imtiaz Hussain 1, Mohamed M. Abdaah 1, Mohamed-Sim Aouini 1,, Mazen
More informationFREQUENCY-DOMAIN TURBO EQUALIZATION FOR SINGLE CARRIER MOBILE BROADBAND SYSTEMS. Liang Dong and Yao Zhao
FREQUENCY-DOMAIN TURBO EQUALIZATION FOR SINGLE CARRIER MOBILE BROADBAND SYSTEMS Liang Dong and Yao Zhao Department of Eectrica and Computer Engineering Western Michigan University Kaamazoo, MI 49008 ABSTRACT
More informationSuppression of ISI Caused by Sampling Time Offset in IFDMA Systems
Suppression of ISI Caused by Samping Time Offset in IFDA Systems Aexander Arkhipov, ichae Schne German Aerospace Center (DLR), Inst. of Communications and Navigation, D-82234, Wessing, Germany. Phone/e-mai:
More informationRelay Selection for Low-Complexity Coded Cooperation
Relay Selection for Low-Complexity Coded Cooperation Josephine P. K. Chu,RavirajS.Adve and Andrew W. Eckford Dept. of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada
More informationDistribution of Path Durations in Mobile Ad-Hoc Networks and Path Selection
Distribution of ath Durations in Mobie Ad-Hoc Networks and ath Seection Richard J. La and Yijie Han Abstract We investigate the issue of path seection in mutihop wireess networks with the goa of identifying
More informationOn the Relationship Between Queuing Delay and Spatial Degrees of Freedom in a MIMO Multiple Access Channel
On the Reationship Between Queuing Deay and Spatia Degrees of Freedom in a IO utipe Access Channe Sriram N. Kizhakkemadam, Dinesh Rajan, andyam Srinath Dept. of Eectrica Engineering Southern ethodist University
More informationADAPTIVE ITERATION SCHEME OF TURBO CODE USING HYSTERESIS CONTROL
ADATIV ITRATION SCHM OF TURBO COD USING HYSTRSIS CONTROL Chih-Hao WU, Kenichi ITO, Yung-Liang HUANG, Takuro SATO Received October 9, 4 Turbo code, because of its remarkabe coding performance, wi be popuar
More informationUtility-Proportional Fairness in Wireless Networks
IEEE rd Internationa Symposium on Persona, Indoor and Mobie Radio Communications - (PIMRC) Utiity-Proportiona Fairness in Wireess Networks G. Tychogiorgos, A. Gkeias and K. K. Leung Eectrica and Eectronic
More informationHybrid Digital-Analog Joint Source Channel Coding for Broadcast Multiresolution Communications
217 25th European Signa Processing Conference (EUSIPCO) Hybrid Digita-Anaog Joint Source Channe Coding for Broadcast Mutiresoution Communications O. Fresnedo, P. Suárez-Casa, L. Castedo Department of Eectronics
More informationAirborne Ultrasonic Position and Velocity Measurement Using Two Cycles of Linear-Period-Modulated Signal
Airborne Utrasonic Position and Veocity Measurement Using Two Cyces of Linear-Period-Moduated Signa Shinya Saito 1, Minoru Kuribayashi Kurosawa 1, Yuichiro Orino 1, and Shinnosuke Hirata 2 1 Department
More informationSpace-Time Focusing Transmission in Ultra-wideband Cooperative Relay Networks
ICUWB 2009 (September 9-11, 2009) 1 Space-Time Focusing Transmission in Utra-wideband Cooperative Reay Networks Yafei Tian and Chenyang Yang Schoo of Eectronics and Information Engineering, Beihang University
More informationPerformance of Single User vs. Multiuser Modulation in Wireless Multicarrier (MC) Communications
erformance of Singe User vs. Mutiuser Moduation in Wireess Muticarrier (MC) Communications Anwaru Azim, ecturer, East West University Bangadesh Abstract-- he main objective of this paper is to compare
More informationTEMPORAL FAIRNESS ENHANCED SCHEDULING FOR COOPERATIVE RELAYING NETWORKS IN LOW MOBILITY FADING ENVIRONMENTS
TEMPORAL FAIRNESS ENHANCED SCHEDULING FOR COOPERATIVE RELAYING NETWORKS IN LOW MOBILITY FADING ENVIRONMENTS Ingmar Hammerström, Jian Zhao, and Armin Wittneben Swiss Federa Institute of Technoogy (ETH)
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 2, FEBRUARY Cooperative Relaying in Multi-Antenna Fixed Relay Networks
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 2, FEBRUARY 27 533 Cooperative Reaying in Muti-Antenna Fixed Reay Networks Abdukareem Adinoyi and Haim Yanikomerogu Abstract Space, cost, and signa
More informationOn optimizing low SNR wireless networks using network coding
On optimizing ow SNR wireess networks using network coding Mohit Thakur Institute for communications engineering, Technische Universität München, 80290, München, Germany. Emai: mohit.thakur@tum.de Murie
More informationJoint Beamforming and Power Optimization with Iterative User Clustering for MISO-NOMA Systems
This artice has been accepted for pubication in a future issue of this journa, but has not been fuy edited. Content may change prior to fina pubication. Citation information: DOI 0.09/ACCESS.07.70008,
More informationUsing the Bhattacharyya Parameter for Design and Analysis of Cooperative Wireless Systems
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. X, NO. YY, OCTOBER 2008 1 Using the Bhattacharyya Parameter for Design and Analysis of Cooperative Wireless Systems Josephine P. K. Chu, Student Member,
More informationCOMPARATIVE ANALYSIS OF ULTRA WIDEBAND (UWB) IEEE A CHANNEL MODELS FOR nlos PROPAGATION ENVIRONMENTS
COMPARATIVE ANALYSIS OF ULTRA WIDEBAND (UWB) IEEE80.15.3A CHANNEL MODELS FOR nlos PROPAGATION ENVIRONMENTS Ms. Jina H. She PG Student C.C.E.T, Wadhwan, Gujarat, Jina_hshet@yahoo.com Dr. K. H. Wandra Director
More informationInformation Theoretic Radar Waveform Design for Multiple Targets
1 Information Theoretic Radar Waveform Design for Mutipe Targets Amir Leshem and Arye Nehorai Abstract In this paper we use information theoretic approach to design radar waveforms suitabe for simutaneousy
More informationDistributed Resource Allocation for Relay-Aided Device-to-Device Communication: A Message Passing Approach
Distributed Resource Aocation for Reay-Aided Device-to-Device Communication: A Message Passing Approach Monowar Hasan and Ekram Hossain arxiv:406.323v [cs.ni] 2 Jun 204 Abstract Device-to-device D2D communication
More informationSpatial Reuse in Dense Wireless Areas: A Cross-layer Optimization Approach via ADMM
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 1 Spatia Reuse in Dense Wireess Areas: A Cross-ayer Optimization Approach via ADMM Haeh Tabrizi, Member, IEEE, Borja Peeato, Member, IEEE, Gonaz Farhadi, Member,
More informationPerformance Analysis of Non-Orthogonal Multiple Access under I/Q Imbalance
This artice has been accepted for pubication in a future issue of this journa, but has not been fuy edited. Content may change prior to fina pubication. Citation information: DOI 10.1109/ACCESS.2018.2820074,
More informationFast Hybrid DFT/DCT Architecture for OFDM in Cognitive Radio System
Fast Hybrid DF/D Architecture for OFDM in ognitive Radio System Zhu hen, Moon Ho Lee, Senior Member, EEE, hang Joo Kim 3 nstitute of nformation&ommunication, honbuk ationa University, Jeonju, 56-756,Korea
More informationBlock-Level Unitary Query: Incorporating Orthogonal-like Space-time Code with Query Diversity for MIMO Backscatter RFID
1 Bock-Leve Unitary Query: Incorporating Orthogona-ike Space-time Code with Query Diversity for MIMO Backscatter RFID Chen He, Member, IEEE, Z. Jane Wang, Senior Member, IEEE, and Victor C.M. Leung, Feow,
More informationJoint Optimization of Scheduling and Power Control in Wireless Networks: Multi-Dimensional Modeling and Decomposition
This artice has been accepted for pubication in a future issue of this journa, but has not been fuy edited. Content may change prior to fina pubication. Citation information: DOI 10.1109/TMC.2018.2861859,
More informationOptimal Bandwidth Allocation for Source Coding, Channel Coding and Spreading in a CDMA System
ptima Bandwidth Aocation or Source oding, hanne oding and Spreading in a DA System Qinghua Zhao, Pamea. osman, and aurence B. istein Department o Eectrica and omputer Engineering, University o aiornia,
More informationDistributed Resource Allocation for Relay-Aided Device-to-Device Communication Under Channel Uncertainties: A Stable Matching Approach
Distributed Resource Aocation for Reay-Aided Device-to-Device Communication Under Channe Uncertainties: A Stabe Matching Approach Monowar Hasan, Student Member, IEEE, and Ekram Hossain, Feow, IEEE Abstract
More informationSCHEDULING the wireless links and controlling their
3738 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 7, JULY 2014 Minimum Length Scheduing With Packet Traffic Demands in Wireess Ad Hoc Networks Yacin Sadi, Member, IEEE, and Sinem Coeri Ergen,
More informationOptimum Power Allocation in Cooperative Networks
Optimum Power Allocation in Cooperative Networks Jaime Adeane, Miguel R.D. Rodrigues, and Ian J. Wassell Laboratory for Communication Engineering Department of Engineering University of Cambridge 5 JJ
More informationEE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code. 1 Introduction. 2 Extended Hamming Code: Encoding. 1.
EE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code Project #1 is due on Tuesday, October 6, 2009, in class. You may turn the project report in early. Late projects are accepted
More informationA Novel Method for Doppler and DOD- DOA Jointly Estimation Based on FRFT in Bistatic MIMO Radar System
7 Asia-Pacific Engineering and Technoogy Conference (APETC 7) ISBN: 978--6595-443- A Nove Method for Dopper and DOD- DOA Jointy Estimation Based on FRFT in Bistatic MIMO Radar System Derui Song, Li Li,
More informationUplink Massive MIMO SIR Analysis: How do Antennas Scale with Users?
Upink Massive MIMO SIR Anaysis: How do Antennas Scae with Users? Tianyang Bai and Robert W. Heath, Jr. Wireess Networking and Communication Group The University of Texas at Austin 66 Guadaupe Street, C83,
More informationLDPC codes for OFDM over an Inter-symbol Interference Channel
LDPC codes for OFDM over an Inter-symbol Interference Channel Dileep M. K. Bhashyam Andrew Thangaraj Department of Electrical Engineering IIT Madras June 16, 2008 Outline 1 LDPC codes OFDM Prior work Our
More informationPower Spectrum Optimization for Interference Mitigation via Iterative Function Evaluation
Power Spectrum Optimization for Interference Mitigation via Iterative Function Evauation Hayssam Dahrouj, Wei Yu, Taiwen Tang, and Steve Beaudin Eectrica and Computer Engineering Dept., University of Toronto,
More informationCommunication Systems
Communication Systems 1. A basic communication system consists of (1) receiver () information source (3) user of information (4) transmitter (5) channe Choose the correct sequence in which these are arranged
More informationCHANNEL MODELLING & PERFORMANCE ANALYSIS OF WIFI
CHANNEL MODELLING & PERFORMANCE ANALYSIS OF WIFI Jivisha, Gaurav Mohta, Saumya Das Siim Manipa Institute of Technoogy Emai Id- gauravmohta.officia@gmai.com; Ph No. +9 9609850304 Abstract Wi-Fi or wireess
More informationTHE EMERGING IEEE ad wireless local area
1 Suboptima Spatia Diversity Scheme for 60 Gz Miimeter-Wave WLAN Zhenyu Xiao, Member, IEEE arxiv:1511.02326v1 [cs.it] 7 Nov 2015 Abstract This etter revisits the equa-gain (EG) spatia diversity technique,
More informationQoS-Driven MAC-Layer Resource Allocation for Wireless Mesh Networks with Non-Altruistic Node Cooperation and Service Differentiation
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 2, DECEMBER 2009 QoS-Driven MAC-Layer Resource Aocation for Wireess Mesh Networks with n-atruistic de Cooperation and Service Differentiation Ho
More informationAn Optimization Framework for XOR-Assisted Cooperative Relaying in Cellular Networks
n Optimization Framework for XOR-ssisted Cooperative Reaying in Ceuar Networks Hong Xu, Student Member, IEEE, Baochun Li, Senior Member, IEEE bstract This work seeks to address two questions in cooperative
More informationSelf-Interference Canceller for Full-Duplex Radio Relay Station Using Virtual Coupling Wave Paths
Sef-Interference Canceer for Fu-Dupex Radio Reay Station Using Virtua Couping Wave Paths Kazunori Hayashi Yasuo Fujishima Megumi Kaneko Hideaki Sakai Riichi Kudo and Tomoki Murakami Graduate Schoo of Informatics,
More informationAnalyzing Uplink SINR and Rate in Massive. MIMO Systems Using Stochastic Geometry
Anayzing Upink SINR and Rate in Massive MIMO Systems Using Stochastic Geometry Tianyang Bai and Robert W. Heath, Jr. arxiv:5.2538v2 [cs.it] 2 Apr 26 Abstract This paper proposes a stochastic geometry framework
More informationGRAY CODE FOR GENERATING TREE OF PERMUTATION WITH THREE CYCLES
VO. 10, NO. 18, OCTOBER 2015 ISSN 1819-6608 GRAY CODE FOR GENERATING TREE OF PERMUTATION WITH THREE CYCES Henny Widowati 1, Suistyo Puspitodjati 2 and Djati Kerami 1 Department of System Information, Facuty
More informationDual Relay Selection for Cooperative NOMA with Distributed Space Time Coding
This artice has been accepted for pubication in a future issue of this journa, but has not been fuy edited. Content may change prior to fina pubication. Citation information: DOI.9/ACCESS.8.846, IEEE Access
More informationAn Approach to use Cooperative Car Data in Dynamic OD Matrix
An Approach to use Cooperative Car Data in Dynamic OD Matrix Estimation L. Montero and J. Barceó Department of Statistics and Operations Research Universitat Poitècnica de Cataunya UPC-Barceona Tech Abstract.
More informationCoverage and Rate Analysis for Millimeter Wave Cellular Networks
Coverage and Rate Anaysis for Miimeter Wave Ceuar Networks Tianyang Bai and Robert W. Heath, Jr. arxiv:42.643v3 cs.it 8 Oct 24 Abstract Miimeter wave mmwave) hods promise as a carrier frequency for fifth
More informationAN Ω(D log(n/d)) LOWER BOUND FOR BROADCAST IN RADIO NETWORKS
SIAM J. COMPUT. c 1998 Society for Industria and Appied Mathematics Vo. 27, No. 3, pp. 702 712, June 1998 008 AN Ω(D og(n/d)) LOWER BOUND FOR BROADCAST IN RADIO NETWORKS EYAL KUSHILEVITZ AND YISHAY MANSOUR
More informationResource Allocation for Network-Integrated Device-to-Device Communications Using Smart Relays
Resource Aocation for Network-Integrated Device-to-Device Communications Using Smart Reays Monowar Hasan and Ekram Hossain Department of Eectrica and Computer Engineering, University of Manitoba, Winnipeg,
More informationRobust Blind Multiuser Detection in DS-CDMA Systems over Nakagami-m Fading Channels with Impulsive Noise including MRC Receive Diversity
Robust Bind Mutiuser Detection in DS-CDMA Systems over Nakagami-m Fading Channes with Impusive Noise incuding MRC Receive Diversity Vinay Kumar Pamua, Member, IEEE, Department of ECE, MIC Coege of echnoogy,
More informationWireless Communications
Wireess Communications Mutipe Access Hamid Bahrami Eectrica & Computer Engineering Communication System Bock Diagram Dupexing Dupexing: transmit and receive at the same time Exampe: teephone, how about
More informationURL: <http://dx.doi.org/ /sopo >
Citation: Tang Xuan Rajbhandari Sujan Popooa Wasiu Oyewoe Ghassemooy Zabih Muhammad Sajid Sheikh Leitgeb Erich and Kandus Gorazd (1) Performance of BPSK subcarrier intensity moduation free-space optica
More informationCopyright 2000 IEEE. IEEE Global Communications Conference (Globecom 2000), November 27 - December 1, 2000, San Francisco, California, USA
Copyright 2000 EEE. EEE Goba Communications Conference (Gobecom 2000), November 27 - December 1, 2000, San Francisco, Caifornia, USA Persona use of this materia is permitted. owever, permission to reprint/repubish
More informationHybrid Digital-to-Analog Beamforming for Millimeter-Wave Systems with High User Density
Hybrid Digita-to-Anaog Beamforming for Miimeter-Wave Systems with High User Density Manish Nair, Qasim Zeeshan Ahmed and Huiing Zhu Schoo of Engineering and Digita Arts, University of Kent, Canterbury,
More informationFBMC/OQAM for the Asynchronous Multi-User MIMO Uplink
FBMC/OQAM for the Asynchronous Muti-User MIMO Upin Yao Cheng, Peng Li, and Martin Haardt Communications Research Laboratory, Imenau University of Technoogy P. O. Box 100565, D-98694 Imenau, Germany {y.cheng,
More informationImproving the Active Power Filter Performance with a Prediction Based Reference Generation
Improving the Active Power Fiter Performance with a Prediction Based Reference Generation M. Routimo, M. Sao and H. Tuusa Abstract In this paper a current reference generation method for a votage source
More informationarxiv: v1 [cs.it] 22 Aug 2007
Voice Service Support in Mobie Ad Hoc Networks Hai Jiang, Ping Wang, H. Vincent Poor, and Weihua Zhuang Dept. of Eec. & Comp. Eng., University of Aberta, Canada, hai.jiang@ece.uaberta.ca Dept. of Eec.
More informationTransmission Capacity Of D2D Communication Under Cellular Networks *
nternationa Conference on Computer, Networs and Communication Engineering (CCNCE 13) Transmission Capacity Of Communication Under Ceuar Networs * Xianghai Xu 1, Jun Sun 1,Shixiang Shao 1 1 Jiangsu provincia
More informationSoft Channel Encoding; A Comparison of Algorithms for Soft Information Relaying
IWSSIP, -3 April, Vienna, Austria ISBN 978-3--38-4 Soft Channel Encoding; A Comparison of Algorithms for Soft Information Relaying Mehdi Mortazawi Molu Institute of Telecommunications Vienna University
More informationLSTM TIME AND FREQUENCY RECURRENCE FOR AUTOMATIC SPEECH RECOGNITION
LSTM TIME AND FREQUENCY RECURRENCE FOR AUTOMATIC SPEECH RECOGNITION Jinyu Li, Abderahman Mohamed, Geoffrey Zweig, and Yifan Gong Microsoft Corporation, One Microsoft Way, Redmond, WA 98052 { jinyi, asamir,
More informationPerformance comparison of convolutional and block turbo codes
Performance comparison of convolutional and block turbo codes K. Ramasamy 1a), Mohammad Umar Siddiqi 2, Mohamad Yusoff Alias 1, and A. Arunagiri 1 1 Faculty of Engineering, Multimedia University, 63100,
More informationENERGY MANAGEMENT OF WIRELESS SENSOR NETWORK WITH MIMO TECHNIQUES
EERGY MAAGEMET OF WIRELESS SESOR ETWORK WITH MIMO TECHIQUES TRUPTI MAYEE BEHERA Schoo of Eectronics, KIIT University Bhubaneswar, Odisha,India trupti_behera@rediffmai.com SUDHASU SEKHAR SIGH Schoo of Eectronics,
More informationDevelopment of a LabVIEW-based test facility for standalone PV systems
Deveopment of a LabVIEW-based test faciity for standaone PV systems Aex See Kok Bin, Shen Weixiang, Ong Kok Seng, Saravanan Ramanathan and Low I-Wern Monash University Maaysia, Schoo of Engineering No.2,
More informationJoint Congestion Control, Routing and Media Access Control Optimization via Dual Decomposition for Ad Hoc Wireless Networks
Joint Congestion Contro, Routing and Media Access Contro Optimization via Dua Decomposition for Ad Hoc Wireess Networks Francesco Lo Presti Dipartimento di Informatica Università de L Aquia opresti@di.univaq.it
More informationComparison of Cooperative Schemes using Joint Channel Coding and High-order Modulation
Comparison of Cooperative Schemes using Joint Channel Coding and High-order Modulation Ioannis Chatzigeorgiou, Weisi Guo, Ian J. Wassell Digital Technology Group, Computer Laboratory University of Cambridge,
More informationAnnouncements. Tuesday April 15 covers material from chapters: 1-3, 5-6 emphasis on material since last midterm
Announcements Reading Today: 4.1 & 4.2 (skip 4.2.4 and 4.2.5) Second Midterm: Tuesday Apri 15 covers materia from chapters: 1-3, 5-6 emphasis on materia since ast midterm CMSC 417 - S97 (ect 18) copyright
More informationWireless Communications
Wireess Communications Ceuar Concept Hamid Bahrami Reference: Rappaport Chap3 Eectrica & Computer Engineering Statements of Probems Soving the probem of Spectra congestion System Capacity A system-eve
More informationFox-1E (RadFxSat-2) Telemetry and Whole Orbit Data Simulation. Burns Fisher, W2BFJ Carl Wick, N3MIM
Fox-1E (RadFxSat-2) Teemetry and Whoe Orbit Data Simuation Burns Fisher, W2BFJ Car Wick, N3MIM 1 Review: Fox-1 DUV Teemetry Fox-1A through Fox-1D are FM Repeater Sateites» Ony a singe downink frequency»
More informationWorst case delay analysis for a wireless point-to-point transmission
Worst case deay anaysis for a wireess point-to-point transmission Katia Jaffrès-Runser University of Tououse IRIT - INPT ENSEEIHT Tououse, France Emai: katia.jaffres-runser@irit.fr Abstract Wireess technoogies
More informationMulti-Target Localization of Breathing Humans
Muti-Target Locaization of Breathing Humans ChangKyeong Kim, Joon-Yong Lee, Taechong Cho, Dongbok Ki, Bong Ho Cho, and Jihoon Yoon Dept. of Information & Technoogy, Handong University, Pohang 79-78, Korea
More informationCHANNEL ESTIMATION USING EXTENDED KALMAN FILTER WITH SLICED MULTI MODULUS BLIND EQUALIZATION ALGORITHM (SMMA)
Journa of Theoretica and Appied nformation Technoogy 005-06 JATT & LLS. A rights reserved. SSN: 99-8645 www.jatit.org E-SSN: 87-395 CHANNEL ESTMATON USNG EXTENDED KALMAN FLTE WTH SLCED MULT MODULUS BLND
More informationRun to Potential: Sweep Coverage in Wireless Sensor Networks
Run to Potentia: Sweep Coverage in Wireess Sensor Networks Min Xi,KuiWu,Yong Qi,Jizhong Zhao, Yunhao Liu,MoLi Department of Computer Science, Xi an Jiaotong University, China Department of Computer Science,
More information