亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲(chóng)蟲(chóng)首頁(yè)| 資源下載| 資源專(zhuān)輯| 精品軟件
登錄| 注冊(cè)

probability

  • Mathematics and probability for communication engineers

    Mathematics and probability for communication engineers

    標(biāo)簽: communication Mathematics probability engineers

    上傳時(shí)間: 2013-12-14

    上傳用戶(hù):cainaifa

  • probability and Random Processes

    Many good textbooks exist on probability and random processes written at the under- graduate level to the research level. However, there is no one handy and ready book that explains most of the essential topics, such as random variables and most of their frequently used discrete and continuous probability distribution functions; moments, transformation, and convergences of random variables; characteristic and generating functions; estimation theory and the associated orthogonality principle; vector random variables; random processes and their autocovariance and cross-covariance functions; sta- tionarity concepts; and random processes through linear systems and the associated Wiener and Kalman filters. 

    標(biāo)簽: probability Processes Random and

    上傳時(shí)間: 2020-05-31

    上傳用戶(hù):shancjb

  • 快速跳頻通信系統(tǒng)同步技術(shù)研究

    同步技術(shù)是跳頻通信系統(tǒng)的關(guān)鍵技術(shù)之一,尤其是在快速跳頻通信系統(tǒng)中,常規(guī)跳頻通信通過(guò)同步字頭攜帶相關(guān)碼的方法來(lái)實(shí)現(xiàn)同步,但對(duì)于快跳頻來(lái)說(shuō),由于是一跳或者多跳傳輸一個(gè)調(diào)制符號(hào),難以攜帶相關(guān)碼。對(duì)此引入雙跳頻圖案方法,提出了一種適用于快速跳頻通信系統(tǒng)的同步方案。采用短碼攜帶同步信息,克服了快速跳頻難以攜帶相關(guān)碼的困難。分析了同步性能,仿真結(jié)果表明該方案同步時(shí)間短、虛警概率低、捕獲概率高,同步性能可靠。 Abstract:  Synchronization is one of the key techniques to frequency-hopping communication system, especially in the fast frequency hopping communication system. In conventional frequency hopping communication systems, synchronization can be achieved by synchronization-head which can be used to carry the synchronization information, but for the fast frequency hopping, Because modulation symbol is transmitted by per hop or multi-hop, it is difficult to carry the correlation code. For the limitation of fast frequency hopping in carrying correlation code, a fast frequency-hopping synchronization scheme with two hopping patterns is proposed. The synchronization information is carried by short code, which overcomes the difficulty of correlation code transmission in fast frequency-hopping. The performance of the scheme is analyzed, and simulation results show that the scheme has the advantages of shorter synchronization time, lower probability of false alarm, higher probability of capture and more reliable of synchronization.

    標(biāo)簽: 快速跳頻 同步技術(shù) 通信系統(tǒng)

    上傳時(shí)間: 2013-11-23

    上傳用戶(hù):mpquest

  • bayeserr - Computes the Bayesian risk for optimal classifier. % bayescln - Classifier based on Baye

    bayeserr - Computes the Bayesian risk for optimal classifier. % bayescln - Classifier based on Bayes decision rule for Gaussians. % bayesnd - Discrim. function, dichotomy, max aposteriori probability. % bhattach - Bhattacharya s upper limit of mean class. error. % pbayescln - Plots discriminat function of Bayes classifier.

    標(biāo)簽: Classifier classifier bayeserr Computes

    上傳時(shí)間: 2015-06-14

    上傳用戶(hù):sunjet

  • HMM(Hidden Markov Model)

    HMM(Hidden Markov Model),狀態(tài)數(shù)目N=3,觀察符號(hào)數(shù)目M=2,時(shí)間長(zhǎng)度T=3。 (a) probability Evaluation: 給定狀態(tài)轉(zhuǎn)換機(jī)率A、狀態(tài)符號(hào)觀察機(jī)率B、和起始機(jī)率 ,求觀察序列 出現(xiàn)的機(jī)率。 (b) Optimal State Sequence: 給定狀態(tài)轉(zhuǎn)換機(jī)率A、狀態(tài)符號(hào)觀察機(jī)率B、起始機(jī)率 、和觀察序列 ,求一個(gè)狀態(tài)序列 使得O出現(xiàn)的機(jī)率最大。 (c) Parameter Estimation: 給定狀態(tài)轉(zhuǎn)換機(jī)率A、狀態(tài)符號(hào)觀察機(jī)率B、起始機(jī)率 、和觀察序列 ,求新的A、B、 ,使得O出現(xiàn)的機(jī)率最大。

    標(biāo)簽: Hidden Markov Model HMM

    上傳時(shí)間: 2014-08-28

    上傳用戶(hù):heart520beat

  • We address the problem of blind carrier frequency-offset (CFO) estimation in quadrature amplitude mo

    We address the problem of blind carrier frequency-offset (CFO) estimation in quadrature amplitude modulation, phase-shift keying, and pulse amplitude modulation communications systems.We study the performance of a standard CFO estimate, which consists of first raising the received signal to the Mth power, where M is an integer depending on the type and size of the symbol constellation, and then applying the nonlinear least squares (NLLS) estimation approach. At low signal-to noise ratio (SNR), the NLLS method fails to provide an accurate CFO estimate because of the presence of outliers. In this letter, we derive an approximate closed-form expression for the outlier probability. This enables us to predict the mean-square error (MSE) on CFO estimation for all SNR values. For a given SNR, the new results also give insight into the minimum number of samples required in the CFO estimation procedure, in order to ensure that the MSE on estimation is not significantly affected by the outliers.

    標(biāo)簽: frequency-offset estimation quadrature amplitude

    上傳時(shí)間: 2014-01-22

    上傳用戶(hù):牛布牛

  • We present a particle filter construction for a system that exhibits time-scale separation. The sep

    We present a particle filter construction for a system that exhibits time-scale separation. The separation of time-scales allows two simplifications that we exploit: i) The use of the averaging principle for the dimensional reduction of the system needed to solve for each particle and ii) the factorization of the transition probability which allows the Rao-Blackwellization of the filtering step. Both simplifications can be implemented using the coarse projective integration framework. The resulting particle filter is faster and has smaller variance than the particle filter based on the original system. The convergence of the new particle filter to the analytical filter for the original system is proved and some numerical results are provided.

    標(biāo)簽: construction separation time-scale particle

    上傳時(shí)間: 2016-01-02

    上傳用戶(hù):fhzm5658

  • The algorm of viterbi. You talk to your friend three days in a row and discover that on the first da

    The algorm of viterbi. You talk to your friend three days in a row and discover that on the first day he went for a walk, on the second day he went shopping, and on the third day he cleaned his apartment. You have two questions: What is the overall probability of this sequence of observations? And what is the most likely sequence of rainy/sunny days that would explain these observations? The first question is answered by the forward algorithm the second question is answered by the Viterbi algorithm. These two algorithms are structurally so similar (in fact, they are both instances of the same abstract algorithm) that they can be implemented in a single function:

    標(biāo)簽: discover viterbi algorm friend

    上傳時(shí)間: 2016-02-16

    上傳用戶(hù):xc216

  • This project aim was to build wireless software modem for data communication between two computers

    This project aim was to build wireless software modem for data communication between two computers using an acoustic interface in the voice frequency range (20Hz– 20,000Hz). The transmitting antenna is a speaker (frequency response of: 90Hz – 20,000Hz) and the receiving antenna is a microphone (frequency response of: 100Hz – 16,000Hz). The test files used as information files were text files. This goal was attained both in an incoherent scheme and in a coherent scheme. Build under Matlab code, our modem uses OFDM (orthogonal frequency division multiplexing) modulation, synchronization by LMS sequence, channel estimation (no equalizer) via pilot tones. The symbols are either PSK or ASK for a constellation size of 2 or 4. To optimize the probability of error, these symbols were mapped using Gray mapping. Report

    標(biāo)簽: communication computers software wireless

    上傳時(shí)間: 2014-05-29

    上傳用戶(hù):wangdean1101

  • GloptiPoly 3: moments, optimization and semidefinite programming. Gloptipoly 3 is intended to so

    GloptiPoly 3: moments, optimization and semidefinite programming. Gloptipoly 3 is intended to solve, or at least approximate, the Generalized Problem of Moments (GPM), an infinite-dimensional optimization problem which can be viewed as an extension of the classical problem of moments [8]. From a theoretical viewpoint, the GPM has developments and impact in various areas of mathematics such as algebra, Fourier analysis, functional analysis, operator theory, probability and statistics, to cite a few. In addition, and despite a rather simple and short formulation, the GPM has a large number of important applications in various fields such as optimization, probability, finance, control, signal processing, chemistry, cristallography, tomography, etc. For an account of various methodologies as well as some of potential applications, the interested reader is referred to [1, 2] and the nice collection of papers [5].

    標(biāo)簽: optimization semidefinite programming GloptiPoly

    上傳時(shí)間: 2016-06-05

    上傳用戶(hù):lgnf

主站蜘蛛池模板: 贺兰县| 安丘市| 五河县| 吴旗县| 静宁县| 彩票| 尼玛县| 黑河市| 墨脱县| 朔州市| 宿迁市| 兰州市| 乌鲁木齐县| 涞源县| 鞍山市| 威信县| 同江市| 安国市| 邮箱| 区。| 资中县| 乌海市| 英山县| 光山县| 瑞安市| 铅山县| 读书| 阜康市| 平远县| 内乡县| 峨山| 迁安市| 双桥区| 犍为县| 磐安县| 彭州市| 鹿邑县| 府谷县| 华池县| 嘉兴市| 聂拉木县|