This document contains documentation on how to use the Long Term Evolution (LTE) System Level simulator [1] as well as some insight on its structure and the assumptions that were made while developing it. This document relates more on how to actually use the simulator. The concept and the structure of the simulator is described in more detail in [2].

Filename	Size	Update
srv1_9	0	2015-03-07
srv1_9\readMe.txt	3508	2015-03-03
srv1_9\exampleUSR.m	509	2015-03-03
srv1_9\wvote.m	858	2013-02-15
srv1_9\vsmf.m	7186	2015-03-07
srv1_9\vote.m	821	2011-10-12
srv1_9\vec2mat.m	290	2010-09-28
srv1_9\usr.m	4308	2013-02-23
srv1_9\unmatrizicing.m	1397	2011-10-12
srv1_9\threeDSearchUniverse.m	4116	2013-02-04
srv1_9\subspace.m	1975	2013-07-11
srv1_9\SRC2.m	3170	2015-03-03
srv1_9\src.m	3150	2011-12-17
srv1_9\sparsity.m	372	2013-07-11
srv1_9\sparsenmfnnlstest.m	1450	2012-01-12
srv1_9\softSVMTrain2.m	7046	2012-11-12
srv1_9\softSVMPredict2.m	2178	2012-09-16
srv1_9\significantAcc.m	3206	2012-11-25
srv1_9\sampleSelNNLS.m	961	2011-11-19
srv1_9\sampleSelKNN.m	493	2011-11-19
srv1_9\pseudoinverse.m	570	2011-10-12
srv1_9\proximalOperator.m	486	2013-04-04
srv1_9\plotTime.m	399	2012-04-05
srv1_9\plotNemenyiTest.m	1795	2012-11-25
srv1_9\plotDataMulti.m	1808	2012-04-05
srv1_9\plotBarError.m	2525	2013-02-20
srv1_9\perform.m	4100	2012-08-10
srv1_9\normmean0std1.m	869	2011-10-12
srv1_9\normcl1.m	175	2011-11-19
srv1_9\normalizeKernelMatrix.m	393	2012-02-17
srv1_9\NNQPSMOMulti.m	248	2013-05-23
srv1_9\NNQPSMO.m	1424	2013-05-23
srv1_9\NNQPIPMulti.m	527	2013-07-16
srv1_9\NNQPIP.m	2582	2013-07-16
srv1_9\NNQPActiveSet.m	5216	2015-03-07
srv1_9\NNLSKernelBatch.m	875	2012-02-09
srv1_9\nnlsClassifierLargeSampleSize.m	3223	2011-11-19
srv1_9\nnlsClassifier.m	4017	2013-04-04
srv1_9\nearestCentroidTrain.m	774	2012-09-18
srv1_9\nearestCentroidPredict.m	543	2012-09-18
srv1_9\multiClassifiers.m	4187	2013-07-24
srv1_9\mergeOption.m	529	2011-05-27
srv1_9\matrizicing.m	1330	2006-11-01
srv1_9\matrixNorm.m	225	2011-10-12
srv1_9\mat2vec.m	254	2010-09-28
srv1_9\lrc.m	2595	2013-03-15
srv1_9\log2Inf.m	183	2011-10-12
srv1_9\localSVM.m	2047	2012-08-10
srv1_9\lineSearchSRC2.m	2369	2011-10-12
srv1_9\lineSearchNNLS.m	2276	2011-10-11
srv1_9\leaveMOut.m	1427	2012-11-25
srv1_9\learnCurve.m	1281	2012-11-25
srv1_9\l1QPSMOMulti.m	238	2013-05-23
srv1_9\l1QPSMO.m	2517	2013-05-23
srv1_9\l1QPProximalMulti.m	364	2013-07-17
srv1_9\l1QPProximal.m	1341	2013-07-16
srv1_9\l1QPMultiTemp.m	279	2013-05-29
srv1_9\l1QPIPMulti.m	558	2013-07-16
srv1_9\l1QPIP.m	3088	2013-07-16
srv1_9\l1QPActiveSet.m	3453	2013-07-16
srv1_9\l1NNQPActiveSetMultiTemp.m	281	2013-05-23
srv1_9\l1NNQPActiveSet.m	5311	2013-05-23
srv1_9\l1NNLSKernelBatchDL.m	563	2012-02-10
srv1_9\l1NNLSKernelBatch.m	920	2012-02-09
srv1_9\l1NNLSKernel.m	2683	2012-04-12
srv1_9\l1LSKernelBatch.m	916	2012-02-09
srv1_9\KSRSCClassifier.m	3969	2013-07-11
srv1_9\KSRSC.m	3884	2013-07-17
srv1_9\KSRDLDR.m	408	2012-02-17
srv1_9\KSRDL.m	7414	2015-03-03
srv1_9\knnrule.m	690	2013-02-15
srv1_9\khdlmTrain.m	2943	2012-08-31
srv1_9\khdlmPredict.m	1609	2012-08-31
srv1_9\khdlmClassifier.m	3412	2012-01-24
srv1_9\kfcnnls.m	4844	2011-10-05
srv1_9\kernelSigmoid.m	426	2011-10-12
srv1_9\kernelseminmfruletest.m	2251	2011-10-11
srv1_9\kernelRBF.m	516	2011-10-12
srv1_9\kernelPoly.m	495	2011-10-12
srv1_9\kernelLinear.m	288	2011-12-28
srv1_9\iszero.m	281	2013-05-19
srv1_9\invsvd.m	356	2011-10-11
srv1_9\innerProduct.m	562	2011-10-11
srv1_9\initializeNNQPSMO.m	372	2013-03-18
srv1_9\initializel1QPSMO.m	493	2013-03-16
srv1_9\gridSearchUniverse.m	3639	2013-01-17
srv1_9\gridSearch.m	2765	2011-10-11
srv1_9\getRank.m	428	2012-10-25
srv1_9\getLambda.m	605	2013-03-19
srv1_9\getBestScores.m	396	2011-11-19
srv1_9\geometricMean.m	332	2012-07-05
srv1_9\genCode.m	495	2013-03-22
srv1_9\FriedmanTest.m	1566	2012-11-10
srv1_9\findViolateXl1QPSMO.m	621	2013-03-15
srv1_9\featureExtrationTest.m	8722	2013-07-24
srv1_9\featureExtractionTrain.m	12637	2013-07-24
srv1_9\featSel.m	3788	2013-03-11
srv1_9\exampleVSMF.m	509	2015-03-03
srv1_9\exampleUnboundedQPFeb212012.m	345	2012-02-22
srv1_9\examplePlotBars.m	3428	2015-03-03

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．