Application (fix point) for playing MP3 data on embedded systems. mp3play is
designed to be able to play mp3 data files within the local filesystem
(which can be a network filesystem), or fetch files to play via http
over a network. For the http case the address can specify a streaming
MP3 server.
SD card controller can just read data using 1 bit SD mode.
I have written this core for NIOS2 CPU, Cyclone, but I think it can works
with other FPGA or CPLD. Better case for this core is SD clock = 20 MHz and
CPU clock = 100 MHz (or in the ratio 1:5). If you have a wish you can achieve this core.
Good luck
國外的人才求職招聘最新版，找了很久的，還在調(diào)試中，舊版本說明如下PHP寫的一個人力資源管理系統(tǒng)的源碼：系統(tǒng)采用模塊話的設計，此文件解壓到php的環(huán)境下，直接訪問就可以，需要建立一個mysql數(shù)據(jù)庫數(shù)據(jù)庫名為orangeHRM，并建立一個用戶。然后直接訪問http：//localhost/orangehrm就ok！-PHP write a human resources management system of Source : System is modular case design, This document to extract php environment, we can directly access, need to establish a database mysql database called orangeHRM, and the establishment of a user. Then directly on the visit http://localhost/orangehrm ok!
this directory
contains the following:
* The acdc algorithm for finding the
approximate general (non-orthogonal)
joint diagonalizer (in the direct Least Squares sense) of a set of Hermitian matrices.
[acdc.m]
* The acdc algorithm for finding the
same for a set of Symmetric matrices.
[acdc_sym.m](note that for real-valued matrices the Hermitian and Symmetric cases are similar however, in such cases the Hermitian version
[acdc.m], rather than the Symmetric version[acdc_sym] is preferable.
* A function that finds an initial guess
for acdc by applying hard-whitening
followed by Cardoso s orthogonal joint
diagonalizer. Note that acdc may also
be called without an initial guess,
in which case the initial guess is set by default to the identity matrix.
The m-file includes the joint_diag
function (by Cardoso) for performing
the orthogonal part.
[init4acdc.m]
The inverse of the gradient function. I ve provided versions that work on 1-d vectors, or 2-d or 3-d arrays. In the 1-d case I offer 5 different methods, from cumtrapz, and an integrated cubic spline, plus several finite difference methods.
In higher dimensions, only a finite difference/linear algebra solution is provided, but it is fully vectorized and fully sparse in its approach. In 2-d and 3-d, if the gradients are inconsistent, then a least squares solution is generated
The DHRY program performs the dhrystone benchmarks on the 8051.
Dhrystone is a general-performance benchmark test originally
developed by Reinhold Weicker in 1984. This benchmark is
used to measure and compare the performance of different
computers or, in this case, the efficiency of the code
generated for the same computer by different compilers.
The test reports general performance in dhrystones per second.
Like most benchmark programs, dhrystone consists of standard
code and concentrates on string handling. It uses no
floating-point operations. It is heavily influenced by
hardware and software design, compiler and linker options,
code optimizing, cache memory, wait states, and integer
data types.
The DHRY program is available in different targets:
Simulator: Large Model: DHRY example in LARGE model
for Simulation
Philips 80C51MX: DHRY example in LARGE model
for the Philips 80C51MC
