搜索资源列表
chap2_01_WhiteNoise_series
- 白噪声及有色噪声序列的产生，一个很小的.m文件-White noise and colored noise sequences
vigenere
- 计一个vigenere密码类，类的对象各自拥有不用的密匙。用不用对象加密相同的明文，将会获得不同的密文。加密过程如下：设密匙为K=k1k2.......kn,明文为M=m1m2.......mn,密文为C=c1c2.......cn，其中k1k2.........kn,m1m2...........mn, c1c2.........cn，每个都代表一个字母。 将字母A到Z编号，从0到25，那么它们之间有这样的对应关系：ci=(mi+ki)mod26。 例如，M=data sec
s2ss
- a program to divide a sequence to subsequences. Helpful for the OFDM simulations: Function to divide the input sequence to sub sequences s2ss - Function 1. (cd) Input the data 2. (hl) Hadamard matrix length 3. Outpot of the function i
circul
- circular convolution is one of the property of discrete fourier transforms. This circular convolution is simply a liner convolution of the periodic extensions of the finite sequences being convolved. Here matlab M file is written for this circular co
LABEX2
- Program P2_1 Simulation of an M-point Moving Average Filter Program P2_2 Generate a sinusoidal input signal Program P2_3 Generate the input sequences
spread-spectrum-correlation-properties-simulation
- the two .m file used to generate m sequence and compute two sequences s correlation properties, for example to compute two gold sequences s correlations properties
walsh-seq-a-gold-seqa-correlation-properties
- these m file can generate walsh sequence , gold sequence and walsh&m multiplexed sequence and can compute two sequences s correlation properties.
Josephu
- Josephu 问题为：设编号为1，2，… n的n个人围坐一圈，约定编号为k（1<=k<=n）的人从1开始报数，数到m 的那个人出列，它的下一位又从1开始报数，数到m的那个人又出列，依次类推，直到所有人出列为止，由此产生一个出队编号的序列。-Josephu issues: Let numbered 1,2, ... n of the n individuals sitting around, agreed number k (1 < = k < = n) the number
lab2-conv
- This does convolution of two sequences in stepwise manner according to normal understanding. sigfold.m:-fips signal 1..and changes n accordingly. sigshift.m:-shifts flipped signal from left to right to cover all overlapping sigmulti.m:-multipli
Maximum-Increasing-subsequences
- 最大递增子序列，动态规划经典算法 设L=<a1,a2,…,an>是n个不同的实数的序列，L的递增子序列是这样一个子序列Lin=<aK1,ak2,…,akm>，其中k1<k2<…<km且aK1<ak2<…<akm。求最大的m值。-Maximum increment sequence, the classic dynamic programming algorithm set L = <a1,a2,…,an> Are n d
randtoolbox_1.11
- As digital computers cannot generate true random numbers. So a pseudo random number generator must have uncorrelated sequences, long period, uniformity and efficiency. ‘myrand.m’ has pass the chi square test for uniform distribution.
Josephus
- 编写程序，模拟约瑟夫环（josephus）问题： n个人（编号为1，2，3，……，n (n>0) ）按顺时针方向围坐一圈，每人持有一个正整数密码。开始时任意给出两个值：一个为首先报数的人的编号i (0<i<=n)，另一个为起始报数上限值m。接着从编号为i的人开始按顺时针方向自1起顺序报数，报到m时停止报数，且报到m的人出列，并将他的密码作为新的m值，从他在顺时针方向上的下一个人起重新自1报数，……，如此下去，直到所有人全部出列为止。要求设计一个程序模拟此过程，给出出列人的编号序
Chaos-Toolbox-Ver.2.0
- C-C方法计算时间延迟和嵌入维数 主程序：C_CMethod.m, C_CMethod_independent.m 子函数：correlation_integral.m(计算关联积分) disjoint.m(将时间序列拆分成t个不相关的子序列) heaviside.m（计算时间序列的海维赛函数值）-CC method to calculate the time delay and embedding dimension of the main program: C_CMeth
Merge
- 给定k 个排好序的序列s , s , , sk 1 2 , 用 2 路合并算法将这k 个序列合并成一个序列。 假设所采用的 2 路合并算法合并 2 个长度分别为m和n的序列需要m + n -1次比较。试设 计一个算法确定合并这个序列的最优合并顺序，使所需的总比较次数最少-Given k sorted sequence s, s, sk 1 2 2-way merge algorithm these the k sequences merged into
BasicWave
- Matlab常用信号产生函数演示实例：编写一个M文件，依次产生均匀分布的随机序列、高斯白噪声随机序列、方波信号序列、三角波信号序列、正弦波信号序列，以及信噪比SNR为10dB的加性高斯白噪声正弦信号。-Matlab commonly used signal generating function demo examples: write a M file, in turn generating uniformly distributed random sequences, Gauss white
encode-and-decode-of-shop-job
- 用于车间调度的编码和解码。 encode函数用于生成M*N的编码数组。M为机器数，N为工件数。 Jm数组的行，表示对应工件在不同机器上的加工顺序。数组内容为机器号。 T数组为加工时间数组。第M行第N列，表示第N号工件在第M号机器上的加工时间。 程序采用先判断对应机器上是否有空间满足插空标准，处理后，再判断是否产生新的空间。 decode解码函数最终需要求得，在M个机器中，所用的最长时间，也就是最大完成时间，作为解码的结果。-For shop scheduling encodi
gold
- 依据所选取的m序列优选对生成所有Gold序列族，确定产生Gold序列族的数量，标出每个Gold序列族中的所有序列，并实例验证（选取3个就可）族内序列彼此的自相关和互相关特性；在每个Gold序列族内，明确标出平衡序列和非平衡序列，并验证其分布关系。 -Race all the sequences in the Gold series, and example (choose three) within the family of autocorrelation and cross-correl
Spreading-code-matlab
- m序列生成和抽取，Gold码和kasami序列生成，三种序列子相关，互相性能分析等。程序完整，注释清楚，报告详细。-m sequence generation and extraction, Gold codes and kasami sequence generation, all three sub-sequences related to each other performance analysis. Program integrity, comments clear, the repo
FinalDSIPAPROrdinary
- The DSI method is basically a modified SLM method. The additional aspect of the DSI method is to add M-bits dummy sequences to the original sequence in order to reduce the PAPR. Where, the dummy bits are inserted at the end of the data sequen
goldcode
- generation of gold code using two maximal length (m seq) sequences. first we need to generate two maximal length sequences and then we have to xor those , we get gold code