The idea behind differential GPS is to remove as much errors as possible from the range measurements by establishing these errors at a reference site. In its most simple setup, a GPS receiver is located at a well surveyed position and its (pseudo) range measurements are compared with the actual calculated range from this receiver to the SV s. The differences between measured ranges and calculated ranges at the reference receiver are applied as corrections to the ranges measured by other receiver(s) close by.
USB Thumb Drive Designer Reference Manual. This manual describes a reference design of USB2.0 Thumb Drive solution by using the MC9S12UF32
microcontroller.
Family Tree
This a geneology program for entering your family tree. It s a complete working app but has no reports within it. You can add pictures and name the individuals in the pictures using a really cool frame and name technique. You can also add census information and lots more.
gcclib
This gcc 1.40 suits for Linux kernel 0.11 - 0.95
Installtion hints
-----------------
This suit contains include.taz, local.taz and this README file.
You must download the bootimage and rootimage and install them first.
The include.taz contains all the include files for using with gcc 1.40.
The local.taz contains all the gcc tools & libs stored in two sepearted
directories:
/usr/local/lib
/usr/local/bin
You should copy the linux/ asm/ sys/ subdirectories into the include
directory from the corresponding kernel source.
Installation
------------
Goto the /usr directory. Untar the include.taz to the directory /usr/include.
Untar the local.taz to the directory /usr/local. That s it!
Example:
--------
cd /usr
tar zxvf include.taz
tar zxvf local.taz
This document aims to provide instructions on how to configure the H.264/AVC encoder and decoder using the different command line options. Also, sample command line parameters are included for reference
The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
assignment problem: Given an assignment, move the minimum number of
codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code assignment problem for which we derive several results
This file contains board-specific information for the Motorola cpv3060
target board. Specifically, this file contains information on any BSP
interface changes from previous software or hardware versions, and
contains caveats that the user must be aware of before using this BSP.
Additionally, the target board s reference entry (i.e., cpv3060/target.nr)
provides board-specific information necessary to run VxWorks, and
should be read before this BSP is used.
This document constitutes the user manual for the YAMON™ ROM monitor.
YAMON (“Yet Another MONitor”) is the ROM monitor used on MIPS Technologies evaluation and reference boards.
The target audience for this document is users of those boards. This would typically be engineers developing hardware
or software including compilers, RTOS and other tools.
Currently, the following boards/CPUs are supported by YAMON :
• Atlas™ with MIPS32 4K™ or MIPS64 5K™ class of CPUs.
• Atlas with QED RM5261® .
• Malta™ with MIPS32 4K or MIPS64 5K class of CPUs.
• Malta with QED RM5261® .
• SEAD™ with MIPS32 4K or MIPS64 5K class of CPUs.
• SEAD-2™ with MIPS32 4K or MIPS64 5K class of CPUs.
cordic methods describe essentially the same algorithm that with suitably chosen inputs can be used to calculate a whole range of scientific functions including sin, cos, tan, arctan, arcsin, arccos, sinh, cosh, tanh, arctanh, log, exp, square root and even multiply and divide.
the method dates back to volder [1959], and due to its versatility and compactness, it made possible the microcoding of the hp35 pocket scientific calculator in 1972.
here is some code to illustrate the techniques. ive split the methods into three parts linear, circular and hyperbolic. in the hp35 microcode these would be unified into one function (for space reasons). because the linear mode can perform multiply and divide, you only need add/subtract and shift to complete the implementation.
you can select in the code whether to do the multiples and divides also by cordic means. other multiplies and divides are all powers of 2 (these dont count). to eliminate these too, would involve ieee hackery.
Very simple USB 1.1 PHY. Includes all the goodies: serial/parallel
conversion, bit stuffing/unstuffing, NRZI encoding decoding. Uses a
simplified UTMI interface. Currently doesn t do any error checking in
the RX section [should probably check for bit unstuffing errors].
Otherwise complete and fully functional.
There is currently no test bench available. This core is very simple
and is proven in hardware. I see no point of writing a test bench at
this time.