This is the model of boost converter. The control of this converter is PID. With changing the cofficient of the P-I and D a good replay can be supplied.
标签： converter the changing control
上传时间： 2013-12-21
上传用户：阿四AIR
•ARINC429总线协议是美国航空电子工程委员会(Airlines Engineering Committee)于1977年7月提出的，并于同年发表并获得批准使用，它的全称是数字式信息传输系统(Digital Information Transmission System ) 。协议标准规定了航空电子设备及有关系统间的数字信息传输要求。ARINC429广泛应用在先进的民航客机中，如B-737、B-757、B-767，俄制军用飞机也选用了类似的技术。
标签： ARINC429 总线
上传时间： 2015-03-25
上传用户：423619775
ARINC429总线协议是美国航空电子工程委员会(Airlines Engineering Committee)于1977年7月提出的，并于同年发表并获得批准使用，它的全称是数字式信息传输系统(Digital Information Transmission System ) 。协议标准规定了航空电子设备及有关系统间的数字信息传输要求。ARINC429广泛应用在先进的民航客机中，如B-737、B-757、B-767，俄制军用飞机也选用了类似的技术。 ARINC429总线结构简单、性能稳定，抗干扰性强。最大的优势在于可靠性高。飞机上的ARINC429数据总线，用于在系统和设备之间传送上千种不同类型的参数，如航向、真空速、马赫数等。
标签： 429总线协议
上传时间： 2016-08-17
上传用户：w50403
1．Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.) #include<stdio.h> #include<stdlib.h> void merge(int arr[],int low,int mid,int high){ int i,k; int *tmp=(int*)malloc((high-low+1)*sizeof(int)); int left_low=low; int left_high=mid; int right_low=mid+1; int right_high=high; for(k=0;left_low<=left_high&&right_low<=right_high;k++) { if(arr[left_low]<=arr[right_low]){ tmp[k]=arr[left_low++]; } else{ tmp[k]=arr[right_low++]; } } if(left_low<=left_high){ for(i=left_low;i<=left_high;i++){ tmp[k++]=arr[i]; } } if(right_low<=right_high){ for(i=right_low;i<=right_high;i++) tmp[k++]=arr[i]; } for(i=0;i<high-low+1;i++) arr[low+i]=tmp[i]; } void merge_sort(int a[],int p,int r){ int q; if(p<r){ q=(p+r)/2; merge_sort(a,p,q); merge_sort(a,q+1,r); merge(a,p,q,r); } } int main(){ int a[8]={3,5,8,6,4,1,1}; int i,j; int x=10; merge_sort(a,0,6); printf("after Merging-Sort:\n"); for(i=0;i<7;i++){ printf("%d",a[i]); } printf("\n"); i=0;j=6; do{ if(a[i]+a[j]==x){ printf("exist"); break; } if(a[i]+a[j]>x) j--; if(a[i]+a[j]<x) i++; }while(i<=j); if(i>j) printf("not exist"); system("pause"); return 0; }
上传时间： 2017-04-01
上传用户：糖儿水嘻嘻
We were on the lookout for ice. I was in a 32 foot sailing yacht with writer and explorer Tristan Gooley, undertaking a double-handed sail from Scotland through the Faroes up to 66 33 45.7 N and the midnight sun. Now sailing out of the Arctic Circle we were approaching Iceland from the north, heading for the Denmark Straits, where ice flowed south. The Admiralty Pilot warned of bergs but the ice charts we had sailed with were over a week old. We needed an update.
标签： Interference Analysis
上传时间： 2020-05-27
上传用户：shancjb
The continuing vitality of spread-spectrum communication systems and the devel- opment of new mathematical methods for their analysis provided the motivation to undertake this new edition of the book. This edition is intended to enable readers to understand the current state-of-the-art in this field. Almost twenty percent of the materialinthiseditionisnew, includingseveralnewsections, anewchapteronadap- tive arrays and filters, and a new chapter on code-division multiple-access networks. The remainder of the material has been thoroughly revised, and I have removed a considerable amount of material that has been superseded by more definitive results.
标签： Spread-Spectrum Communication Systems 3rd
上传时间： 2020-06-01
上传用户：shancjb
The idea for this book was born during one of my project-related trips to the beautiful city of Hangzhou in China, where in the role of Chief Architect I had to guide a team of very young, very smart and extremely dedicated software developers and verification engineers. Soon it became clear that as eager as the team was to jump into the coding, it did not have any experience in system architecture and design and if I did not want to spend all my time in constant travel between San Francisco and Hangzhou, the only option was to groom a number of local junior architects. Logically, one of the first questions being asked by these carefully selected future architects was whether I could recommend a book or other learning material that could speed up the learning cycle. I could not. Of course, there were many books on various related topics, but many of them were too old and most of the updated information was either somewhere on the Internet dispersed between many sites and online magazines, or buried in my brain along with many years of experience of system architecture.
标签： Telecommunication Gateways System Design for
上传时间： 2020-06-01
上传用户：shancjb
December 2007, San Jose, California: It seems a long time ago. I walked into a big networking company to head their small Power over Ethernet (PoE) applications team. Surprisingly, I hardly knew anything about PoE prior to that day, having been a switching-power conversion engineer almost all my life. But it seemed a great opportunity to widen my horizons. As you can see, one notable outcome of that seemingly illogical career choice five years ago is the book you hold in your hands today. I hope this small body of work goes on to prove worthy of your expectations and also of all the effort that went into it. Because, behind the scenes, there is a rather interesting story to relate—about its backdrop, intertwined with a small slice of modern PoE history, punctuated by a rather res- tive search for our roots and our true heroes, one that takes us back almost two centuries
上传时间： 2020-06-07
上传用户：shancjb
I can remember buying my first electronic calculator. I was teaching a graduate level statistics course and I had to have a calculator with a square root function. Back in the late 1960s, that was a pretty high-end requirement for a calculator. I managed to purchase one at the “educational discount price” of $149.95! Now, I look down at my desk at an ATmega2560 that is half the size for less than a quarter of the cost and think of all the possibilities built into that piece of hardware. I am amazed by what has happened to everything from toasters to car engines. Who-da-thunk-it 40 years ago?
上传时间： 2020-06-09
上传用户：shancjb
#include <stdio.h> #include <stdlib.h> #define SMAX 100 typedef struct SPNode { int i,j,v; }SPNode; struct sparmatrix { int rows,cols,terms; SPNode data [SMAX]; }; sparmatrix CreateSparmatrix() { sparmatrix A; printf("\n\t\t请输入稀疏矩阵的行数，列数和非零元素个数（用逗号隔开）:"); scanf("%d,%d,%d",&A.cols,&A.terms); for(int n=0;n<=A.terms-1;n++) { printf("\n\t\t输入非零元素值（格式：行号，列号，值）:"); scanf("%d,%d,%d",&A.data[n].i,&A.data[n].j,&A.data[n].v); } return A; } void ShowSparmatrix(sparmatrix A) { int k; printf("\n\t\t"); for(int x=0;x<=A.rows-1;x++) { for(int y=0;y<=A.cols-1;y++) { k=0; for(int n=0;n<=A.terms-1;n++) { if((A.data[n].i-1==x)&&(A.data[n].j-1==y)) { printf("%8d",A.data[n].v); k=1; } } if(k==0) printf("%8d",k); } printf("\n\t\t"); } } void sumsparmatrix(sparmatrix A) { SPNode *p; p=(SPNode*)malloc(sizeof(SPNode)); p->v=0; int k; k=0; printf("\n\t\t"); for(int x=0;x<=A.rows-1;x++) { for(int y=0;y<=A.cols-1;y++) { for(int n=0;n<=A.terms;n++) { if((A.data[n].i==x)&&(A.data[n].j==y)&&(x==y)) { p->v=p->v+A.data[n].v; k=1; } } } printf("\n\t\t"); } if(k==1) printf("\n\t\t对角线元素的和：:%d\n",p->v); else printf("\n\t\t对角线元素的和为：:0"); } int main() { int ch=1,choice; struct sparmatrix A; A.terms=0; while(ch) { printf("\n"); printf("\n\t\t 稀疏矩阵的三元组系统 "); printf("\n\t\t*********************************"); printf("\n\t\t 1------------创建 "); printf("\n\t\t 2------------显示 "); printf("\n\t\t 3------------求对角线元素和"); printf("\n\t\t 4------------返回 "); printf("\n\t\t*********************************"); printf("\n\t\t请选择菜单号（0-3）:"); scanf("%d",&choice); switch(choice) { case 1: A=CreateSparmatrix(); break; case 2: ShowSparmatrix(A); break; case 3: SumSparmatrix(A); break; default: system("cls"); printf("\n\t\t输入错误！请重新输入！\n"); break; } if (choice==1||choice==2||choice==3) { printf("\n\t\t"); system("pause"); system("cls"); } else system("cls"); } }
上传时间： 2020-06-11
上传用户：ccccy
