The target of the assignment is to familiarize the student with MIMO channel modeling. The work is based on L. Schumacher’s MIMO channel model implementation, with added capacity analysis. First the channel model implementation is introduced, and thereafter analysis on MIMO channel with different parameters is done. Finally a short report on the results is written.
標簽： familiarize assignment The the
上傳時間： 2014-01-01
上傳用戶：jjj0202
編寫一個程序，輸出基本數據類型char, short, int, long, float, double和指針類型void *, char *, short *, int *, long *, float *, double *的數據類型的長度。
上傳時間： 2013-12-26
上傳用戶：pompey
Pattern Analysis is the process of fi nding general relations in a set of data, and forms the core of many disciplines, from neural networks to so-called syn- tactical pattern recognition, from statistical pattern recognition to machine learning and data mining. Applications of pattern analysis range from bioin- formatics to document retrieval.
標簽： the relations Analysis Pattern
上傳時間： 2017-09-07
上傳用戶：SimonQQ
第一章關鍵字...................................................................................................................................9 1.1，最寬恒大量的關鍵字----auto..........................................................................................11 1.2，最快的關鍵字---- register............................................................................................... 11 1.2.1，皇帝身邊的小太監----寄存器............................................................................. 11 1.2.2，使用register 修飾符的注意點.............................................................................11 1.3，最名不符實的關鍵字----static........................................................................................12 1.3.1，修飾變量...............................................................................................................12 1.3.2，修飾函數...............................................................................................................13 1.4，基本數據類型----short、int、long、char、float、double........................................... 13 1.4.1，數據類型與“模子”............................................................................................... 14 1.4.2，變量的命名規則...................................................................................................14 1.5，最冤枉的關鍵字----sizeof...............................................................................................18 1.5.1，常年被人誤認為函數...........................................................................................18 1.5.2，sizeof（int）*p 表示什么意思？........................................................................18 1.4，signed、unsigned 關鍵字................................................................................................19 1.6，if、else 組合.................................................................................................................... 20 1.6.1，bool 變量與“零值”進行比較...............................................................................20 1.6.2, float 變量與“零值”進行比較.................................................................................21 1.6.3，指針變量與“零值”進行比較...............................................................................21 1.6.4，else 到底與哪個if 配對呢？...............................................................................22 1.6.5，if 語句后面的分號............................................................................................... 23 1.6.6，使用if 語句的其他注意事項.............................................................................. 24 1.7，switch、case 組合........................................................................................................... 24 1.7.1，不要拿青龍偃月刀去削蘋果.............................................................................. 24 1.7.2，case 關鍵字后面的值有什么要求嗎？.............................................................. 25 1.7.3，case 語句的排列順序...........................................................................................25 1.7.4，使用case 語句的其他注意事項..........................................................................27 1.8，do、while、for 關鍵字................................................................................................... 28 1.8.1，break 與continue 的區別.....................................................................................28 1.8.2，循環語句的注意點...............................................................................................29 1.9，goto 關鍵字......................................................................................................................30 1.10，void 關鍵字....................................................................................................................31 1.10.1，void a？............................................................................................................31 1.10，return 關鍵字................................................................................................................. 34 1.11，const 關鍵字也許該被替換為readolny....................................................................... 34 1.11.2，節省空間，避免不必要的內存分配，同時提高效率.................................... 35 1.12，最易變的關鍵字----volatile.......................................................................................... 36 1.13，最會帶帽子的關鍵字----extern.................................................................................... 37 1.14，struct 關鍵字..................................................................................................................38
標簽： c語言深度剖析
上傳時間： 2015-05-01
上傳用戶：cascas
matlab有限元網格劃分程序 DistMesh is a simple MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below. One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods. For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes. Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles. To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.
標簽： matlab有限元網格劃分程序
上傳時間： 2015-08-12
上傳用戶：凜風拂衣袖
Description The STM3210E-EVAL evaluation board is a complete development platform for STMicroelectronic's ARM Cortex-M3 core-based STM32F103ZET6 or STM32F103ZGT6 microcontroller. The range of hardware features on the board help you to evaluate all peripherals (LCD, SPI Flash, USART, IrDA, USB, audio, CAN bus, smartcard, MicroSD Card, NOR Flash, NAND Flash, SRAM, temperature sensor, audio DAC and motor control) and develop your own applications.
標簽： stm3210e_eval
上傳時間： 2016-03-27
上傳用戶：guozhenhui1st
The TAS3204 is a highly-integrated audio system-on-chip (SOC) consisting of a fully-programmable, 48-bit digital audio processor, a 3:1 stereo analog input MUX, four ADCs, four DACs, and other analog functionality. The TAS3204 is programmable with the graphical PurePath Studio? suite of DSP code development software. PurePath Studio is a highly intuitive, drag-and-drop environment that minimizes software development effort while allowing the end user to utilize the power and flexibility of the TAS3204’s digital audio processing core. TAS3204 processing capability includes speaker equalization and crossover, volume/bass/treble control, signal mixing/MUXing/splitting, delay compensation, dynamic range compression, and many other basic audio functions. Audio functions such as matrix decoding, stereo widening, surround sound virtualization and psychoacoustic bass boost are also available with either third-party or TI royalty-free algorithms. The TAS3204 contains a custom-designed, fully-programmable 135-MHz, 48-bit digital audio processor. A 76-bit accumulator ensures that the high precision necessary for quality digital audio is maintained during arithmetic operations. Four differential 102 dB DNR ADCs and four differential 105 dB DNR DACs ensure that high quality audio is maintained through the whole signal chain as well as increasing robustness against noise sources such as TDMA interference. The TAS3204 is composed of eight functional blocks: Clocking System Digital Audio Interface Analog Audio Interface Power supply Clocks, digital PLL I2C control interface 8051 MCUcontroller Audio DSP – digital audio processing 特性 Digital Audio Processor Fully Programmable With the Graphical, Drag-and-Drop PurePath Studio? Software Development Environment 135-MHz Operation 48-Bit Data Path With 76-Bit Accumulator Hardware Single-Cycle Multiplier (28 × 48)
上傳時間： 2016-05-06
上傳用戶：fagong
對[1]的matlab實現，有所改動，在計算新的點是否屬于平面時用點到平面的距離替換MSE，親測精度不變計算時間大大減少。 referenece [1]Junhao Xiao, Jianhua Zhang and Jianwei Zhang，'Fast Plane Detection for SLAM from Noisy Range Images in Both Structured and Unstructured Environments',IEEE International Conference on Mechatronics & Automation,2011:1768-1773
上傳時間： 2016-06-01
上傳用戶：李先生的大香港
msp430The LDC1312 and LDC1314 are 2- and 4-channel, 1? Easy-to-use – minimal configuration required 12-bit inductance to digital converters (LDCs) for ? Measure up to 4 sensors with one IC inductive sensing solutions. With multiple channels ? Multiple channels support environmental and and support for remote sensing, the LDC1312 and aging compensation LDC1314 enable the performance and reliability benefits of inductive sensing to be realized at minimal? Multi-channel remote sensing provides lowest cost and power. The products are easy to use, onlysystem cost requiring that the sensor frequency be within 1 kHz ? Pin-compatible medium and high-resolution and 10 MHz to begin sensing. The wide 1 kHz to 10 options MHz sensor frequency range also enables use of very small PCB coils, further reducing sensing– LDC1312/4: 2/4-ch 12-bit LDC solution cost and size.– LDC1612/4: 2/4-ch 28
上傳時間： 2016-07-22
上傳用戶：tongmoonsky
#include <malloc.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define NULL 0 #define MaxSize 30 typedef struct athletestruct /*運動員*/ { char name[20]; int score; /*分數*/ int range; /**/ int item; /*項目*/ }ATH; typedef struct schoolstruct /*學校*/ { int count; /*編號*/ int serial; /**/ int menscore; /*男選手分數*/ int womenscore; /*女選手分數*/ int totalscore; /*總分*/ ATH athlete[MaxSize]; /**/ struct schoolstruct *next; }SCH; int nsc,msp,wsp; int ntsp; int i,j; int overgame; int serial,range; int n; SCH *head,*pfirst,*psecond; int *phead=NULL,*pafirst=NULL,*pasecond=NULL; void create(); void input () { char answer; head = (SCH *)malloc(sizeof(SCH)); /**/ head->next = NULL; pfirst = head; answer = 'y'; while ( answer == 'y' ) { Is_Game_DoMain: printf("\nGET Top 5 when odd\nGET Top 3 when even"); printf("\n輸入運動項目序號 (x<=%d):",ntsp); scanf("%d",pafirst); overgame = *pafirst; if ( pafirst != phead ) { for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ ) { if ( overgame == *pasecond ) { printf("\n這個項目已經存在請選擇其他的數字\n"); goto Is_Game_DoMain; } } } pafirst = pafirst + 1; if ( overgame > ntsp ) { printf("\n項目不存在"); printf("\n請重新輸入"); goto Is_Game_DoMain; } switch ( overgame%2 ) { case 0: n = 3;break; case 1: n = 5;break; } for ( i = 1 ; i <= n ; i++ ) { Is_Serial_DoMain: printf("\n輸入序號 of the NO.%d (0<x<=%d): ",i,nsc); scanf("%d",&serial); if ( serial > nsc ) { printf("\n超過學校數目,請重新輸入"); goto Is_Serial_DoMain; } if ( head->next == NULL ) { create(); } psecond = head->next ; while ( psecond != NULL ) { if ( psecond->serial == serial ) { pfirst = psecond; pfirst->count = pfirst->count + 1; goto Store_Data; } else { psecond = psecond->next; } } create(); Store_Data: pfirst->athlete[pfirst->count].item = overgame; pfirst->athlete[pfirst->count].range = i; pfirst->serial = serial; printf("Input name:) : "); scanf("%s",pfirst->athlete[pfirst->count].name); } printf("\n繼續輸入運動項目(y&n)？"); answer = getchar(); printf("\n"); } } void calculate() /**/ { pfirst = head->next; while ( pfirst->next != NULL ) { for (i=1;i<=pfirst->count;i++) { if ( pfirst->athlete[i].item % 2 == 0 ) { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 5;break; case 2:pfirst->athlete[i].score = 3;break; case 3:pfirst->athlete[i].score = 2;break; } } else { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 7;break; case 2:pfirst->athlete[i].score = 5;break; case 3:pfirst->athlete[i].score = 3;break; case 4:pfirst->athlete[i].score = 2;break; case 5:pfirst->athlete[i].score = 1;break; } } if ( pfirst->athlete[i].item <=msp ) { pfirst->menscore = pfirst->menscore + pfirst->athlete[i].score; } else { pfirst->womenscore = pfirst->womenscore + pfirst->athlete[i].score; } } pfirst->totalscore = pfirst->menscore + pfirst->womenscore; pfirst = pfirst->next; } } void output() { pfirst = head->next; psecond = head->next; while ( pfirst->next != NULL ) { // clrscr(); printf("\n第%d號學校的結果成績:",pfirst->serial); printf("\n\n項目的數目\t學校的名字\t分數"); for (i=1;i<=ntsp;i++) { for (j=1;j<=pfirst->count;j++) { if ( pfirst->athlete[j].item == i ) { printf("\n %d\t\t\t\t\t\t%s\n %d",i,pfirst->athlete[j].name,pfirst->athlete[j].score);break; } } } printf("\n\n\n\t\t\t\t\t\t按任意建 進入下一頁"); getchar(); pfirst = pfirst->next; } // clrscr(); printf("\n運動會結果:\n\n學校編號\t男運動員成績\t女運動員成績\t總分"); pfirst = head->next; while ( pfirst->next != NULL ) { printf("\n %d\t\t %d\t\t %d\t\t %d",pfirst->serial,pfirst->menscore,pfirst->womenscore,pfirst->totalscore); pfirst = pfirst->next; } printf("\n\n\n\t\t\t\t\t\t\t按任意建結束"); getchar(); } void create() { pfirst = (struct schoolstruct *)malloc(sizeof(struct schoolstruct)); pfirst->next = head->next ; head->next = pfirst ; pfirst->count = 1; pfirst->menscore = 0; pfirst->womenscore = 0; pfirst->totalscore = 0; } void Save() {FILE *fp; if((fp = fopen("school.dat","wb"))==NULL) {printf("can't open school.dat\n"); fclose(fp); return; } fwrite(pfirst,sizeof(SCH),10,fp); fclose(fp); printf("文件已經成功保存\n"); } void main() { system("cls"); printf("\n\t\t\t 運動會分數統計\n"); printf("輸入學校數目 (x>= 5):"); scanf("%d",&nsc); printf("輸入男選手的項目(x<=20):"); scanf("%d",&msp); printf("輸入女選手項目(<=20):"); scanf("%d",&wsp); ntsp = msp + wsp; phead = (int *)calloc(ntsp,sizeof(int)); pafirst = phead; pasecond = phead; input(); calculate(); output(); Save(); }
標簽： 源代碼
上傳時間： 2016-12-28
上傳用戶：150501
