iic總線控制器VHDL實現
-- VHDL Source Files:
i2c.vhd -- top level file
i2c_control.vhd -- control function for the I2C master/slave
shift.vhd -- shift register
uc_interface.vhd -- uC interface function for an 8-bit 68000-like uC
upcnt4.vhd -- 4-bit up counter
i2c_timesim.vhd -- post-ROUTE I2C simulation netlist
DSR-UU is a DSR implementation that runs in Linux and in the ns-2 network simulator.
DSR-UU implements most of the basic DSR features specified in the DSR
draft (version 10). One big exception is flow extensions.
DSR-UU does NOT use ARP, so do not be surprised if you do not see ARP
traffic. DSR-UU instead uses its own neighbor table that sets up the
MAC-to-IP translation during ROUTE discovery.
做網格的好程序，PARAMESH is a package of Fortran 90 subroutines designed to provide an application developer with an easy ROUTE to extend an existing serial code which uses a logically cartesian structured mesh into a parallel code with adaptive mesh refinement(AMR).
DDR SDRAM控制器的VHDL源代碼，含詳細設計文檔。
The DDR, DCM, and SelectI/O™ features in the Virtex™ -II architecture make it the perfect
choice for implementing a controller of a Double Data Rate (DDR) SDRAM. The Digital Clock
Manager (DCM) provides the required Delay Locked Loop (DLL), Digital Phase Shift (DPS),
and Digital Frequency Synthesis (DFS) functions. This application note describes a controller
design for a 16-bit DDR SDRAM. The application note and reference design are enhanced
versions of XAPP200 targeted to the Virtex-II series of FPGAs. At a clock rate of 133 MHz,
16-bit data changes at both clock edges. The reference design is fully synthesizable and
achieves 133 MHz performance with automatic place and ROUTE tools.
The xapp851.zip archive includes the following subdirectories. The specific
contents of each subdirectory below:
\rtl - HDL design files
\sim - simulation files
\synth - Synthesis related files
\par - Place/ROUTE related files
The task in this assignment is to implement an airline routing system. Your
system should be able to read in a
ight network as a graph from a le, where
airports are represented as vertices and
ights between airports are represented
as edges, take as input two airports and calculate the shortest ROUTE (ie path)
between them.
There exist two essentially different approaches to the study of dynamical systems, based on
the following distinction:
time-continuous nonlinear differential equations ? time-discrete maps
One approach starts from time-continuous differential equations and leads to time-discrete
maps, which are obtained from them by a suitable discretization of time. This path is
pursued, e.g., in the book by Strogatz [Str94]. 1 The other approach starts from the study of
time-discrete maps and then gradually builds up to time-continuous differential equations,
see, e.g., [Ott93, All97, Dev89, Has03, Rob95]. After a short motivation in terms of nonlinear
differential equations, for the rest of this course we shall follow the latter ROUTE to dynamical
systems theory. This allows a generally more simple way of introducing the important
concepts, which can usually be carried over to a more complex and physically realistic
context.
