Search - max - CodeBus

Search - max - List

[3G develop] yalmip DL : 1: matlab用于求解规划问题的工具包推荐把这个工具整合到matlab中去，这个工具是私人的，不过大家都可以免费下载使用。下载后，只要在matlab中添加路径就可以使用这工具箱。正在吸引我的是，这个工具箱建立了一种新的数据类型，使所有规划问题都整合在一起。举例如下：已知非线性整数规划为： Max z=x1^2+x2^2+3*x3^2+4*x4^2+2*x5^2-8*x1-2*x2-3*x3-x4-2*x5 s.t. 0<=xi<=99(i=1,2,...,5) x1+x2+x3+x4+x5<=400 x1+2*x2+2*x3+x4+6*x5<=800 2*x1+x2+6*x3<=800 x3+x4+5*x5<=200 在matlab中输入 x=intvar（1，5）； f=[1 1 3 4 2]*(x .^2)-[8 2 3 1 2]*x F=set(0<=x<=99) F=F+set([1 1 1 1 1]*x <=400)+set([1 2 2 1 6]*x <=800)+set(2*x(1)+x(2)+6*x(3)<=800) F=F+set(x(3)+x(4)+5*x(5)<=200) solvesdp(F,-f) double(f) 80199 double(x) 53 99 99 99 0 intvar（m，n）:生成整数型变量； sdpvar（m，n）：生产变量； solvesdp（F，f）：求解最优解（最小值），其中F为约束条件（用set连接），f为目标函数 double：显示求解的答案 intvar，sdpvar，生成的变量可以像矩阵一样使用，如例题显示。 -matlab用于求解规划问题的工具包推荐把这个工具整合到matlab中去，这个工具是私人的，不过大家都可以免费下载使用。下载后，只要在matlab中添加路径就可以使用这工具箱。正在吸引我的是，这个工具箱建立了一种新的数据类型，使所有规划问题都整合在一起。举例如下：已知非线性整数规划为： Max z=x1^2+x2^2+3*x3^2+4*x4^2+2*x5^2-8*x1-2*x2-3*x3-x4-2*x5 s.t. 0<=xi<=99(i=1,2,...,5) x1+x2+x3+x4+x5<=400 x1+2*x2+2*x3+x4+6*x5<=800 2*x1+x2+6*x3<=800 x3+x4+5*x5<=200 在matlab中输入 x=intvar（1，5）； f=[1 1 3 4 2]*(x .^2)-[8 2 3 1 2]*x F=set(0<=x<=99) F=F+set([1 1 1 1 1]*x <=400)+set([1 2 2 1 6]*x <=800)+set(2*x(1)+x(2)+6*x(3)<=800) F=F+set(x(3)+x(4)+5*x(5)<=200) solvesdp(F,-f) double(f) 80199 double(x) 53 99 99 99 0 intvar（m，n）:生成整数型变量； sdpvar（m，n）：生产变量； solvesdp（F，f）：求解最优解（最小值），其中F为约束条件（用set连接），f为目标函数 double：显示求解的答案 intvar，sdpvar，生成的变量可以像矩阵一样使用，如例题显示。
Date : 2025-12-28 Size : 789kb User : wrui
[3G develop] WIMAX_Turbo_Code DL : 0: 这是一套完整的支持wimax 16e协议CTC的编译码程序，主程序在demo.c 译码器：tcdecoder.c 编码器：tcencoder.c-/* This program simulates the classical turbo encoding-decoding system on PC.*/ /* It uses parallel concatenated convolutional codes described in Figure 2.9 in Chapter 2.*/ /* Two component RSC (Recursive Systematic Convolutional) encoders are used. */ /* First encoder is terminated with tails bits. (Info+ tail) bits are scrambled and */ /* passed to the second encoder, while second encoder is left open without tail bits. */ /* Random information bits are modulated into+1/-1, and transmitted through an AWGN channel.*/ /* Interleavers are randomly generated for each frame.*/ /* Log-MAP algorithm without quantization or approximation is used.*/ /* By making use of ln(e^x+e^y) = max (x,y)+ ln(1+e^(-abs(x-y))), */ /* the Log-MAP is simplified with a look-up table for the correction term.*/ /* When the approximation ln(e^x+e^y) = max (x,y) is, we have MAX-Log-MAP.*/ /* To set the number of iterations, change the globle variable "DECITER". To set the fr
Date : 2025-12-28 Size : 26kb User : bennytang
[3G develop] turbo_sys_demo DL : 0: This script simulates the classical turbo encoding-decoding system. It simulates parallel concatenated convolutional codes. Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed. First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to the second encoder, while second encoder is left open without tail bits of itself. Random information bits are modulated into +1/-1, and transmitted through a AWGN channel. Interleavers are randomly generated for each frame. Log-MAP algorithm without quantization or approximation is used. By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))), the Log-MAP can be simplified with a look-up table for the correction function. If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP.- This script simulates the classical turbo encoding-decoding system. It simulates parallel concatenated convolutional codes. Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed. First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to the second encoder, while second encoder is left open without tail bits of itself. Random information bits are modulated into +1/-1, and transmitted through a AWGN channel. Interleavers are randomly generated for each frame. Log-MAP algorithm without quantization or approximation is used. By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))), the Log-MAP can be simplified with a look-up table for the correction function. If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP.
Date : 2025-12-28 Size : 2kb User : yk
[3G develop] wimax-implementation DL : 0: Wi-MAX module for ns-2
Date : 2025-12-28 Size : 211kb User : 姜志
[3G develop] Pschedulers DL : 1: LTE系统中的调度算法，包括轮询。比例公平。最大C/I等-The LTE system, the scheduling algorithm, including polling. Proportional fairness. Max C/I
Date : 2025-12-28 Size : 17kb User : Rosa
[3G develop] 3gpp-turbo DL : 0: 一种基于3gpp标准的运行速度较快的turbo编译码程序，内含logmap，max-logmap，th-logmap译码算法，程序达到设定的错误帧数自动停止，速度快！-Based on the the 3gpp standard run faster turbo encoding and decoding procedures, containing logmap the max-logmap, th-logmap decoding algorithm, the program reaches a set number of error frames automatically stop, more fast!
Date : 2025-12-28 Size : 82kb User : 王建
[3G develop] report-Circular-Waveguide DL : 0: Attenuation Max-Attenuation Min<2dB Assign Material ferrite TT1-105 Pozar
Date : 2025-12-28 Size : 543kb User : Milad