搜索结果
找到约 120 项符合
Near-Capacity 的查询结果
书籍 Near-Capacity+Multi-Functional+MIMO+Systems
The family of recent wireless standards included the optional employment of MIMO tyechniques.
This was motivated by the observation according to the classic Shannon-Hartley law the achiev-
able channel capacity increases logarithmically with the transmit power. By contrast, the MIMO
capacity increas ...
其他书籍 Near-Optimal Selection Of Transmit Antennas For A Mimo Channel Based On Shannon Capacity
Near-Optimal Selection Of Transmit Antennas For A Mimo Channel Based On Shannon Capacity
软件工程 CMM是软件过程能力成熟度模型(Capacity Maturity Model)的简称
CMM是软件过程能力成熟度模型(Capacity Maturity Model)的简称,是卡内基-梅隆大学软件工程研究院为了满足美国联邦政府评估软件供应商能力的要求,于1986年开始研究的模型,并于1991年正式推出了CMM 1.0 版。CMM自问世以来备受关注,在一些发达国家和地区得到了广泛应用,成为衡量软件公司软件开发管理水平的重要参考因 ...
VHDL/FPGA/Verilog Capacity RAM Model的VHDL的例子。最佳的资源优化版。
Capacity RAM Model的VHDL的例子。最佳的资源优化版。
人工智能/神经网络 this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, s ...
行业发展研究 I believe that technology has the capacity to fundamentally improve people’s lives, and improve the
I believe that technology has the capacity to fundamentally improve people’s lives, and
improve the world in which we live.We are now two years into what my company have
called the ‘Digital Decade’.We think that by 2010 a combination of hardware and software
innovation with broader social trends ...
行业发展研究 Capacity and Random-Coding Exponents for Channel Coding with Side Information (P.moulin关于信息隐藏容量的论文
Capacity and Random-Coding Exponents
for Channel Coding with Side Information
(P.moulin关于信息隐藏容量的论文2006年)
Delphi控件源码 show disk capacity for large drive in delphi
show disk capacity for large drive in delphi
matlab例程 Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algo
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
matlab例程 The Capacity of a MIMO channel with nt transmit antenna and nr recieve antenna is analyzed. The p
The
Capacity of a MIMO channel with nt transmit antenna and nr recieve
antenna is analyzed. The power in parallel channel (after
decomposition) is distributed as water-filling algorithm