<strike id="gemoq"></strike>
A combined space鈥搕ime block coding (STBC) and eigen-space tracking (EST) scheme in multiple-input-multiple-output systems is proposed. It is proved that the STBC-EST is capable of shifting hardware complexity from the receiver to the transmitter without any bit error rate (BER) performance loss. A computation efficient EST algorithm is also proposed, which makes the STBC-EST affordable. Simulation results show that the STBC-EST with a modest feedback requirement results in a negligible BER performance loss compared with a dual system configuration.
標簽： multiple-input-m eigen-space combined tracking
上傳時間： 2014-01-13
上傳用戶：磊子226
A user-space device driver can do many of the things that kernel drivers can t, such as perform a long-running computation, block while waiting for an event, or read files from the file system. Unlike kernel drivers, a user-space device driver can use other device drivers--that is, access the network, talk to a serial port, get interactive input from the user, pop up GUI windows, or read from disks. User-space drivers implemented using FUSD can be much easier to debug it is impossible for them to crash the machine, are easily traceable using tools such as gdb, and can be killed and restarted without rebooting even if they become corrupted. FUSD drivers don t have to be in C--Perl, Python, or any other language that knows how to read from and write to a file descriptor can work with FUSD. User-space drivers can be swapped out, whereas kernel drivers lock physical memory.
標簽： user-space can drivers perform
上傳時間： 2014-01-01
上傳用戶：saharawalker
Blocking CoThe aim of this toolbox is to compute blocking probabilities in WDM networks. This work was based on [1], [2], [3], [4] and user is referred to those papers for deeper study. Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources.computation in WDM Networks Toolbox
標簽： probabilities Blocking blocking networks
上傳時間： 2014-01-14
上傳用戶：iswlkje
Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network. Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three graph algorithms for shortest path computation are also in this toolbox (they are used for traffic matrix creation).
標簽： networks blocking switched Because
上傳時間： 2017-07-28
上傳用戶：zhangzhenyu
Matlab 畫三維立體圖形 The aim of geom3d library is to handle and visualize 3D geometric primitives such as points, lines, planes, polyhedra... It provides low-level functions for manipulating 3D geometric primitives, making easier the development of more complex geometric algorithms. Some features of the library are: - creation of various shapes (3D points, 3D lines, planes, polyhedra...) through an intuitive syntax. Ex: createPlane(p1, p2, p3) to create a plane through 3 points. - derivation of new shapes: intersection between 2 planes, intersection between a plane and a line, between a sphere and a line... - functions for 3D polygons and polyhedra. Polyhedra use classical vertex-faces arrays (face array contain indices of vertices), and support faces with any number of vertices. Some basic models are provided (createOctaedron, createCubeoctaedron...), as well as some computation (like faceNormal or centroid) - manipulation of planar transformation. Ex.: ROT = createRotationOx(THETA); P2 = transformPoint3d(P1, ROT); - direct drawing of shapes with specialized functions. Clipping is performed automatically for infinite shapes such as lines or rays. Ex: drawPoint3d([50 50 25; 20 70 10], 'ro'); % draw some points drawLine3d([X0 Y0 Z0 DX DY DZ]); % clip and draw straight line Some functions require the geom2d package. Additional help is provided in geom3d/Contents.m file, as well as summary files like 'points3d.m' or 'lines3d.m'.
標簽： Matlab 畫三維立體圖形
上傳時間： 2015-11-02
上傳用戶：A1321
computation of loudness (Zwicker model) according to ISO 532B / DIN 45631 norms. This model is valid for steady sounds. Code based on BASIC program published in the following article: Program for calculating loudness according to DIN 45 631 (ISO 532B)", E.Zwicker and H.Fastl, J.A.S.J (E) 12, 1 (1991).
上傳時間： 2016-11-14
上傳用戶：zztony16
粒子群優化算法（PSO）是一種進化計算技術（evolutionary computation）,1995 年由Eberhart 博士和kennedy 博士提出，源于對鳥群捕食的行為研究 。
標簽： 粒子群算法
上傳時間： 2017-09-18
上傳用戶：yinfanghao
obot control, a subject aimed at making robots behave as desired, has been extensively developed for more than two decades. Among many books being published on this subject, a common feature is to treat a robot as a single system that is to be controlled by a variety of control algorithms depending on different scenarios and control objectives. However, when a robot becomes more complex and its degrees of freedom of motion increase substantially, the needed control computation can easily go beyond the scope a modern computer can handle within a pre-specified sampling period. A solution is to base the control on subsystem dynamics.
標簽： decomposition virtual control
上傳時間： 2019-09-04
上傳用戶：txb96
% computation of ST-ZCR and STE of a speech signal. % % Functions required: zerocross, sgn, winconv. % % Author: Nabin Sharma % Date: 2009/03/15 [x,Fs] = wavread('so.wav'); % word is: so x = x.'; N = length(x); % signal length n = 0:N-1; ts = n*(1/Fs); % time for signal % define the window wintype = 'rectwin'; winlen = 201; winamp = [0.5,1]*(1/winlen);
標簽： 短時過零率和短時能量
上傳時間： 2019-09-23
上傳用戶：minwenji
Evolutionary computation (EC) deals with problem solving, optimization, and machine learning techniques inspired by principles of natural evolution and ge- netics. Just from this basic definition, it is clear that one of the main features of the research community involved in the study of its theory and in its applications is multidisciplinarity. For this reason, EC has been able to draw the attention of an ever-increasing number of researchers and practitioners in several fields.
標簽： Applications Evolutionary Computing of
上傳時間： 2020-05-26
上傳用戶：shancjb
