CORDIC (Coordinate Rotation Digital Computer) is a method for computing elementary functions using minimal hardware such as shifts, adds/subs and compares.
CORDIC works by rotating the coordinate system through constant angles until the angle is reduces to zero. The angle offsets are selected such that the OPERATIONs on X and Y are only shifts and adds.
To develop functional modules to process grayscale image intensity data. And perform Point and spatial OPERATIONs. Uses Prewitt, Sobel, and Laplacian of Guassian Methods. And calculates their histograms.
In a preemptive priority based RTOS, priority inversion
problem is among the major sources of deadline
violations. Priority inheritance protocol is one of the
approaches to reduce priority inversion. Unfortunately,
RTOS like uC/OS can’t support priority inheritance
protocol since it does not allow kernel to have multiple
tasks at the same priority. Although it has different ways
to avoid priority inversion such as priority ceiling
protocol, developers still have some difficulties in
programming real time applications with it. In this paper,
we redesign the uC/OS kernel to provide the ability to
support round robin scheduling and implement priority
inheritance semaphore on the modified kernel. As result,
we port new kernel with priority inheritance semaphore to
evaluation board, and evaluate the execution time of each
of the kernel service as well as verify the OPERATIONs of
our implementation.
This library allows creating, modifying and extracting zip archives in the compatible way with PKZIP (2.5 and higher) and WinZip. Supported are all possible OPERATIONs on the zip archive: creating, extracting, adding, deleting files from the archive, modifications of the existing archive. There is also the support for creating and extracting multiple disk archives (on non-removable devices as well) and for password encryption and decryption. This module uses compression and decompression functions from zlib library by Jean-loup Gailly and Mark Adler.
Matrix TCL Lite 1.12
This matrix C++ template class library is for performing common matrix OPERATIONs in your C++ program like any other built-in data types. To install the package, just copy MATRIX.H file into the INCLUDE directory of your compiler and include this header file in your program source file.
Contains source to demonstrate how to copy/delete files and folders with HFS+ APIs. It also demonstrates a technique to rename an object if an object of the same name exists in the destination.
This sample shows how to perform these OPERATIONs in an MP-safe way.
This code implements min binomial heaps and min leftist trees.Plus, measure and compare the relative performance of these two implementations under the assumption that the only permissible OPERATIONs are insert and delete-min.
The first task at hand is to set up the endpoints appropriately for this example. The following code switches the CPU clock speed
to 48 MHz (since at power-on default it is 12 MHz), and sets up EP2 as a Bulk OUT endpoint, 4x buffered of size 512, and EP6
as a Bulk IN endpoint, also 4x buffered of size 512. This set-up utilizes the maximum allotted 4-KB FIFO space. It also sets up
the FIFOs for manual mode, word-wide operation, and goes through a FIFO reset and arming sequence to ensure that they are
ready for data OPERATIONs
