FAST CONVERGENCE ADAPTIVE MMSE RECEIVER FOR ASYNCHRONOUS DS-CDMA SYSTEMS
|
|
- Brendan Garrett
- 5 years ago
- Views:
Transcription
1 Électronque et transmsson de l nformaton FAST CONVERGENCE ADAPTIVE MMSE RECEIVER FOR ASYNCHRONOUS DS-CDMA SYSTEMS CĂLIN VLĂDEANU, CONSTANTIN PALEOLOGU 1 Key words: DS-CDMA, MMSE adaptve recever, Least mean square (LMS), Recursve least square (RLS). Ths paper reconsders the Mnmum Mean-Squared Error (MMSE) sngle user adaptve recever for the asynchronous Drect Sequence Code Dvson Multple Access (DS-CDMA) system. Durng the tranng perod the classcal MMSE recever adapts the tap weghts once every data bt nterval. Our am s to reduce the overhead ntroduced durng the tranng perod. Ths wll be acheved by adaptng the tap weghts several tmes durng each bt nterval, n an teratve manner. Due to ths teratve process, the adaptve flter acheves a faster convergence rate. Hence, the tranng nterval or Multple-Access Interference (MAI) can be sgnfcantly reduced. Nevertheless, ths performance mprovement s computatonal expensve. 1. INTRODUCTION Many of the moble communcatons systems are employng the CDMA (Code Dvson Multple Access) technque, where the users are transmttng smultaneously wthn the same bandwdth by means of dfferent code sequences. CDMA technque has been found to be attractve because of such characterstcs as potental capacty ncreases over competng multple access methods, antmultpath capabltes, soft capacty, narrow-bandwdth ant-jammng, and soft handoff. In the DS-CDMA (Drect Sequence CDMA) system, each code sequence s used to spread the user data sgnal over a larger bandwdth, and to encode the nformaton nto a random waveform [1]. In ths case a smple multplcaton between the data sgnal and the code sequence waveform s needed, and the resulted sgnal nherts ts spectral characterstcs from the spreadng sequence. Hence, because of ts lnear sgnal processng functon ths scheme may be a 1 Faculty of Electroncs, Telecommuncatons and Informaton Theory / Telecommuncatons Department, Poltehnca Unversty of Bucharest, 1-3 Iulu Manu, ZIP , Bucharest, Romana, E-mal: {caln.pale}@comm.pub.ro. Rev. Roum. Sc. Techn. Électrotechn. et Énerg., 52, 1, p , Bucarest, 2007
2 52 Căln Vlădeanu, Constantn Paleologu 2 subject for possble performance mprovements by developng new sgnal processng technques for the recever. In DS-CDMA, the conventonal matched flter recever dstngushes each user s sgnal by correlatng the receved mult-user sgnal wth the correspondng sgnature waveform. Hence, the data symbol decson for each user s affected by Multple-Access Interference (MAI) from other users and by channel dstortons. The multple access nterference power depends also on the correlaton propertes of the chosen spreadng sequences [1-6]. Hence, the conventonal matched flter recever performances are lmted by ts orgnal purpose. It was desgned to be optmum only for a sngle user channel where no MAI s present, and to be optmum for a perfect power control, so t suffers from the near-far problem. These lmtatons have led to the ntroducton of an optmum mult-user detecton approach, based on Maxmum Lelhood Sequence Estmaton (MLSE) [2]. The computatonal complexty of such MLSE s nown to grow exponentally wth the actve number of users, a soluton that s not feasble. In ths context, many mult-user recevers have been proposed to overcome the nherent lmtatons of the conventonal matched flter recever. The use of these mult-user recevers has shown to mprove system s performance, and enhance ts capacty relatve to the conventonal matched flter detecton. Unfortunately, most of these mult-user detectors requre complete system nformaton on all users. Implementatons of adaptve Mnmum Mean-Squared Error (MMSE) recevers n DS-CDMA systems have been analyzed n [3] and [4]. The prncple of the adaptve MMSE recevers conssts of a sngle user detector that wors only wth the bt sequence of that user. In ths case the detecton process s done n a bt by bt manner, and the fnal decson s taen for a sngle bt nterval from the receved sgnal. The complexty of an adaptve MMSE recever s slghtly hgher than that of a conventonal recever, but wth superor performances [3-5, 11]. Besdes ts facle mplementaton the adaptve MMSE recever has the advantage that t needs no supplementary nformaton durng the detecton process, as compared to the conventonal matched-flter recever. Wthn the present paper we am to mprove adaptve MMSE recevers that reduce the MAI n a DS-CDMA system wth a faster rate or wthn a smaller tranng nterval. Ths wll be acheved by adaptng the tap weghts several tmes durng each bt nterval. Due to ths teratve process, the adaptve flter acheves a faster convergence rate. Ths performance s pad by an ncreased computatonal complexty. The paper s organzed as follows. In secton 2 we descrbe our asynchronous DS-CDMA system model, both the transmtter and adaptve recever parts of the scheme. The expermental results are presented n secton 3. Fnally, secton 4 concludes ths wor.
3 3 Adaptve MMSE recever for asynchronous DS-CDMA systems SYSTEM MODEL In ths secton we present the asynchronous DS-CDMA system model used n our analyss. The adaptve MMSE teratve recever s ntroduced for the asynchronous DS-CDMA system TRANSMITTER MODEL In the transmtter part of the system, each user data symbol s modulated usng a unque sgnature waveform a (t) (wth a normalzed energy over a data bt T 2 nterval T, a () t dt = 1) gven by [1]: 0 a N () t a ( j) p ( t jt ), 1, K, = c c = j= 1 where the a ( j) represents the j-th chp of the th user s code sequence and are assumed to be elements of { 1, +1}, and p c (t) s the chp pulse waveform defned over the nterval [0, T c ), wth T c as the chp duraton whch s related to the bt duraton through the processng gan N (T c = T/N). K denotes the number of users n the system. In the followng analyss we consder bnary phase shft eyng modulaton (BPSK) for sgnal transmsson. Then, the -th user transmtted sgnal s gven by where P s the th user bt power, s ( t) = 2P b ( t) a ( t)cos( ω0t + θ ), 1, K, (2) = (1) N b b ( t) = b ( m) p( t mt ), m= 1 b ( m) { 1, + 1} (3) s the bnary data sequence for -th user, N b s the number of receved data bts, ω 0 = 2π f 0 and θ represent the common carrer pulsaton and phase, respectvely ADAPTIVE MMSE ITERATIVE RECEIVER A bloc dagram of the recever structure s shown n Fg. 1 [3]. After convertng the receved sgnal to ts baseband form usng a down converter, the receved sgnal s gven by:
4 54 Căln Vlădeanu, Constantn Paleologu 4 r( t) = P = 2 = 1 K K = 1 b s ( t τ ) + n( t) cos( ω t) ( t τ ) a ( t τ ) cos( θ ) + n( t) cos( ω t), 0 = 0 (4) where N b s the number of receved data bts, and n(t) s the two-sded PSD (Power Spectral Densty) N 0 /2 addtve whte Gaussan nose (AWGN). The asynchronous DS-CDMA system conssts of random ntal phases of the carrer 0 θ < 2π and random propagaton delays 0 τ < T for all the users = 1, K. There s no loss of generalty to assume that θ = 0 and τ = 0 for the desred user, and to consder only 0 τ < T and 0 θ < 2π for any [3]. Fg. 1 MMSE adaptve recever scheme. As shown n Fg. 1, the adaptve recever s modelled as a fnte mpulse response (FIR) flter wth flter taps delayed n steps of the chp duraton and total tme span equal to the transmtted bt duraton. Assumng perfect chp tmng at the recever, the receved sgnal n (4) s passed through a chp-matched flter followed by samplng at the end of each chp nterval to gve for the m-th data bt nterval: mt + ( l+ 1) Tc rm, l= r() t p( t ltc) d t, l = 0, 1,..., N 1, (5) mt + lt c
5 5 Adaptve MMSE recever for asynchronous DS-CDMA systems 55 where p(t) s the chp pulse shape, whch s taen to be a rectangular pulse wth ampltude 1 / N. Usng (5) and tang the th user as the desred one, the output of the chp matched flter after samplng for the mth data bt s gven by: where r K P 1 = Tcb ( m) a ( l) + P cosθb ( m) I, ( m, l) n( m, ), 2N 2N = 1 (6) m, l + l ( ) ( ) ( ) ( ) ( ) ( ) ( )( ) ( ) ( ) ( ) ( ) ( ) b m 1 εa N 1 N + l + Tc ε a N N + l, 0 l N 1 I, ( m, l) = b m 1 εa N 1 + b m Tc ε a 0, l = N (7) b m εa l N 1 + Tc ε a l N, N + 1 l N 1, wth τ = N Tc + ε, 0 N N 1, 0 < ε < Tc. (8) Let us consder the followng vectors: ( ) r m = rm,0, rm,1... r m, N 1, (9) T wth r m,l gven by (6). The components of the nose n(m,l) vector n (6) conssts of ndependent zero-mean Gaussan random varables wth varance N0 /( 2N ). In the tranng mode, the recever attempts to cancel the MAI and adapts ts coeffcents usng a short tranng sequence employng an adaptve algorthm. After tranng s acqured, the recever swtches to the decson-drected mode and contnues to adapt and trac channel varatons [3-5, 11]. Durng the tranng mode, the flter tap weghts are adjusted teratvely G tmes every transmtted bt nterval. At each MMSE teraton g {1, 2, G} (.e., G tmes for every receved bt), the recever forms an error sgnal proportonal to the dfference between the flter output and the nown reference sgnal. Ths error sgnal s then used to adjust the flter tap weghts usng the adaptve algorthm. The error obtaned durng the Gth teraton of the m-th data bt s used by the algorthm n the 1st teraton of the (m + 1)-th data bt. Ths process s repeated for every receved bt untl convergence s reached. Now, let w (m) be the N coeffcent vector representng the adaptve flter weghts: w ( ) ( ) ( ) ( ) T m = w,0 m, w,1 m... w, N 1 m, (10) where the symbol m denotes the dscrete tme ndex of the data bt sequence. The dscrete output sgnal y (m) at the gth teraton s gven by:
6 56 Căln Vlădeanu, Constantn Paleologu 6 ( ) N 1 g ( 1 ( ) g y ) m = w, l ( m) rm, l. (11) l= 0 Usng vector notaton, (11) can be wrtten as: T g ( g) y m = w m r m (12) ( ) ( ) ( ) ( ). The soluton for the optmum flter tap weghts that acheve the MMSE are defned by the Wener-Hopf equaton as [7, 8]: w opt 1 = R P, (13) where R s the autocorrelaton matrx of the receved nput sgnal gven by: T ( m) ( m) R = E r r (14) and P s the crosscorrelaton vector of the nput sgnal wth the desred flter output gven by: P = E r ( m) d( m). (15) At the end of each teraton, the recever forms an error sgnal e (g) (m), e ( g ) ( g ( m) b ( m) y ) ( m), = (16) wth y (g) (m) gven by (12), and a new flter tap weght vector w (g) (m) s estmated accordng to the adaptve algorthm. When a new data bt s receved, the flter tap weghts are adapted n the same manner, wth the ntal tap weghts adapted gven by: ( 0 ) ( G w ( 1 ) ) m+ = w ( m), (17) ( 0 ) ( ) ( G ) ( ) where w m +1 and w m represent the ntal tap wegths at the (m+1)-th receved bt, and the fnal tap weghts at tme ndex m, respectvely. The adaptve algorthms used for MMSE recevers can be dvded nto two major categores [7, 8]. The frst one contans the algorthms based on mean square error mnmzaton, whose representatve member s the Least Mean Square (LMS) algorthm. The second category of algorthms uses an optmsaton procedure n the least squares (LS) sense, and ts representatve s the Recursve Least Squares (RLS) algorthm. The LMS algorthm wth ts smple mplementaton suffers from slow convergence, whch mples long tranng overhead wth low system throughput. On the other hand, LS algorthms such as the RLS offer faster convergence rate and tracng capablty than the LMS algorthm. Ths
7 7 Adaptve MMSE recever for asynchronous DS-CDMA systems 57 performance mprovement of the RLS over the LMS s acheved at the expense of the large computatonal complexty. In the case of LMS algorthm, the new flter tap weght vector w (g) (m) s gven by: ( ) ( ) ( 1 ) ( ) g g g ( ) ( ) ( ) w m = w m +µ e m r m. (18) The parameter µ n (18) s the flter adaptaton step sze chosen to optmze both the convergence rate and the mean squared error [7, 8]. For the RLS algorthm we have to ntroduce frst a new parameter, Q (g) (m). Ths parameter s teratve computed n the algorthm, startng wth an ntal value: ( 0 ) ( ) α, Q m = I N (19) where α s a postve constant (regularzaton parameter) and I s an N-by-N dentty matrx. A detaled study about choosng the value of α can be found n [9]. The RLS algorthm can be resumed as follows, w Q ( g ) ( g 1 ( m) = w ) ( m) 1 λ + λ + r ( g ) ( g 1 ( m) = Q ) ( m) Q ( g 1 Q ) ( m) r( m) ( ( ) ) ( ) ( ) ( g e ) ( m) ; T g 1 m Q m r m ( g 1 ) T ( g 1 ( m) ( m) ( m) ) r r Q ( m) T ( g 1 λ + r ( m) Q ) ( m) r( m) where λ s a postve constant, smaller than unt, whch s called the weghtng parameter (or forgettng factor). It controls the algorthm s memory [9, 10]., (20) 3. EXPERIMENTAL RESULTS The asynchronous DS-CDMA system usng MMSE teratve recever presented n the prevous secton was tested usng MATLAB programmng envronment. A bnary-phase shft eyng transmsson n a tranng mode scenaro was consdered. The bnary spreadng sequences are pseudo-random. The system smulaton parameters were fxed as followng: N = 16 and K = 8. The sgnal-tonose rato (SNR) s 15 db. The adaptve algorthm s terated G = 10 tmes for each data bt. The mean square error (MSE) was estmated by averagng over 100 ndependent trals usng LMS and RLS adaptve algorthms. The results are presented n Fg. 2 and Fg. 3.
8 58 Căln Vlădeanu, Constantn Paleologu 8 Fg. 2 Convergence of MMSE recevers usng LMS algorthm. Fg. 3 Convergence of MMSE recevers usng RLS algorthm. Comparng these results t can be concluded that the RLS algorthm outperforms LMS algorthm. Nevertheless, ths performance enhancement s pad by an ncreased computatonal complexty.
9 9 Adaptve MMSE recever for asynchronous DS-CDMA systems 59 Fnally, we nvestgated the steady-state BER (Bt Error Rate) performance as a functon of the energy per bt to nose power spectral densty rato (E b /N 0 ) of the teratve MMSE recever consdered above. These results are shown n Fg. 4, where we compared the performance of the teratve MMSE recever usng sx consecutve teratons wth the conventonal adaptve recever, usng LMS algorthm. The smulaton results were obtaned usng bts tranng perod for each value of E b /N 0, n order to assure that the steady-state s reached. It s very mportant to note that under the same condtons the BER s mproved every new teraton. Nevertheless, one should mae a compromse between the computatonal complexty and the BER performances. Fg. 4 BER performance of MMSE recevers usng LMS algorthm. 4. CONCLUSIONS The MMSE teratve recever consdered above was shown to mprove the asynchronous DS-CDMA system performances. Thus, the MSE s decreased every new teraton by reducng MAI. Ths decrease offers a faster tranng mode for the recever. Hence, the desgnng procedure may consder one of these two enhancements: to shorten the tranng sequence for mantanng the same MAI n
10 60 Căln Vlădeanu, Constantn Paleologu 10 the system or to strongly reduce the MAI by eepng the same length of the tranng sequence. A very mportant result s that the BER s consderably mproved every new teraton. However, ths performance mprovement s computatonal expensve. Nevertheless, the systems performances are evaluated by means of smulatons. An analytcal estmaton of BER for ths MMSE teratve recever wll be consdered n perspectve. Receved on 16 July, 2006 REFERENCES 1. S. Glsc, B. Vucetc, CDMA Systems for Wreless Communcatons, Artech House, S. Verdu, Optmum Multuser Asymptotc Effcency, IEEE Transactons on Communcatons, 34, 9, pp , S. Mller, An Adaptve Drect-Sequence Code-Dvson Multple-Access Recever for Mult-user Interference Rejecton, IEEE Transactons on Communcatons, 43, 4, pp , P. Rapajc, B. Vucetc, Adaptve Recever Structures for Asynchronous CDMA Systems, IEEE Journal on Selected Areas n Communcatons, 12, 5, pp , W. Hamouda, P. McLane, A Fast Adaptve Algorthm for MMSE Recevers n DS-CDMA Systems, IEEE Sgnal Processng Letters, 11, 2, pp , C. Vlădeanu, Optmum Chaotc Quantzed Sequences for Asynchronous DS-CDMA System, EUSIPCO 2005, Antalya, Turey, 4-8 Sept., S. Cochnă, C. Negrescu, Ssteme adaptve, Ed. Tehncă, Bucharest, S. Hayn, Adaptve Flter Theory, fourth edton, Prentce Hall Upper Saddle Rver, NJ, G.V. Moustades, Study of the Transent Phase of the Forgettng Factor RLS, IEEE Transactons on Sgnal Processng, 45, 10, pp , S. Cochnă, C. Paleologu, A.A. Enescu, On the Behavour of RLS Adaptve Algorthm n Fxed- Pont Implementaton, SCS 2003, Iaş, Romana, July, C. Vlădeanu, C. Paleologu, MMSE Sngle User Iteratve Recever for Asynchronous DS-CDMA Systems, Communcatons 2006, Bucharest, Romana, 8-10 June, 2006.
Consider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.
PASSBAND DIGITAL MODULATION TECHNIQUES Consder the followng passband dgtal communcaton system model. cos( ω + φ ) c t message source m sgnal encoder s modulator s () t communcaton xt () channel t r a n
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationTLCOM 612 Advanced Telecommunications Engineering II
TLCOM 62 Advanced Telecommuncatons Engneerng II Wnter 2 Outlne Presentatons The moble rado sgnal envronment Combned fadng effects and nose Delay spread and Coherence bandwdth Doppler Shft Fast vs. Slow
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationA NEW DISCRETE WAVELET TRANSFORM
A NEW DISCRETE WAVELET TRANSFORM ALEXANDRU ISAR, DORINA ISAR Keywords: Dscrete wavelet, Best energy concentraton, Low SNR sgnals The Dscrete Wavelet Transform (DWT) has two parameters: the mother of wavelets
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationIterative Multiuser Receiver Utilizing Soft Decoding Information
teratve Multuser Recever Utlzng Soft Decodng nformaton Kmmo Kettunen and Tmo Laaso Helsn Unversty of Technology Laboratory of Telecommuncatons Technology emal: Kmmo.Kettunen@hut.f, Tmo.Laaso@hut.f Abstract
More informationOFDM is a good candidate for wireless multimedia communication
Detecton of OFDM-CPM Sgnals over Multpath Channels Imran A. Tasadduq and Raveendra K. Rao Department of Electrcal & Computer Engneerng Elborn College, 11 Western Road The Unversty of Western Ontaro London,
More informationCHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER. In real environmental conditions the speech signal may be
55 CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER 4.1 Introducton In real envronmental condtons the speech sgnal may be supermposed by the envronmental nterference. In general, the spectrum
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationDigital Modems. Lecture 2
Dgtal Modems Lecture Revew We have shown that both Bayes and eyman/pearson crtera are based on the Lkelhood Rato Test (LRT) Λ ( r ) < > η Λ r s called observaton transformaton or suffcent statstc The crtera
More informationPerforming Modulation Scheme of Chaos Shift Keying with Hyperchaotic Chen System
6 th Internatonal Advanced echnologes Symposum (IAS 11), 16-18 May 011, Elazığ, urkey Performng Modulaton Scheme of Chaos Shft Keyng wth Hyperchaotc Chen System H. Oğraş 1, M. ürk 1 Unversty of Batman,
More informationLow Complexity Soft-Input Soft-Output Hamming Decoder
Low Complexty Soft-Input Soft-Output Hammng Der Benjamn Müller, Martn Holters, Udo Zölzer Helmut Schmdt Unversty Unversty of the Federal Armed Forces Department of Sgnal Processng and Communcatons Holstenhofweg
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationTOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:
More informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationLecture 3: Shannon s Theorem
CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts
More informationAverage Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1
Average Decson hreshold of CA CFAR and excson CFAR Detectors n the Presence of Strong Pulse Jammng Ivan G. Garvanov and Chrsto A. Kabachev Insttute of Informaton echnologes Bulgaran Academy of Scences
More informationDC-Free Turbo Coding Scheme Using MAP/SOVA Algorithms
Proceedngs of the 5th WSEAS Internatonal Conference on Telecommuncatons and Informatcs, Istanbul, Turkey, May 27-29, 26 (pp192-197 DC-Free Turbo Codng Scheme Usng MAP/SOVA Algorthms Prof. Dr. M. Amr Mokhtar
More informationCOGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK
COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK Ayman MASSAOUDI, Noura SELLAMI 2, Mohamed SIALA MEDIATRON Lab., Sup Com Unversty of Carthage 283 El Ghazala Arana, Tunsa
More informationMulti-user Detection Based on Weight approaching particle filter in Impulsive Noise
Internatonal Symposum on Computers & Informatcs (ISCI 2015) Mult-user Detecton Based on Weght approachng partcle flter n Impulsve Nose XIAN Jn long 1, a, LI Sheng Je 2,b 1 College of Informaton Scence
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationOn balancing multiple video streams with distributed QoS control in mobile communications
On balancng multple vdeo streams wth dstrbuted QoS control n moble communcatons Arjen van der Schaaf, José Angel Lso Arellano, and R. (Inald) L. Lagendjk TU Delft, Mekelweg 4, 68 CD Delft, The Netherlands
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationStatistical tables are provided Two Hours UNIVERSITY OF MANCHESTER. Date: Wednesday 4 th June 2008 Time: 1400 to 1600
Statstcal tables are provded Two Hours UNIVERSITY OF MNCHESTER Medcal Statstcs Date: Wednesday 4 th June 008 Tme: 1400 to 1600 MT3807 Electronc calculators may be used provded that they conform to Unversty
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationJAB Chain. Long-tail claims development. ASTIN - September 2005 B.Verdier A. Klinger
JAB Chan Long-tal clams development ASTIN - September 2005 B.Verder A. Klnger Outlne Chan Ladder : comments A frst soluton: Munch Chan Ladder JAB Chan Chan Ladder: Comments Black lne: average pad to ncurred
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationIRO0140 Advanced space time-frequency signal processing
IRO4 Advanced space tme-frequency sgnal processng Lecture Toomas Ruuben Takng nto account propertes of the sgnals, we can group these as followng: Regular and random sgnals (are all sgnal parameters determned
More informationAn Improved multiple fractal algorithm
Advanced Scence and Technology Letters Vol.31 (MulGraB 213), pp.184-188 http://dx.do.org/1.1427/astl.213.31.41 An Improved multple fractal algorthm Yun Ln, Xaochu Xu, Jnfeng Pang College of Informaton
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationSignal space Review on vector space Linear independence Metric space and norm Inner product
Sgnal space.... Revew on vector space.... Lnear ndependence... 3.3 Metrc space and norm... 4.4 Inner product... 5.5 Orthonormal bass... 7.6 Waveform communcaton system... 9.7 Some examples... 6 Sgnal space
More information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More informationDifferential Phase Shift Keying (DPSK)
Dfferental Phase Shft Keyng (DPSK) BPSK need to synchronze the carrer. DPSK no such need. Key dea: transmt the dfference between adjacent messages, not messages themselves. Implementaton: b = b m m = 1
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationThe Concept of Beamforming
ELG513 Smart Antennas S.Loyka he Concept of Beamformng Generc representaton of the array output sgnal, 1 where w y N 1 * = 1 = w x = w x (4.1) complex weghts, control the array pattern; y and x - narrowband
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationError Probability for M Signals
Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationPerformance Analysis of Iterative Multistage Detection Scheme for Overloaded DS-CDMA System
Performance Analyss of Iteratve ultstage Detecton Scheme for Overloaded DS-CDA System Preetam Kumar,. Ramesh and Saswat Charaart G. S. Sanyal School of elecommuncatos, II Kharagpur Department of Electroncs
More informationCommunication with AWGN Interference
Communcaton wth AWG Interference m {m } {p(m } Modulator s {s } r=s+n Recever ˆm AWG n m s a dscrete random varable(rv whch takes m wth probablty p(m. Modulator maps each m nto a waveform sgnal s m=m
More informationMonte Carlo Simulation and Generation of Random Numbers
S-7.333 Postgraduate Course n Radocommuncatons Sprng 000 Monte Carlo Smulaton and Generaton of Random umbers Dmtr Foursov Dmtr.Foursov@noka.com Contents. Introducton. Prncple of Monte Carlo Smulaton 3.
More informationA Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function
Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1,
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationDe-noising Method Based on Kernel Adaptive Filtering for Telemetry Vibration Signal of the Vehicle Test Kejun ZENG
6th Internatonal Conference on Mechatroncs, Materals, Botechnology and Envronment (ICMMBE 6) De-nosng Method Based on Kernel Adaptve Flterng for elemetry Vbraton Sgnal of the Vehcle est Kejun ZEG PLA 955
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationPower Allocation for Distributed BLUE Estimation with Full and Limited Feedback of CSI
Power Allocaton for Dstrbuted BLUE Estmaton wth Full and Lmted Feedback of CSI Mohammad Fanae, Matthew C. Valent, and Natala A. Schmd Lane Department of Computer Scence and Electrcal Engneerng West Vrgna
More informationMULTISPECTRAL IMAGE CLASSIFICATION USING BACK-PROPAGATION NEURAL NETWORK IN PCA DOMAIN
MULTISPECTRAL IMAGE CLASSIFICATION USING BACK-PROPAGATION NEURAL NETWORK IN PCA DOMAIN S. Chtwong, S. Wtthayapradt, S. Intajag, and F. Cheevasuvt Faculty of Engneerng, Kng Mongkut s Insttute of Technology
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationComparison of Wiener Filter solution by SVD with decompositions QR and QLP
Proceedngs of the 6th WSEAS Int Conf on Artfcal Intellgence, Knowledge Engneerng and Data Bases, Corfu Island, Greece, February 6-9, 007 7 Comparson of Wener Flter soluton by SVD wth decompostons QR and
More informationA Fast Computer Aided Design Method for Filters
2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationMultiple Sound Source Location in 3D Space with a Synchronized Neural System
Multple Sound Source Locaton n D Space wth a Synchronzed Neural System Yum Takzawa and Atsush Fukasawa Insttute of Statstcal Mathematcs Research Organzaton of Informaton and Systems 0- Mdor-cho, Tachkawa,
More informationDO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED.
EE 539 Homeworks Sprng 08 Updated: Tuesday, Aprl 7, 08 DO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED. For full credt, show all work. Some problems requre hand calculatons.
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationProbability Density Function Estimation by different Methods
EEE 739Q SPRIG 00 COURSE ASSIGMET REPORT Probablty Densty Functon Estmaton by dfferent Methods Vas Chandraant Rayar Abstract The am of the assgnment was to estmate the probablty densty functon (PDF of
More informationNovel Pre-Compression Rate-Distortion Optimization Algorithm for JPEG 2000
Novel Pre-Compresson Rate-Dstorton Optmzaton Algorthm for JPEG 2000 Yu-We Chang, Hung-Ch Fang, Chung-Jr Lan, and Lang-Gee Chen DSP/IC Desgn Laboratory, Graduate Insttute of Electroncs Engneerng Natonal
More informationLecture Space-Bounded Derandomization
Notes on Complexty Theory Last updated: October, 2008 Jonathan Katz Lecture Space-Bounded Derandomzaton 1 Space-Bounded Derandomzaton We now dscuss derandomzaton of space-bounded algorthms. Here non-trval
More informationAdaptive Consensus Control of Multi-Agent Systems with Large Uncertainty and Time Delays *
Journal of Robotcs, etworkng and Artfcal Lfe, Vol., o. (September 04), 5-9 Adaptve Consensus Control of Mult-Agent Systems wth Large Uncertanty and me Delays * L Lu School of Mechancal Engneerng Unversty
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationHopfield Training Rules 1 N
Hopfeld Tranng Rules To memorse a sngle pattern Suppose e set the eghts thus - = p p here, s the eght beteen nodes & s the number of nodes n the netor p s the value requred for the -th node What ll the
More informationA Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.
More informationS Advanced Digital Communication (4 cr) Targets today
S.72-3320 Advanced Dtal Communcaton (4 cr) Convolutonal Codes Tarets today Why to apply convolutonal codn? Defnn convolutonal codes Practcal encodn crcuts Defnn qualty of convolutonal codes Decodn prncples
More informationClock Synchronization in WSN: from Traditional Estimation Theory to Distributed Signal Processing
Clock Synchronzaton n WS: from Tradtonal Estmaton Theory to Dstrbuted Sgnal Processng Yk-Chung WU The Unversty of Hong Kong Emal: ycwu@eee.hku.hk, Webpage: www.eee.hku.hk/~ycwu Applcatons requre clock
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationSTAT 511 FINAL EXAM NAME Spring 2001
STAT 5 FINAL EXAM NAME Sprng Instructons: Ths s a closed book exam. No notes or books are allowed. ou may use a calculator but you are not allowed to store notes or formulas n the calculator. Please wrte
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationIN synchronous Code Division Multiple Access (CDMA)
1 Optmal Groupng Algorthm for a Group Decson Feedbac Detector n Synchronous CDMA Communcatons J. Luo, K. Pattpat, P. Wllett, G. Levchu Abstract he Group Decson Feedbac (GDF) detector s studed n ths paper.
More informationAN IMPROVED PARTICLE FILTER ALGORITHM BASED ON NEURAL NETWORK FOR TARGET TRACKING
AN IMPROVED PARTICLE FILTER ALGORITHM BASED ON NEURAL NETWORK FOR TARGET TRACKING Qn Wen, Peng Qcong 40 Lab, Insttuton of Communcaton and Informaton Engneerng,Unversty of Electronc Scence and Technology
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2015 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons We consder a network of many neurons, each of whch obeys a set of conductancebased,
More informationSIO 224. m(r) =(ρ(r),k s (r),µ(r))
SIO 224 1. A bref look at resoluton analyss Here s some background for the Masters and Gubbns resoluton paper. Global Earth models are usually found teratvely by assumng a startng model and fndng small
More information