Description: This set of simulation files performs a computational complexity performance comparison of the two methods mentioned in the paper. The source is ANSI-C compliant, hence any C-compiler can be used to compile the source code. It has been tested using Visual Studio.net C++ and TI code composer studio C compiler for the TMS320C6701. Note that the performance comparison may be different for different platforms.-This set of simulation files performs a com putational complexity performance compariso n of the two methods mentioned in the paper. The s ource is ANSI-C compliant. hence any C-compiler can be used to compile the s ource code. It has been tested using Visual Stud io.net C and TI code composer studio C compiler f or the TMS320C6701. Note that the performance c omparison may be different for different platf orms. Platform: |
Size: 593301 |
Author:马文 |
Hits:
Description: 块状OFDMA仿真,同样是在多径信道下,对初学者帮助不言而喻-massive OFDMA simulation, in the same multi-path channel, for beginners to help self-evident Platform: |
Size: 2584 |
Author:宿星辉 |
Hits:
Description: This set of simulation files performs a computational complexity performance comparison of the two methods mentioned in the paper. The source is ANSI-C compliant, hence any C-compiler can be used to compile the source code. It has been tested using Visual Studio.net C++ and TI code composer studio C compiler for the TMS320C6701. Note that the performance comparison may be different for different platforms.-This set of simulation files performs a com putational complexity performance compariso n of the two methods mentioned in the paper. The s ource is ANSI-C compliant. hence any C-compiler can be used to compile the s ource code. It has been tested using Visual Stud io.net C and TI code composer studio C compiler f or the TMS320C6701. Note that the performance c omparison may be different for different platf orms. Platform: |
Size: 592896 |
Author:马文 |
Hits:
Description: 块状OFDMA仿真,同样是在多径信道下,对初学者帮助不言而喻-massive OFDMA simulation, in the same multi-path channel, for beginners to help self-evident Platform: |
Size: 2048 |
Author:宿星辉 |
Hits:
Description: 本文对3GPPLTE中的OFDMA和SC_FDMA性能通过matlab仿真比较-In this paper, 3GPPLTE in the performance of OFDMA and SC_FDMA arecompared through simulation matlab Platform: |
Size: 2475008 |
Author:留心呀 |
Hits:
Description: 这是一个MIMO系统的Space-Time Codes and MIMO Systems 的matlab仿真程序,全书所有章节的仿真程序,都有详细的程序。-This is a MIMO system, Space-Time Codes and MIMO Systems of matlab simulation program, all the chapters of the book simulation program, there are detailed procedures. Platform: |
Size: 274432 |
Author:安大 |
Hits:
Description: 很好OFDMA的matlab仿真程序,程序简明的对系统进行了仿真,OFDMA入门级资料-OFDMA of matlab simulation program well, the program simple system simulation, OFDMA entry-level data Platform: |
Size: 5120 |
Author:刘硕 |
Hits:
Description: OFDMA仿真代码,可以直接运行,包含很多M文件,可以分块使用,非常有用。-OFDMA simulation code can run, including a lot of M file, you can block use, very useful. Platform: |
Size: 13312 |
Author:jeson |
Hits:
Description: 基于OFDMA系统的多用户资源分配算法,论文配备MATLAB代码,入门的好教材。- Orthogonal Frequency Division Multiple Access (OFDMA) basestations allow multiple users to transmit simultaneously on different subcarriers during the same symbol period. This paper considers basestation allocation of subcarriers and power to each user to maximize the sum of user data rates, subject to constraints on total power, bit error rate, and proportionality
among user data rates. Previous allocation methods have been iterative nonlinear methods suitable for ofine optimization. In the special high subchannel SNR case, an iterative root-nding method has linear-time complexity in the number of users and
N logN complexity in the number of subchannels. We propose
a non-iterative method that is made possible by our relaxation
of strict user rate proportionality constraints. Compared to the
root-nding method, the proposed method waives the restriction
of high subchannel SNR, has signicantly lower complexity, and
in simulation, yields higher user data rates. Platform: |
Size: 160768 |
Author:王刚名 |
Hits: