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

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

fourier

  • Hybrid+Analog-Digital+Precoding

    In this paper we revisit hybrid analog-digital precoding systems with emphasis on their modelling and radio-frequency (RF) losses, to realistically evaluate their benefits in 5G system implementations. For this, we decompose the analog beamforming networks (ABFN) as a bank of commonly used RF components and formulate realistic model constraints based on their S-parameters. Specifically, we concentrate on fully-connected ABFN (FC-ABFN) and Butler networks for implementing the discrete fourier transform (DFT) in the RF domain. The results presented in this paper reveal that the performance and energy efficiency of hybrid precoding systems are severely affected, once practical factors are considered in the overall design. In this context, we also show that Butler RF networks are capable of providing better performances than FC-ABFN for systems with a large number of RF chains.

    標簽: Analog-Digital Precoding Hybrid

    上傳時間: 2020-05-27

    上傳用戶:shancjb

  • OFDM+Wireless+LANS

    Before delving into the details of orthogonal frequency division multiplexing (OFDM), relevant background material must be presented first. The purpose of this chapter is to provide the necessary building blocks for the development of OFDM principles. Included in this chapter are reviews of stochastic and random process, discrete-time signals and systems, and the Discrete fourier Transform (DFT). Tooled with the necessary mathematical foundation, we proceed with an overview of digital communication systems and OFDM communication systems. We conclude the chapter with summaries of the OFDM wireless LAN standards currently in existence and a high-level comparison of single carrier systems versus OFDM.

    標簽: Wireless OFDM LANS

    上傳時間: 2020-05-31

    上傳用戶:shancjb

  • fft信號分析

    快速傅里葉變換,fft應用實例。供學習,供參考。 原理:快速傅里葉變換 (fast fourier transform), 即利用計算機計算離散傅里葉變換(DFT)的高效、快速計算方法的統稱,簡稱FFT。快速傅里葉變換是1965年由J.W.庫利和T.W.圖基提出的。采用這種算法能使計算機計算離散傅里葉變換所需要的乘法次數大為減少,特別是被變換的抽樣點數N越多,FFT算法計算量的節省就越顯著。

    標簽: fft 信號分析

    上傳時間: 2021-07-14

    上傳用戶:hhh4321

主站蜘蛛池模板: 呼伦贝尔市| 凤冈县| 科技| 左贡县| 张家界市| 九寨沟县| 柘荣县| 绥滨县| 平陆县| 登封市| 漠河县| 和林格尔县| 慈溪市| 海安县| 弥渡县| 株洲县| 广饶县| 隆昌县| 泗阳县| 郓城县| 綦江县| 鄂伦春自治旗| 山西省| 广水市| 绵阳市| 隆德县| 安岳县| 巴楚县| 浪卡子县| 孟村| 宜川县| 海兴县| 兴业县| 大安市| 天峻县| 辽源市| 津市市| 巴东县| 赤壁市| 莱阳市| 包头市|