Search - max - CodeBus

Search - max - List

[Program doc] edaclock DL : 0: maxplus2变得电子钟程序/// ///// -maxplus2 become electronic bell procedures
Date : 2025-12-28 Size : 667kb User : xuemiao
[Program doc] MAX+plusIIxiaVHDLsheji DL : 0: VHDL在MAX+plusII下进行的电路设计!是一个WORD文档!-VHDL in MAX+ PlusII carried out under the circuit design! Is a WORD document!
Date : 2025-12-28 Size : 12kb User : 段正伟
[Program doc] Wi-Fi_Wimax DL : 0: wi max presentation, very nice and very clear understanding. Wimax
Date : 2025-12-28 Size : 1.83mb User : volkan
[Program doc] WiMAX_downlink_simulink DL : 0: simulink for Wi-Max design
Date : 2025-12-28 Size : 12kb User : Zaki
[Program doc] auction DL : 0: A code that finds max in a column and return its position
Date : 2025-12-28 Size : 2kb User : Monkeyte
[Program doc] harminv DL : 0: this file find max & min of a signal in time domain
Date : 2025-12-28 Size : 1kb User : ghasem
[Program doc] Lloyd DL : 0: LLoyd max qeuatizer with matlab code
Date : 2025-12-28 Size : 379kb User : qe13
[Program doc] SIC_THP3 DL : 0: he term dirty paper coding comes Max Costa[1] who imagined a paper which is partially covered with dirt that is indistinguishable ink. The theorem says that if the writer knows where the dirt is to start with, she can convey just as much information by writing on the paper as if it were clean, even though the reader does not know where the dirt is. In this case the dirt is interference, the paper is the channel, the writer on the paper is the transmitter, and the reader is the receiver. In information-theoretic terms, dirty-paper coding achieves the channel capacity, without a power penalty and without requiring the receiver to gain knowledge of the interference state. Note that DPC at the encoder is an information-theoretic dual of Wyner-Ziv coding at the decoder[citation needed].-he term dirty paper coding comes Max Costa[1] who imagined a paper which is partially covered with dirt that is indistinguishable ink. The theorem says that if the writer knows where the dirt is to start with, she can convey just as much information by writing on the paper as if it were clean, even though the reader does not know where the dirt is. In this case the dirt is interference, the paper is the channel, the writer on the paper is the transmitter, and the reader is the receiver. In information-theoretic terms, dirty-paper coding achieves the channel capacity, without a power penalty and without requiring the receiver to gain knowledge of the interference state. Note that DPC at the encoder is an information-theoretic dual of Wyner-Ziv coding at the decoder[citation needed].
Date : 2025-12-28 Size : 10kb User : alan
[Program doc] 16QAM_ML-detection DL : 0: the use of multiple antennas at the transmitter and receiver in wireless systems,know as MIMO technology. 16-ary QAM by Max Likelihood(ML) detection
Date : 2025-12-28 Size : 504kb User : yifan
[Program doc] MRC-simulation DL : 0: 最大比合并技术仿真,该技术可用于分集接收-MRC（max ratio combine)
Date : 2025-12-28 Size : 70kb User : jason
[Program doc] LFM123 DL : 0: 基于matlab实现 LFM信号和输出最大的SNR。简单的一钟压缩脉冲信号-it is base on matlab。 to make LFM and out put max SNR。
Date : 2025-12-28 Size : 1kb User : 何果
[Program doc] algorithm provide QOS for 4G networks DL : 0: There is a growing interest of wireless operators to migrate their existing 3G networks to different 4G technologies such as Wi MAX and L TE. In this heterogeneous environment of wireless networks and architectures, one of the major concerns is how to allocate network resources efficiently to diverse traffic classes with different QoS constraints. Further it has been convincingly demonstrated through numerous high quality studies that multimedia traffic found in modern wireless networks exhibits Long-Range Dependence (LRD) and self-similarity, a phenomenon which cant' be captured by traditional traffic modeling based on simplistic Poisson model.
Date : 2025-12-28 Size : 349kb User : hicham
[Program doc] Outage analysis and power allocation in uplink non-orthogonal multiple access systems DL : 0: We propose a tractable expression for the outage probability in single-cell uplink non-orthogonal multiple access (NOMA) systems serving an arbitrary number of users. The expression is obtained by approximating the interuser interference using a shifted-gamma distributed random variable. We then formulate and propose an efficient iterative algorithm for the outage-constrained min–max power allocation problem for the NOMA system. To give a rigorous comparison, we solve the outage-constrained min–max power allocation problem for the orthogonal multiple access (OMA) counterpart where both the user power allocation and the radio resource division pattern are optimized. Simulations confirm the accuracy of the derived outage probability expression for the NOMA system. Also, we demonstrate that fairness among users in terms of transmission power can be achieved by NOMA. Moreover, NOMA can bring significant power savings to the users as compared with OMA
Date : 2021-08-30 Size : 556.47kb User : dipfr@yahoo.fr