URL
https://opencores.org/ocsvn/ima_adpcm_encoder/ima_adpcm_encoder/trunk
Subversion Repositories ima_adpcm_encoder
Compare Revisions
- This comparison shows the changes necessary to convert path
/
- from Rev 7 to Rev 8
- ↔ Reverse comparison
Rev 7 → Rev 8
/trunk/gpl.txt
File deleted
/trunk/tb_IMA_ADPCM_top.vhd
File deleted
/trunk/WAV_header_rom.vhd
File deleted
/trunk/IMA_ADPCM_Encode.vhd
File deleted
/trunk/IMA_adpcm_steptable_rom.vhd
File deleted
/trunk/IMA_ADPCM_top.vhd
File deleted
/ima_adpcm_encoder/trunk/gpl.txt
0,0 → 1,674
GNU GENERAL PUBLIC LICENSE |
Version 3, 29 June 2007 |
|
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/> |
Everyone is permitted to copy and distribute verbatim copies |
of this license document, but changing it is not allowed. |
|
Preamble |
|
The GNU General Public License is a free, copyleft license for |
software and other kinds of works. |
|
The licenses for most software and other practical works are designed |
to take away your freedom to share and change the works. By contrast, |
the GNU General Public License is intended to guarantee your freedom to |
share and change all versions of a program--to make sure it remains free |
software for all its users. We, the Free Software Foundation, use the |
GNU General Public License for most of our software; it applies also to |
any other work released this way by its authors. You can apply it to |
your programs, too. |
|
When we speak of free software, we are referring to freedom, not |
price. Our General Public Licenses are designed to make sure that you |
have the freedom to distribute copies of free software (and charge for |
them if you wish), that you receive source code or can get it if you |
want it, that you can change the software or use pieces of it in new |
free programs, and that you know you can do these things. |
|
To protect your rights, we need to prevent others from denying you |
these rights or asking you to surrender the rights. Therefore, you have |
certain responsibilities if you distribute copies of the software, or if |
you modify it: responsibilities to respect the freedom of others. |
|
For example, if you distribute copies of such a program, whether |
gratis or for a fee, you must pass on to the recipients the same |
freedoms that you received. You must make sure that they, too, receive |
or can get the source code. And you must show them these terms so they |
know their rights. |
|
Developers that use the GNU GPL protect your rights with two steps: |
(1) assert copyright on the software, and (2) offer you this License |
giving you legal permission to copy, distribute and/or modify it. |
|
For the developers' and authors' protection, the GPL clearly explains |
that there is no warranty for this free software. For both users' and |
authors' sake, the GPL requires that modified versions be marked as |
changed, so that their problems will not be attributed erroneously to |
authors of previous versions. |
|
Some devices are designed to deny users access to install or run |
modified versions of the software inside them, although the manufacturer |
can do so. This is fundamentally incompatible with the aim of |
protecting users' freedom to change the software. The systematic |
pattern of such abuse occurs in the area of products for individuals to |
use, which is precisely where it is most unacceptable. Therefore, we |
have designed this version of the GPL to prohibit the practice for those |
products. If such problems arise substantially in other domains, we |
stand ready to extend this provision to those domains in future versions |
of the GPL, as needed to protect the freedom of users. |
|
Finally, every program is threatened constantly by software patents. |
States should not allow patents to restrict development and use of |
software on general-purpose computers, but in those that do, we wish to |
avoid the special danger that patents applied to a free program could |
make it effectively proprietary. To prevent this, the GPL assures that |
patents cannot be used to render the program non-free. |
|
The precise terms and conditions for copying, distribution and |
modification follow. |
|
TERMS AND CONDITIONS |
|
0. Definitions. |
|
"This License" refers to version 3 of the GNU General Public License. |
|
"Copyright" also means copyright-like laws that apply to other kinds of |
works, such as semiconductor masks. |
|
"The Program" refers to any copyrightable work licensed under this |
License. Each licensee is addressed as "you". "Licensees" and |
"recipients" may be individuals or organizations. |
|
To "modify" a work means to copy from or adapt all or part of the work |
in a fashion requiring copyright permission, other than the making of an |
exact copy. The resulting work is called a "modified version" of the |
earlier work or a work "based on" the earlier work. |
|
A "covered work" means either the unmodified Program or a work based |
on the Program. |
|
To "propagate" a work means to do anything with it that, without |
permission, would make you directly or secondarily liable for |
infringement under applicable copyright law, except executing it on a |
computer or modifying a private copy. Propagation includes copying, |
distribution (with or without modification), making available to the |
public, and in some countries other activities as well. |
|
To "convey" a work means any kind of propagation that enables other |
parties to make or receive copies. Mere interaction with a user through |
a computer network, with no transfer of a copy, is not conveying. |
|
An interactive user interface displays "Appropriate Legal Notices" |
to the extent that it includes a convenient and prominently visible |
feature that (1) displays an appropriate copyright notice, and (2) |
tells the user that there is no warranty for the work (except to the |
extent that warranties are provided), that licensees may convey the |
work under this License, and how to view a copy of this License. If |
the interface presents a list of user commands or options, such as a |
menu, a prominent item in the list meets this criterion. |
|
1. Source Code. |
|
The "source code" for a work means the preferred form of the work |
for making modifications to it. "Object code" means any non-source |
form of a work. |
|
A "Standard Interface" means an interface that either is an official |
standard defined by a recognized standards body, or, in the case of |
interfaces specified for a particular programming language, one that |
is widely used among developers working in that language. |
|
The "System Libraries" of an executable work include anything, other |
than the work as a whole, that (a) is included in the normal form of |
packaging a Major Component, but which is not part of that Major |
Component, and (b) serves only to enable use of the work with that |
Major Component, or to implement a Standard Interface for which an |
implementation is available to the public in source code form. A |
"Major Component", in this context, means a major essential component |
(kernel, window system, and so on) of the specific operating system |
(if any) on which the executable work runs, or a compiler used to |
produce the work, or an object code interpreter used to run it. |
|
The "Corresponding Source" for a work in object code form means all |
the source code needed to generate, install, and (for an executable |
work) run the object code and to modify the work, including scripts to |
control those activities. However, it does not include the work's |
System Libraries, or general-purpose tools or generally available free |
programs which are used unmodified in performing those activities but |
which are not part of the work. For example, Corresponding Source |
includes interface definition files associated with source files for |
the work, and the source code for shared libraries and dynamically |
linked subprograms that the work is specifically designed to require, |
such as by intimate data communication or control flow between those |
subprograms and other parts of the work. |
|
The Corresponding Source need not include anything that users |
can regenerate automatically from other parts of the Corresponding |
Source. |
|
The Corresponding Source for a work in source code form is that |
same work. |
|
2. Basic Permissions. |
|
All rights granted under this License are granted for the term of |
copyright on the Program, and are irrevocable provided the stated |
conditions are met. This License explicitly affirms your unlimited |
permission to run the unmodified Program. The output from running a |
covered work is covered by this License only if the output, given its |
content, constitutes a covered work. This License acknowledges your |
rights of fair use or other equivalent, as provided by copyright law. |
|
You may make, run and propagate covered works that you do not |
convey, without conditions so long as your license otherwise remains |
in force. You may convey covered works to others for the sole purpose |
of having them make modifications exclusively for you, or provide you |
with facilities for running those works, provided that you comply with |
the terms of this License in conveying all material for which you do |
not control copyright. Those thus making or running the covered works |
for you must do so exclusively on your behalf, under your direction |
and control, on terms that prohibit them from making any copies of |
your copyrighted material outside their relationship with you. |
|
Conveying under any other circumstances is permitted solely under |
the conditions stated below. Sublicensing is not allowed; section 10 |
makes it unnecessary. |
|
3. Protecting Users' Legal Rights From Anti-Circumvention Law. |
|
No covered work shall be deemed part of an effective technological |
measure under any applicable law fulfilling obligations under article |
11 of the WIPO copyright treaty adopted on 20 December 1996, or |
similar laws prohibiting or restricting circumvention of such |
measures. |
|
When you convey a covered work, you waive any legal power to forbid |
circumvention of technological measures to the extent such circumvention |
is effected by exercising rights under this License with respect to |
the covered work, and you disclaim any intention to limit operation or |
modification of the work as a means of enforcing, against the work's |
users, your or third parties' legal rights to forbid circumvention of |
technological measures. |
|
4. Conveying Verbatim Copies. |
|
You may convey verbatim copies of the Program's source code as you |
receive it, in any medium, provided that you conspicuously and |
appropriately publish on each copy an appropriate copyright notice; |
keep intact all notices stating that this License and any |
non-permissive terms added in accord with section 7 apply to the code; |
keep intact all notices of the absence of any warranty; and give all |
recipients a copy of this License along with the Program. |
|
You may charge any price or no price for each copy that you convey, |
and you may offer support or warranty protection for a fee. |
|
5. Conveying Modified Source Versions. |
|
You may convey a work based on the Program, or the modifications to |
produce it from the Program, in the form of source code under the |
terms of section 4, provided that you also meet all of these conditions: |
|
a) The work must carry prominent notices stating that you modified |
it, and giving a relevant date. |
|
b) The work must carry prominent notices stating that it is |
released under this License and any conditions added under section |
7. This requirement modifies the requirement in section 4 to |
"keep intact all notices". |
|
c) You must license the entire work, as a whole, under this |
License to anyone who comes into possession of a copy. This |
License will therefore apply, along with any applicable section 7 |
additional terms, to the whole of the work, and all its parts, |
regardless of how they are packaged. This License gives no |
permission to license the work in any other way, but it does not |
invalidate such permission if you have separately received it. |
|
d) If the work has interactive user interfaces, each must display |
Appropriate Legal Notices; however, if the Program has interactive |
interfaces that do not display Appropriate Legal Notices, your |
work need not make them do so. |
|
A compilation of a covered work with other separate and independent |
works, which are not by their nature extensions of the covered work, |
and which are not combined with it such as to form a larger program, |
in or on a volume of a storage or distribution medium, is called an |
"aggregate" if the compilation and its resulting copyright are not |
used to limit the access or legal rights of the compilation's users |
beyond what the individual works permit. Inclusion of a covered work |
in an aggregate does not cause this License to apply to the other |
parts of the aggregate. |
|
6. Conveying Non-Source Forms. |
|
You may convey a covered work in object code form under the terms |
of sections 4 and 5, provided that you also convey the |
machine-readable Corresponding Source under the terms of this License, |
in one of these ways: |
|
a) Convey the object code in, or embodied in, a physical product |
(including a physical distribution medium), accompanied by the |
Corresponding Source fixed on a durable physical medium |
customarily used for software interchange. |
|
b) Convey the object code in, or embodied in, a physical product |
(including a physical distribution medium), accompanied by a |
written offer, valid for at least three years and valid for as |
long as you offer spare parts or customer support for that product |
model, to give anyone who possesses the object code either (1) a |
copy of the Corresponding Source for all the software in the |
product that is covered by this License, on a durable physical |
medium customarily used for software interchange, for a price no |
more than your reasonable cost of physically performing this |
conveying of source, or (2) access to copy the |
Corresponding Source from a network server at no charge. |
|
c) Convey individual copies of the object code with a copy of the |
written offer to provide the Corresponding Source. This |
alternative is allowed only occasionally and noncommercially, and |
only if you received the object code with such an offer, in accord |
with subsection 6b. |
|
d) Convey the object code by offering access from a designated |
place (gratis or for a charge), and offer equivalent access to the |
Corresponding Source in the same way through the same place at no |
further charge. You need not require recipients to copy the |
Corresponding Source along with the object code. If the place to |
copy the object code is a network server, the Corresponding Source |
may be on a different server (operated by you or a third party) |
that supports equivalent copying facilities, provided you maintain |
clear directions next to the object code saying where to find the |
Corresponding Source. Regardless of what server hosts the |
Corresponding Source, you remain obligated to ensure that it is |
available for as long as needed to satisfy these requirements. |
|
e) Convey the object code using peer-to-peer transmission, provided |
you inform other peers where the object code and Corresponding |
Source of the work are being offered to the general public at no |
charge under subsection 6d. |
|
A separable portion of the object code, whose source code is excluded |
from the Corresponding Source as a System Library, need not be |
included in conveying the object code work. |
|
A "User Product" is either (1) a "consumer product", which means any |
tangible personal property which is normally used for personal, family, |
or household purposes, or (2) anything designed or sold for incorporation |
into a dwelling. In determining whether a product is a consumer product, |
doubtful cases shall be resolved in favor of coverage. For a particular |
product received by a particular user, "normally used" refers to a |
typical or common use of that class of product, regardless of the status |
of the particular user or of the way in which the particular user |
actually uses, or expects or is expected to use, the product. A product |
is a consumer product regardless of whether the product has substantial |
commercial, industrial or non-consumer uses, unless such uses represent |
the only significant mode of use of the product. |
|
"Installation Information" for a User Product means any methods, |
procedures, authorization keys, or other information required to install |
and execute modified versions of a covered work in that User Product from |
a modified version of its Corresponding Source. The information must |
suffice to ensure that the continued functioning of the modified object |
code is in no case prevented or interfered with solely because |
modification has been made. |
|
If you convey an object code work under this section in, or with, or |
specifically for use in, a User Product, and the conveying occurs as |
part of a transaction in which the right of possession and use of the |
User Product is transferred to the recipient in perpetuity or for a |
fixed term (regardless of how the transaction is characterized), the |
Corresponding Source conveyed under this section must be accompanied |
by the Installation Information. But this requirement does not apply |
if neither you nor any third party retains the ability to install |
modified object code on the User Product (for example, the work has |
been installed in ROM). |
|
The requirement to provide Installation Information does not include a |
requirement to continue to provide support service, warranty, or updates |
for a work that has been modified or installed by the recipient, or for |
the User Product in which it has been modified or installed. Access to a |
network may be denied when the modification itself materially and |
adversely affects the operation of the network or violates the rules and |
protocols for communication across the network. |
|
Corresponding Source conveyed, and Installation Information provided, |
in accord with this section must be in a format that is publicly |
documented (and with an implementation available to the public in |
source code form), and must require no special password or key for |
unpacking, reading or copying. |
|
7. Additional Terms. |
|
"Additional permissions" are terms that supplement the terms of this |
License by making exceptions from one or more of its conditions. |
Additional permissions that are applicable to the entire Program shall |
be treated as though they were included in this License, to the extent |
that they are valid under applicable law. If additional permissions |
apply only to part of the Program, that part may be used separately |
under those permissions, but the entire Program remains governed by |
this License without regard to the additional permissions. |
|
When you convey a copy of a covered work, you may at your option |
remove any additional permissions from that copy, or from any part of |
it. (Additional permissions may be written to require their own |
removal in certain cases when you modify the work.) You may place |
additional permissions on material, added by you to a covered work, |
for which you have or can give appropriate copyright permission. |
|
Notwithstanding any other provision of this License, for material you |
add to a covered work, you may (if authorized by the copyright holders of |
that material) supplement the terms of this License with terms: |
|
a) Disclaiming warranty or limiting liability differently from the |
terms of sections 15 and 16 of this License; or |
|
b) Requiring preservation of specified reasonable legal notices or |
author attributions in that material or in the Appropriate Legal |
Notices displayed by works containing it; or |
|
c) Prohibiting misrepresentation of the origin of that material, or |
requiring that modified versions of such material be marked in |
reasonable ways as different from the original version; or |
|
d) Limiting the use for publicity purposes of names of licensors or |
authors of the material; or |
|
e) Declining to grant rights under trademark law for use of some |
trade names, trademarks, or service marks; or |
|
f) Requiring indemnification of licensors and authors of that |
material by anyone who conveys the material (or modified versions of |
it) with contractual assumptions of liability to the recipient, for |
any liability that these contractual assumptions directly impose on |
those licensors and authors. |
|
All other non-permissive additional terms are considered "further |
restrictions" within the meaning of section 10. If the Program as you |
received it, or any part of it, contains a notice stating that it is |
governed by this License along with a term that is a further |
restriction, you may remove that term. If a license document contains |
a further restriction but permits relicensing or conveying under this |
License, you may add to a covered work material governed by the terms |
of that license document, provided that the further restriction does |
not survive such relicensing or conveying. |
|
If you add terms to a covered work in accord with this section, you |
must place, in the relevant source files, a statement of the |
additional terms that apply to those files, or a notice indicating |
where to find the applicable terms. |
|
Additional terms, permissive or non-permissive, may be stated in the |
form of a separately written license, or stated as exceptions; |
the above requirements apply either way. |
|
8. Termination. |
|
You may not propagate or modify a covered work except as expressly |
provided under this License. Any attempt otherwise to propagate or |
modify it is void, and will automatically terminate your rights under |
this License (including any patent licenses granted under the third |
paragraph of section 11). |
|
However, if you cease all violation of this License, then your |
license from a particular copyright holder is reinstated (a) |
provisionally, unless and until the copyright holder explicitly and |
finally terminates your license, and (b) permanently, if the copyright |
holder fails to notify you of the violation by some reasonable means |
prior to 60 days after the cessation. |
|
Moreover, your license from a particular copyright holder is |
reinstated permanently if the copyright holder notifies you of the |
violation by some reasonable means, this is the first time you have |
received notice of violation of this License (for any work) from that |
copyright holder, and you cure the violation prior to 30 days after |
your receipt of the notice. |
|
Termination of your rights under this section does not terminate the |
licenses of parties who have received copies or rights from you under |
this License. If your rights have been terminated and not permanently |
reinstated, you do not qualify to receive new licenses for the same |
material under section 10. |
|
9. Acceptance Not Required for Having Copies. |
|
You are not required to accept this License in order to receive or |
run a copy of the Program. Ancillary propagation of a covered work |
occurring solely as a consequence of using peer-to-peer transmission |
to receive a copy likewise does not require acceptance. However, |
nothing other than this License grants you permission to propagate or |
modify any covered work. These actions infringe copyright if you do |
not accept this License. Therefore, by modifying or propagating a |
covered work, you indicate your acceptance of this License to do so. |
|
10. Automatic Licensing of Downstream Recipients. |
|
Each time you convey a covered work, the recipient automatically |
receives a license from the original licensors, to run, modify and |
propagate that work, subject to this License. You are not responsible |
for enforcing compliance by third parties with this License. |
|
An "entity transaction" is a transaction transferring control of an |
organization, or substantially all assets of one, or subdividing an |
organization, or merging organizations. If propagation of a covered |
work results from an entity transaction, each party to that |
transaction who receives a copy of the work also receives whatever |
licenses to the work the party's predecessor in interest had or could |
give under the previous paragraph, plus a right to possession of the |
Corresponding Source of the work from the predecessor in interest, if |
the predecessor has it or can get it with reasonable efforts. |
|
You may not impose any further restrictions on the exercise of the |
rights granted or affirmed under this License. For example, you may |
not impose a license fee, royalty, or other charge for exercise of |
rights granted under this License, and you may not initiate litigation |
(including a cross-claim or counterclaim in a lawsuit) alleging that |
any patent claim is infringed by making, using, selling, offering for |
sale, or importing the Program or any portion of it. |
|
11. Patents. |
|
A "contributor" is a copyright holder who authorizes use under this |
License of the Program or a work on which the Program is based. The |
work thus licensed is called the contributor's "contributor version". |
|
A contributor's "essential patent claims" are all patent claims |
owned or controlled by the contributor, whether already acquired or |
hereafter acquired, that would be infringed by some manner, permitted |
by this License, of making, using, or selling its contributor version, |
but do not include claims that would be infringed only as a |
consequence of further modification of the contributor version. For |
purposes of this definition, "control" includes the right to grant |
patent sublicenses in a manner consistent with the requirements of |
this License. |
|
Each contributor grants you a non-exclusive, worldwide, royalty-free |
patent license under the contributor's essential patent claims, to |
make, use, sell, offer for sale, import and otherwise run, modify and |
propagate the contents of its contributor version. |
|
In the following three paragraphs, a "patent license" is any express |
agreement or commitment, however denominated, not to enforce a patent |
(such as an express permission to practice a patent or covenant not to |
sue for patent infringement). To "grant" such a patent license to a |
party means to make such an agreement or commitment not to enforce a |
patent against the party. |
|
If you convey a covered work, knowingly relying on a patent license, |
and the Corresponding Source of the work is not available for anyone |
to copy, free of charge and under the terms of this License, through a |
publicly available network server or other readily accessible means, |
then you must either (1) cause the Corresponding Source to be so |
available, or (2) arrange to deprive yourself of the benefit of the |
patent license for this particular work, or (3) arrange, in a manner |
consistent with the requirements of this License, to extend the patent |
license to downstream recipients. "Knowingly relying" means you have |
actual knowledge that, but for the patent license, your conveying the |
covered work in a country, or your recipient's use of the covered work |
in a country, would infringe one or more identifiable patents in that |
country that you have reason to believe are valid. |
|
If, pursuant to or in connection with a single transaction or |
arrangement, you convey, or propagate by procuring conveyance of, a |
covered work, and grant a patent license to some of the parties |
receiving the covered work authorizing them to use, propagate, modify |
or convey a specific copy of the covered work, then the patent license |
you grant is automatically extended to all recipients of the covered |
work and works based on it. |
|
A patent license is "discriminatory" if it does not include within |
the scope of its coverage, prohibits the exercise of, or is |
conditioned on the non-exercise of one or more of the rights that are |
specifically granted under this License. You may not convey a covered |
work if you are a party to an arrangement with a third party that is |
in the business of distributing software, under which you make payment |
to the third party based on the extent of your activity of conveying |
the work, and under which the third party grants, to any of the |
parties who would receive the covered work from you, a discriminatory |
patent license (a) in connection with copies of the covered work |
conveyed by you (or copies made from those copies), or (b) primarily |
for and in connection with specific products or compilations that |
contain the covered work, unless you entered into that arrangement, |
or that patent license was granted, prior to 28 March 2007. |
|
Nothing in this License shall be construed as excluding or limiting |
any implied license or other defenses to infringement that may |
otherwise be available to you under applicable patent law. |
|
12. No Surrender of Others' Freedom. |
|
If conditions are imposed on you (whether by court order, agreement or |
otherwise) that contradict the conditions of this License, they do not |
excuse you from the conditions of this License. If you cannot convey a |
covered work so as to satisfy simultaneously your obligations under this |
License and any other pertinent obligations, then as a consequence you may |
not convey it at all. For example, if you agree to terms that obligate you |
to collect a royalty for further conveying from those to whom you convey |
the Program, the only way you could satisfy both those terms and this |
License would be to refrain entirely from conveying the Program. |
|
13. Use with the GNU Affero General Public License. |
|
Notwithstanding any other provision of this License, you have |
permission to link or combine any covered work with a work licensed |
under version 3 of the GNU Affero General Public License into a single |
combined work, and to convey the resulting work. The terms of this |
License will continue to apply to the part which is the covered work, |
but the special requirements of the GNU Affero General Public License, |
section 13, concerning interaction through a network will apply to the |
combination as such. |
|
14. Revised Versions of this License. |
|
The Free Software Foundation may publish revised and/or new versions of |
the GNU General Public License from time to time. Such new versions will |
be similar in spirit to the present version, but may differ in detail to |
address new problems or concerns. |
|
Each version is given a distinguishing version number. If the |
Program specifies that a certain numbered version of the GNU General |
Public License "or any later version" applies to it, you have the |
option of following the terms and conditions either of that numbered |
version or of any later version published by the Free Software |
Foundation. If the Program does not specify a version number of the |
GNU General Public License, you may choose any version ever published |
by the Free Software Foundation. |
|
If the Program specifies that a proxy can decide which future |
versions of the GNU General Public License can be used, that proxy's |
public statement of acceptance of a version permanently authorizes you |
to choose that version for the Program. |
|
Later license versions may give you additional or different |
permissions. However, no additional obligations are imposed on any |
author or copyright holder as a result of your choosing to follow a |
later version. |
|
15. Disclaimer of Warranty. |
|
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY |
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT |
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY |
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, |
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM |
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF |
ALL NECESSARY SERVICING, REPAIR OR CORRECTION. |
|
16. Limitation of Liability. |
|
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING |
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS |
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY |
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE |
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF |
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD |
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), |
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF |
SUCH DAMAGES. |
|
17. Interpretation of Sections 15 and 16. |
|
If the disclaimer of warranty and limitation of liability provided |
above cannot be given local legal effect according to their terms, |
reviewing courts shall apply local law that most closely approximates |
an absolute waiver of all civil liability in connection with the |
Program, unless a warranty or assumption of liability accompanies a |
copy of the Program in return for a fee. |
|
END OF TERMS AND CONDITIONS |
|
How to Apply These Terms to Your New Programs |
|
If you develop a new program, and you want it to be of the greatest |
possible use to the public, the best way to achieve this is to make it |
free software which everyone can redistribute and change under these terms. |
|
To do so, attach the following notices to the program. It is safest |
to attach them to the start of each source file to most effectively |
state the exclusion of warranty; and each file should have at least |
the "copyright" line and a pointer to where the full notice is found. |
|
<one line to give the program's name and a brief idea of what it does.> |
Copyright (C) <year> <name of author> |
|
This program is free software: you can redistribute it and/or modify |
it under the terms of the GNU General Public License as published by |
the Free Software Foundation, either version 3 of the License, or |
(at your option) any later version. |
|
This program is distributed in the hope that it will be useful, |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
GNU General Public License for more details. |
|
You should have received a copy of the GNU General Public License |
along with this program. If not, see <http://www.gnu.org/licenses/>. |
|
Also add information on how to contact you by electronic and paper mail. |
|
If the program does terminal interaction, make it output a short |
notice like this when it starts in an interactive mode: |
|
<program> Copyright (C) <year> <name of author> |
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. |
This is free software, and you are welcome to redistribute it |
under certain conditions; type `show c' for details. |
|
The hypothetical commands `show w' and `show c' should show the appropriate |
parts of the General Public License. Of course, your program's commands |
might be different; for a GUI interface, you would use an "about box". |
|
You should also get your employer (if you work as a programmer) or school, |
if any, to sign a "copyright disclaimer" for the program, if necessary. |
For more information on this, and how to apply and follow the GNU GPL, see |
<http://www.gnu.org/licenses/>. |
|
The GNU General Public License does not permit incorporating your program |
into proprietary programs. If your program is a subroutine library, you |
may consider it more useful to permit linking proprietary applications with |
the library. If this is what you want to do, use the GNU Lesser General |
Public License instead of this License. But first, please read |
<http://www.gnu.org/philosophy/why-not-lgpl.html>. |
/ima_adpcm_encoder/trunk/tb_IMA_ADPCM_top.vhd
0,0 → 1,217
---------------------------------------------------------------------------------- |
-- Company: VISENGI S.L. (www.visengi.com) |
-- Engineer: Victor Lopez Lorenzo (victor.lopez (at) visengi (dot) com) |
-- |
-- Create Date: 19:34:36 04/November/2008 |
-- Project Name: IMA ADPCM Encoder |
-- Tool versions: Xilinx ISE 9.2i |
-- Description: |
-- |
-- Description: This project features a full-hardware sound compressor using the well known algorithm IMA ADPCM. |
-- The core acts as a slave WISHBONE device. The output is perfectly compatible with any sound player |
-- with the IMA ADPCM codec (included by default in every Windows). Includes a testbench that takes |
-- an uncompressed PCM 16 bits Mono WAV file and outputs an IMA ADPCM compressed WAV file. |
-- Compression ratio is fixed for IMA-ADPCM, being 4:1. |
-- |
-- |
-- LICENSE TERMS: GNU GENERAL PUBLIC LICENSE Version 3 |
-- |
-- That is you may use it only in NON-COMMERCIAL projects. |
-- You are only required to include in the copyrights/about section |
-- that your system contains a "IMA ADPCM Encoder (C) VISENGI S.L. under GPL license" |
-- This holds also in the case where you modify the core, as the resulting core |
-- would be a derived work. |
-- Also, we would like to know if you use this core in a project of yours, just an email will do. |
-- |
-- Please take good note of the disclaimer section of the GPL license, as we don't |
-- take any responsability for anything that this core does. |
---------------------------------------------------------------------------------- |
|
LIBRARY ieee; |
USE ieee.std_logic_1164.ALL; |
USE ieee.std_logic_unsigned.all; |
USE ieee.std_logic_arith.all; |
use ieee.numeric_std.all; |
|
ENTITY tb_IMA_ADPCM_top_vhd IS |
END tb_IMA_ADPCM_top_vhd; |
|
ARCHITECTURE behavior OF tb_IMA_ADPCM_top_vhd IS |
|
-- Component Declaration for the Unit Under Test (UUT) |
COMPONENT IMA_ADPCM_top |
PORT( |
wb_clk_i : IN std_logic; |
wb_rst_i : IN std_logic; |
wb_cyc_i : IN std_logic; |
wb_stb_i : IN std_logic; |
wb_we_i : IN std_logic; |
wb_adr_i : IN std_logic_vector(1 downto 0); |
wb_dat_i : IN std_logic_vector(15 downto 0); |
wb_dat_o : OUT std_logic_vector(15 downto 0); |
wb_ack_o : OUT std_logic |
); |
END COMPONENT; |
|
--Inputs |
SIGNAL wb_clk_i : std_logic := '0'; |
SIGNAL wb_rst_i : std_logic := '0'; |
SIGNAL wb_cyc_i : std_logic := '0'; |
SIGNAL wb_stb_i : std_logic := '0'; |
SIGNAL wb_we_i : std_logic := '0'; |
SIGNAL wb_adr_i : std_logic_vector(1 downto 0) := (others=>'0'); |
SIGNAL wb_dat_i : std_logic_vector(15 downto 0) := (others=>'0'); |
|
--Outputs |
SIGNAL wb_dat_o : std_logic_vector(15 downto 0); |
SIGNAL wb_ack_o : std_logic; |
|
|
type ByteFileType is file of character; |
file infile : ByteFileType open read_mode is "input.wav"; |
file outfile : ByteFileType open write_mode is "output.wav"; |
|
signal bytes, bytesout : std_logic_vector(23 downto 0); |
|
signal SamplesPerSec : std_logic_vector(15 downto 0); |
signal SecondsToCompress : std_logic_vector(31 downto 0); |
BEGIN |
|
-- Instantiate the Unit Under Test (UUT) |
uut: IMA_ADPCM_top PORT MAP( |
wb_clk_i => wb_clk_i, |
wb_rst_i => wb_rst_i, |
wb_cyc_i => wb_cyc_i, |
wb_stb_i => wb_stb_i, |
wb_we_i => wb_we_i, |
wb_adr_i => wb_adr_i, |
wb_dat_i => wb_dat_i, |
wb_dat_o => wb_dat_o, |
wb_ack_o => wb_ack_o |
); |
|
wb_rst_i <= '1', '0' after 40 ns; --active high reset |
|
Clocking : process --50 MHz -> T = 20 ns |
begin |
wb_clk_i <= '1'; wait for 20 ns; |
wb_clk_i <= '0'; wait for 20 ns; |
end process; |
|
|
|
|
Control_Compressor : process (wb_clk_i, wb_rst_i) |
variable byte : character; |
variable WaitACK, EndSignaled : std_logic; |
variable State : integer; |
variable data : std_logic_vector(15 downto 0); |
variable DataBytes : std_logic_vector(31 downto 0); |
begin |
if (wb_rst_i = '1') then |
bytes <= (others => '0'); |
bytesout <= (others => '0'); |
State := 0; |
WaitACK := '0'; |
EndSignaled := '0'; |
wb_cyc_i <= '0'; |
wb_stb_i <= '0'; |
wb_we_i <= '0'; |
wb_adr_i <= (others => '0'); |
wb_dat_i <= (others => '0'); |
data := (others => '0'); |
elsif (wb_clk_i = '1' and wb_clk_i'event) then |
if (WaitACK = '1') then |
if (wb_ack_o = '1') then |
wb_cyc_i <= '0'; wb_stb_i <= '0'; wb_we_i <= '0'; |
data := wb_dat_o; WaitACK := '0'; |
end if; |
end if; |
|
if (WaitACK = '0') then |
case State is |
when 0 => |
--read the WAV header in search of SamplesPerSecond (bytes 19h and 18h in little endian) |
--and DataBytes (bytes 39h,38h,37h,36h in little endian) to get SecondsToCompress as DataBytes/2/SamplesPerSecond |
for i in 0 to 57 loop --PCM header has 58 bytes |
read(infile, byte); |
case i is |
when 25 => --x"19" => --MSB of SamplesPerSecond |
SamplesPerSec(15 downto 8) <= conv_std_logic_vector(character'pos(byte),8); |
when 24 => --x"18" => --LSB of SamplesPerSecond |
SamplesPerSec(7 downto 0) <= conv_std_logic_vector(character'pos(byte),8); |
|
when 7 => --x"39" => --1stMSB of DataBytes |
DataBytes(31 downto 24) := conv_std_logic_vector(character'pos(byte),8); |
when 6 => --x"38" => --2ndMSB of DataBytes |
DataBytes(23 downto 16) := conv_std_logic_vector(character'pos(byte),8); |
when 5 => --x"37" => --3rdMSB of DataBytes |
DataBytes(15 downto 8) := conv_std_logic_vector(character'pos(byte),8); |
when 4 => --x"36" => --4thMSB of DataBytes |
DataBytes(7 downto 0) := conv_std_logic_vector(character'pos(byte),8); |
when others => |
null; |
end case; |
end loop; |
EndSignaled := '0'; |
bytes <= (others => '0'); |
bytesout <= (others => '0'); |
DataBytes := DataBytes - x"32"; --with fmt18 and fact4 chunks |
State := State + 1; |
when 1 => |
SecondsToCompress <= conv_std_logic_vector((conv_integer(DataBytes)/conv_integer(SamplesPerSec))/2,32); |
wb_adr_i <= "01"; wb_dat_i <= SamplesPerSec; wb_we_i <= '1'; WaitACK := '1'; |
State := State + 1; |
when 2 => |
wb_adr_i <= "10"; wb_dat_i <= SecondsToCompress(15 downto 0); wb_we_i <= '1'; WaitACK := '1'; |
State := State + 1; |
when 3 => |
wb_adr_i <= "00"; wb_dat_i <= x"8000"; wb_we_i <= '1'; WaitACK := '1'; |
State := State + 1; |
when 4 => |
wb_adr_i <= "00"; wb_we_i <= '0'; WaitACK := '1'; State := State + 1; |
when 5 => |
if (data(15) = '0') then --compression end |
File_Close(infile); --finished |
report "Input bytes = " & integer'image(conv_integer(bytes)) & " at time " & time'image(now); |
report "Output bytes = " & integer'image(conv_integer(bytesout)) & " at time " & time'image(now); |
File_Close(outfile); --finished |
report "-----------> Compression Finished OK!" severity FAILURE; --everything went fine, it's just to stop the simulation |
else |
if (data(0) = '1') then --output word ready |
wb_adr_i <= "11"; wb_we_i <= '0'; WaitACK := '1'; |
State := 15; --write word |
elsif (data(1) = '1' and EndSignaled = '0') then --ready for new input sample AND haven't reached the input file's EOF? |
if (bytes < DataBytes(23 downto 0) and not endfile(infile)) then |
--send two bytes to the WAV compressor |
read(infile,byte); --1st byte ----> goes in LSBs!!! (little endian) |
wb_dat_i(7 downto 0) <= conv_std_logic_vector(character'pos(byte),8); |
read(infile,byte); --2nd byte |
wb_dat_i(15 downto 8) <= conv_std_logic_vector(character'pos(byte),8); |
bytes <= bytes + x"2"; |
wb_adr_i <= "11"; wb_we_i <= '1'; WaitACK := '1'; State := State - 1; |
else --already sent the number of bytes indicated in PCM WAV header |
wb_adr_i <= "00"; wb_dat_i <= x"0000"; wb_we_i <= '1'; WaitACK := '1'; --signal finish compression |
EndSignaled := '1'; State := State - 1; --there will be still bytes to write but don't get in here again (EndSignaled='1') |
end if; |
else |
wb_adr_i <= "00"; wb_we_i <= '0'; WaitACK := '1'; --read again and stay in this state |
end if; |
end if; |
|
|
when 15 => --write word |
write(outfile, character'val(conv_integer(data(15 downto 8)))); |
write(outfile, character'val(conv_integer(data(7 downto 0)))); |
bytesout <= bytesout + x"2"; |
wb_adr_i <= "00"; wb_we_i <= '0'; WaitACK := '1'; State := 5; --go back and continue |
|
when others => |
State := 0; |
end case; |
end if; |
if (WaitACK = '1') then wb_cyc_i <= '1'; wb_stb_i <= '1'; end if; |
end if; |
end process Control_Compressor; |
|
END; |
/ima_adpcm_encoder/trunk/WAV_header_rom.vhd
0,0 → 1,149
---------------------------------------------------------------------------------- |
-- Company: VISENGI S.L. (www.visengi.com) |
-- Engineer: Victor Lopez Lorenzo (victor.lopez (at) visengi (dot) com) |
-- |
-- Create Date: 19:34:36 04/November/2008 |
-- Project Name: IMA ADPCM Encoder |
-- Tool versions: Xilinx ISE 9.2i |
-- Description: |
-- |
-- Description: This project features a full-hardware sound compressor using the well known algorithm IMA ADPCM. |
-- The core acts as a slave WISHBONE device. The output is perfectly compatible with any sound player |
-- with the IMA ADPCM codec (included by default in every Windows). Includes a testbench that takes |
-- an uncompressed PCM 16 bits Mono WAV file and outputs an IMA ADPCM compressed WAV file. |
-- Compression ratio is fixed for IMA-ADPCM, being 4:1. |
-- |
-- |
-- LICENSE TERMS: GNU GENERAL PUBLIC LICENSE Version 3 |
-- |
-- That is you may use it only in NON-COMMERCIAL projects. |
-- You are only required to include in the copyrights/about section |
-- that your system contains a "IMA ADPCM Encoder (C) VISENGI S.L. under GPL license" |
-- This holds also in the case where you modify the core, as the resulting core |
-- would be a derived work. |
-- Also, we would like to know if you use this core in a project of yours, just an email will do. |
-- |
-- Please take good note of the disclaimer section of the GPL license, as we don't |
-- take any responsability for anything that this core does. |
---------------------------------------------------------------------------------- |
|
-------------------------------------------------------------------------------- |
-- WAV HEADER ROM |
-------------------------------------------------------------------------------- |
|
library IEEE; |
use IEEE.STD_LOGIC_1164.all; |
use ieee.numeric_std.all; |
|
entity WAV_header_rom is |
generic (ROMADDR_W : integer := 6; |
ROMDATA_W : integer := 8); |
port( |
addr0 : in STD_LOGIC_VECTOR(ROMADDR_W-1 downto 0); |
clk : in STD_LOGIC; |
datao0 : out STD_LOGIC_VECTOR(ROMDATA_W-1 downto 0)); |
end WAV_header_rom; |
|
architecture RTL of WAV_header_rom is |
|
type ROM_TYPE is array (0 to 2**ROMADDR_W-1) |
of STD_LOGIC_VECTOR(ROMDATA_W-1 downto 0); |
constant rom : ROM_TYPE := |
( |
-- Everything little endian: |
-- 52 49 46 46 00 00 00 00 57 41 56 45 66 6D 74 20 14 00 00 00 |
-- R I F F x x x x W A V E f m t x x x x <-- these last are ok |
--x ^ ^ ^ ^ = change these for (file_size-8 or, simply, bytes that follow) |
-- 11 00 <-- wFormatTag = IMA ADPCM |
-- 01 00 <-- nChannels = 1 (Mono) |
--x40 1F 00 00 <-- nSamplesPerSec = 8000 |
--xD7 0F 00 00 <-- nAvgBytesPerSec = 4055 |
-- (505 samples/block -> 8000 samples/sec -> 504/2 + 4 header bytes w. 1 sample = 256 bytes/block -> (8000/505)*256 = 4055 bytes/sec) |
-- can be an approximate number and still be reproducible (i.e. nAvgBytesPerSec=nSamplesPerSec/512*256=nSamplesPerSec/2) |
-- 00 01 <-- nBlockAlign = 100h = 256 bytes block size |
-- 04 00 <-- wBitsPerSample = 4 bits |
-- 02 00 <-- cbSize = size of extension = 2 bytes |
-- F9 01 <-- wSamplesPerBlock = 505 samples/block |
-- |
-- 66 61 63 74 04 00 00 00 00 00 00 00 64 61 74 61 00 00 00 00 |
--x f a c t x x x x x x x x d a t a x x x x <-- change these for (file_size-60 or, simply, bytes that follow) |
--x ^ ^ ^ ^ = # samples per channel in file |
"01010010", |
"01001001", |
"01000110", |
"01000110", |
"11111111", |
"11111111", |
"11111111", |
"01111111", |
"01010111", |
"01000001", |
"01010110", |
"01000101", |
"01100110", |
"01101101", |
"01110100", |
"00100000", |
"00010100", |
"00000000", |
"00000000", |
"00000000", |
"00010001", |
"00000000", |
"00000001", |
"00000000", |
"01000000", |
"00011111", |
"00000000", |
"00000000", |
"11010111", |
"00001111", |
"00000000", |
"00000000", |
"00000000", |
"00000001", |
"00000100", |
"00000000", |
"00000010", |
"00000000", |
"11111001", |
"00000001", |
"01100110", |
"01100001", |
"01100011", |
"01110100", |
"00000100", |
"00000000", |
"00000000", |
"00000000", |
"11111111", |
"11111111", |
"11111111", |
"01111111", |
"01100100", |
"01100001", |
"01110100", |
"01100001", |
"11111111", |
"11111111", |
"11111111", |
"01111111", |
--0 stuffing |
"00000000", |
"00000000", |
"00000000", |
"00000000"); |
signal addr_reg0 : STD_LOGIC_VECTOR(ROMADDR_W-1 downto 0); |
|
begin |
|
datao0 <= rom( TO_INTEGER(UNSIGNED(addr_reg0)) ); |
|
process(clk) |
begin |
if clk = '1' and clk'event then |
addr_reg0 <= addr0; |
end if; |
end process; |
|
end RTL; |
/ima_adpcm_encoder/trunk/IMA_ADPCM_Encode.vhd
0,0 → 1,200
---------------------------------------------------------------------------------- |
-- Company: VISENGI S.L. (www.visengi.com) |
-- Engineer: Victor Lopez Lorenzo (victor.lopez (at) visengi (dot) com) |
-- |
-- Create Date: 19:34:36 04/November/2008 |
-- Project Name: IMA ADPCM Encoder |
-- Tool versions: Xilinx ISE 9.2i |
-- Description: |
-- |
-- Description: This project features a full-hardware sound compressor using the well known algorithm IMA ADPCM. |
-- The core acts as a slave WISHBONE device. The output is perfectly compatible with any sound player |
-- with the IMA ADPCM codec (included by default in every Windows). Includes a testbench that takes |
-- an uncompressed PCM 16 bits Mono WAV file and outputs an IMA ADPCM compressed WAV file. |
-- Compression ratio is fixed for IMA-ADPCM, being 4:1. |
-- |
-- |
-- LICENSE TERMS: GNU GENERAL PUBLIC LICENSE Version 3 |
-- |
-- That is you may use it only in NON-COMMERCIAL projects. |
-- You are only required to include in the copyrights/about section |
-- that your system contains a "IMA ADPCM Encoder (C) VISENGI S.L. under GPL license" |
-- This holds also in the case where you modify the core, as the resulting core |
-- would be a derived work. |
-- Also, we would like to know if you use this core in a project of yours, just an email will do. |
-- |
-- Please take good note of the disclaimer section of the GPL license, as we don't |
-- take any responsability for anything that this core does. |
---------------------------------------------------------------------------------- |
|
library IEEE; |
use IEEE.STD_LOGIC_1164.ALL; |
use IEEE.STD_LOGIC_ARITH.ALL; |
use IEEE.STD_LOGIC_UNSIGNED.ALL; |
|
entity IMA_ADPCM_Encode is |
Port ( clk : in STD_LOGIC; |
reset : in STD_LOGIC; |
|
PredictedValue_o : out std_logic_vector(15 downto 0); |
StepIndex_o : out std_logic_vector(6 downto 0); |
StateRDY : out std_logic; |
|
sample : in std_logic_vector(15 downto 0); --don't change it while sample_rdy='1' |
sample_rdy : in std_logic; --lower it only when ADPCM_sample_rdy = '1' |
ADPCM_sample : out std_logic_vector(3 downto 0); |
ADPCM_sample_rdy : out std_logic |
); |
end IMA_ADPCM_Encode; |
|
architecture Behavioral of IMA_ADPCM_Encode is |
signal PredictedValue : std_logic_vector(15 downto 0); |
signal StepIndex : std_logic_vector(6 downto 0); |
|
component IMA_adpcm_steptable_rom port( |
addr0 : in STD_LOGIC_VECTOR(6 downto 0); |
clk : in STD_LOGIC; |
datao0: out STD_LOGIC_VECTOR(14 downto 0)); |
end component; |
|
signal Step : std_logic_vector(14 downto 0); |
|
signal comp16b_AbtB : std_logic; --A bigger than B |
signal delta, diff : std_logic_vector(15 downto 0); |
signal State : integer range 0 to 31; |
begin |
StepTable_ROM : IMA_adpcm_steptable_rom port map ( |
addr0 => StepIndex, |
clk => clk, |
datao0=> Step); |
|
|
|
process (reset, clk) |
variable AdderSub16 : std_logic_vector(15 downto 0); |
variable ADPCM_sample2 : std_logic_vector(3 downto 0); |
begin |
if (reset = '1') then |
State <= 0; |
AdderSub16 := (others => '0'); |
ADPCM_sample <= x"0"; |
ADPCM_sample2 := x"0"; |
ADPCM_sample_rdy <= '0'; |
|
PredictedValue <= (others => '0'); |
StepIndex <= (others => '0'); |
PredictedValue_o <= (others => '0'); |
StepIndex_o <= (others => '0'); |
StateRDY <= '0'; |
delta <= (others => '0'); |
diff <= (others => '0'); |
comp16b_AbtB <= '0'; |
elsif (clk='1' and clk'event) then |
ADPCM_sample_rdy <= '0'; |
|
case State is |
when 0 => |
PredictedValue_o <= PredictedValue; StepIndex_o <= StepIndex; StateRDY <= '1'; |
if (sample_rdy = '1') then State <= 10; StateRDY <= '0'; end if; |
when 10 => --Signed comparison between A:sample and B:PredictedValue |
if (sample(15) = '1' and PredictedValue(15) = '0') then |
comp16b_AbtB <= '0'; --sample<0, Pred>=0 |
elsif (sample(15) = '0' and PredictedValue(15) = '1') then |
comp16b_AbtB <= '1'; --sample>=0, Pred<0 |
else --both positives or both negatives --> normal comparison |
if (sample > PredictedValue) then comp16b_AbtB <= '1'; else comp16b_AbtB <= '0'; end if; |
end if; |
State <= State + 1; |
when 11 => |
if (comp16b_AbtB = '1') then --it really should be beq but a negative zero is as good as a positive one |
delta <= sample - PredictedValue; |
ADPCM_sample2(3) := '0'; |
else |
delta <= PredictedValue - sample; |
ADPCM_sample2(3) := '1'; --set the sign (negative) |
end if; |
State <= State + 1; |
|
when 12 => --we've got the rigth Step now |
diff <= "0000" & Step(14 downto 3); |
if (delta > '0' & Step) then comp16b_AbtB <= '1'; else comp16b_AbtB <= '0'; end if; |
State <= State + 1; |
when 13 => |
if (comp16b_AbtB = '1') then --delta > step |
delta <= delta - ('0' & Step); |
diff <= diff + ('0' & Step); |
ADPCM_sample2(2) := '1'; |
else |
ADPCM_sample2(2) := '0'; |
end if; |
State <= State + 1; |
|
when 14 => |
if (delta > "00" & Step(14 downto 1)) then comp16b_AbtB <= '1'; else comp16b_AbtB <= '0'; end if; |
State <= State + 1; |
when 15 => |
if (comp16b_AbtB = '1') then --delta > step |
delta <= delta - ("00" & Step(14 downto 1)); |
diff <= diff + ("00" & Step(14 downto 1)); |
ADPCM_sample2(1) := '1'; |
else |
ADPCM_sample2(1) := '0'; |
end if; |
State <= State + 1; |
|
when 16 => |
if (delta > "000" & Step(14 downto 2)) then comp16b_AbtB <= '1'; else comp16b_AbtB <= '0'; end if; |
State <= State + 1; |
when 17 => |
if (comp16b_AbtB = '1') then --delta > step |
diff <= diff + ("000" & Step(14 downto 2)); |
ADPCM_sample2(0) := '1'; |
else |
ADPCM_sample2(0) := '0'; |
end if; |
ADPCM_sample_rdy <= '1'; |
State <= State + 1; |
|
when 18 => |
if (ADPCM_sample2(3) = '1') then --negative |
AdderSub16 := PredictedValue - diff; |
else |
AdderSub16 := PredictedValue + diff; |
end if; |
|
--IMA_ADPCMIndexTable[8] = -1, -1, -1, -1, 2, 4, 6, 8, |
case ADPCM_sample2(2 downto 0) is |
when "111" => StepIndex <= StepIndex + "0001000"; |
when "110" => StepIndex <= StepIndex + "0000110"; |
when "101" => StepIndex <= StepIndex + "0000100"; |
when "100" => StepIndex <= StepIndex + "0000010"; |
when others => StepIndex <= StepIndex - "0000001"; |
end case; |
State <= State + 1; |
when 19 => |
if (StepIndex = "1111111") then |
StepIndex <= (others => '0'); |
elsif (StepIndex > "1011000") then |
StepIndex <= "1011000"; |
end if; |
|
--diff is always positive, it becomes negative if we substract Pred - diff == Pred + (-diff) |
--so the sign of diff is marked by ADPCM_sample2(3) |
if (PredictedValue(15) = '0' and ADPCM_sample2(3) = '0' and AdderSub16(15) = '1') then --both positives result in negative? |
PredictedValue <= '0' & (14 downto 0 => '1'); --positive overflow -> set biggest positive |
elsif (PredictedValue(15) = '1' and ADPCM_sample2(3) = '1' and AdderSub16(15) = '0') then --both negatives result positive? |
PredictedValue <= '1' & (14 downto 0 => '0'); --negative overflow -> set biggest negative |
else --one positive, the other negative (overflow not possible) |
PredictedValue <= AdderSub16(15 downto 0); |
end if; |
State <= 0; --go wait for new sample ready |
|
when others => |
State <= 0; |
end case; |
ADPCM_sample <= ADPCM_sample2; |
end if; |
end process; |
|
end Behavioral; |
|
/ima_adpcm_encoder/trunk/IMA_adpcm_steptable_rom.vhd
0,0 → 1,211
---------------------------------------------------------------------------------- |
-- Company: VISENGI S.L. (www.visengi.com) |
-- Engineer: Victor Lopez Lorenzo (victor.lopez (at) visengi (dot) com) |
-- |
-- Create Date: 19:34:36 04/November/2008 |
-- Project Name: IMA ADPCM Encoder |
-- Tool versions: Xilinx ISE 9.2i |
-- Description: |
-- |
-- Description: This project features a full-hardware sound compressor using the well known algorithm IMA ADPCM. |
-- The core acts as a slave WISHBONE device. The output is perfectly compatible with any sound player |
-- with the IMA ADPCM codec (included by default in every Windows). Includes a testbench that takes |
-- an uncompressed PCM 16 bits Mono WAV file and outputs an IMA ADPCM compressed WAV file. |
-- Compression ratio is fixed for IMA-ADPCM, being 4:1. |
-- |
-- |
-- LICENSE TERMS: GNU GENERAL PUBLIC LICENSE Version 3 |
-- |
-- That is you may use it only in NON-COMMERCIAL projects. |
-- You are only required to include in the copyrights/about section |
-- that your system contains a "IMA ADPCM Encoder (C) VISENGI S.L. under GPL license" |
-- This holds also in the case where you modify the core, as the resulting core |
-- would be a derived work. |
-- Also, we would like to know if you use this core in a project of yours, just an email will do. |
-- |
-- Please take good note of the disclaimer section of the GPL license, as we don't |
-- take any responsability for anything that this core does. |
---------------------------------------------------------------------------------- |
|
-------------------------------------------------------------------------------- |
-- |
-- static const uint16_t IMA_ADPCMStepTable[89] = |
-- { |
-- 7, 8, 9, 10, 11, 12, 13, 14, |
-- 16, 17, 19, 21, 23, 25, 28, 31, |
-- 34, 37, 41, 45, 50, 55, 60, 66, |
-- 73, 80, 88, 97, 107, 118, 130, 143, |
-- 157, 173, 190, 209, 230, 253, 279, 307, |
-- 337, 371, 408, 449, 494, 544, 598, 658, |
-- 724, 796, 876, 963, 1060, 1166, 1282, 1411, |
-- 1552, 1707, 1878, 2066, 2272, 2499, 2749, 3024, |
-- 3327, 3660, 4026, 4428, 4871, 5358, 5894, 6484, |
-- 7132, 7845, 8630, 9493,10442,11487,12635,13899, |
-- 15289,16818,18500,20350,22385,24623,27086,29794, |
-- 32767 |
-- }; |
-- |
-------------------------------------------------------------------------------- |
|
library IEEE; |
use IEEE.STD_LOGIC_1164.all; |
use ieee.numeric_std.all; |
|
entity IMA_adpcm_steptable_rom is |
generic (ROMADDR_W : integer := 7; |
ROMDATA_W : integer := 15); |
port( |
addr0 : in STD_LOGIC_VECTOR(ROMADDR_W-1 downto 0); |
clk : in STD_LOGIC; |
datao0 : out STD_LOGIC_VECTOR(ROMDATA_W-1 downto 0)); |
end IMA_adpcm_steptable_rom; |
|
architecture RTL of IMA_adpcm_steptable_rom is |
|
type ROM_TYPE is array (0 to 2**ROMADDR_W-1) |
of STD_LOGIC_VECTOR(ROMDATA_W-1 downto 0); |
constant rom : ROM_TYPE := |
( |
"000000000000111", |
"000000000001000", |
"000000000001001", |
"000000000001010", |
"000000000001011", |
"000000000001100", |
"000000000001101", |
"000000000001110", |
"000000000010000", |
"000000000010001", |
"000000000010011", |
"000000000010101", |
"000000000010111", |
"000000000011001", |
"000000000011100", |
"000000000011111", |
"000000000100010", |
"000000000100101", |
"000000000101001", |
"000000000101101", |
"000000000110010", |
"000000000110111", |
"000000000111100", |
"000000001000010", |
"000000001001001", |
"000000001010000", |
"000000001011000", |
"000000001100001", |
"000000001101011", |
"000000001110110", |
"000000010000010", |
"000000010001111", |
"000000010011101", |
"000000010101101", |
"000000010111110", |
"000000011010001", |
"000000011100110", |
"000000011111101", |
"000000100010111", |
"000000100110011", |
"000000101010001", |
"000000101110011", |
"000000110011000", |
"000000111000001", |
"000000111101110", |
"000001000100000", |
"000001001010110", |
"000001010010010", |
"000001011010100", |
"000001100011100", |
"000001101101100", |
"000001111000011", |
"000010000100100", |
"000010010001110", |
"000010100000010", |
"000010110000011", |
"000011000010000", |
"000011010101011", |
"000011101010110", |
"000100000010010", |
"000100011100000", |
"000100111000011", |
"000101010111101", |
"000101111010000", |
"000110011111111", |
"000111001001100", |
"000111110111010", |
"001000101001100", |
"001001100000111", |
"001010011101110", |
"001011100000110", |
"001100101010100", |
"001101111011100", |
"001111010100101", |
"010000110110110", |
"010010100010101", |
"010100011001010", |
"010110011011111", |
"011000101011011", |
"011011001001011", |
"011101110111001", |
"100000110110010", |
"100100001000100", |
"100111101111110", |
"101011101110001", |
"110000000101111", |
"110100111001110", |
"111010001100010", |
"111111111111111", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000", |
"000000000000000" |
); |
signal addr_reg0 : STD_LOGIC_VECTOR(ROMADDR_W-1 downto 0); |
|
begin |
|
datao0 <= rom( TO_INTEGER(UNSIGNED(addr_reg0)) ); |
|
process(clk) |
begin |
if clk = '1' and clk'event then |
addr_reg0 <= addr0; |
end if; |
end process; |
|
end RTL; |
/ima_adpcm_encoder/trunk/IMA_ADPCM_top.vhd
0,0 → 1,427
---------------------------------------------------------------------------------- |
-- Company: VISENGI S.L. (www.visengi.com) |
-- Engineer: Victor Lopez Lorenzo (victor.lopez (at) visengi (dot) com) |
-- |
-- Create Date: 19:34:36 04/November/2008 |
-- Project Name: IMA ADPCM Encoder |
-- Tool versions: Xilinx ISE 9.2i |
-- Description: |
-- |
-- Description: This project features a full-hardware sound compressor using the well known algorithm IMA ADPCM. |
-- The core acts as a slave WISHBONE device. The output is perfectly compatible with any sound player |
-- with the IMA ADPCM codec (included by default in every Windows). Includes a testbench that takes |
-- an uncompressed PCM 16 bits Mono WAV file and outputs an IMA ADPCM compressed WAV file. |
-- Compression ratio is fixed for IMA-ADPCM, being 4:1. |
-- |
-- |
-- LICENSE TERMS: GNU GENERAL PUBLIC LICENSE Version 3 |
-- |
-- That is you may use it only in NON-COMMERCIAL projects. |
-- You are only required to include in the copyrights/about section |
-- that your system contains a "IMA ADPCM Encoder (C) VISENGI S.L. under GPL license" |
-- This holds also in the case where you modify the core, as the resulting core |
-- would be a derived work. |
-- Also, we would like to know if you use this core in a project of yours, just an email will do. |
-- |
-- Please take good note of the disclaimer section of the GPL license, as we don't |
-- take any responsability for anything that this core does. |
---------------------------------------------------------------------------------- |
|
library IEEE; |
use IEEE.STD_LOGIC_1164.ALL; |
use IEEE.STD_LOGIC_ARITH.ALL; |
use IEEE.STD_LOGIC_UNSIGNED.ALL; |
|
entity IMA_ADPCM_top is |
Port ( wb_clk_i : in std_logic; |
wb_rst_i : in std_logic; |
wb_cyc_i : in std_logic; |
wb_stb_i : in std_logic; |
wb_we_i : in std_logic; |
wb_adr_i : in std_logic_vector(1 downto 0); |
wb_dat_i : in std_logic_vector(15 downto 0); |
wb_dat_o : out std_logic_vector(15 downto 0); |
wb_ack_o : out std_logic); |
end IMA_ADPCM_top; |
|
architecture Behavioral of IMA_ADPCM_top is |
component IMA_ADPCM_Encode port ( |
clk : in STD_LOGIC; |
reset : in STD_LOGIC; |
PredictedValue_o : out std_logic_vector(15 downto 0); |
StepIndex_o : out std_logic_vector(6 downto 0); |
StateRDY : out std_logic; |
sample : in std_logic_vector(15 downto 0); --don't change it while sample_rdy='1' |
sample_rdy : in std_logic; --lower it only when ADPCM_sample_rdy = '1' |
ADPCM_sample : out std_logic_vector(3 downto 0); |
ADPCM_sample_rdy : out std_logic); |
end component; |
|
component WAV_header_rom port( |
addr0 : in STD_LOGIC_VECTOR(5 downto 0); |
clk : in STD_LOGIC; |
datao0: out STD_LOGIC_VECTOR(7 downto 0)); |
end component; |
|
signal WAV_addr : std_logic_vector(5 downto 0); |
signal WAV_data : std_logic_vector(7 downto 0); |
|
signal sample : std_logic_vector(15 downto 0); |
signal ADPCM_sample : std_logic_vector(3 downto 0); |
signal sample_rdy, ADPCM_sample_rdy : std_logic; |
|
signal soft_reset, isoft_reset : std_logic; |
signal iwb_ack_o : std_logic; |
|
|
-- IMPORTANT: Remember that flow control MUST be done externally (that is, if SamplesPerSec is set to 8000, then 8000 samples must be fed every second) |
-- The first 60 bytes of data correspond to the WAV header |
-- |
--WISHBONE REGS' DESCRIPTION: |
--reg 0: Control(W: WRITES)/Status(R: READS) |
-- bit 15: (R) 0=finished, 1=compressing (W) 0=end file (if compressing), 1=start file compression |
-- clearing this bit while compressing doesn't immediately end it, because the current block must be finished (block size=256 bytes) |
-- the only thing that happens is that the next samples up to the end of the block (samples_per_block=505) will be zeros (silence). |
-- bit 1: (R) 1=ready for new input sample to be written on reg 3 (auto-cleared on write to reg 3), 0=processing last input sample |
-- bit 0: (R) 1=16 bits of output file are ready to be read on reg 3 (auto-cleared on read to reg 3), 0=processing next output word |
--reg 1: SamplesPerSec (i.e.: 8000, 22050, 32000, 44100, ...) |
--reg 2: SecondsToCompress (0 for undefined (max values will be used in file headers) -> the sound will be complete and reproducible but an "early EOF" or "damaged file" error may appear in player at the end of the sound) |
--reg 3: On writes: a 16 bit sample is expected - On reads: data lines will contain 16 bits of the compressed output file (only if reg(0)(0)='1'!!!) |
--output words of 16 bits should be read from MSB to LSB |
|
signal SamplesPerSec1, SecondsToCompress2, CompressedWord : std_logic_vector(15 downto 0); |
signal InputRDY, OutputRDY, OutputRDY_sync2, RDYOutput, FinishBlock : std_logic; |
signal StartCompressing, Compressing, EndCompression : std_logic; |
signal CompressedNibbles : integer range 0 to 4; |
|
signal WriteHeader, WriteHeader_sync2 : std_logic; |
signal WriteState, WriteState_sync2 : std_logic; |
signal BlockBytes : integer range 0 to 255; |
signal SecondsCompressed : std_logic_vector(15 downto 0); |
signal SamplesCompressed : std_logic_vector(15 downto 0); |
signal MSB, LoadROM : std_logic; |
signal SamplesInFile : std_logic_vector(31 downto 0); |
|
signal PredictedValue : std_logic_vector(15 downto 0); |
signal StepIndex : std_logic_vector(6 downto 0); |
signal StateRDY : std_logic; |
signal WriteStateLSWord : std_logic; |
begin |
isoft_reset <= soft_reset or wb_rst_i; |
|
WAV_ROM: WAV_header_rom port map ( |
addr0 => WAV_addr, |
clk => wb_clk_i, |
datao0 => WAV_data); |
|
IMA_ADPCM_Encoder : IMA_ADPCM_Encode port map ( |
clk => wb_clk_i, |
reset => isoft_reset, |
PredictedValue_o => PredictedValue, |
StepIndex_o => StepIndex, |
StateRDY => StateRDY, |
sample => sample, |
sample_rdy => sample_rdy, |
ADPCM_sample => ADPCM_sample, |
ADPCM_sample_rdy => ADPCM_sample_rdy); |
|
Input_process : process (wb_clk_i, wb_rst_i) |
variable WaitW : std_logic; |
begin |
if (wb_rst_i = '1') then |
iwb_ack_o <= '0'; |
wb_dat_o <= (others => '0'); |
InputRDY <= '0'; |
OutputRDY <= '0'; |
OutputRDY_sync2 <= '0'; |
SamplesPerSec1 <= (others => '0'); |
SecondsToCompress2 <= (others => '0'); |
Compressing <= '0'; |
StartCompressing <= '0'; |
WaitW := '0'; |
soft_reset <= '0'; |
|
sample <= (others => '0'); |
sample_rdy <= '0'; |
elsif (wb_clk_i = '1' and wb_clk_i'event) then |
OutputRDY_sync2 <= OutputRDY; |
soft_reset <= '0'; |
iwb_ack_o <= wb_cyc_i and wb_stb_i and not iwb_ack_o; |
|
if (RDYOutput = '1') then OutputRDY <= '1'; end if; |
if (ADPCM_sample_rdy = '1') then |
sample_rdy <= '0'; |
if (CompressedNibbles < 3 and WriteState = '0') then InputRDY <= '1'; end if; |
end if; |
|
if (OutputRDY_sync2 = '1' and OutputRDY = '0' and WriteState = '0' and WriteHeader = '0') then InputRDY <= '1'; end if; |
if (((OutputRDY_sync2 = '1' and OutputRDY = '0') or (WriteHeader_sync2 = '1' and WriteHeader = '0')) and WriteState = '1' and BlockBytes = 0 and WaitW = '0') then InputRDY <= '1'; WaitW := '1'; end if; --to write the block header one input sample is required |
if (WriteState_sync2 = '1' and WriteState = '0') then InputRDY <= '1'; WaitW := '0'; end if; --after writing the block header, ask for input sample |
|
|
if (EndCompression = '1') then Compressing <= '0'; end if; |
|
if (FinishBlock = '1') then |
sample <= x"0000"; |
sample_rdy <= '1'; |
InputRDY <= '0'; |
end if; |
|
if (wb_cyc_i = '1' and wb_stb_i = '1') then |
case wb_adr_i is |
when "00" => --control/status |
if (wb_we_i = '0') then --read = status |
wb_dat_o <= (others => '0'); |
wb_dat_o(15) <= Compressing; |
wb_dat_o(1) <= InputRDY; |
wb_dat_o(0) <= OutputRDY; |
else --write = control |
StartCompressing <= wb_dat_i(15); |
if (wb_dat_i(15) = '1' and Compressing = '0') then --start new operation? |
soft_reset <= '1'; |
OutputRDY <= '0'; |
InputRDY <= '0'; --wait for WriteHeader |
Compressing <= '1'; |
end if; |
end if; |
when "11" => --data in/out |
if (wb_we_i = '0') then --read = get compressed data |
if (OutputRDY = '1') then |
wb_dat_o <= CompressedWord; |
OutputRDY <= '0'; |
end if; |
else --write = put input sample |
if (InputRDY = '1') then |
if (FinishBlock = '0') then sample <= wb_dat_i; else sample <= x"0000"; end if; |
sample_rdy <= '1'; |
InputRDY <= '0'; |
end if; |
end if; |
when "01" => --SamplesPerSec |
if (wb_we_i = '0') then --read |
wb_dat_o <= SamplesPerSec1; |
else --write |
SamplesPerSec1 <= wb_dat_i; |
end if; |
when "10" => --SecondsToCompress |
if (wb_we_i = '0') then --read |
wb_dat_o <= SecondsToCompress2; |
else --write |
SecondsToCompress2 <= wb_dat_i; |
end if; |
when others => |
report "-----------> Wrong WB Address!" severity WARNING; |
end case; |
end if; |
end if; |
end process; |
|
wb_ack_o <= iwb_ack_o; |
|
|
Output_process : process (wb_clk_i, wb_rst_i) |
variable WaitADPCM : std_logic; |
variable WAV_data_to_write : std_logic_vector(7 downto 0); |
begin |
if (wb_rst_i = '1') then |
CompressedWord <= (others => '0'); |
RDYOutput <= '0'; |
WriteHeader <= '1'; |
WriteHeader_sync2 <= '1'; |
FinishBlock <= '0'; |
BlockBytes <= 0; |
CompressedNibbles <= 0; |
EndCompression <= '0'; |
MSB <= '1'; |
LoadROM <= '1'; |
WAV_addr <= (others => '0'); |
WAV_data_to_write := (others => '0'); |
|
SecondsCompressed <= (others => '0'); |
SamplesCompressed <= (others => '0'); |
|
WriteState <= '0'; |
WriteState_sync2 <= '0'; |
WriteStateLSWord <= '0'; |
WaitADPCM := '0'; |
elsif (wb_clk_i = '1' and wb_clk_i'event) then |
WriteHeader_sync2 <= WriteHeader; |
WriteState_sync2 <= WriteState; |
|
if (WriteState_sync2 = '0' and WriteState = '1') then WaitADPCM := '1'; end if; |
|
EndCompression <= '0'; |
RDYOutput <= '0'; |
if (StartCompressing = '0' and Compressing = '1') then FinishBlock <= '1'; end if; --finish compression on end of current block! |
|
if (ADPCM_sample_rdy = '1' and WriteState = '0') then --because WriteState uses one ADPCM_sample_rdy to write its own header sample |
case CompressedNibbles is --little endian on each byte (byte 0:n1n0, byte 1:n3n2, ...) |
when 0 => |
CompressedWord(11 downto 8) <= ADPCM_sample; |
CompressedNibbles <= CompressedNibbles + 1; |
when 1 => |
CompressedWord(15 downto 12) <= ADPCM_sample; |
CompressedNibbles <= CompressedNibbles + 1; |
when 2 => |
CompressedWord(3 downto 0) <= ADPCM_sample; |
CompressedNibbles <= CompressedNibbles + 1; |
when 3 => |
CompressedWord(7 downto 4) <= ADPCM_sample; |
CompressedNibbles <= CompressedNibbles + 1; |
if (BlockBytes /= 254) then |
BlockBytes <= BlockBytes + 2; |
else |
BlockBytes <= 0; |
WriteState <= '1'; |
end if; |
when others => --4 pending wb read of reg 3 |
CompressedNibbles <= CompressedNibbles; |
end case; |
|
|
if (SamplesCompressed = SamplesPerSec1) then |
if (SecondsCompressed = SecondsToCompress2) then |
FinishBlock <= '1'; --finish compression on end of current block! |
else |
SamplesCompressed <= (others => '0'); |
SecondsCompressed <= SecondsCompressed + 1; |
end if; |
else |
SamplesCompressed <= SamplesCompressed + 1; |
end if; |
end if; |
|
if (Compressing = '1' and EndCompression = '0') then |
if (CompressedNibbles = 4) then |
if (OutputRDY_sync2 = '1' and OutputRDY = '0') then |
CompressedNibbles <= 0; |
if (WriteStateLSWord = '0' and BlockBytes = 4) then WriteState <= '0'; end if; --lower it (but not in the cycle it is risen!) |
else |
if (OutputRDY = '0' and RDYOutput = '0') then RDYOutput <= '1'; end if; |
end if; |
else |
if (RDYOutput = '0' and OutputRDY = '0') then --get next nibble/s if last CompressedWord is read |
if (FinishBlock = '1') then --finish compression on end of current block! |
if (BlockBytes = 0) then |
EndCompression <= '1'; --signal input process the end of the compression |
end if; |
else --normal operation |
if (WriteHeader = '1') then --output WAV header |
if (LoadROM = '0') then |
LoadROM <= '1'; --give the ROM time to read a byte |
if (WAV_addr = "111100") then --last header byte + 1 |
WAV_addr <= (others => '0'); |
WriteHeader <= '0'; |
WriteState <= '1'; |
end if; |
else |
WAV_addr <= WAV_addr + 1; |
WAV_data_to_write := WAV_data; --by default times are for undefined in WAV header |
case WAV_addr is --all data is little-endian! |
when "000100" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(7 downto 0); end if; --LSB of file_size-8 (FF for undefined) |
when "000101" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(15 downto 8); end if; --LSB2 of file_size-8 (FF for undefined) |
when "000110" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(23 downto 16); end if; --MSB2 of file_size-8 (FF for undefined) |
when "000111" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(31 downto 24); end if; --MSB of file_size-8 (7F for undefined) |
|
when "011000" => WAV_data_to_write := SamplesPerSec1(7 downto 0); --LSB of SamplesPerSec |
when "011001" => WAV_data_to_write := SamplesPerSec1(15 downto 8); --MSB of SamplesPerSec |
when "011100" => WAV_data_to_write := SamplesPerSec1(8 downto 1); --LSB of AvgBytesPerSec : approx. SamplesPerSec/2 |
when "011101" => WAV_data_to_write := '0' & SamplesPerSec1(15 downto 9); --MSB of AvgBytesPerSec : approx. SamplesPerSec/2 |
|
when "110000" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(7 downto 0); end if; --LSB of SamplesPerChannelInFile (FF for undefined) |
when "110001" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(15 downto 8); end if; --LSB2 of SamplesPerChannelInFile (FF for undefined) |
when "110010" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(23 downto 16); end if; --MSB2 of SamplesPerChannelInFile (FF for undefined) |
when "110011" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(31 downto 24); end if; --MSB of SamplesPerChannelInFile (7F for undefined) |
|
when "111000" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(7 downto 0); end if; --LSB of file_size-60 (FF for undefined) |
when "111001" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(15 downto 8); end if; --LSB2 of file_size-60 (FF for undefined) |
when "111010" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(23 downto 16); end if; --MSB2 of file_size-60 (FF for undefined) |
when "111011" => if (SecondsToCompress2 /= x"0000") then WAV_data_to_write := SamplesInFile(31 downto 24); end if; --MSB of file_size-60 (7F for undefined) |
when others => null; |
end case; |
if (MSB = '1') then |
CompressedWord(15 downto 8) <= WAV_data_to_write; |
else |
CompressedWord(7 downto 0) <= WAV_data_to_write; |
CompressedNibbles <= 4; --signal word ready |
end if; |
MSB <= not MSB; |
LoadROM <= '0'; |
end if; |
else --output ADPCM data |
if (WriteState = '1' and FinishBlock = '0') then --block header with state at the beginning and every 256 bytes |
if (WaitADPCM = '1') then |
if (ADPCM_sample_rdy = '1') then WaitADPCM := '0'; end if; |
else |
if (StateRDY = '1') then |
if (WriteStateLSWord = '0') then --write first two bytes of state: PredictedValue |
CompressedWord <= PredictedValue(7 downto 0) & PredictedValue(15 downto 8); --little endian! |
BlockBytes <= 2; |
SamplesCompressed <= SamplesCompressed + 1; |
else --write second two bytes of state: StepIndex & x"00" |
CompressedWord <= '0' & StepIndex & x"00"; |
--WriteState <= '0'; lower it only after Output written |
BlockBytes <= BlockBytes + 2; |
end if; |
WriteStateLSWord <= not WriteStateLSWord; |
CompressedNibbles <= 4; --signal word ready |
end if; |
end if; |
else --data nibbles |
null; --taken care of above |
end if; |
end if; |
end if; |
end if; |
end if; |
else |
CompressedWord <= (others => '0'); |
RDYOutput <= '0'; |
WriteHeader <= '1'; |
FinishBlock <= '0'; |
BlockBytes <= 0; |
CompressedNibbles <= 0; |
EndCompression <= '0'; |
MSB <= '1'; |
LoadROM <= '1'; |
WAV_addr <= (others => '0'); |
SecondsCompressed <= (others => '0'); |
SamplesCompressed <= (others => '0'); |
WriteState <= '0'; |
WriteStateLSWord <= '0'; |
WaitADPCM := '0'; |
end if; |
end if; |
end process; |
|
process (wb_clk_i, wb_rst_i) |
begin |
if (wb_rst_i = '1') then |
SamplesInFile <= (others => '0'); |
elsif (wb_clk_i = '1' and wb_clk_i'event) then |
--comment next lines to save up a lot of resources (multiplier), |
--but then use undefined number of seconds for compression!! |
--(to stop it just write 0 to the MSb of WB reg 0) |
--just be aware that final WAV file will play but at the end, |
--some players will display an error saying something like "Early EOF" or "Corrupted file". |
|
--if (Compressing = '1' and EndCompression = '0') then |
--SamplesInFile <= SamplesPerSec1 * SecondsToCompress2; |
--else |
if (LoadROM = '1') then |
if (WAV_addr = "000000") then --file_size-8=SamplesInFile/2+52 |
--file size calculation is approximate, unless you want to mess up with floats |
--or you have a fixed sampling rate (and want to modify the source code of this process) |
SamplesInFile <= (('0' & SamplesPerSec1(15 downto 1)) * SecondsToCompress2) + x"34"; |
--SamplesInFile <= '0' & (SamplesInFile(31 downto 1) + x"34"); |
elsif (WAV_addr = "011101") then --get raw SamplesInFile |
SamplesInFile <= SamplesPerSec1 * SecondsToCompress2; |
elsif (WAV_addr = "110100") then --file_size-60=SamplesInFile/2 |
SamplesInFile <= '0' & SamplesInFile(31 downto 1); |
end if; |
end if; |
--end if; |
end if; |
end process; |
end Behavioral; |
|
ima_adpcm_encoder/trunk
Property changes :
Added: svn:mergeinfo
## -0,0 +0,0 ##
Index: ima_adpcm_encoder/web_uploads
===================================================================
--- ima_adpcm_encoder/web_uploads (nonexistent)
+++ ima_adpcm_encoder/web_uploads (revision 8)
ima_adpcm_encoder/web_uploads
Property changes :
Added: svn:mergeinfo
## -0,0 +0,0 ##
Index: ima_adpcm_encoder/branches
===================================================================
--- ima_adpcm_encoder/branches (nonexistent)
+++ ima_adpcm_encoder/branches (revision 8)
ima_adpcm_encoder/branches
Property changes :
Added: svn:mergeinfo
## -0,0 +0,0 ##
Index: ima_adpcm_encoder/tags
===================================================================
--- ima_adpcm_encoder/tags (nonexistent)
+++ ima_adpcm_encoder/tags (revision 8)
ima_adpcm_encoder/tags
Property changes :
Added: svn:mergeinfo
## -0,0 +0,0 ##