这个设计是使用Virtex-4实现DDR的控制器的，设计分为三个主要模块：Front-End FIFOs,DDR SDRAM Controller和Datapath Module。其中主要是DDR SDRAM Controller,当然还有测试模块。
上传时间： 2017-05-20
上传用户：llandlu
AVR single-chip developed by a very low threshold, as long as the computer will be able to study the development of AVR microcontroller. Only a single-chip ISP download beginners line, the editing, debugging of software programs through a direct line into the AVR microcontroller, which can develop AVR Series Single-chip package of a variety of devices. AVR single-chip microcomputer in the industry known as "Front-line struggle to seize state power."
标签： single-chip developed threshold the
上传时间： 2017-09-12
上传用户：shinesyh
AVR single-chip developed by a very low threshold, as long as the computer will be able to study the development of AVR microcontroller. Only a single-chip ISP download beginners line, the editing, debugging of software programs through a direct line into the AVR microcontroller, which can develop AVR Series Single-chip package of a variety of devices. AVR single-chip microcomputer in the industry known as "Front-line struggle to seize state power."
标签： single-chip developed threshold the
上传时间： 2013-12-09
上传用户：invtnewer
UNTER EQU 35H;显示计数 REMVOL EQU 36H;音量连续控制 DISPBUFF1 EQU 37H; DISPBUFF2 EQU 38H; DISPBUFF3 EQU 39H; DISPBUFF EQU 3AH; SDA BIT P3.4 SCL BIT P3.2 MTD EQU 30H;PT2258数据首址 NUMBYT EQU 3BH;PT2258数据位数 CS_X1 EQU 3CH;遥控 CS0_X1 EQU 3DH U0_X1 EQU 3EH;遥控数据暂存区 NO_M EQU 40H;数据码 Front EQU 41H
标签： PT2258
上传时间： 2015-04-26
上传用户：solomon33
#include <iostream> #include <stdio.head> #include <stdlib.head> #include <string.head> #define ElemType int #define max 100 using namespace std; typedef struct node1 { ElemType data; struct node1 *next; }Node1,*LinkList;//链栈 typedef struct { ElemType *base; int top; }SqStack;//顺序栈 typedef struct node2 { ElemType data; struct node2 *next; }Node2,*LinkQueue; typedef struct node22 { LinkQueue Front; LinkQueue rear; }*LinkList;//链队列 typedef struct { ElemType *base; int Front,rear; }SqQueue;//顺序队列 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 //1．采用链式存储实现栈的初始化、入栈、出栈操作。 LinkList CreateStack()//创建栈 { LinkList top; top=NULL; return top; } bool StackEmpty(LinkList s)//判断栈是否为空，0代表空 { if(s==NULL) return 0; else return 1; } LinkList Pushead(LinkList s,int x)//入栈 { LinkList q,top=s; q=(LinkList)malloc(sizeof(Node1)); q->data=x; q->next=top; top=q; return top; } LinkList Pop(LinkList s,int &e)//出栈 { if(!StackEmpty(s)) { printf("栈为空。"); } else { e=s->data; LinkList p=s; s=s->next; free(p); } return s; } void DisplayStack(LinkList s)//遍历输出栈中元素 { if(!StackEmpty(s)) printf("栈为空。"); else { wheadile(s!=NULL) { cout<<s->data<<" "; s=s->next; } cout<<endl; } } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 //2．采用顺序存储实现栈的初始化、入栈、出栈操作。 int StackEmpty(int t)//判断栈S是否为空 { SqStack.top=t; if (SqStack.top==0) return 0; else return 1; } int InitStack() { SqStack.top=0; return SqStack.top; } int pushead(int t,int e) { SqStack.top=t; SqStack.base[++SqStack.top]=e; return SqStack.top; } int pop(int t,int *e)//出栈 { SqStack.top=t; if(!StackEmpty(SqStack.top)) { printf("栈为空."); return SqStack.top; } *e=SqStack.base[s.top]; SqStack.top--; return SqStack.top; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 //3．采用链式存储实现队列的初始化、入队、出队操作。 LinkList InitQueue()//创建 { LinkList head; head->rear=(LinkQueue)malloc(sizeof(Node)); head->Front=head->rear; head->Front->next=NULL; return head; } void deleteEle(LinkList head,int &e)//出队 { LinkQueue p; p=head->Front->next; e=p->data; head->Front->next=p->next; if(head->rear==p) head->rear=head->Front; free(p); } void EnQueue(LinkList head,int e)//入队 { LinkQueue p=(LinkQueue)malloc(sizeof(Node)); p->data=e; p->next=NULL; head->rear->next=p; head->rear=p; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 //4．采用顺序存储实现循环队列的初始化、入队、出队操作。 bool InitQueue(SqQueue &head)//创建队列 { head.data=(int *)malloc(sizeof(int)); head.Front=head.rear=0; return 1; } bool EnQueue(SqQueue &head,int e)//入队 { if((head.rear+1)%MAXQSIZE==head.Front) { printf("队列已满\n"); return 0; } head.data[head.rear]=e; head.rear=(head.rear+1)%MAXQSIZE; return 1; } int QueueLengthead(SqQueue &head)//返回队列长度 { return (head.rear-head.Front+MAXQSIZE)%MAXQSIZE; } bool deleteEle(SqQueue &head,int &e)//出队 { if(head.Front==head.rear) { cout<<"队列为空！"<<endl; return 0; } e=head.data[head.Front]; head.Front=(head.Front+1)%MAXQSIZE; return 1; } int gethead(SqQueue head)//得到队列头元素 { return head.data[head.Front]; } int QueueEmpty(SqQueue head)//判断队列是否为空 { if (head.Front==head.rear) return 1; else return 0; } void travelQueue(SqQueue head)//遍历输出 { wheadile(head.Front!=head.rear) { printf("%d ",head.data[head.Front]); head.Front=(head.Front+1)%MAXQSIZE; } cout<<endl; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 //5．在主函数中设计一个简单的菜单，分别测试上述算法。 int main() { LinkList top=CreateStack(); int x; wheadile(scanf("%d",&x)!=-1) { top=Pushead(top,x); } int e; wheadile(StackEmpty(top)) { top=Pop(top,e); printf("%d ",e); }//以上是链栈的测试 int top=InitStack(); int x; wheadile(cin>>x) top=pushead(top,x); int e; wheadile(StackEmpty(top)) { top=pop(top,&e); printf("%d ",e); }//以上是顺序栈的测试 LinkList Q; Q=InitQueue(); int x; wheadile(scanf("%d",&x)!=-1) { EnQueue(Q,x); } int e; wheadile(Q) { deleteEle(Q,e); printf("%d ",e); }//以上是链队列的测试 SqQueue Q1; InitQueue(Q1); int x; wheadile(scanf("%d",&x)!=-1) { EnQueue(Q1,x); } int e; wheadile(QueueEmpty(Q1)) { deleteEle(Q1,e); printf("%d ",e); } return 0; }
上传时间： 2018-05-09
上传用户：123456..
参照栈类模板的例子编写一个队列类模板class <T> Queue，私有成员包括：队首指针Front，队尾指针Tail，队列容积max。实现：构造函数Queue，复制构造函数Queue，析构函数~Queue，入队函数In，出队函数Out（每次出队，后面的元素自动前移一位），判队列空函数Empty。并分别用队列类模板定义int和double对象，通过实例调用各个成员函数。
标签： Queue 函数 double class Front Empty 队列 Tail 模板 Out
上传时间： 2020-05-04
上传用户：1qw2e3r4t5y6u7i8
This book gives a comprehensive overview of the technologies for the advances of mobile radio access networks. The topics covered include linear transmitters, superconducting filters and cryogenic radio frequency (RF) Front head, radio over fiber, software radio base stations, mobile terminal positioning, high speed downlink packet access (HSDPA), multiple antenna systems such as smart antennas and multiple input and multiple output (MIMO) systems, orthogonal frequency division multiplexing (OFDM) systems, IP-based radio access networks (RAN), autonomic networks, and ubiquitous networks.
标签： Advances Networks Access Mobile Radio in
上传时间： 2020-05-26
上传用户：shancjb
Wireless technology has been evolving at a breakneck speed. The total number of cell-phones in use (as of 2011) was over 6 billion for a 7 billion world population [1] constituting 87% of the world population. Additionally, with user convenience be- coming paramount, more and more functions are being implemented wirelessly.
标签： Front-Ends Cognitive Receiver Radio
上传时间： 2020-05-26
上传用户：shancjb
The book you’re holding, physically or electronically, is the result of a very interesting, challenging but also rewarding research project. The research was carried out in different contexts and cooperations but it was centered around the following question: how can we make the RF transmitters of our modern com- munication systems (WiFi, GSM, LTE, and so on) more flexible and more efficient at the same time.
标签： Continuous-Time Front-Ends Digital
上传时间： 2020-05-27
上传用户：shancjb
OSCILLATORS are key building blocks in integrated transceivers. In wired and wireless communication terminals, the receiver Front-end selects, amplifies and converts the desired high-frequency signal to baseband. At baseband the signal can then be converted into the digital domain for further data processing and demodula- tion. The transmitter Front-end converts an analog baseband signal to a suitable high- frequency signal that can be transmitted over the wired or wireless channel.
标签： High-Frequency Oscillator Design
上传时间： 2020-05-27
上传用户：shancjb
