MATLAB

采用floyd算法计算图中任意两点之间最短路程，可以有负权(Floyd algorithm to calculate the shortest distance between any two points can have a negative right to)

ANALYSIS, DESIGN AND MODELING DC-DC CONVERTER

matlab实现对ofdm系统的整体仿真，适合初学ofdm的人员(Matlab implementation of the overall simulation of the OFDM system, suitable for the beginners of OFDM)

说明：  模型预测控制matlab运行代码，可实现模型预测控制。(Model predictive control matlab running code)

很好的正态分布代码，用简单的matlab代码编写，很清晰！(Very good normal distribution code, matlab code is written in simple, very clear!)

实现差分编码和数字分相码的波形以及功率谱密度的仿真，取样点数默认为2^14。(achieve Differential encoding and digital Phase code and the waveform of the power spectral density of simulation, The default sampling points for 14 ^ 2.)

function [x, hist] = secant(x, f, tola, tolr) SECANT This a secant code with no line search. This code terminates on small relative-absolute errors function [X, HIST] = SECANT(X, F, TOLA, TOLR) Inputs: X = initial iterate F = function TOLA = absolute error tolerance TOLR = relative error tolerance Output: X = approximate result

说明：  3GLTE下行链路方案ofdma性能仿真 以图形的方式表示 OFDMA和sc-fdma的性能差异 信噪比等(3GLTE ofdma downlink performance simulation program to graphically express OFDMA and sc-fdma differences in SNR performance)

TVL1重建从混合压缩采样，rice大学泊松分布图像重建与全变分正规化的代码(Note: (1)Fore small-scale data, hybrid sampling consists of Bernoulli random sampling and low-resolution sampling (TVL1_HCS) (1)Fore large-scale data, hybrid sampling consists of Fourier radial sampling and low-frequency sampling (TV_RecPF) Copyright (C) 2010 Xianbiao Shu, Computer Vision and Robotics Lab, University of Illinois at Urbana-Champaign. Acknowledgement: RecPF (Rice University) PDCO (Stanford University) Twister (MIT) Reference: X. Shu, N. Ahuja, Hybrid Compressive Sampling via a New Total Variation TVL1, In Proceedings of ECCV 2010. Usage: >> run_me_first >>[Im_rec, PSNR_est1,PSNR_est2] = TVL1L2_HCS_test( Ball1_32.bmp , 0.35,3) >>[Im_rec, PSNR_est1,PSNR_est2] = TVL1L2_HCS_test( Ball1_32.bmp , 0.35,3) >>[Im_rec, PSNR1, PSNR2, G_error, Ratio] = TV_RecPF_test( Chest.png , 5, 10, 0, 1e-10, 0) )

A 4 bit twisted ring counter is a sequential circuit which produces the following sequence of output values: 0000, 1000, 1100, 1110, 1111, 0111, 0011, 0001 and then repeats. Design a circuit for a 4 bit twisted ring counter that uses four D flip flops. Draw a state transition diagram, a state table and a schematic for your circuit. Design an alternate implementation using just three flip flops and draw a state transition diagram, state table and a schematic for your circuit. If your designs are extended to implement an n bit twisted ring counter, how many flip flops are required using each of the two approaches. In what situations would you prefer the first method? In what situations would you prefer the second?