maki/openairinterface5g
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

moving EMOS to extras

Browse Source 
git-svn-id: http://svn.eurecom.fr/openair4G/trunk@7222 818b1a75-f10b-46b9-bf7c-635c3b92a50f
This commit is contained in:
Florian Kaltenberger
2015-04-21 12:06:50 +00:00
parent 8119385a6a
commit 7fe41b0827
315 changed files with 0 additions and 56347 deletions
Download Patch File Download Diff File Expand all files Collapse all files
openair1/EMOS/DOC/measurement_manual.tex
-105
View File
@@ -1,105 +0,0 @@
\documentclass[10pt,a4paper]{article}
%\usepackage{epsfig,amsmath,amsfonts,url,subfigure,verbatim}
\begin{document}
\author{Florian Kaltenberger (\texttt{florian.kaltenberger@eurecom.fr})}
\title{EMOS Multiuser Measurement Manual}
\maketitle
\section{EMOS Multiuser Measurement Manual}
\subsection{Checklist}
Each user should have the following equipment
\begin{itemize}
\item Laptop
\item Power supply
\item Car power adaptor
\item GPS
\item CBMIMO1 Card (Availiable cards: 2, 6, 7, 11. Card 10 has a bad frequency response and card 12 crashes after some time)
\item 2 Batteries
\item Antennas
\item This Manual
\item Route and Time
\item Walkie Talkie
\end{itemize}
\subsection{Startup}
\begin{itemize}
\item Login using the name written on the laptop (password {\tt linux})
\item Power up the CBMIMO1 card, connect the antennas to the two outer connectors on the card, and insert it in the card slot
\item Connect the USB GPS receiver
\item Open a terminal window and change directory:\\
{\tt cd EMOS/emos\_gui}
\item Load the kernel module as root:\\
{\tt sudo make install\_cbmimo1\_softmodem\_emos}\\
(provide password {\tt linux} if asked)\\
The leds on the card should now be ``moving''
\item Start the GPS daemon as root:\\
{\tt sudo gpsd -f /dev/ttyUSB0} (provide password {\tt linux} if asked)
\item Start the GUI:\\
{\tt cd src}\\
{\tt ./emos\_gui -n4}
%Start with {\tt ./emos\_gui -nx}, where {\tt x} is the number of base station antennas.
\end{itemize}
\subsection{Operation}
\begin{itemize}
\item Turn on the GUI by clicking the ``PWR'' button.
\item Make sure, there are no error messages.
\item If the terminal can synchronize to the base station, the displays should turn on and the two rightmost leds on the card should stay on.
\item Bring the GUI into multiuser mode by pressing the ``terminal mode'' button.
\item Make sure you set the terminal number to the number indicated on your laptop.
\item Now you are ready to turn on the recorder by pressing ``record''. The terminal now waits for the base station to signal the recording flag. Upon receiving the flag, the terminal will record the estimated channel. When the recording flag goes off, the data is stored to file, the file index is increased, and the terminal goes into standby again.
\end{itemize}
\subsection{Troubleshooting}
\paragraph{Card does not synchronize}
Most probably you are in an area with no or too little signal.
\begin{itemize}
\item Make sure you stay on the measurement routes.
\item Make sure the antennas are connected correctly.
\item Check for other error messages on the GUI.
\end{itemize}
\paragraph{Channel displays do not refresh}
Most probably the card has crashed or there is a problem with the fifo.
\begin{itemize}
\item Stop recording and exit the GUI
\item Remove the kernel module:\\
{\tt cd ~/EMOS/emos\_gui}\\
{\tt sudo make remove\_cbmimo1\_emos}
\item Remove the card and the power
\item Load the kernel module as described above
\item Restart the GUI
\end{itemize}
\paragraph{No GPS data availiable}
\begin{itemize}
\item Make sure the GPS is connected correctly and that it can see the satelites (led on GPS constantly on)
\item Have you started the GPS daemon {\tt gpsd -f /dev/ttyUSB0}
\item Restart the GUI
\end{itemize}
\paragraph{GUI does not record or records permanently}
\begin{itemize}
\item Make sure you are in multiuser mode and you turned on record
\item Make sure there is enough disk space
\item Make sure that the record path (``config'' button) is set to ~/EMOS/data/
\end{itemize}
\paragraph{Computer freezes}
\begin{itemize}
\item Reboot
\end{itemize}
\end{document}
openair1/EMOS/DUMP/COPYING
-674
View File
@@ -1,674 +0,0 @@
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>.
openair1/EMOS/DUMP/Makefile
-37
View File
@@ -1,37 +0,0 @@
SRC = emos_dump.c dump_size.c
OBJ = emos_dump.o dump_size.o
CFLAGS += $(shell rtai-config --lxrt-cflags)
LDFLAGS = $(shell rtai-config --lxrt-ldflags) -lpthread -llxrt -lm -lgps -lforms
CFLAGS += -m32 -I$(OPENAIR1_DIR) -I$(OPENAIR2_DIR)/RRC/LITE/MESSAGES
CFLAGS += -DPHYSIM -DNODE_RG -DUSER_MODE -DPC_TARGET -DPC_DSP -DNB_ANTENNAS_RX=2 -DNB_ANTENNAS_TXRX=2 -DNB_ANTENNAS_TX=2 -DPHY_CONTEXT=1
CFLAGS += -DOPENAIR_LTE -DENABLE_FXP -DOPENAIR1 #-DDLSCH_THREAD -DULSCH_THREAD
CFLAGS += -DEMOS -DEXMIMO
all: emos_dump dump_size
$(OBJ): %.o : %.c
@echo Compiling $< ...
@$(CC) -c $(CFLAGS) -o $@ $<
emos_dump: emos_dump.c
$(CC) $(CFLAGS) $(LDFLAGS) emos_dump.c -o emos_dump
dump_size: dump_size.c
$(CC) $(CFLAGS) $(LDFLAGS) dump_size.c -o dump_size
clean:
rm -rf emos_dump dump_size
rm -rf $(OBJ)
show:
@echo $(CFLAGS)
@echo $(OBJ)
beautiful:
astyle --style=gnu -s2 $(SRC)
openair1/EMOS/DUMP/dump_size.c
-45
View File
@@ -1,45 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
#include "gps.h"
#include "SCHED/phy_procedures_emos.h"
int main(void)
{
printf("MAX_CQI_BITS = %d;\n",MAX_CQI_BITS);
printf("PHY_measurements_size = %d;\n",sizeof(PHY_MEASUREMENTS));
printf("PHY_measurements_eNb_size = %d;\n",sizeof(PHY_MEASUREMENTS_eNB));
//printf("UCI_data_t_size = %d;\n",sizeof(UCI_DATA_t));
//printf("DCI_alloc_t_size = %d;\n",sizeof(DCI_ALLOC_t));
printf("eNb_UE_stats_size = %d;\n",sizeof(LTE_eNB_UE_stats));
printf("fifo_dump_emos_UE_size = %d;\n",sizeof(fifo_dump_emos_UE));
printf("fifo_dump_emos_eNb_size = %d;\n",sizeof(fifo_dump_emos_eNB));
printf("gps_fix_t_size = %d\n",sizeof(struct gps_fix_t));
return(0);
}
openair1/EMOS/DUMP/emos_dump.c
-228
View File
@@ -1,228 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
/*! \file emod_dump.c
* \brief reads data from a fifo and dumps it to disk
* \author F. Kaltenberger, Leonardo Cardoso
* \date 2012
* \version 0.2
* \company Eurecom
* \email: florian.kaltenberger@eurecom.fr
* \note
* \warning
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <unistd.h>
#include <errno.h>
#include <math.h>
#include <time.h>
#include <gps.h>
#include <forms.h>
#include "SCHED/phy_procedures_emos.h"
#include "emos_dump.h"
int end=0;
static void endme(int dummy)
{
printf("SIGINT received\n");
end=1;
}
/*
#define TIMESTAMP_SIZE 8
#define PDU_ERRORS_SIZE 4
#define RX_RSSI_SIZE 2
#define COMPLEX16_SIZE 4
#define NO_OF_OFDM_CARRIERS 256
#define CHANNEL_BUFFER_SIZE (NB_ANTENNAS*COMPLEX16_SIZE*NO_OF_OFDM_CARRIERS+TIMESTAMP_SIZE+PDU_ERRORS_SIZE+RX_RSSI_SIZE) //in bytes
*/
#define NO_ESTIMATES_DISK 100 //No. of estimates that are aquired before dumped to disk
int main (int argc, char **argv)
{
char c, eNB_flag=0;
char *fifo2file_buffer, *fifo2file_ptr;
int fifo, counter=0, bytes;
FILE *dumpfile_id;
char dumpfile_name[1024];
time_t starttime_tmp;
struct tm starttime;
int channel_buffer_size;
time_t timer;
struct tm *now;
struct gps_data_t *gps_data = NULL;
struct gps_fix_t dummy_gps_data;
while ((c = getopt (argc, argv, "he")) != -1) {
switch (c) {
case 'e':
eNB_flag=1;
break;
case 'h':
printf("EMOS FIFO to file dump.\n");
printf("Usage: %s -h(elp) -e(NB) (default=ue)\n",argv[0]);
exit(0);
default:
break;
}
}
timer = time(NULL);
now = localtime(&timer);
memset(&dummy_gps_data,1,sizeof(struct gps_fix_t));
gps_data = gps_open("127.0.0.1","2947");
if (gps_data == NULL) {
printf("Could not open GPS\n");
//exit(-1);
}
#if GPSD_API_MAJOR_VERSION>=4
else if (gps_stream(gps_data, WATCH_ENABLE,NULL) != 0)
#else
else if (gps_query(gps_data, "w+x") != 0)
#endif
{
//sprintf(tmptxt,"Error sending command to GPS, gps_data = %x", gps_data);
printf("Error sending command to GPS\n");
//exit(-1);
}
if (eNB_flag==1)
channel_buffer_size = sizeof(fifo_dump_emos_eNB);
else
channel_buffer_size = sizeof(fifo_dump_emos_UE);
// allocate memory for NO_FRAMES_DISK channes estimations
fifo2file_buffer = malloc(NO_ESTIMATES_DISK*channel_buffer_size);
fifo2file_ptr = fifo2file_buffer;
if (fifo2file_buffer == NULL) {
printf("Cound not allocate memory for fifo2file_buffer\n");
exit(EXIT_FAILURE);
}
if ((fifo = open(CHANSOUNDER_FIFO_DEV, O_RDONLY)) < 0) {
fprintf(stderr, "Error opening the fifo\n");
exit(EXIT_FAILURE);
}
time(&starttime_tmp);
localtime_r(&starttime_tmp,&starttime);
snprintf(dumpfile_name,1024,"%s_data_%d%02d%02d_%02d%02d%02d.EMOS",
(eNB_flag==1) ? "eNB" : "UE",
1900+starttime.tm_year, starttime.tm_mon+1, starttime.tm_mday, starttime.tm_hour, starttime.tm_min, starttime.tm_sec);
dumpfile_id = fopen(dumpfile_name,"w");
if (dumpfile_id == NULL) {
fprintf(stderr, "Error opening dumpfile\n");
exit(EXIT_FAILURE);
}
signal(SIGINT, endme);
printf("starting dump, channel_buffer_size=%d ...\n",channel_buffer_size);
while (!end) {
bytes = rtf_read_all_at_once(fifo, fifo2file_ptr, channel_buffer_size);
/*
if (eNB_flag==1)
printf("eNB: count %d, frame %d, read: %d bytes from the fifo\n",counter, ((fifo_dump_emos_eNB*)fifo2file_ptr)->frame_tx,bytes);
else
printf("UE: count %d, frame %d, read: %d bytes from the fifo\n",counter, ((fifo_dump_emos_UE*)fifo2file_ptr)->frame_rx,bytes);
*/
fifo2file_ptr += channel_buffer_size;
counter ++;
if (counter == NO_ESTIMATES_DISK) {
//reset stuff
fifo2file_ptr = fifo2file_buffer;
counter = 0;
//flush buffer to disk
if (eNB_flag==1)
printf("eNB: count %d, frame %d, flushing buffer to disk\n",
counter, ((fifo_dump_emos_eNB*)fifo2file_ptr)->frame_tx);
else
printf("UE: count %d, frame %d, flushing buffer to disk\n",
counter, ((fifo_dump_emos_UE*)fifo2file_ptr)->frame_rx);
if (fwrite(fifo2file_buffer, sizeof(char), NO_ESTIMATES_DISK*channel_buffer_size, dumpfile_id) != NO_ESTIMATES_DISK*channel_buffer_size) {
fprintf(stderr, "Error writing to dumpfile\n");
exit(EXIT_FAILURE);
}
if (gps_data) {
if (gps_poll(gps_data) != 0) {
printf("problem polling data from gps\n");
} else {
printf("lat %g, lon %g\n",gps_data->fix.latitude,gps_data->fix.longitude);
}
if (fwrite(&(gps_data->fix), sizeof(char), sizeof(struct gps_fix_t), dumpfile_id) != sizeof(struct gps_fix_t)) {
printf("Error writing to dumpfile, stopping recording\n");
exit(EXIT_FAILURE);
}
} else {
printf("WARNING: No GPS data available, storing dummy packet\n");
if (fwrite(&(dummy_gps_data), sizeof(char), sizeof(struct gps_fix_t), dumpfile_id) != sizeof(struct gps_fix_t)) {
printf("Error writing to dumpfile, stopping recording\n");
exit(EXIT_FAILURE);
}
}
}
}
free(fifo2file_buffer);
fclose(dumpfile_id);
close(fifo);
return 0;
}
openair1/EMOS/DUMP/emos_dump.h
-29
View File
@@ -1,29 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
#define CHANSOUNDER_FIFO_DEV "/dev/rtf3"
openair1/EMOS/GPS/COPYING
-674
View File
@@ -1,674 +0,0 @@
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>.
openair1/EMOS/GPS/Makefile
-5
View File
@@ -1,5 +0,0 @@
gps_trace: gps.c
gcc gps.c -Wall -g -I/usr/include/X11 -lgps -lforms -o gps_trace
read_iw: read_iw.c
gcc read_iw.c -Wall -g -o read_iw
openair1/EMOS/GPS/gps.c
-140
View File
@@ -1,140 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <gps.h>
#include <forms.h>
struct gps_data_t *gps_data = NULL;
struct gps_fix_t dummy_gps_data;
FILE *dumpfile_id = NULL;
void gps_data_callback(int gps_fd, void* data)
{
//char tmptxt[1024];
time_t timer;
struct tm *now;
timer = time(NULL);
//printf("GPS timer called\n");
if (gps_data) {
if (gps_poll(gps_data) != 0) {
//sprintf(tmptxt,"Error polling data from GPS, gps_data = %x", gps_data);
printf("Error polling data from GPS\n");
} else
now = localtime(&timer);
printf("%04d%02d%02d%02d%02d%02d,%g,%g\n",
now->tm_year+1900,now->tm_mon+1,now->tm_mday,now->tm_hour, now->tm_min, now->tm_sec,
//asctime(localtime(&timer)),
gps_data->fix.latitude,gps_data->fix.longitude);
}
//fl_set_timer(ob, 0.05);
//write GPS
if (gps_data) {
if (fwrite(&(gps_data->fix), sizeof(char), sizeof(struct gps_fix_t), dumpfile_id) != sizeof(struct gps_fix_t)) {
printf("Error writing to dumpfile, stopping recording\n");
}
} else {
printf("WARNING: No GPS data available, storing dummy packet\n");
if (fwrite(&(dummy_gps_data), sizeof(char), sizeof(struct gps_fix_t), dumpfile_id) != sizeof(struct gps_fix_t)) {
printf("Error writing to dumpfile, stopping recording\n");
}
}
}
void stop_gps(int sig)
{
// stop gps
if (gps_data)
fl_remove_io_callback(gps_data->gps_fd, FL_READ , &gps_data_callback);
// close the GPS
if (gps_data)
gps_close(gps_data);
fclose(dumpfile_id);
dumpfile_id = NULL;
fl_finish();
exit(0);
}
int main(int argc, char *argv[])
{
time_t timer;
char log_filename[256], date_str[128];
struct tm *now;
timer = time(NULL);
now = localtime(&timer);
// open GPS
gps_data = gps_open("127.0.0.1","2947");
if (gps_data == NULL) {
printf("Could not open GPS\n");
exit(-1);
} else if (gps_stream(gps_data, WATCH_ENABLE,NULL) != 0) {
//sprintf(tmptxt,"Error sending command to GPS, gps_data = %x", gps_data);
printf("Error sending command to GPS\n");
exit(-1);
}
strftime(date_str, 128, "%Y%m%d_%H%M%S", now);
sprintf(log_filename,"gps_trace_%s.log", date_str);
dumpfile_id = fopen(log_filename,"w");
if (dumpfile_id == NULL) {
printf("Error opening dumpfile\n");
exit(-1);
}
signal(SIGINT, stop_gps);
fl_initialize(&argc, argv, "GPS Tracer", 0, 0);
if (gps_data)
fl_add_io_callback(gps_data->gps_fd, FL_READ, &gps_data_callback, NULL);
fl_do_forms();
exit(0);
}
openair1/EMOS/GPS/load_gps_trace.m
-85
View File
@@ -1,85 +0,0 @@
function [gps_data, NFrames] = load_gps_trace(filename, NFrames_max, decimation)
%
% EMOS GPS trace import filter
%
% [gps_data, NFrames] =
% load_estimates_lte(filename, NFrames_max)
%
% Parameters:
% filename - filename(s) of the EMOS data file
% NFrames_max - Maximum number of estimates. Leave it blank to get up to the
% maximum file contents
% decimation - read every 'decimation' frame
%
% Returns:
% gps_data - A structure array containing gps data
% NFrames - the number of read estimates
% Author: Florian Kaltenberger
% Copyright: Eurecom Sophia Antipolis
% Version History
% Date Version Comment
% 20120123 0.1 Created based on load_estimates
if nargin < 3
decimation = 1;
end
if nargin < 2
NFrames_max = Inf;
end
gps_data_struct = struct(...
'timestamp', double(0),...
'mode', int32(0),...
'ept',double(0),...
'latitude',double(0),...
'longitude',double(0),...
'eph',double(0),...
'altitude',double(0),...
'epv',double(0),...
'track',double(0),...
'epd',double(0),...
'speed',double(0),...
'eps',double(0),...
'climb',double(0),...
'epc',double(0));
gps_data_struct_a = cstruct(gps_data_struct,[],4);
gps_fix_t_size = gps_data_struct_a.size;
% Estimate the size of the file for a pre-allocation of memory
if ~iscell(filename)
filename = {filename};
end
NFiles = length(filename);
NFrames_file = zeros(1,NFiles);
for n=1:NFiles
if ~exist(filename{n},'file')
error('File does not exist!')
end
info_file = dir(filename{n});
NFrames_file(n) = floor(info_file.bytes/gps_fix_t_size);
if (mod(info_file.bytes,gps_fix_t_size) ~= 0)
warning('File size not a multiple of buffer size. File might be corrupt.');
end
end
NFrames = min(sum(NFrames_file), NFrames_max);
gps_data = repmat(gps_data_struct,1,NFrames);
l = 1;
for n=1:NFiles
fid = fopen(filename{n},'r');
while (~feof(fid) && (l <= min(sum(NFrames_file(1:n)),NFrames_max)))
%read GPS data
gps_data(l) = binread(fid,gps_data_struct,1,4,'l');
l=l+1;
end
fclose(fid);
end
openair1/EMOS/GPS/read_iw.c
-186
View File
@@ -1,186 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
int main(int argc, char *argv[])
{
FILE *file_id = NULL;
struct iw_struct {
char wday[8];
char mon[8];
int day;
int hour;
int min;
int sec;
int year;
char addr[32];
char dev[32];
int inactive_time;
int rx_bytes;
int rx_packets;
int tx_bytes;
int tx_packets;
int tx_retries;
int tx_failed;
int signal;
int signal_ctl0;
int signal_ctl1;
float tx_bitrate;
int tx_mcs;
int tx_bw;
char tx_gi1[32];
char tx_gi2[32];
float rx_bitrate;
int rx_mcs;
int rx_bw;
char rx_gi1[32];
char rx_gi2[32];
} iw_field;
char line[256];
int i;
if (argc < 2) {
printf("Program requires an argument (filename)\n");
return(-1);
}
file_id = fopen(argv[1],"r");
if (file_id == NULL) {
printf("Error opening file %s\n", argv[1]);
return(-1);
}
i=0;
while (~feof(file_id)) {
fgets(line, 256, file_id);
if (feof(file_id))
break;
sscanf(line,"%s %s %d %d:%d:%d GMT %d",
iw_field.wday,
iw_field.mon,
&iw_field.day,
&iw_field.hour,
&iw_field.min,
&iw_field.sec,
&iw_field.year);
fgets(line, 256, file_id);
sscanf(line,"Station %s (on %s",
iw_field.addr,
iw_field.dev);
fgets(line, 256, file_id);
sscanf(line," inactive time: %d ms",
&iw_field.inactive_time);
fgets(line, 256, file_id);
sscanf(line," rx bytes: %d",
&iw_field.rx_bytes);
fgets(line, 256, file_id);
sscanf(line," rx packets: %d",
&iw_field.rx_packets);
fgets(line, 256, file_id);
sscanf(line," tx bytes: %d",
&iw_field.tx_bytes);
fgets(line, 256, file_id);
sscanf(line," tx packets: %d",
&iw_field.tx_packets);
fgets(line, 256, file_id);
sscanf(line," tx retries: %d",
&iw_field.tx_retries);
fgets(line, 256, file_id);
sscanf(line," tx failed: %d",
&iw_field.tx_failed);
fgets(line, 256, file_id);
sscanf(line," signal: %d dBm",
&iw_field.signal);
fgets(line, 256, file_id);
sscanf(line," signal_ctl0: %d dBm",
&iw_field.signal_ctl0);
fgets(line, 256, file_id);
sscanf(line," signal_ctl1: %d dBm",
&iw_field.signal_ctl1);
fgets(line, 256, file_id);
sscanf(line," tx bitrate: %e MBit/s MCS %d %dMhz %s %s",
&iw_field.tx_bitrate,
&iw_field.tx_mcs,
&iw_field.tx_bw,
iw_field.tx_gi1,
iw_field.tx_gi2);
fgets(line, 256, file_id);
sscanf(line," rx bitrate: %e MBit/s MCS %d %dMhz %s %s",
&iw_field.rx_bitrate,
&iw_field.rx_mcs,
&iw_field.rx_bw,
iw_field.rx_gi1,
iw_field.rx_gi2);
//printf("read set %d, time %d:%d:%d\n",i,iw_field.hour,iw_field.min,iw_field.sec);
if (i==0) {
printf("num, date; inactive_time; rx_bytes; rx_packets; tx_bytes; tx_packets; tx_retries; tx_failed; signal; signal0; signal1; tx_bitrate; tx_mcs; rx_bitrate; rx_mcs\n");
}
printf("%d; %d-%s-%d %d:%d:%d; %d; %d; %d; %d; %d; %d; %d; %d; %d; %d; %e; %d; %e; %d\n",
i,
iw_field.day,
iw_field.mon,
iw_field.year,
iw_field.hour,
iw_field.min,
iw_field.sec,
iw_field.inactive_time,
iw_field.rx_bytes,
iw_field.rx_packets,
iw_field.tx_bytes,
iw_field.tx_packets,
iw_field.tx_retries,
iw_field.tx_failed,
iw_field.signal,
iw_field.signal_ctl0,
iw_field.signal_ctl1,
iw_field.tx_bitrate,
iw_field.tx_mcs,
iw_field.rx_bitrate,
iw_field.rx_mcs);
i=i+1;
}
fclose(file_id);
return (0);
}
openair1/EMOS/GUI/AUTHORS
-1
View File
@@ -1 +0,0 @@
Leonardo Cardoso <sampaio@eurecom.fr>
openair1/EMOS/GUI/COPYING
-674
View File
@@ -1,674 +0,0 @@
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>.
openair1/EMOS/GUI/ChangeLog
View File
openair1/EMOS/GUI/Doxyfile
-275
View File
@@ -1,275 +0,0 @@
# Doxyfile 1.4.1-KDevelop
#---------------------------------------------------------------------------
# Project related configuration options
#---------------------------------------------------------------------------
PROJECT_NAME = emos_gui.kdevelop
PROJECT_NUMBER = 0.1
OUTPUT_DIRECTORY =
CREATE_SUBDIRS = NO
OUTPUT_LANGUAGE = English
USE_WINDOWS_ENCODING = NO
BRIEF_MEMBER_DESC = YES
REPEAT_BRIEF = YES
ABBREVIATE_BRIEF = "The $name class" \
"The $name widget" \
"The $name file" \
is \
provides \
specifies \
contains \
represents \
a \
an \
the
ALWAYS_DETAILED_SEC = NO
INLINE_INHERITED_MEMB = NO
FULL_PATH_NAMES = YES
STRIP_FROM_PATH = /homes/cardoso/Devel/openairinterface/emos_dump/
STRIP_FROM_INC_PATH =
SHORT_NAMES = NO
JAVADOC_AUTOBRIEF = NO
MULTILINE_CPP_IS_BRIEF = NO
DETAILS_AT_TOP = NO
INHERIT_DOCS = YES
DISTRIBUTE_GROUP_DOC = NO
TAB_SIZE = 8
ALIASES =
OPTIMIZE_OUTPUT_FOR_C = NO
OPTIMIZE_OUTPUT_JAVA = NO
SUBGROUPING = YES
#---------------------------------------------------------------------------
# Build related configuration options
#---------------------------------------------------------------------------
EXTRACT_ALL = NO
EXTRACT_PRIVATE = NO
EXTRACT_STATIC = NO
EXTRACT_LOCAL_CLASSES = YES
EXTRACT_LOCAL_METHODS = NO
HIDE_UNDOC_MEMBERS = NO
HIDE_UNDOC_CLASSES = NO
HIDE_FRIEND_COMPOUNDS = NO
HIDE_IN_BODY_DOCS = NO
INTERNAL_DOCS = NO
CASE_SENSE_NAMES = YES
HIDE_SCOPE_NAMES = NO
SHOW_INCLUDE_FILES = YES
INLINE_INFO = YES
SORT_MEMBER_DOCS = YES
SORT_BRIEF_DOCS = NO
SORT_BY_SCOPE_NAME = NO
GENERATE_TODOLIST = YES
GENERATE_TESTLIST = YES
GENERATE_BUGLIST = YES
GENERATE_DEPRECATEDLIST= YES
ENABLED_SECTIONS =
MAX_INITIALIZER_LINES = 30
SHOW_USED_FILES = YES
SHOW_DIRECTORIES = YES
FILE_VERSION_FILTER =
#---------------------------------------------------------------------------
# configuration options related to warning and progress messages
#---------------------------------------------------------------------------
QUIET = NO
WARNINGS = YES
WARN_IF_UNDOCUMENTED = YES
WARN_IF_DOC_ERROR = YES
WARN_NO_PARAMDOC = NO
WARN_FORMAT = "$file:$line: $text"
WARN_LOGFILE =
#---------------------------------------------------------------------------
# configuration options related to the input files
#---------------------------------------------------------------------------
INPUT = /homes/cardoso/Devel/openairinterface/emos_ofdm/emos_gui
FILE_PATTERNS = *.c \
*.cc \
*.cxx \
*.cpp \
*.c++ \
*.java \
*.ii \
*.ixx \
*.ipp \
*.i++ \
*.inl \
*.h \
*.hh \
*.hxx \
*.hpp \
*.h++ \
*.idl \
*.odl \
*.cs \
*.php \
*.php3 \
*.inc \
*.m \
*.mm \
*.dox \
*.C \
*.CC \
*.C++ \
*.II \
*.I++ \
*.H \
*.HH \
*.H++ \
*.CS \
*.PHP \
*.PHP3 \
*.M \
*.MM \
*.C \
*.H \
*.tlh \
*.diff \
*.patch \
*.moc \
*.xpm \
*.dox
RECURSIVE = yes
EXCLUDE =
EXCLUDE_SYMLINKS = NO
EXCLUDE_PATTERNS =
EXAMPLE_PATH =
EXAMPLE_PATTERNS = *
EXAMPLE_RECURSIVE = NO
IMAGE_PATH =
INPUT_FILTER =
FILTER_PATTERNS =
FILTER_SOURCE_FILES = NO
#---------------------------------------------------------------------------
# configuration options related to source browsing
#---------------------------------------------------------------------------
SOURCE_BROWSER = NO
INLINE_SOURCES = NO
STRIP_CODE_COMMENTS = YES
REFERENCED_BY_RELATION = YES
REFERENCES_RELATION = YES
VERBATIM_HEADERS = YES
#---------------------------------------------------------------------------
# configuration options related to the alphabetical class index
#---------------------------------------------------------------------------
ALPHABETICAL_INDEX = NO
COLS_IN_ALPHA_INDEX = 5
IGNORE_PREFIX =
#---------------------------------------------------------------------------
# configuration options related to the HTML output
#---------------------------------------------------------------------------
GENERATE_HTML = YES
HTML_OUTPUT = html
HTML_FILE_EXTENSION = .html
HTML_HEADER =
HTML_FOOTER =
HTML_STYLESHEET =
HTML_ALIGN_MEMBERS = YES
GENERATE_HTMLHELP = NO
CHM_FILE =
HHC_LOCATION =
GENERATE_CHI = NO
BINARY_TOC = NO
TOC_EXPAND = NO
DISABLE_INDEX = NO
ENUM_VALUES_PER_LINE = 4
GENERATE_TREEVIEW = NO
TREEVIEW_WIDTH = 250
#---------------------------------------------------------------------------
# configuration options related to the LaTeX output
#---------------------------------------------------------------------------
GENERATE_LATEX = YES
LATEX_OUTPUT = latex
LATEX_CMD_NAME = latex
MAKEINDEX_CMD_NAME = makeindex
COMPACT_LATEX = NO
PAPER_TYPE = a4wide
EXTRA_PACKAGES =
LATEX_HEADER =
PDF_HYPERLINKS = NO
USE_PDFLATEX = NO
LATEX_BATCHMODE = NO
LATEX_HIDE_INDICES = NO
#---------------------------------------------------------------------------
# configuration options related to the RTF output
#---------------------------------------------------------------------------
GENERATE_RTF = NO
RTF_OUTPUT = rtf
COMPACT_RTF = NO
RTF_HYPERLINKS = NO
RTF_STYLESHEET_FILE =
RTF_EXTENSIONS_FILE =
#---------------------------------------------------------------------------
# configuration options related to the man page output
#---------------------------------------------------------------------------
GENERATE_MAN = NO
MAN_OUTPUT = man
MAN_EXTENSION = .3
MAN_LINKS = NO
#---------------------------------------------------------------------------
# configuration options related to the XML output
#---------------------------------------------------------------------------
GENERATE_XML = yes
XML_OUTPUT = xml
XML_SCHEMA =
XML_DTD =
XML_PROGRAMLISTING = YES
#---------------------------------------------------------------------------
# configuration options for the AutoGen Definitions output
#---------------------------------------------------------------------------
GENERATE_AUTOGEN_DEF = NO
#---------------------------------------------------------------------------
# configuration options related to the Perl module output
#---------------------------------------------------------------------------
GENERATE_PERLMOD = NO
PERLMOD_LATEX = NO
PERLMOD_PRETTY = YES
PERLMOD_MAKEVAR_PREFIX =
#---------------------------------------------------------------------------
# Configuration options related to the preprocessor
#---------------------------------------------------------------------------
ENABLE_PREPROCESSING = YES
MACRO_EXPANSION = NO
EXPAND_ONLY_PREDEF = NO
SEARCH_INCLUDES = YES
INCLUDE_PATH =
INCLUDE_FILE_PATTERNS =
PREDEFINED =
EXPAND_AS_DEFINED =
SKIP_FUNCTION_MACROS = YES
#---------------------------------------------------------------------------
# Configuration::additions related to external references
#---------------------------------------------------------------------------
TAGFILES =
GENERATE_TAGFILE = emos_gui.tag
ALLEXTERNALS = NO
EXTERNAL_GROUPS = YES
PERL_PATH = /usr/bin/perl
#---------------------------------------------------------------------------
# Configuration options related to the dot tool
#---------------------------------------------------------------------------
CLASS_DIAGRAMS = YES
HIDE_UNDOC_RELATIONS = YES
HAVE_DOT = NO
CLASS_GRAPH = YES
COLLABORATION_GRAPH = YES
GROUP_GRAPHS = YES
UML_LOOK = NO
TEMPLATE_RELATIONS = NO
INCLUDE_GRAPH = YES
INCLUDED_BY_GRAPH = YES
CALL_GRAPH = NO
GRAPHICAL_HIERARCHY = YES
DIRECTORY_GRAPH = YES
DOT_IMAGE_FORMAT = png
DOT_PATH =
DOTFILE_DIRS =
MAX_DOT_GRAPH_WIDTH = 1024
MAX_DOT_GRAPH_HEIGHT = 1024
MAX_DOT_GRAPH_DEPTH = 1000
DOT_TRANSPARENT = NO
DOT_MULTI_TARGETS = NO
GENERATE_LEGEND = YES
DOT_CLEANUP = YES
#---------------------------------------------------------------------------
# Configuration::additions related to the search engine
#---------------------------------------------------------------------------
SEARCHENGINE = NO
openair1/EMOS/GUI/INSTALL
-167
View File
@@ -1,167 +0,0 @@
Basic Installation
==================
These are generic installation instructions.
The `configure' shell script attempts to guess correct values for
various system-dependent variables used during compilation. It uses
those values to create a `Makefile' in each directory of the package.
It may also create one or more `.h' files containing system-dependent
definitions. Finally, it creates a shell script `config.status' that
you can run in the future to recreate the current configuration, a file
`config.cache' that saves the results of its tests to speed up
reconfiguring, and a file `config.log' containing compiler output
(useful mainly for debugging `configure').
If you need to do unusual things to compile the package, please try
to figure out how `configure' could check whether to do them, and mail
diffs or instructions to the address given in the `README' so they can
be considered for the next release. If at some point `config.cache'
contains results you don't want to keep, you may remove or edit it.
The file `configure.in' is used to create `configure' by a program
called `autoconf'. You only need `configure.in' if you want to change
it or regenerate `configure' using a newer version of `autoconf'.
The simplest way to compile this package is:
1. `cd' to the directory containing the package's source code and type
`./configure' to configure the package for your system. If you're
using `csh' on an old version of System V, you might need to type
`sh ./configure' instead to prevent `csh' from trying to execute
`configure' itself.
Running `configure' takes a while. While running, it prints some
messages telling which features it is checking for.
2. Type `make' to compile the package.
3. Type `make install' to install the programs and any data files and
documentation.
4. You can remove the program binaries and object files from the
source code directory by typing `make clean'.
Compilers and Options
=====================
Some systems require unusual options for compilation or linking that
the `configure' script does not know about. You can give `configure'
initial values for variables by setting them in the environment. Using
a Bourne-compatible shell, you can do that on the command line like
this:
CC=c89 CFLAGS=-O2 LIBS=-lposix ./configure
Or on systems that have the `env' program, you can do it like this:
env CPPFLAGS=-I/usr/local/include LDFLAGS=-s ./configure
Compiling For Multiple Architectures
====================================
You can compile the package for more than one kind of computer at the
same time, by placing the object files for each architecture in their
own directory. To do this, you must use a version of `make' that
supports the `VPATH' variable, such as GNU `make'. `cd' to the
directory where you want the object files and executables to go and run
the `configure' script. `configure' automatically checks for the
source code in the directory that `configure' is in and in `..'.
If you have to use a `make' that does not supports the `VPATH'
variable, you have to compile the package for one architecture at a time
in the source code directory. After you have installed the package for
one architecture, use `make distclean' before reconfiguring for another
architecture.
Installation Names
==================
By default, `make install' will install the package's files in
`/usr/local/bin', `/usr/local/man', etc. You can specify an
installation prefix other than `/usr/local' by giving `configure' the
option `--prefix=PATH'.
You can specify separate installation prefixes for
architecture-specific files and architecture-independent files. If you
give `configure' the option `--exec-prefix=PATH', the package will use
PATH as the prefix for installing programs and libraries.
Documentation and other data files will still use the regular prefix.
If the package supports it, you can cause programs to be installed
with an extra prefix or suffix on their names by giving `configure' the
option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
Optional Features
=================
Some packages pay attention to `--enable-FEATURE' options to
`configure', where FEATURE indicates an optional part of the package.
They may also pay attention to `--with-PACKAGE' options, where PACKAGE
is something like `gnu-as' or `x' (for the X Window System). The
`README' should mention any `--enable-' and `--with-' options that the
package recognizes.
For packages that use the X Window System, `configure' can usually
find the X include and library files automatically, but if it doesn't,
you can use the `configure' options `--x-includes=DIR' and
`--x-libraries=DIR' to specify their locations.
Specifying the System Type
==========================
There may be some features `configure' can not figure out
automatically, but needs to determine by the type of host the package
will run on. Usually `configure' can figure that out, but if it prints
a message saying it can not guess the host type, give it the
`--host=TYPE' option. TYPE can either be a short name for the system
type, such as `sun4', or a canonical name with three fields:
CPU-COMPANY-SYSTEM
See the file `config.sub' for the possible values of each field. If
`config.sub' isn't included in this package, then this package doesn't
need to know the host type.
If you are building compiler tools for cross-compiling, you can also
use the `--target=TYPE' option to select the type of system they will
produce code for and the `--build=TYPE' option to select the type of
system on which you are compiling the package.
Sharing Defaults
================
If you want to set default values for `configure' scripts to share,
you can create a site shell script called `config.site' that gives
default values for variables like `CC', `cache_file', and `prefix'.
`configure' looks for `PREFIX/share/config.site' if it exists, then
`PREFIX/etc/config.site' if it exists. Or, you can set the
`CONFIG_SITE' environment variable to the location of the site script.
A warning: not all `configure' scripts look for a site script.
Operation Controls
==================
`configure' recognizes the following options to control how it
operates.
`--cache-file=FILE'
Use and save the results of the tests in FILE instead of
`./config.cache'. Set FILE to `/dev/null' to disable caching, for
debugging `configure'.
`--help'
Print a summary of the options to `configure', and exit.
`--quiet'
`--silent'
`-q'
Do not print messages saying which checks are being made.
`--srcdir=DIR'
Look for the package's source code in directory DIR. Usually
`configure' can determine that directory automatically.
`--version'
Print the version of Autoconf used to generate the `configure'
script, and exit.
`configure' also accepts some other, not widely useful, options.
openair1/EMOS/GUI/Makefile.am
-23
View File
@@ -1,23 +0,0 @@
# not a GNU package. You can remove this line, if
# have all needed files, that a GNU package needs
AUTOMAKE_OPTIONS = foreign 1.4
SUBDIRS = src
install_cbmimo1_softmodem_emos:
make fifos
insmod device_driver/openair_rf_softmodem_emos.ko ;
remove_cbmimo1_emos:
rmmod openair_rf
fifos:
@for i in `seq 0 64`;\
do \
have_rtfX=`ls /dev/ |grep -c rtf$$i`;\
if test "$$have_rtfX" == 0 ;then \
mknod -m 666 /dev/rtf$$i c 150 $$i; \
fi;\
done
openair1/EMOS/GUI/Makefile.cvs
-8
View File
@@ -1,8 +0,0 @@
default: all
all:
aclocal
autoheader
automake
autoconf
openair1/EMOS/GUI/Makefile.in
-595
View File
@@ -1,595 +0,0 @@
# Makefile.in generated by automake 1.9.6 from Makefile.am.
# @configure_input@
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
# 2003, 2004, 2005 Free Software Foundation, Inc.
# This Makefile.in is free software; the Free Software Foundation
# gives unlimited permission to copy and/or distribute it,
# with or without modifications, as long as this notice is preserved.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
# PARTICULAR PURPOSE.
@SET_MAKE@
srcdir = @srcdir@
top_srcdir = @top_srcdir@
VPATH = @srcdir@
pkgdatadir = $(datadir)/@PACKAGE@
pkglibdir = $(libdir)/@PACKAGE@
pkgincludedir = $(includedir)/@PACKAGE@
top_builddir = .
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
INSTALL = @INSTALL@
install_sh_DATA = $(install_sh) -c -m 644
install_sh_PROGRAM = $(install_sh) -c
install_sh_SCRIPT = $(install_sh) -c
INSTALL_HEADER = $(INSTALL_DATA)
transform = $(program_transform_name)
NORMAL_INSTALL = :
PRE_INSTALL = :
POST_INSTALL = :
NORMAL_UNINSTALL = :
PRE_UNINSTALL = :
POST_UNINSTALL = :
subdir = .
DIST_COMMON = README $(am__configure_deps) $(srcdir)/Makefile.am \
$(srcdir)/Makefile.in $(srcdir)/config.h.in \
$(top_srcdir)/configure AUTHORS COPYING ChangeLog INSTALL NEWS \
TODO config.guess config.sub depcomp install-sh ltmain.sh \
missing mkinstalldirs
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
am__aclocal_m4_deps = $(top_srcdir)/configure.in
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
$(ACLOCAL_M4)
am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
configure.lineno configure.status.lineno
mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
CONFIG_HEADER = config.h
CONFIG_CLEAN_FILES =
SOURCES =
DIST_SOURCES =
RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
html-recursive info-recursive install-data-recursive \
install-exec-recursive install-info-recursive \
install-recursive installcheck-recursive installdirs-recursive \
pdf-recursive ps-recursive uninstall-info-recursive \
uninstall-recursive
ETAGS = etags
CTAGS = ctags
DIST_SUBDIRS = $(SUBDIRS)
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
distdir = $(PACKAGE)-$(VERSION)
top_distdir = $(distdir)
am__remove_distdir = \
{ test ! -d $(distdir) \
|| { find $(distdir) -type d ! -perm -200 -exec chmod u+w {} ';' \
&& rm -fr $(distdir); }; }
DIST_ARCHIVES = $(distdir).tar.gz
GZIP_ENV = --best
distuninstallcheck_listfiles = find . -type f -print
distcleancheck_listfiles = find . -type f -print
ACLOCAL = @ACLOCAL@
AMDEP_FALSE = @AMDEP_FALSE@
AMDEP_TRUE = @AMDEP_TRUE@
AMTAR = @AMTAR@
AUTOCONF = @AUTOCONF@
AUTOHEADER = @AUTOHEADER@
AUTOMAKE = @AUTOMAKE@
AWK = @AWK@
CC = @CC@
CCDEPMODE = @CCDEPMODE@
CFLAGS = @CFLAGS@
CPPFLAGS = @CPPFLAGS@
CYGPATH_W = @CYGPATH_W@
DEFS = @DEFS@
DEPDIR = @DEPDIR@
ECHO_C = @ECHO_C@
ECHO_N = @ECHO_N@
ECHO_T = @ECHO_T@
EXEEXT = @EXEEXT@
INSTALL_DATA = @INSTALL_DATA@
INSTALL_PROGRAM = @INSTALL_PROGRAM@
INSTALL_SCRIPT = @INSTALL_SCRIPT@
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
LDFLAGS = @LDFLAGS@
LIBOBJS = @LIBOBJS@
LIBS = @LIBS@
LTLIBOBJS = @LTLIBOBJS@
MAKEINFO = @MAKEINFO@
OBJEXT = @OBJEXT@
PACKAGE = @PACKAGE@
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
PACKAGE_NAME = @PACKAGE_NAME@
PACKAGE_STRING = @PACKAGE_STRING@
PACKAGE_TARNAME = @PACKAGE_TARNAME@
PACKAGE_VERSION = @PACKAGE_VERSION@
PATH_SEPARATOR = @PATH_SEPARATOR@
SET_MAKE = @SET_MAKE@
SHELL = @SHELL@
STRIP = @STRIP@
VERSION = @VERSION@
ac_ct_CC = @ac_ct_CC@
am__fastdepCC_FALSE = @am__fastdepCC_FALSE@
am__fastdepCC_TRUE = @am__fastdepCC_TRUE@
am__include = @am__include@
am__leading_dot = @am__leading_dot@
am__quote = @am__quote@
am__tar = @am__tar@
am__untar = @am__untar@
bindir = @bindir@
build_alias = @build_alias@
datadir = @datadir@
datarootdir = @datarootdir@
docdir = @docdir@
dvidir = @dvidir@
exec_prefix = @exec_prefix@
host_alias = @host_alias@
htmldir = @htmldir@
includedir = @includedir@
infodir = @infodir@
install_sh = @install_sh@
libdir = @libdir@
libexecdir = @libexecdir@
localedir = @localedir@
localstatedir = @localstatedir@
mandir = @mandir@
mkdir_p = @mkdir_p@
oldincludedir = @oldincludedir@
pdfdir = @pdfdir@
prefix = @prefix@
program_transform_name = @program_transform_name@
psdir = @psdir@
sbindir = @sbindir@
sharedstatedir = @sharedstatedir@
sysconfdir = @sysconfdir@
target_alias = @target_alias@
# not a GNU package. You can remove this line, if
# have all needed files, that a GNU package needs
AUTOMAKE_OPTIONS = foreign 1.4
SUBDIRS = src
all: config.h
$(MAKE) $(AM_MAKEFLAGS) all-recursive
.SUFFIXES:
am--refresh:
@:
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
@for dep in $?; do \
case '$(am__configure_deps)' in \
*$$dep*) \
echo ' cd $(srcdir) && $(AUTOMAKE) --foreign '; \
cd $(srcdir) && $(AUTOMAKE) --foreign \
&& exit 0; \
exit 1;; \
esac; \
done; \
echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \
cd $(top_srcdir) && \
$(AUTOMAKE) --foreign Makefile
.PRECIOUS: Makefile
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
@case '$?' in \
*config.status*) \
echo ' $(SHELL) ./config.status'; \
$(SHELL) ./config.status;; \
*) \
echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
esac;
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
$(SHELL) ./config.status --recheck
$(top_srcdir)/configure: $(am__configure_deps)
cd $(srcdir) && $(AUTOCONF)
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
cd $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
config.h: stamp-h1
@if test ! -f $@; then \
rm -f stamp-h1; \
$(MAKE) stamp-h1; \
else :; fi
stamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status
@rm -f stamp-h1
cd $(top_builddir) && $(SHELL) ./config.status config.h
$(srcdir)/config.h.in: $(am__configure_deps)
cd $(top_srcdir) && $(AUTOHEADER)
rm -f stamp-h1
touch $@
distclean-hdr:
-rm -f config.h stamp-h1
uninstall-info-am:
# This directory's subdirectories are mostly independent; you can cd
# into them and run `make' without going through this Makefile.
# To change the values of `make' variables: instead of editing Makefiles,
# (1) if the variable is set in `config.status', edit `config.status'
# (which will cause the Makefiles to be regenerated when you run `make');
# (2) otherwise, pass the desired values on the `make' command line.
$(RECURSIVE_TARGETS):
@failcom='exit 1'; \
for f in x $$MAKEFLAGS; do \
case $$f in \
*=* | --[!k]*);; \
*k*) failcom='fail=yes';; \
esac; \
done; \
dot_seen=no; \
target=`echo $@ | sed s/-recursive//`; \
list='$(SUBDIRS)'; for subdir in $$list; do \
echo "Making $$target in $$subdir"; \
if test "$$subdir" = "."; then \
dot_seen=yes; \
local_target="$$target-am"; \
else \
local_target="$$target"; \
fi; \
(cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
|| eval $$failcom; \
done; \
if test "$$dot_seen" = "no"; then \
$(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
fi; test -z "$$fail"
mostlyclean-recursive clean-recursive distclean-recursive \
maintainer-clean-recursive:
@failcom='exit 1'; \
for f in x $$MAKEFLAGS; do \
case $$f in \
*=* | --[!k]*);; \
*k*) failcom='fail=yes';; \
esac; \
done; \
dot_seen=no; \
case "$@" in \
distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
*) list='$(SUBDIRS)' ;; \
esac; \
rev=''; for subdir in $$list; do \
if test "$$subdir" = "."; then :; else \
rev="$$subdir $$rev"; \
fi; \
done; \
rev="$$rev ."; \
target=`echo $@ | sed s/-recursive//`; \
for subdir in $$rev; do \
echo "Making $$target in $$subdir"; \
if test "$$subdir" = "."; then \
local_target="$$target-am"; \
else \
local_target="$$target"; \
fi; \
(cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
|| eval $$failcom; \
done && test -z "$$fail"
tags-recursive:
list='$(SUBDIRS)'; for subdir in $$list; do \
test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
done
ctags-recursive:
list='$(SUBDIRS)'; for subdir in $$list; do \
test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
done
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) ' { files[$$0] = 1; } \
END { for (i in files) print i; }'`; \
mkid -fID $$unique
tags: TAGS
TAGS: tags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
tags=; \
here=`pwd`; \
if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \
include_option=--etags-include; \
empty_fix=.; \
else \
include_option=--include; \
empty_fix=; \
fi; \
list='$(SUBDIRS)'; for subdir in $$list; do \
if test "$$subdir" = .; then :; else \
test ! -f $$subdir/TAGS || \
tags="$$tags $$include_option=$$here/$$subdir/TAGS"; \
fi; \
done; \
list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) ' { files[$$0] = 1; } \
END { for (i in files) print i; }'`; \
if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \
test -n "$$unique" || unique=$$empty_fix; \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
$$tags $$unique; \
fi
ctags: CTAGS
CTAGS: ctags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
tags=; \
here=`pwd`; \
list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) ' { files[$$0] = 1; } \
END { for (i in files) print i; }'`; \
test -z "$(CTAGS_ARGS)$$tags$$unique" \
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
$$tags $$unique
GTAGS:
here=`$(am__cd) $(top_builddir) && pwd` \
&& cd $(top_srcdir) \
&& gtags -i $(GTAGS_ARGS) $$here
distclean-tags:
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
distdir: $(DISTFILES)
$(am__remove_distdir)
mkdir $(distdir)
@srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \
list='$(DISTFILES)'; for file in $$list; do \
case $$file in \
$(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \
$(top_srcdir)/*) file=`echo "$$file" | sed "s|^$$topsrcdirstrip/|$(top_builddir)/|"`;; \
esac; \
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \
if test "$$dir" != "$$file" && test "$$dir" != "."; then \
dir="/$$dir"; \
$(mkdir_p) "$(distdir)$$dir"; \
else \
dir=''; \
fi; \
if test -d $$d/$$file; then \
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \
fi; \
cp -pR $$d/$$file $(distdir)$$dir || exit 1; \
else \
test -f $(distdir)/$$file \
|| cp -p $$d/$$file $(distdir)/$$file \
|| exit 1; \
fi; \
done
list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
if test "$$subdir" = .; then :; else \
test -d "$(distdir)/$$subdir" \
|| $(mkdir_p) "$(distdir)/$$subdir" \
|| exit 1; \
distdir=`$(am__cd) $(distdir) && pwd`; \
top_distdir=`$(am__cd) $(top_distdir) && pwd`; \
(cd $$subdir && \
$(MAKE) $(AM_MAKEFLAGS) \
top_distdir="$$top_distdir" \
distdir="$$distdir/$$subdir" \
distdir) \
|| exit 1; \
fi; \
done
-find $(distdir) -type d ! -perm -777 -exec chmod a+rwx {} \; -o \
! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
! -type d ! -perm -400 -exec chmod a+r {} \; -o \
! -type d ! -perm -444 -exec $(SHELL) $(install_sh) -c -m a+r {} {} \; \
|| chmod -R a+r $(distdir)
dist-gzip: distdir
tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
$(am__remove_distdir)
dist-bzip2: distdir
tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2
$(am__remove_distdir)
dist-tarZ: distdir
tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
$(am__remove_distdir)
dist-shar: distdir
shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
$(am__remove_distdir)
dist-zip: distdir
-rm -f $(distdir).zip
zip -rq $(distdir).zip $(distdir)
$(am__remove_distdir)
dist dist-all: distdir
tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
$(am__remove_distdir)
# This target untars the dist file and tries a VPATH configuration. Then
# it guarantees that the distribution is self-contained by making another
# tarfile.
distcheck: dist
case '$(DIST_ARCHIVES)' in \
*.tar.gz*) \
GZIP=$(GZIP_ENV) gunzip -c $(distdir).tar.gz | $(am__untar) ;;\
*.tar.bz2*) \
bunzip2 -c $(distdir).tar.bz2 | $(am__untar) ;;\
*.tar.Z*) \
uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
*.shar.gz*) \
GZIP=$(GZIP_ENV) gunzip -c $(distdir).shar.gz | unshar ;;\
*.zip*) \
unzip $(distdir).zip ;;\
esac
chmod -R a-w $(distdir); chmod a+w $(distdir)
mkdir $(distdir)/_build
mkdir $(distdir)/_inst
chmod a-w $(distdir)
dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
&& dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
&& cd $(distdir)/_build \
&& ../configure --srcdir=.. --prefix="$$dc_install_base" \
$(DISTCHECK_CONFIGURE_FLAGS) \
&& $(MAKE) $(AM_MAKEFLAGS) \
&& $(MAKE) $(AM_MAKEFLAGS) dvi \
&& $(MAKE) $(AM_MAKEFLAGS) check \
&& $(MAKE) $(AM_MAKEFLAGS) install \
&& $(MAKE) $(AM_MAKEFLAGS) installcheck \
&& $(MAKE) $(AM_MAKEFLAGS) uninstall \
&& $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
distuninstallcheck \
&& chmod -R a-w "$$dc_install_base" \
&& ({ \
(cd ../.. && umask 077 && mkdir "$$dc_destdir") \
&& $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
&& $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
&& $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
} || { rm -rf "$$dc_destdir"; exit 1; }) \
&& rm -rf "$$dc_destdir" \
&& $(MAKE) $(AM_MAKEFLAGS) dist \
&& rm -rf $(DIST_ARCHIVES) \
&& $(MAKE) $(AM_MAKEFLAGS) distcleancheck
$(am__remove_distdir)
@(echo "$(distdir) archives ready for distribution: "; \
list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
sed -e '1{h;s/./=/g;p;x;}' -e '$${p;x;}'
distuninstallcheck:
@cd $(distuninstallcheck_dir) \
&& test `$(distuninstallcheck_listfiles) | wc -l` -le 1 \
|| { echo "ERROR: files left after uninstall:" ; \
if test -n "$(DESTDIR)"; then \
echo " (check DESTDIR support)"; \
fi ; \
$(distuninstallcheck_listfiles) ; \
exit 1; } >&2
distcleancheck: distclean
@if test '$(srcdir)' = . ; then \
echo "ERROR: distcleancheck can only run from a VPATH build" ; \
exit 1 ; \
fi
@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
|| { echo "ERROR: files left in build directory after distclean:" ; \
$(distcleancheck_listfiles) ; \
exit 1; } >&2
check-am: all-am
check: check-recursive
all-am: Makefile config.h
installdirs: installdirs-recursive
installdirs-am:
install: install-recursive
install-exec: install-exec-recursive
install-data: install-data-recursive
uninstall: uninstall-recursive
install-am: all-am
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
installcheck: installcheck-recursive
install-strip:
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
`test -z '$(STRIP)' || \
echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install
mostlyclean-generic:
clean-generic:
distclean-generic:
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
maintainer-clean-generic:
@echo "This command is intended for maintainers to use"
@echo "it deletes files that may require special tools to rebuild."
clean: clean-recursive
clean-am: clean-generic mostlyclean-am
distclean: distclean-recursive
-rm -f $(am__CONFIG_DISTCLEAN_FILES)
-rm -f Makefile
distclean-am: clean-am distclean-generic distclean-hdr distclean-tags
dvi: dvi-recursive
dvi-am:
html: html-recursive
info: info-recursive
info-am:
install-data-am:
install-exec-am:
install-info: install-info-recursive
install-man:
installcheck-am:
maintainer-clean: maintainer-clean-recursive
-rm -f $(am__CONFIG_DISTCLEAN_FILES)
-rm -rf $(top_srcdir)/autom4te.cache
-rm -f Makefile
maintainer-clean-am: distclean-am maintainer-clean-generic
mostlyclean: mostlyclean-recursive
mostlyclean-am: mostlyclean-generic
pdf: pdf-recursive
pdf-am:
ps: ps-recursive
ps-am:
uninstall-am: uninstall-info-am
uninstall-info: uninstall-info-recursive
.PHONY: $(RECURSIVE_TARGETS) CTAGS GTAGS all all-am am--refresh check \
check-am clean clean-generic clean-recursive ctags \
ctags-recursive dist dist-all dist-bzip2 dist-gzip dist-shar \
dist-tarZ dist-zip distcheck distclean distclean-generic \
distclean-hdr distclean-recursive distclean-tags \
distcleancheck distdir distuninstallcheck dvi dvi-am html \
html-am info info-am install install-am install-data \
install-data-am install-exec install-exec-am install-info \
install-info-am install-man install-strip installcheck \
installcheck-am installdirs installdirs-am maintainer-clean \
maintainer-clean-generic maintainer-clean-recursive \
mostlyclean mostlyclean-generic mostlyclean-recursive pdf \
pdf-am ps ps-am tags tags-recursive uninstall uninstall-am \
uninstall-info-am
install_cbmimo1_softmodem_emos:
make fifos
insmod device_driver/openair_rf_softmodem_emos.ko ;
remove_cbmimo1_emos:
rmmod openair_rf
fifos:
@for i in `seq 0 64`;\
do \
have_rtfX=`ls /dev/ |grep -c rtf$$i`;\
if test "$$have_rtfX" == 0 ;then \
mknod -m 666 /dev/rtf$$i c 150 $$i; \
fi;\
done
# Tell versions [3.59,3.63) of GNU make to not export all variables.
# Otherwise a system limit (for SysV at least) may be exceeded.
.NOEXPORT:
openair1/EMOS/GUI/NEWS
View File
openair1/EMOS/GUI/README
-4
View File
@@ -1,4 +0,0 @@
to compile run
./src/make_links
./configure
make
openair1/EMOS/GUI/TODO
View File
openair1/EMOS/GUI/config.guess
Vendored
-1466
View File
File diff suppressed because it is too large Load Diff
openair1/EMOS/GUI/config.h.in
-55
View File
@@ -1,55 +0,0 @@
/* config.h.in. Generated from configure.in by autoheader. */
/* Define to 1 if you have the <dlfcn.h> header file. */
#undef HAVE_DLFCN_H
/* Define to 1 if you have the <inttypes.h> header file. */
#undef HAVE_INTTYPES_H
/* Define to 1 if you have the <memory.h> header file. */
#undef HAVE_MEMORY_H
/* Define to 1 if you have the <stdint.h> header file. */
#undef HAVE_STDINT_H
/* Define to 1 if you have the <stdlib.h> header file. */
#undef HAVE_STDLIB_H
/* Define to 1 if you have the <strings.h> header file. */
#undef HAVE_STRINGS_H
/* Define to 1 if you have the <string.h> header file. */
#undef HAVE_STRING_H
/* Define to 1 if you have the <sys/stat.h> header file. */
#undef HAVE_SYS_STAT_H
/* Define to 1 if you have the <sys/types.h> header file. */
#undef HAVE_SYS_TYPES_H
/* Define to 1 if you have the <unistd.h> header file. */
#undef HAVE_UNISTD_H
/* Name of package */
#undef PACKAGE
/* Define to the address where bug reports for this package should be sent. */
#undef PACKAGE_BUGREPORT
/* Define to the full name of this package. */
#undef PACKAGE_NAME
/* Define to the full name and version of this package. */
#undef PACKAGE_STRING
/* Define to the one symbol short name of this package. */
#undef PACKAGE_TARNAME
/* Define to the version of this package. */
#undef PACKAGE_VERSION
/* Define to 1 if you have the ANSI C header files. */
#undef STDC_HEADERS
/* Version number of package */
#undef VERSION
openair1/EMOS/GUI/config.sub
Vendored
-1579
View File
File diff suppressed because it is too large Load Diff
openair1/EMOS/GUI/configure
Vendored
-4789
View File
File diff suppressed because it is too large Load Diff
openair1/EMOS/GUI/configure.in
-10
View File
@@ -1,10 +0,0 @@
AC_INIT(configure.in)
AM_CONFIG_HEADER(config.h)
AM_INIT_AUTOMAKE(emos_gui, 0.1)
AC_LANG_C
AC_PROG_CC
AM_PROG_LIBTOOL
AC_OUTPUT(Makefile src/Makefile)
openair1/EMOS/GUI/depcomp
-441
View File
@@ -1,441 +0,0 @@
#! /bin/sh
# depcomp - compile a program generating dependencies as side-effects
# Copyright 1999, 2000 Free Software Foundation, Inc.
# 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 2, 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, write to the Free Software
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
# 02111-1307, USA.
# As a special exception to the GNU General Public License, if you
# distribute this file as part of a program that contains a
# configuration script generated by Autoconf, you may include it under
# the same distribution terms that you use for the rest of that program.
# Originally written by Alexandre Oliva <oliva@dcc.unicamp.br>.
if test -z "$depmode" || test -z "$source" || test -z "$object"; then
echo "depcomp: Variables source, object and depmode must be set" 1>&2
exit 1
fi
# `libtool' can also be set to `yes' or `no'.
depfile=${depfile-`echo "$object" | sed 's,\([^/]*\)$,.deps/\1,;s/\.\([^.]*\)$/.P\1/'`}
tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`}
rm -f "$tmpdepfile"
# Some modes work just like other modes, but use different flags. We
# parameterize here, but still list the modes in the big case below,
# to make depend.m4 easier to write. Note that we *cannot* use a case
# here, because this file can only contain one case statement.
if test "$depmode" = hp; then
# HP compiler uses -M and no extra arg.
gccflag=-M
depmode=gcc
fi
if test "$depmode" = dashXmstdout; then
# This is just like dashmstdout with a different argument.
dashmflag=-xM
depmode=dashmstdout
fi
case "$depmode" in
gcc3)
## gcc 3 implements dependency tracking that does exactly what
## we want. Yay! Note: for some reason libtool 1.4 doesn't like
## it if -MD -MP comes after the -MF stuff. Hmm.
"$@" -MT "$object" -MD -MP -MF "$tmpdepfile"
stat=$?
if test $stat -eq 0; then :
else
rm -f "$tmpdepfile"
exit $stat
fi
mv "$tmpdepfile" "$depfile"
;;
gcc)
## There are various ways to get dependency output from gcc. Here's
## why we pick this rather obscure method:
## - Don't want to use -MD because we'd like the dependencies to end
## up in a subdir. Having to rename by hand is ugly.
## (We might end up doing this anyway to support other compilers.)
## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like
## -MM, not -M (despite what the docs say).
## - Using -M directly means running the compiler twice (even worse
## than renaming).
if test -z "$gccflag"; then
gccflag=-MD,
fi
"$@" -Wp,"$gccflag$tmpdepfile"
stat=$?
if test $stat -eq 0; then :
else
rm -f "$tmpdepfile"
exit $stat
fi
rm -f "$depfile"
echo "$object : \\" > "$depfile"
alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz
## The second -e expression handles DOS-style file names with drive letters.
sed -e 's/^[^:]*: / /' \
-e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile"
## This next piece of magic avoids the `deleted header file' problem.
## The problem is that when a header file which appears in a .P file
## is deleted, the dependency causes make to die (because there is
## typically no way to rebuild the header). We avoid this by adding
## dummy dependencies for each header file. Too bad gcc doesn't do
## this for us directly.
tr ' ' '
' < "$tmpdepfile" |
## Some versions of gcc put a space before the `:'. On the theory
## that the space means something, we add a space to the output as
## well.
## Some versions of the HPUX 10.20 sed can't process this invocation
## correctly. Breaking it into two sed invocations is a workaround.
sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
rm -f "$tmpdepfile"
;;
hp)
# This case exists only to let depend.m4 do its work. It works by
# looking at the text of this script. This case will never be run,
# since it is checked for above.
exit 1
;;
sgi)
if test "$libtool" = yes; then
"$@" "-Wp,-MDupdate,$tmpdepfile"
else
"$@" -MDupdate "$tmpdepfile"
fi
stat=$?
if test $stat -eq 0; then :
else
rm -f "$tmpdepfile"
exit $stat
fi
rm -f "$depfile"
if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files
echo "$object : \\" > "$depfile"
# Clip off the initial element (the dependent). Don't try to be
# clever and replace this with sed code, as IRIX sed won't handle
# lines with more than a fixed number of characters (4096 in
# IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines;
# the IRIX cc adds comments like `#:fec' to the end of the
# dependency line.
tr ' ' '
' < "$tmpdepfile" \
| sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \
tr '
' ' ' >> $depfile
echo >> $depfile
# The second pass generates a dummy entry for each header file.
tr ' ' '
' < "$tmpdepfile" \
| sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \
>> $depfile
else
# The sourcefile does not contain any dependencies, so just
# store a dummy comment line, to avoid errors with the Makefile
# "include basename.Plo" scheme.
echo "#dummy" > "$depfile"
fi
rm -f "$tmpdepfile"
;;
aix)
# The C for AIX Compiler uses -M and outputs the dependencies
# in a .u file. This file always lives in the current directory.
# Also, the AIX compiler puts `$object:' at the start of each line;
# $object doesn't have directory information.
stripped=`echo "$object" | sed -e 's,^.*/,,' -e 's/\(.*\)\..*$/\1/'`
tmpdepfile="$stripped.u"
outname="$stripped.o"
if test "$libtool" = yes; then
"$@" -Wc,-M
else
"$@" -M
fi
stat=$?
if test $stat -eq 0; then :
else
rm -f "$tmpdepfile"
exit $stat
fi
if test -f "$tmpdepfile"; then
# Each line is of the form `foo.o: dependent.h'.
# Do two passes, one to just change these to
# `$object: dependent.h' and one to simply `dependent.h:'.
sed -e "s,^$outname:,$object :," < "$tmpdepfile" > "$depfile"
sed -e "s,^$outname: \(.*\)$,\1:," < "$tmpdepfile" >> "$depfile"
else
# The sourcefile does not contain any dependencies, so just
# store a dummy comment line, to avoid errors with the Makefile
# "include basename.Plo" scheme.
echo "#dummy" > "$depfile"
fi
rm -f "$tmpdepfile"
;;
icc)
# Must come before tru64.
# Intel's C compiler understands `-MD -MF file'. However
# icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c
# will fill foo.d with something like
# foo.o: sub/foo.c
# foo.o: sub/foo.h
# which is wrong. We want:
# sub/foo.o: sub/foo.c
# sub/foo.o: sub/foo.h
# sub/foo.c:
# sub/foo.h:
"$@" -MD -MF "$tmpdepfile"
stat=$?
if test $stat -eq 0; then :
else
rm -f "$tmpdepfile"
exit $stat
fi
rm -f "$depfile"
# Each line is of the form `foo.o: dependent.h'.
# Do two passes, one to just change these to
# `$object: dependent.h' and one to simply `dependent.h:'.
sed -e "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile"
sed -e "s,^[^:]*: \(.*\)$,\1:," < "$tmpdepfile" >> "$depfile"
rm -f "$tmpdepfile"
;;
tru64)
# The Tru64 AIX compiler uses -MD to generate dependencies as a side
# effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'.
# At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put
# dependencies in `foo.d' instead, so we check for that too.
# Subdirectories are respected.
tmpdepfile1="$object.d"
tmpdepfile2=`echo "$object" | sed -e 's/.o$/.d/'`
if test "$libtool" = yes; then
"$@" -Wc,-MD
else
"$@" -MD
fi
stat=$?
if test $stat -eq 0; then :
else
rm -f "$tmpdepfile1" "$tmpdepfile2"
exit $stat
fi
if test -f "$tmpdepfile1"; then
tmpdepfile="$tmpdepfile1"
else
tmpdepfile="$tmpdepfile2"
fi
if test -f "$tmpdepfile"; then
sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile"
# That's a space and a tab in the [].
sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile"
else
echo "#dummy" > "$depfile"
fi
rm -f "$tmpdepfile"
;;
#nosideeffect)
# This comment above is used by automake to tell side-effect
# dependency tracking mechanisms from slower ones.
dashmstdout)
# Important note: in order to support this mode, a compiler *must*
# always write the proprocessed file to stdout, regardless of -o,
# because we must use -o when running libtool.
test -z "$dashmflag" && dashmflag=-M
( IFS=" "
case " $* " in
*" --mode=compile "*) # this is libtool, let us make it quiet
for arg
do # cycle over the arguments
case "$arg" in
"--mode=compile")
# insert --quiet before "--mode=compile"
set fnord "$@" --quiet
shift # fnord
;;
esac
set fnord "$@" "$arg"
shift # fnord
shift # "$arg"
done
;;
esac
"$@" $dashmflag | sed 's:^[^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile"
) &
proc=$!
"$@"
stat=$?
wait "$proc"
if test "$stat" != 0; then exit $stat; fi
rm -f "$depfile"
cat < "$tmpdepfile" > "$depfile"
tr ' ' '
' < "$tmpdepfile" | \
## Some versions of the HPUX 10.20 sed can't process this invocation
## correctly. Breaking it into two sed invocations is a workaround.
sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
rm -f "$tmpdepfile"
;;
dashXmstdout)
# This case only exists to satisfy depend.m4. It is never actually
# run, as this mode is specially recognized in the preamble.
exit 1
;;
makedepend)
# X makedepend
(
shift
cleared=no
for arg in "$@"; do
case $cleared in no)
set ""; shift
cleared=yes
esac
case "$arg" in
-D*|-I*)
set fnord "$@" "$arg"; shift;;
-*)
;;
*)
set fnord "$@" "$arg"; shift;;
esac
done
obj_suffix="`echo $object | sed 's/^.*\././'`"
touch "$tmpdepfile"
${MAKEDEPEND-makedepend} 2>/dev/null -o"$obj_suffix" -f"$tmpdepfile" "$@"
) &
proc=$!
"$@"
stat=$?
wait "$proc"
if test "$stat" != 0; then exit $stat; fi
rm -f "$depfile"
cat < "$tmpdepfile" > "$depfile"
tail +3 "$tmpdepfile" | tr ' ' '
' | \
## Some versions of the HPUX 10.20 sed can't process this invocation
## correctly. Breaking it into two sed invocations is a workaround.
sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
rm -f "$tmpdepfile" "$tmpdepfile".bak
;;
cpp)
# Important note: in order to support this mode, a compiler *must*
# always write the proprocessed file to stdout, regardless of -o,
# because we must use -o when running libtool.
( IFS=" "
case " $* " in
*" --mode=compile "*)
for arg
do # cycle over the arguments
case $arg in
"--mode=compile")
# insert --quiet before "--mode=compile"
set fnord "$@" --quiet
shift # fnord
;;
esac
set fnord "$@" "$arg"
shift # fnord
shift # "$arg"
done
;;
esac
"$@" -E |
sed -n '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' |
sed '$ s: \\$::' > "$tmpdepfile"
) &
proc=$!
"$@"
stat=$?
wait "$proc"
if test "$stat" != 0; then exit $stat; fi
rm -f "$depfile"
echo "$object : \\" > "$depfile"
cat < "$tmpdepfile" >> "$depfile"
sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile"
rm -f "$tmpdepfile"
;;
msvisualcpp)
# Important note: in order to support this mode, a compiler *must*
# always write the proprocessed file to stdout, regardless of -o,
# because we must use -o when running libtool.
( IFS=" "
case " $* " in
*" --mode=compile "*)
for arg
do # cycle over the arguments
case $arg in
"--mode=compile")
# insert --quiet before "--mode=compile"
set fnord "$@" --quiet
shift # fnord
;;
esac
set fnord "$@" "$arg"
shift # fnord
shift # "$arg"
done
;;
esac
"$@" -E |
sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::echo "`cygpath -u \\"\1\\"`":p' | sort | uniq > "$tmpdepfile"
) &
proc=$!
"$@"
stat=$?
wait "$proc"
if test "$stat" != 0; then exit $stat; fi
rm -f "$depfile"
echo "$object : \\" > "$depfile"
. "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile"
echo " " >> "$depfile"
. "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s::\1\::p' >> "$depfile"
rm -f "$tmpdepfile"
;;
none)
exec "$@"
;;
*)
echo "Unknown depmode $depmode" 1>&2
exit 1
;;
esac
exit 0
openair1/EMOS/GUI/emos_gui.kdevelop
-240
View File
@@ -1,240 +0,0 @@
<?xml version = '1.0'?>
<kdevelop>
<general>
<author>Leonardo Cardoso</author>
<email>sampaio@eurecom.fr</email>
<version>0.1</version>
<projectmanagement>KDevAutoProject</projectmanagement>
<primarylanguage>C</primarylanguage>
<keywords>
<keyword>C</keyword>
<keyword>Code</keyword>
</keywords>
<ignoreparts/>
<projectdirectory>.</projectdirectory>
<absoluteprojectpath>false</absoluteprojectpath>
<description/>
</general>
<kdevautoproject>
<general>
<activetarget>src/emos_gui</activetarget>
<useconfiguration>default</useconfiguration>
</general>
<run>
<mainprogram>src/emos_gui</mainprogram>
<terminal>true</terminal>
<directoryradio>executable</directoryradio>
<customdirectory>/</customdirectory>
<programargs>-n 4</programargs>
<autocompile>true</autocompile>
<envvars/>
<runarguments>
<emos_gui/>
</runarguments>
</run>
<configurations>
<optimized>
<builddir>optimized</builddir>
<ccompiler>kdevgccoptions</ccompiler>
<cxxcompiler>kdevgppoptions</cxxcompiler>
<f77compiler>kdevg77options</f77compiler>
<cflags>-O2 -g0 </cflags>
<envvars/>
<configargs/>
<topsourcedir/>
<cppflags/>
<ldflags>-lforms</ldflags>
<ccompilerbinary/>
<cxxcompilerbinary/>
<f77compilerbinary/>
<cxxflags/>
<f77flags/>
</optimized>
<debug>
<configargs>--enable-debug=full</configargs>
<builddir>debug</builddir>
<ccompiler>kdevgccoptions</ccompiler>
<cxxcompiler>kdevgppoptions</cxxcompiler>
<f77compiler>kdevg77options</f77compiler>
<cflags>-O0 -g3 </cflags>
<envvars/>
<topsourcedir/>
<cppflags/>
<ldflags/>
<ccompilerbinary/>
<cxxcompilerbinary/>
<f77compilerbinary/>
<cxxflags/>
<f77flags/>
</debug>
<default>
<envvars/>
<configargs/>
<builddir/>
<topsourcedir/>
<cppflags/>
<ldflags/>
<ccompiler>kdevgccoptions</ccompiler>
<cxxcompiler>kdevgppoptions</cxxcompiler>
<f77compiler>kdevg77options</f77compiler>
<ccompilerbinary/>
<cxxcompilerbinary/>
<f77compilerbinary/>
<cflags/>
<cxxflags/>
<f77flags/>
</default>
</configurations>
<make>
<envvars>
<envvar value="1" name="WANT_AUTOCONF_2_5" />
<envvar value="1" name="WANT_AUTOMAKE_1_6" />
</envvars>
<abortonerror>true</abortonerror>
<runmultiplejobs>false</runmultiplejobs>
<numberofjobs>1</numberofjobs>
<dontact>false</dontact>
<makebin/>
<prio>0</prio>
</make>
</kdevautoproject>
<kdevdoctreeview>
<ignoretocs>
<toc>ada</toc>
<toc>ada_bugs_gcc</toc>
<toc>bash</toc>
<toc>bash_bugs</toc>
<toc>clanlib</toc>
<toc>w3c-dom-level2-html</toc>
<toc>fortran_bugs_gcc</toc>
<toc>gnome1</toc>
<toc>gnustep</toc>
<toc>gtk</toc>
<toc>gtk_bugs</toc>
<toc>haskell</toc>
<toc>haskell_bugs_ghc</toc>
<toc>java_bugs_gcc</toc>
<toc>java_bugs_sun</toc>
<toc>kde2book</toc>
<toc>libstdc++</toc>
<toc>opengl</toc>
<toc>pascal_bugs_fp</toc>
<toc>php</toc>
<toc>php_bugs</toc>
<toc>perl</toc>
<toc>perl_bugs</toc>
<toc>python</toc>
<toc>python_bugs</toc>
<toc>qt-kdev3</toc>
<toc>ruby</toc>
<toc>ruby_bugs</toc>
<toc>sdl</toc>
<toc>stl</toc>
<toc>w3c-svg</toc>
<toc>sw</toc>
<toc>w3c-uaag10</toc>
<toc>wxwidgets_bugs</toc>
</ignoretocs>
<ignoreqt_xml>
<toc>Guide to the Qt Translation Tools</toc>
<toc>Qt Assistant Manual</toc>
<toc>Qt Designer Manual</toc>
<toc>Qt Reference Documentation</toc>
<toc>qmake User Guide</toc>
</ignoreqt_xml>
<ignoredoxygen>
<toc>KDE Libraries (Doxygen)</toc>
</ignoredoxygen>
</kdevdoctreeview>
<kdevfilecreate>
<useglobaltypes>
<type ext="c" />
<type ext="h" />
</useglobaltypes>
</kdevfilecreate>
<kdevfileview>
<groups>
<group pattern="*.h" name="Header files" />
<group pattern="*.c" name="Source files" />
<hidenonprojectfiles>false</hidenonprojectfiles>
<hidenonlocation>false</hidenonlocation>
</groups>
<tree>
<hidepatterns>*.o,*.lo,CVS</hidepatterns>
<hidenonprojectfiles>false</hidenonprojectfiles>
</tree>
</kdevfileview>
<kdevdocumentation>
<projectdoc>
<docsystem>Doxygen Documentation Collection</docsystem>
<docurl>emos_gui.tag</docurl>
</projectdoc>
</kdevdocumentation>
<substmap>
<APPNAME>emos_gui</APPNAME>
<APPNAMELC>emos_gui</APPNAMELC>
<APPNAMESC>Emos_gui</APPNAMESC>
<APPNAMEUC>EMOS_GUI</APPNAMEUC>
<AUTHOR>Leonardo Cardoso</AUTHOR>
<CFLAGS/>
<EMAIL>sampaio@eurecom.fr</EMAIL>
<LICENSE>Custom</LICENSE>
<OPT_INCS>-I/usr/include</OPT_INCS>
<OPT_LIBS>-lm</OPT_LIBS>
<VERSION>0.1</VERSION>
<YEAR>2007</YEAR>
<dest>/homes/cardoso/Devel/openairinterface/emos_ofdm/emos_gui</dest>
</substmap>
<cppsupportpart>
<filetemplates>
<interfacesuffix>.h</interfacesuffix>
<implementationsuffix>.cpp</implementationsuffix>
</filetemplates>
</cppsupportpart>
<kdevcppsupport>
<qt>
<used>false</used>
<version>3</version>
<root/>
</qt>
<codecompletion>
<includeGlobalFunctions>true</includeGlobalFunctions>
<includeTypes>true</includeTypes>
<includeEnums>true</includeEnums>
<includeTypedefs>false</includeTypedefs>
<automaticCodeCompletion>true</automaticCodeCompletion>
<automaticArgumentsHint>true</automaticArgumentsHint>
<automaticHeaderCompletion>true</automaticHeaderCompletion>
<codeCompletionDelay>250</codeCompletionDelay>
<argumentsHintDelay>400</argumentsHintDelay>
<headerCompletionDelay>250</headerCompletionDelay>
</codecompletion>
<creategettersetter>
<prefixGet/>
<prefixSet>set</prefixSet>
<prefixVariable>m_,_</prefixVariable>
<parameterName>theValue</parameterName>
<inlineGet>true</inlineGet>
<inlineSet>true</inlineSet>
</creategettersetter>
<references/>
</kdevcppsupport>
<kdevdebugger>
<general>
<programargs>-n 4</programargs>
<gdbpath/>
<dbgshell>libtool</dbgshell>
<configGdbScript/>
<runShellScript/>
<runGdbScript/>
<breakonloadinglibs>true</breakonloadinglibs>
<separatetty>true</separatetty>
<floatingtoolbar>false</floatingtoolbar>
</general>
<display>
<staticmembers>false</staticmembers>
<demanglenames>true</demanglenames>
<outputradix>10</outputradix>
</display>
</kdevdebugger>
</kdevelop>
openair1/EMOS/GUI/install-sh
-276
View File
@@ -1,276 +0,0 @@
#!/bin/sh
#
# install - install a program, script, or datafile
# This comes from X11R5 (mit/util/scripts/install.sh).
#
# Copyright 1991 by the Massachusetts Institute of Technology
#
# Permission to use, copy, modify, distribute, and sell this software and its
# documentation for any purpose is hereby granted without fee, provided that
# the above copyright notice appear in all copies and that both that
# copyright notice and this permission notice appear in supporting
# documentation, and that the name of M.I.T. not be used in advertising or
# publicity pertaining to distribution of the software without specific,
# written prior permission. M.I.T. makes no representations about the
# suitability of this software for any purpose. It is provided "as is"
# without express or implied warranty.
#
# Calling this script install-sh is preferred over install.sh, to prevent
# `make' implicit rules from creating a file called install from it
# when there is no Makefile.
#
# This script is compatible with the BSD install script, but was written
# from scratch. It can only install one file at a time, a restriction
# shared with many OS's install programs.
# set DOITPROG to echo to test this script
# Don't use :- since 4.3BSD and earlier shells don't like it.
doit="${DOITPROG-}"
# put in absolute paths if you don't have them in your path; or use env. vars.
mvprog="${MVPROG-mv}"
cpprog="${CPPROG-cp}"
chmodprog="${CHMODPROG-chmod}"
chownprog="${CHOWNPROG-chown}"
chgrpprog="${CHGRPPROG-chgrp}"
stripprog="${STRIPPROG-strip}"
rmprog="${RMPROG-rm}"
mkdirprog="${MKDIRPROG-mkdir}"
transformbasename=""
transform_arg=""
instcmd="$mvprog"
chmodcmd="$chmodprog 0755"
chowncmd=""
chgrpcmd=""
stripcmd=""
rmcmd="$rmprog -f"
mvcmd="$mvprog"
src=""
dst=""
dir_arg=""
while [ x"$1" != x ]; do
case $1 in
-c) instcmd=$cpprog
shift
continue;;
-d) dir_arg=true
shift
continue;;
-m) chmodcmd="$chmodprog $2"
shift
shift
continue;;
-o) chowncmd="$chownprog $2"
shift
shift
continue;;
-g) chgrpcmd="$chgrpprog $2"
shift
shift
continue;;
-s) stripcmd=$stripprog
shift
continue;;
-t=*) transformarg=`echo $1 | sed 's/-t=//'`
shift
continue;;
-b=*) transformbasename=`echo $1 | sed 's/-b=//'`
shift
continue;;
*) if [ x"$src" = x ]
then
src=$1
else
# this colon is to work around a 386BSD /bin/sh bug
:
dst=$1
fi
shift
continue;;
esac
done
if [ x"$src" = x ]
then
echo "$0: no input file specified" >&2
exit 1
else
:
fi
if [ x"$dir_arg" != x ]; then
dst=$src
src=""
if [ -d "$dst" ]; then
instcmd=:
chmodcmd=""
else
instcmd=$mkdirprog
fi
else
# Waiting for this to be detected by the "$instcmd $src $dsttmp" command
# might cause directories to be created, which would be especially bad
# if $src (and thus $dsttmp) contains '*'.
if [ -f "$src" ] || [ -d "$src" ]
then
:
else
echo "$0: $src does not exist" >&2
exit 1
fi
if [ x"$dst" = x ]
then
echo "$0: no destination specified" >&2
exit 1
else
:
fi
# If destination is a directory, append the input filename; if your system
# does not like double slashes in filenames, you may need to add some logic
if [ -d "$dst" ]
then
dst=$dst/`basename "$src"`
else
:
fi
fi
## this sed command emulates the dirname command
dstdir=`echo "$dst" | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'`
# Make sure that the destination directory exists.
# this part is taken from Noah Friedman's mkinstalldirs script
# Skip lots of stat calls in the usual case.
if [ ! -d "$dstdir" ]; then
defaultIFS='
'
IFS="${IFS-$defaultIFS}"
oIFS=$IFS
# Some sh's can't handle IFS=/ for some reason.
IFS='%'
set - `echo "$dstdir" | sed -e 's@/@%@g' -e 's@^%@/@'`
IFS=$oIFS
pathcomp=''
while [ $# -ne 0 ] ; do
pathcomp=$pathcomp$1
shift
if [ ! -d "$pathcomp" ] ;
then
$mkdirprog "$pathcomp"
else
:
fi
pathcomp=$pathcomp/
done
fi
if [ x"$dir_arg" != x ]
then
$doit $instcmd "$dst" &&
if [ x"$chowncmd" != x ]; then $doit $chowncmd "$dst"; else : ; fi &&
if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd "$dst"; else : ; fi &&
if [ x"$stripcmd" != x ]; then $doit $stripcmd "$dst"; else : ; fi &&
if [ x"$chmodcmd" != x ]; then $doit $chmodcmd "$dst"; else : ; fi
else
# If we're going to rename the final executable, determine the name now.
if [ x"$transformarg" = x ]
then
dstfile=`basename "$dst"`
else
dstfile=`basename "$dst" $transformbasename |
sed $transformarg`$transformbasename
fi
# don't allow the sed command to completely eliminate the filename
if [ x"$dstfile" = x ]
then
dstfile=`basename "$dst"`
else
:
fi
# Make a couple of temp file names in the proper directory.
dsttmp=$dstdir/#inst.$$#
rmtmp=$dstdir/#rm.$$#
# Trap to clean up temp files at exit.
trap 'status=$?; rm -f "$dsttmp" "$rmtmp" && exit $status' 0
trap '(exit $?); exit' 1 2 13 15
# Move or copy the file name to the temp name
$doit $instcmd "$src" "$dsttmp" &&
# and set any options; do chmod last to preserve setuid bits
# If any of these fail, we abort the whole thing. If we want to
# ignore errors from any of these, just make sure not to ignore
# errors from the above "$doit $instcmd $src $dsttmp" command.
if [ x"$chowncmd" != x ]; then $doit $chowncmd "$dsttmp"; else :;fi &&
if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd "$dsttmp"; else :;fi &&
if [ x"$stripcmd" != x ]; then $doit $stripcmd "$dsttmp"; else :;fi &&
if [ x"$chmodcmd" != x ]; then $doit $chmodcmd "$dsttmp"; else :;fi &&
# Now remove or move aside any old file at destination location. We try this
# two ways since rm can't unlink itself on some systems and the destination
# file might be busy for other reasons. In this case, the final cleanup
# might fail but the new file should still install successfully.
{
if [ -f "$dstdir/$dstfile" ]
then
$doit $rmcmd -f "$dstdir/$dstfile" 2>/dev/null ||
$doit $mvcmd -f "$dstdir/$dstfile" "$rmtmp" 2>/dev/null ||
{
echo "$0: cannot unlink or rename $dstdir/$dstfile" >&2
(exit 1); exit
}
else
:
fi
} &&
# Now rename the file to the real destination.
$doit $mvcmd "$dsttmp" "$dstdir/$dstfile"
fi &&
# The final little trick to "correctly" pass the exit status to the exit trap.
{
(exit 0); exit
}
openair1/EMOS/GUI/ltmain.sh
-6343
View File
File diff suppressed because it is too large Load Diff
openair1/EMOS/GUI/missing
-336
View File
@@ -1,336 +0,0 @@
#! /bin/sh
# Common stub for a few missing GNU programs while installing.
# Copyright (C) 1996, 1997, 1999, 2000, 2002 Free Software Foundation, Inc.
# Originally by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996.
# 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 2, 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, write to the Free Software
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
# 02111-1307, USA.
# As a special exception to the GNU General Public License, if you
# distribute this file as part of a program that contains a
# configuration script generated by Autoconf, you may include it under
# the same distribution terms that you use for the rest of that program.
if test $# -eq 0; then
echo 1>&2 "Try \`$0 --help' for more information"
exit 1
fi
run=:
# In the cases where this matters, `missing' is being run in the
# srcdir already.
if test -f configure.ac; then
configure_ac=configure.ac
else
configure_ac=configure.in
fi
case "$1" in
--run)
# Try to run requested program, and just exit if it succeeds.
run=
shift
"$@" && exit 0
;;
esac
# If it does not exist, or fails to run (possibly an outdated version),
# try to emulate it.
case "$1" in
-h|--h|--he|--hel|--help)
echo "\
$0 [OPTION]... PROGRAM [ARGUMENT]...
Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an
error status if there is no known handling for PROGRAM.
Options:
-h, --help display this help and exit
-v, --version output version information and exit
--run try to run the given command, and emulate it if it fails
Supported PROGRAM values:
aclocal touch file \`aclocal.m4'
autoconf touch file \`configure'
autoheader touch file \`config.h.in'
automake touch all \`Makefile.in' files
bison create \`y.tab.[ch]', if possible, from existing .[ch]
flex create \`lex.yy.c', if possible, from existing .c
help2man touch the output file
lex create \`lex.yy.c', if possible, from existing .c
makeinfo touch the output file
tar try tar, gnutar, gtar, then tar without non-portable flags
yacc create \`y.tab.[ch]', if possible, from existing .[ch]"
;;
-v|--v|--ve|--ver|--vers|--versi|--versio|--version)
echo "missing 0.4 - GNU automake"
;;
-*)
echo 1>&2 "$0: Unknown \`$1' option"
echo 1>&2 "Try \`$0 --help' for more information"
exit 1
;;
aclocal*)
if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
# We have it, but it failed.
exit 1
fi
echo 1>&2 "\
WARNING: \`$1' is missing on your system. You should only need it if
you modified \`acinclude.m4' or \`${configure_ac}'. You might want
to install the \`Automake' and \`Perl' packages. Grab them from
any GNU archive site."
touch aclocal.m4
;;
autoconf)
if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
# We have it, but it failed.
exit 1
fi
echo 1>&2 "\
WARNING: \`$1' is missing on your system. You should only need it if
you modified \`${configure_ac}'. You might want to install the
\`Autoconf' and \`GNU m4' packages. Grab them from any GNU
archive site."
touch configure
;;
autoheader)
if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
# We have it, but it failed.
exit 1
fi
echo 1>&2 "\
WARNING: \`$1' is missing on your system. You should only need it if
you modified \`acconfig.h' or \`${configure_ac}'. You might want
to install the \`Autoconf' and \`GNU m4' packages. Grab them
from any GNU archive site."
files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}`
test -z "$files" && files="config.h"
touch_files=
for f in $files; do
case "$f" in
*:*) touch_files="$touch_files "`echo "$f" |
sed -e 's/^[^:]*://' -e 's/:.*//'`;;
*) touch_files="$touch_files $f.in";;
esac
done
touch $touch_files
;;
automake*)
if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
# We have it, but it failed.
exit 1
fi
echo 1>&2 "\
WARNING: \`$1' is missing on your system. You should only need it if
you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'.
You might want to install the \`Automake' and \`Perl' packages.
Grab them from any GNU archive site."
find . -type f -name Makefile.am -print |
sed 's/\.am$/.in/' |
while read f; do touch "$f"; done
;;
autom4te)
if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
# We have it, but it failed.
exit 1
fi
echo 1>&2 "\
WARNING: \`$1' is needed, and you do not seem to have it handy on your
system. You might have modified some files without having the
proper tools for further handling them.
You can get \`$1Help2man' as part of \`Autoconf' from any GNU
archive site."
file=`echo "$*" | sed -n 's/.*--output[ =]*\([^ ]*\).*/\1/p'`
test -z "$file" && file=`echo "$*" | sed -n 's/.*-o[ ]*\([^ ]*\).*/\1/p'`
if test -f "$file"; then
touch $file
else
test -z "$file" || exec >$file
echo "#! /bin/sh"
echo "# Created by GNU Automake missing as a replacement of"
echo "# $ $@"
echo "exit 0"
chmod +x $file
exit 1
fi
;;
bison|yacc)
echo 1>&2 "\
WARNING: \`$1' is missing on your system. You should only need it if
you modified a \`.y' file. You may need the \`Bison' package
in order for those modifications to take effect. You can get
\`Bison' from any GNU archive site."
rm -f y.tab.c y.tab.h
if [ $# -ne 1 ]; then
eval LASTARG="\${$#}"
case "$LASTARG" in
*.y)
SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'`
if [ -f "$SRCFILE" ]; then
cp "$SRCFILE" y.tab.c
fi
SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'`
if [ -f "$SRCFILE" ]; then
cp "$SRCFILE" y.tab.h
fi
;;
esac
fi
if [ ! -f y.tab.h ]; then
echo >y.tab.h
fi
if [ ! -f y.tab.c ]; then
echo 'main() { return 0; }' >y.tab.c
fi
;;
lex|flex)
echo 1>&2 "\
WARNING: \`$1' is missing on your system. You should only need it if
you modified a \`.l' file. You may need the \`Flex' package
in order for those modifications to take effect. You can get
\`Flex' from any GNU archive site."
rm -f lex.yy.c
if [ $# -ne 1 ]; then
eval LASTARG="\${$#}"
case "$LASTARG" in
*.l)
SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'`
if [ -f "$SRCFILE" ]; then
cp "$SRCFILE" lex.yy.c
fi
;;
esac
fi
if [ ! -f lex.yy.c ]; then
echo 'main() { return 0; }' >lex.yy.c
fi
;;
help2man)
if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
# We have it, but it failed.
exit 1
fi
echo 1>&2 "\
WARNING: \`$1' is missing on your system. You should only need it if
you modified a dependency of a manual page. You may need the
\`Help2man' package in order for those modifications to take
effect. You can get \`Help2man' from any GNU archive site."
file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'`
if test -z "$file"; then
file=`echo "$*" | sed -n 's/.*--output=\([^ ]*\).*/\1/p'`
fi
if [ -f "$file" ]; then
touch $file
else
test -z "$file" || exec >$file
echo ".ab help2man is required to generate this page"
exit 1
fi
;;
makeinfo)
if test -z "$run" && (makeinfo --version) > /dev/null 2>&1; then
# We have makeinfo, but it failed.
exit 1
fi
echo 1>&2 "\
WARNING: \`$1' is missing on your system. You should only need it if
you modified a \`.texi' or \`.texinfo' file, or any other file
indirectly affecting the aspect of the manual. The spurious
call might also be the consequence of using a buggy \`make' (AIX,
DU, IRIX). You might want to install the \`Texinfo' package or
the \`GNU make' package. Grab either from any GNU archive site."
file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'`
if test -z "$file"; then
file=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'`
file=`sed -n '/^@setfilename/ { s/.* \([^ ]*\) *$/\1/; p; q; }' $file`
fi
touch $file
;;
tar)
shift
if test -n "$run"; then
echo 1>&2 "ERROR: \`tar' requires --run"
exit 1
fi
# We have already tried tar in the generic part.
# Look for gnutar/gtar before invocation to avoid ugly error
# messages.
if (gnutar --version > /dev/null 2>&1); then
gnutar "$@" && exit 0
fi
if (gtar --version > /dev/null 2>&1); then
gtar "$@" && exit 0
fi
firstarg="$1"
if shift; then
case "$firstarg" in
*o*)
firstarg=`echo "$firstarg" | sed s/o//`
tar "$firstarg" "$@" && exit 0
;;
esac
case "$firstarg" in
*h*)
firstarg=`echo "$firstarg" | sed s/h//`
tar "$firstarg" "$@" && exit 0
;;
esac
fi
echo 1>&2 "\
WARNING: I can't seem to be able to run \`tar' with the given arguments.
You may want to install GNU tar or Free paxutils, or check the
command line arguments."
exit 1
;;
*)
echo 1>&2 "\
WARNING: \`$1' is needed, and you do not seem to have it handy on your
system. You might have modified some files without having the
proper tools for further handling them. Check the \`README' file,
it often tells you about the needed prerequirements for installing
this package. You may also peek at any GNU archive site, in case
some other package would contain this missing \`$1' program."
exit 1
;;
esac
exit 0
openair1/EMOS/GUI/mkinstalldirs
-111
View File
@@ -1,111 +0,0 @@
#! /bin/sh
# mkinstalldirs --- make directory hierarchy
# Author: Noah Friedman <friedman@prep.ai.mit.edu>
# Created: 1993-05-16
# Public domain
errstatus=0
dirmode=""
usage="\
Usage: mkinstalldirs [-h] [--help] [-m mode] dir ..."
# process command line arguments
while test $# -gt 0 ; do
case $1 in
-h | --help | --h*) # -h for help
echo "$usage" 1>&2
exit 0
;;
-m) # -m PERM arg
shift
test $# -eq 0 && { echo "$usage" 1>&2; exit 1; }
dirmode=$1
shift
;;
--) # stop option processing
shift
break
;;
-*) # unknown option
echo "$usage" 1>&2
exit 1
;;
*) # first non-opt arg
break
;;
esac
done
for file
do
if test -d "$file"; then
shift
else
break
fi
done
case $# in
0) exit 0 ;;
esac
case $dirmode in
'')
if mkdir -p -- . 2>/dev/null; then
echo "mkdir -p -- $*"
exec mkdir -p -- "$@"
fi
;;
*)
if mkdir -m "$dirmode" -p -- . 2>/dev/null; then
echo "mkdir -m $dirmode -p -- $*"
exec mkdir -m "$dirmode" -p -- "$@"
fi
;;
esac
for file
do
set fnord `echo ":$file" | sed -ne 's/^:\//#/;s/^://;s/\// /g;s/^#/\//;p'`
shift
pathcomp=
for d
do
pathcomp="$pathcomp$d"
case $pathcomp in
-*) pathcomp=./$pathcomp ;;
esac
if test ! -d "$pathcomp"; then
echo "mkdir $pathcomp"
mkdir "$pathcomp" || lasterr=$?
if test ! -d "$pathcomp"; then
errstatus=$lasterr
else
if test ! -z "$dirmode"; then
echo "chmod $dirmode $pathcomp"
lasterr=""
chmod "$dirmode" "$pathcomp" || lasterr=$?
if test ! -z "$lasterr"; then
errstatus=$lasterr
fi
fi
fi
fi
pathcomp="$pathcomp/"
done
done
exit $errstatus
# Local Variables:
# mode: shell-script
# sh-indentation: 2
# End:
# mkinstalldirs ends here
openair1/EMOS/GUI/src/COPYING
-674
View File
@@ -1,674 +0,0 @@
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>.
openair1/EMOS/GUI/src/Eurecom_Logo.png
BIN
View File
Binary file not shown.
Side by Side

Before

Width:  |  Height:  |  Size: 2.5 KiB

openair1/EMOS/GUI/src/Eurecom_Logo.xpm
-554
View File
@@ -1,554 +0,0 @@
/* XPM */
static char * Eurecom_Logo_xpm[] = {
"106 50 501 2",
" c None",
". c #FFFFFF",
"+ c #FCFCFC",
"@ c #DADADC",
"# c #D5D5D6",
"$ c #E2E2E3",
"% c #F7F7F7",
"& c #C2C2C4",
"* c #BDBEC1",
"= c #DBDADC",
"- c #EFEFEF",
"; c #BDC0C3",
"> c #BFC0C3",
", c #BEC0C3",
"' c #BDBFC3",
") c #B2BEC4",
"! c #B2BEC5",
"~ c #B3BFC5",
"{ c #DBE6EA",
"] c #EFFAFE",
"^ c #F9FDFF",
"/ c #FEFFFE",
"( c #FBFBFB",
"_ c #F4F4F4",
": c #B8DEEC",
"< c #16B0EB",
"[ c #21B7F0",
"} c #22B8F0",
"| c #BFEAFA",
"1 c #FEFEFD",
"2 c #FEFEFE",
"3 c #87D7F3",
"4 c #02ADEF",
"5 c #0AAEED",
"6 c #D8F2FB",
"7 c #F0F0F1",
"8 c #EEEEEF",
"9 c #EEEFEF",
"0 c #74C9EA",
"a c #34B3E3",
"b c #35B3E3",
"c c #35B3E4",
"d c #37B6E6",
"e c #3DBCEB",
"f c #3DBCEC",
"g c #47C1EF",
"h c #F1FAFD",
"i c #C2C1C3",
"j c #BBBDC0",
"k c #BBBDC1",
"l c #BABDC0",
"m c #BCBEC1",
"n c #D3D6D8",
"o c #F9FDFD",
"p c #F8FDFD",
"q c #F9FDFC",
"r c #FAFDFD",
"s c #FDFEFF",
"t c #F6F6F7",
"u c #BEBFC1",
"v c #E1E1E1",
"w c #FFFFFE",
"x c #F6F6F6",
"y c #DCDCDE",
"z c #DDDDDF",
"A c #DCDDDE",
"B c #AFCDDA",
"C c #52B5DC",
"D c #5DB6D9",
"E c #5AB6DA",
"F c #59B6DA",
"G c #5CB6DA",
"H c #5BB6DA",
"I c #5BB6D9",
"J c #6BC6E8",
"K c #80D1F0",
"L c #80D1EF",
"M c #DCF2F8",
"N c #86D8F7",
"O c #13B2EF",
"P c #D6F1F9",
"Q c #FDFDFD",
"R c #5EC9F0",
"S c #06AEEF",
"T c #05AEEF",
"U c #07AFEF",
"V c #26B9F1",
"W c #EEF9FC",
"X c #FAFAFA",
"Y c #CBCDD0",
"Z c #C9C9CB",
"` c #C6C8CA",
" . c #A5C2CC",
".. c #9BC1CE",
"+. c #9AC0CD",
"@. c #9BC0CD",
"#. c #99BFCC",
"$. c #97BECB",
"%. c #98BECC",
"&. c #ABD2E0",
"*. c #C4ECF9",
"=. c #C5EDFB",
"-. c #CDEFFA",
";. c #FCFEFC",
">. c #F2F2F2",
",. c #C0C0C3",
"'. c #BEBEC1",
"). c #BEBEC0",
"!. c #BFBEC0",
"~. c #C0BFC0",
"{. c #E2E1E1",
"]. c #EDECEC",
"^. c #C4C4C6",
"/. c #C5C4C6",
"(. c #BCC1C5",
"_. c #9CBECB",
":. c #9BBECB",
"<. c #9DBECB",
"[. c #9EBECA",
"}. c #A5BCC4",
"|. c #A0BDC8",
"1. c #9BBECC",
"2. c #BFDDE9",
"3. c #CBEEFB",
"4. c #CAEEFB",
"5. c #CAEEFA",
"6. c #E9F8FB",
"7. c #AEE4F9",
"8. c #03ADEF",
"9. c #B1E3F4",
"0. c #FDFEFC",
"a. c #DAF3FC",
"b. c #9BDDF6",
"c. c #61CBF4",
"d. c #67CDF4",
"e. c #F7FDFD",
"f. c #FEFFFD",
"g. c #DDDCDD",
"h. c #DEDDDE",
"i. c #F7F6F6",
"j. c #F8F8F8",
"k. c #E5E6E7",
"l. c #E8E8E9",
"m. c #E3E4E5",
"n. c #E1E1E2",
"o. c #E5E4E5",
"p. c #D0CFCF",
"q. c #BAB9BA",
"r. c #C4C3C3",
"s. c #F8F7F8",
"t. c #D2D1D2",
"u. c #BCBBBB",
"v. c #C3C1C2",
"w. c #E7E9EA",
"x. c #E9E9EA",
"y. c #DDDDDD",
"z. c #EDEDED",
"A. c #DCDCDC",
"B. c #F0F1F2",
"C. c #7D7C7D",
"D. c #2A2728",
"E. c #2D2A2B",
"F. c #393637",
"G. c #DAD9DA",
"H. c #B3B2B2",
"I. c #312D2E",
"J. c #EEEEEE",
"K. c #514F50",
"L. c #858384",
"M. c #B0AEAF",
"N. c #292627",
"O. c #2F2C2D",
"P. c #312E2F",
"Q. c #2E2C2D",
"R. c #4B4848",
"S. c #CDCCCD",
"T. c #EAE9EA",
"U. c #343031",
"V. c #2C292A",
"W. c #757374",
"X. c #FBFAFB",
"Y. c #9F9D9E",
"Z. c #403D3E",
"`. c #3A3738",
" + c #4A4748",
".+ c #373435",
"++ c #6F6D6F",
"@+ c #F3F4F5",
"#+ c #C1C0C1",
"$+ c #4D4A4B",
"%+ c #363334",
"&+ c #4B4849",
"*+ c #373434",
"=+ c #333031",
"-+ c #A1A1A3",
";+ c #5D5A5B",
">+ c #2A2627",
",+ c #B3B1B2",
"'+ c #4A4A4C",
")+ c #282526",
"!+ c #BDBFC1",
"~+ c #484546",
"{+ c #7E7C7C",
"]+ c #E6E6E7",
"^+ c #E7E7E7",
"/+ c #E5E7E8",
"(+ c #807E7F",
"_+ c #4D4C4E",
":+ c #E2E1E2",
"<+ c #7E7C7D",
"[+ c #4F4E50",
"}+ c #F0F0F0",
"|+ c #D7D9DA",
"1+ c #434041",
"2+ c #4E4D4F",
"3+ c #F6F7F7",
"4+ c #BFBEBF",
"5+ c #2B2728",
"6+ c #CDCDCE",
"7+ c #E7E6E7",
"8+ c #F1F2F2",
"9+ c #F7F7F8",
"0+ c #767475",
"a+ c #B5B6B7",
"b+ c #FAF9F9",
"c+ c #BAB9B9",
"d+ c #615E5F",
"e+ c #ABAAAB",
"f+ c #2D292A",
"g+ c #989798",
"h+ c #F2F4F5",
"i+ c #F3F3F3",
"j+ c #7F7D7E",
"k+ c #221E1F",
"l+ c #CBCBCB",
"m+ c #322F30",
"n+ c #484646",
"o+ c #797778",
"p+ c #828081",
"q+ c #2B2829",
"r+ c #E8E8E8",
"s+ c #292526",
"t+ c #B7B5B6",
"u+ c #F8F9F9",
"v+ c #BDBCBD",
"w+ c #252122",
"x+ c #E6E6E6",
"y+ c #F7F8F8",
"z+ c #4B4A4B",
"A+ c #8B898A",
"B+ c #3F3D3F",
"C+ c #F2F2F3",
"D+ c #8D8B8C",
"E+ c #474445",
"F+ c #F5F5F5",
"G+ c #A5A4A4",
"H+ c #2F2B2C",
"I+ c #9B999A",
"J+ c #383536",
"K+ c #808183",
"L+ c #C6C5C5",
"M+ c #4D494A",
"N+ c #3E3A3B",
"O+ c #7B7A7A",
"P+ c #F7F6F7",
"Q+ c #292628",
"R+ c #D0D2D3",
"S+ c #F0EFEF",
"T+ c #EAEAEA",
"U+ c #B2B1B1",
"V+ c #8C8A8B",
"W+ c #3F3D3E",
"X+ c #B4B3B3",
"Y+ c #504D4E",
"Z+ c #737272",
"`+ c #5A5758",
" @ c #706D6E",
".@ c #F2F1F1",
"+@ c #3F3B3C",
"@@ c #868485",
"#@ c #7D7B7B",
"$@ c #474547",
"%@ c #F2F3F4",
"&@ c #555253",
"*@ c #696667",
"=@ c #999898",
"-@ c #D6D6D6",
";@ c #E3E2E2",
">@ c #E9E9E9",
",@ c #444142",
"'@ c #B5B4B4",
")@ c #585556",
"!@ c #7A7879",
"~@ c #322E2F",
"{@ c #353132",
"]@ c #C2C1C2",
"^@ c #5D5B5C",
"/@ c #737374",
"(@ c #C2C1C1",
"_@ c #D1D0D0",
":@ c #787676",
"<@ c #454243",
"[@ c #DFDFDF",
"}@ c #FEFDFE",
"|@ c #CCCBCC",
"1@ c #262223",
"2@ c #CFCECE",
"3@ c #747375",
"4@ c #636263",
"5@ c #868484",
"6@ c #F1F1F1",
"7@ c #3D393A",
"8@ c #B8B9BA",
"9@ c #737172",
"0@ c #7C7B7C",
"a@ c #AAA9A9",
"b@ c #5B595A",
"c@ c #696767",
"d@ c #D7D6D6",
"e@ c #D5D5D5",
"f@ c #EBEBEC",
"g@ c #A8A6A7",
"h@ c #8F8D8E",
"i@ c #E6E5E5",
"j@ c #CBCBCC",
"k@ c #282425",
"l@ c #B7B6B6",
"m@ c #D7D6D7",
"n@ c #E4E3E3",
"o@ c #A9A8A8",
"p@ c #DFDEDF",
"q@ c #383435",
"r@ c #9E9D9E",
"s@ c #373536",
"t@ c #B2B3B5",
"u@ c #6A6768",
"v@ c #494647",
"w@ c #ECEBEC",
"x@ c #CFCECF",
"y@ c #EAEAEB",
"z@ c #373335",
"A@ c #AAA8A9",
"B@ c #5C5A5B",
"C@ c #6B696A",
"D@ c #CBCACB",
"E@ c #D8D7D7",
"F@ c #595758",
"G@ c #6A696A",
"H@ c #D9D8D8",
"I@ c #878585",
"J@ c #9B9A9B",
"K@ c #3B3839",
"L@ c #9D9B9C",
"M@ c #343132",
"N@ c #D5D4D4",
"O@ c #BEBDBD",
"P@ c #272324",
"Q@ c #D8D8D9",
"R@ c #9A9B9C",
"S@ c #242122",
"T@ c #CECDCE",
"U@ c #9C9B9C",
"V@ c #3E3C3D",
"W@ c #F0F2F2",
"X@ c #231F20",
"Y@ c #DAD9D9",
"Z@ c #7B797A",
"`@ c #514E4F",
" # c #332F30",
".# c #A1A2A3",
"+# c #ABA9AA",
"@# c #262324",
"## c #CAC9C9",
"$# c #696768",
"%# c #5E5C5D",
"&# c #AFAEAF",
"*# c #CFD0D1",
"=# c #E2E4E5",
"-# c #9A9899",
";# c #EDEEEE",
"># c #4C4A4C",
",# c #716F6F",
"'# c #A9A7A8",
")# c #E4E4E4",
"!# c #C0BFBF",
"~# c #656466",
"{# c #686566",
"]# c #9E9C9D",
"^# c #F9F9F9",
"/# c #59595A",
"(# c #F1F0F1",
"_# c #B8B7B8",
":# c #B9B8B8",
"<# c #605D5E",
"[# c #4E4B4C",
"}# c #F4F3F3",
"|# c #959494",
"1# c #FAF9FA",
"2# c #605E60",
"3# c #8D8C8D",
"4# c #595657",
"5# c #403C3D",
"6# c #DADBDD",
"7# c #E8E7E8",
"8# c #E6E5E6",
"9# c #747172",
"0# c #706E6F",
"a# c #9C9A9B",
"b# c #6F6D6D",
"c# c #E3E3E3",
"d# c #CCCCCC",
"e# c #575455",
"f# c #ABADAE",
"g# c #9F9FA0",
"h# c #E6E6E5",
"i# c #302D2E",
"j# c #8E8C8D",
"k# c #2E2B2C",
"l# c #7A7878",
"m# c #C3C2C3",
"n# c #524F50",
"o# c #484547",
"p# c #C6C6C6",
"q# c #DFDEDE",
"r# c #4C494A",
"s# c #525051",
"t# c #A7A6A6",
"u# c #CDCCCC",
"v# c #DBDADA",
"w# c #D3D3D3",
"x# c #B6B4B5",
"y# c #A4A3A4",
"z# c #E2E4E4",
"A# c #D9D8D9",
"B# c #D8D7D8",
"C# c #FDFCFC",
"D# c #D0D0D0",
"E# c #EEEDEE",
"F# c #A5A3A4",
"G# c #AFAEAE",
"H# c #D3D2D3",
"I# c #C5C4C4",
"J# c #A7A5A5",
"K# c #D4D3D3",
"L# c #F3F4F4",
"M# c #F9F9FA",
"N# c #FBFAFA",
"O# c #D4D3D4",
"P# c #D2D2D4",
"Q# c #DEDEDF",
"R# c #EAE9E9",
"S# c #C3C4C6",
"T# c #E9EAEB",
"U# c #F5F5F6",
"V# c #BFC1C2",
"W# c #C6C5C6",
"X# c #ECECEC",
"Y# c #F6F7F8",
"Z# c #DBDBDC",
"`# c #FDFCFD",
" $ c #F4F3F2",
".$ c #D4D5D6",
"+$ c #E1E0E1",
"@$ c #E2E2E2",
"#$ c #BCBEBF",
"$$ c #DCDEE0",
"%$ c #CECECF",
"&$ c #D3D5D6",
"*$ c #C5C4C5",
"=$ c #CACACA",
"-$ c #ACABAC",
";$ c #BFBFC0",
">$ c #CECECE",
",$ c #C2C2C3",
"'$ c #DBDADB",
")$ c #C9C9CA",
"!$ c #C8C7C8",
"~$ c #CDCFD0",
"{$ c #C9CACA",
"]$ c #E3E3E4",
"^$ c #E8EAEA",
"/$ c #B7B6B7",
"($ c #E4E4E5",
"_$ c #C5C5C6",
":$ c #E0E0E0",
"<$ c #BBBABB",
"[$ c #D2D4D5",
"}$ c #CCCCCD",
"|$ c #CACACB",
"1$ c #FEFFFF",
"2$ c #E4E6E7",
"3$ c #D7D9DB",
"4$ c #D7D7D8",
"5$ c #D8DADB",
"6$ c #F9FAF9",
"7$ c #B0AFB0",
"8$ c #FEFDFD",
"9$ c #D7D7D7",
"0$ c #C9C9C9",
"a$ c #DEDEDE",
"b$ c #C9C8C9",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . + @ # # # # # # # # # # # # # # # # # # # # $ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . % & * * * * * * * * * * * * * * * * * * * * = . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ; ; > , ; ; ; ' ) ! ~ ~ ~ ~ ~ ~ ~ ~ ~ ! ) { ] ] ] ] ] ] ] ^ / . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ( _ _ _ _ _ _ _ : < < < < < < < < < < < < < [ } } } } } } } | 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 . . . . . . . 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 8 9 9 9 9 9 9 0 a a a a a a b a c a c a d e e e e e e f g h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 i * * * * * * * * j j j j j j k l m l m j n o p p q q q r s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . t u * * * * * * * * * * * * * * * * * * * * v w w w w w w w / . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x y z z z z z A B C D D E F F D D G F F H I J K K K K K K L M / . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . N 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 O P . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Q Q Q Q Q Q Q Q R S S S S S T S S S T S S S U U U U U U U V W . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . X Y Z Z Z Z Z Z ` ...+.@.@.#.$.@.@.@.%.#.@.&.*.=.=.=.=.=.=.-.;.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . >.,.* * * * * * * '.).!.!.!.!.!.!.!.!.!.!.~.{.1 1 1 1 1 1 / 1 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ].^././././././.(._.:.<.[.}.|.<.<.|.}.[.<.1.2.3.4.4.4.4.4.5.6.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Q Q Q Q Q Q Q 7.4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8.9.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0.3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8.a.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . w 0.b.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.d.e.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 f.. . . . . . . . . . . . . . . . . . . . f.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . - g.g.g.g.g.h.i.. . . . % h.j.. . . . k.l.. . . . . % h.g.g.m.X . . . . . . . Q n.g.g.g.g.g.o.2 . . . . . . >.p.q.r.{.2 . . . . . . . s.t.u.v.w.. . . . . . . . x.y.x . . . . z.A.B.. . . . . . . . ",
". . . . . . . . C.D.E.E.E.E.F.G.. . . . H.I.J.. . . ( K.L.. . . . . M.N.O.P.Q.R.S.. . . . . . T.U.V.E.E.E.E.W.Q . . . . X.Y.Z.`. +.+V.++@+. . . 2 2 #+$+%+&+*+=+-+2 . . . . . ( ;+>+,+. . . _ '+)+!+. . . . . . . . ",
". . . . . . . Q ~+{+]+]+]+^+/++ . . . 2 (+_+X . . . :+V.q.. . . . 2 <+[+- }+|+1+2+3+. . . . . 4+5+6+7+7+7+k.8+. . . . 9+0+`.a+b+. s.c+d+x . . . 2 e+f+g+h+. i+j+k+l+. . . . . ^+m+n+o+. . Q p+m+q+^+. . . . . . . . ",
". . . . . . . r+s+t+. . . . . . . . . u+_+<+2 . . . v+w+x+. . . . y+z+L.2 . . A+B+C+. . . . . D+E+F+. . . . . . . . . G+E.t.. . . . 2 i+2 . . . y.H+I++ . . . J.J+K+. . . . 2 L+O.Y.M+x . ~.N+O+~+P+. . . . . . . . ",
". . . . . . . 4+Q+R+S+S+S+S+b+. . . . T+q+U+. . . . V+W+Q . . . . T+D.X+. . + Y+Z++ . . . . 2 `+ @- S+S+S+.@. . . . F++@@@2 . . . . 2 . . . . . #@$@%@. . . . 2 &@*@. . . . 2 =@Y+-@P.;@>@,@'@)@!@2 . . . . . . . . ",
". . . . . . . A+k+~@{@{@{@=+S.. . . . ]@>+A.. . . X ^@/@. . . . . ~.w+(@v _@:@<@[@. . . . . B.~@>+{@{@{@{@d+}@. . . |@1@2@. . . . . . . . . . i.F.D+. . . . . Q $+3@. . . . + 4@5@6@7@8@9@0@}+V.a@. . . . . . . . . ",
". . . . . . Q b@c@d@d@d@d@e@X . . . . D+1+i+. . . f@=+g@. . . . . h@k+U.I.s+o+i@. . . . . . j@k@l@d@d@d@m@n@. . . . o@m+x+. . . . . . . . . . p@k@l@. . . . . J.q@r@. . . . i+s@t@Q u@$+v@w@x@k@m@. . . . . . . . . ",
". . . . . . y@z@A@. . . . . . . . . . B@C@. . . . D@1@E@. . . . . F@G@z.H@%+I@2 . . . . . . J@K@_ . . . . . . . . . L@M@>@. . . . . . . . . . N@1@O@. . . . . '@P@p@. . . . Q@O.h.. R@S@T@2 U@V@W@. . . . . . . . . ",
". . . . . . l+X@Y@. . . . . . . . . . E+p+. . . 2 Z@`@x . . . . }+ #.#. . +#@###. . . . . 2 $#%#. . . . . . . . . . &#w+*#. . . . . W@. . . . =#N.-#. . . . ;#>#,#. . . . . '#<@_ . )#!#. . ~#{#2 . . . . . . . . . ",
". . . . . . ]#.+}+^#^#^#^#Q . . . . . /#Y+(#. Q _#>+:#. . . . . T@s+t.. . j.<#[#}#. . . . >.Z.|#1#^#^#^#X . . . . . r+P.2#S+. . i+Y.3#. . . . + 4#5#6#. . 7#;+~+8#. . . . . 9#0#2 . . . . F+K@a#. . . . . . . . . . ",
". . . . . Q b#k@I.I.I.I.`.c#. . . . . d#{@.+e#~+F.f#2 . . . . . g#`._ . . . h#i#j#Q . . . Y@k#H+I.I.I.I.l#. . . . . . m#Z.=+&@n#F.o#p#. . . . . q#r#5+s#s#m+C@7#2 . . . . + v@t#. . . . . -@i#u#. . . . . . . . . . ",
". . . . . 2 v#_@_@_@_@_@w#( . . . . . 2 i@x#y#u.7#w . . . . . . z#A#. . . . . g.B#C#. . . >._@_@_@_@_@D#^+. . . . . . . E#!#F#G#H#j.. . . . . . . i+I#J#G#e@Q . . . . . . + K#6@. . . . . .@_@^#. . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . Q L#+ . . . . . . . . . . . . . . . . ^#. . . . . Q + . . . . . . . . . . . . . . . 2 X . . . . . . . . . . . Q . . . . ( 2 . . . . . . . . . . . . . . . 2 M#. . . . N#. . . . . . . . . . . . . . . . . ",
". . . . . O#P#- . . . + Q#x . . . 2 :+R#. . . . S#y.. . . . T#.@. . . U#A.+ . . . . . . . . . v V#. . . . i+A.( . . . - W#2 . . . c#^#2 . . X#Q#Q . . . Y#Z#`#. . . $.$. . . 1#$ . . . C#+$F+. . . . . . . . . . . ",
". . . . . @$#$>.. . . $$%$&$. . . }+D@W#. . . Q *$!#. . . . =$X . . . G.-$F+. . . . . . . . Q e+;$2 . . . >$,$6@. . . @$'$. . . Q )$Q . . 2 p#!$% . . . ~${$>@. . . q#]$. . . ^$v#. . . 6@/$_ . . . . . . . . . . . ",
". . . . . t.%$y+. . . ($_$6@. . . :$<$8#. . . % A.[$. . . w N@. . . . }$|$1$. . . . . . . . 2$^+3$Q . . . 4$5$6$. . . @$[@. . . ^#v#. . . ( 7$R+8$. . . 9$0$Q . . . a$j.. . . ]+}+. . . J.b$_ . . . . . . . . . . . ",
". . . . . 2 2 . . . . . 2 . . . . J.x 2 . . . . 2 2 . . . . . . . . . 2 . . . . . . . . . . . . . . . . . . 2 2 . . . . 2 . . . . . . . . Q >@2 . . . . . 2 . . . . . . . . 2 2 . . . . . 2 . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . "};
openair1/EMOS/GUI/src/FFT.c
-96
View File
@@ -1,96 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
// ******* FFT function **********************************************************
#define PI 3.14159264359
#define SWAP(a,b) tempr=(a); (a)=(b); (b)=tempr
void FFT(float *data, // the vector with the outputs
// real part in even indexes
// imaginary part in the odd indexes
// for power conservation, the output should be normalized by 1/sqrt(nn)
unsigned long nn, // number of complex samples
int isign) // isign = 1 -> FFT, -1 -> iFFT
{
unsigned long n,mmax,m,j,istep,i;
float wtemp,wr,wpr,wpi,wi,theta;
float tempr,tempi;
n = nn << 1;
j = 1;
for( i = 1 ; i < n ; i += 2) { // The bit-reversal
if(j > i) {
SWAP(data[j-1],data[i-1]); // Exchanging the two complex number
SWAP(data[j],data[i]);
}
m = n >> 1;
while((m >= 2)&&(j > m)) {
j -= m;
m >>= 1;
}
j += m;
}
mmax = 2;
while(n > mmax) {
istep = mmax << 1;
theta = isign*(-2*PI/mmax);
wtemp = sin(0.5 * theta);
wpr = -2.0 * wtemp * wtemp;
wpi = sin(theta);
wr = 1.0;
wi = 0.0;
for (m = 1; m < mmax; m += 2) {
for (i = m; i <= n; i += istep) {
j = i + mmax;
tempr = wr*data[j-1] - wi*data[j];
tempi = wr*data[j] + wi*data[j-1];
data[j-1] = data[i-1] - tempr;
data[j] = data[i] - tempi;
data[i-1] += tempr;
data[i] += tempi;
}
wr = (wtemp=wr)*wpr - wi*wpi + wr;
wi = wi*wpr + wtemp*wpi + wi;
}
mmax = istep;
}
}
openair1/EMOS/GUI/src/Makefile.am
-16
View File
@@ -1,16 +0,0 @@
include $(OPENAIR_HOME)/common/utils/Makefile.inc
TOP_DIR = $(OPENAIR1_DIR)
bin_PROGRAMS = emos_gui
emos_gui_SOURCES = emos_gui.c emos_gui_forms.c emos_callbacks.c \
$(TOP_DIR)/PHY/CONFIG/openair_configure.c $(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c FFT.c matrix_util.c
# set the include path found by configure
INCLUDES = -I$(TOP_DIR) -I/usr/realtime/include -I/usr/include/X11 $(all_includes)
# the library search path.
emos_gui_LDFLAGS = $(all_libraries)
noinst_HEADERS = emos_gui.h emos_gui_forms.h matrix_util.h
AM_CFLAGS = -DUSER_MODE -DPC_TARGET -DPC_DSP -DNB_ANTENNAS_TXRX=2 -DNB_ANTENNAS_RX=2 -DNB_ANTENNAS_TX=2 -DEMOS -DNODE_RG -DCBMIMO1 -DPHY_CONTEXT
emos_gui_LDADD = -L/usr/lib -L/usr/local/lib -L/usr/realtime/lib\
-L/usr/X11R6/lib -lm -lforms -llxrt -lpthread -lX11 -lXpm -lgps
openair1/EMOS/GUI/src/Makefile.in
-446
View File
@@ -1,446 +0,0 @@
# Makefile.in generated by automake 1.9.6 from Makefile.am.
# @configure_input@
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
# 2003, 2004, 2005 Free Software Foundation, Inc.
# This Makefile.in is free software; the Free Software Foundation
# gives unlimited permission to copy and/or distribute it,
# with or without modifications, as long as this notice is preserved.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
# PARTICULAR PURPOSE.
@SET_MAKE@
srcdir = @srcdir@
top_srcdir = @top_srcdir@
VPATH = @srcdir@
pkgdatadir = $(datadir)/@PACKAGE@
pkglibdir = $(libdir)/@PACKAGE@
pkgincludedir = $(includedir)/@PACKAGE@
top_builddir = ..
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
INSTALL = @INSTALL@
install_sh_DATA = $(install_sh) -c -m 644
install_sh_PROGRAM = $(install_sh) -c
install_sh_SCRIPT = $(install_sh) -c
INSTALL_HEADER = $(INSTALL_DATA)
transform = $(program_transform_name)
NORMAL_INSTALL = :
PRE_INSTALL = :
POST_INSTALL = :
NORMAL_UNINSTALL = :
PRE_UNINSTALL = :
POST_UNINSTALL = :
bin_PROGRAMS = emos_gui$(EXEEXT)
subdir = src
DIST_COMMON = $(noinst_HEADERS) $(srcdir)/Makefile.am \
$(srcdir)/Makefile.in
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
am__aclocal_m4_deps = $(top_srcdir)/configure.in
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
$(ACLOCAL_M4)
mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
CONFIG_HEADER = $(top_builddir)/config.h
CONFIG_CLEAN_FILES =
am__installdirs = "$(DESTDIR)$(bindir)"
binPROGRAMS_INSTALL = $(INSTALL_PROGRAM)
PROGRAMS = $(bin_PROGRAMS)
am_emos_gui_OBJECTS = emos_gui.$(OBJEXT) emos_gui_forms.$(OBJEXT) \
emos_callbacks.$(OBJEXT) openair_configure.$(OBJEXT) \
openair_readconfigfile.$(OBJEXT) FFT.$(OBJEXT) \
matrix_util.$(OBJEXT)
emos_gui_OBJECTS = $(am_emos_gui_OBJECTS)
emos_gui_DEPENDENCIES =
DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir)
depcomp = $(SHELL) $(top_srcdir)/depcomp
am__depfiles_maybe = depfiles
COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
CCLD = $(CC)
LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
SOURCES = $(emos_gui_SOURCES)
DIST_SOURCES = $(emos_gui_SOURCES)
HEADERS = $(noinst_HEADERS)
ETAGS = etags
CTAGS = ctags
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
ACLOCAL = @ACLOCAL@
AMDEP_FALSE = @AMDEP_FALSE@
AMDEP_TRUE = @AMDEP_TRUE@
AMTAR = @AMTAR@
AUTOCONF = @AUTOCONF@
AUTOHEADER = @AUTOHEADER@
AUTOMAKE = @AUTOMAKE@
AWK = @AWK@
CC = @CC@
CCDEPMODE = @CCDEPMODE@
CFLAGS = @CFLAGS@
CPPFLAGS = @CPPFLAGS@
CYGPATH_W = @CYGPATH_W@
DEFS = @DEFS@
DEPDIR = @DEPDIR@
ECHO_C = @ECHO_C@
ECHO_N = @ECHO_N@
ECHO_T = @ECHO_T@
EXEEXT = @EXEEXT@
INSTALL_DATA = @INSTALL_DATA@
INSTALL_PROGRAM = @INSTALL_PROGRAM@
INSTALL_SCRIPT = @INSTALL_SCRIPT@
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
LDFLAGS = @LDFLAGS@
LIBOBJS = @LIBOBJS@
LIBS = @LIBS@
LTLIBOBJS = @LTLIBOBJS@
MAKEINFO = @MAKEINFO@
OBJEXT = @OBJEXT@
PACKAGE = @PACKAGE@
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
PACKAGE_NAME = @PACKAGE_NAME@
PACKAGE_STRING = @PACKAGE_STRING@
PACKAGE_TARNAME = @PACKAGE_TARNAME@
PACKAGE_VERSION = @PACKAGE_VERSION@
PATH_SEPARATOR = @PATH_SEPARATOR@
SET_MAKE = @SET_MAKE@
SHELL = @SHELL@
STRIP = @STRIP@
VERSION = @VERSION@
ac_ct_CC = @ac_ct_CC@
am__fastdepCC_FALSE = @am__fastdepCC_FALSE@
am__fastdepCC_TRUE = @am__fastdepCC_TRUE@
am__include = @am__include@
am__leading_dot = @am__leading_dot@
am__quote = @am__quote@
am__tar = @am__tar@
am__untar = @am__untar@
bindir = @bindir@
build_alias = @build_alias@
datadir = @datadir@
datarootdir = @datarootdir@
docdir = @docdir@
dvidir = @dvidir@
exec_prefix = @exec_prefix@
host_alias = @host_alias@
htmldir = @htmldir@
includedir = @includedir@
infodir = @infodir@
install_sh = @install_sh@
libdir = @libdir@
libexecdir = @libexecdir@
localedir = @localedir@
localstatedir = @localstatedir@
mandir = @mandir@
mkdir_p = @mkdir_p@
oldincludedir = @oldincludedir@
pdfdir = @pdfdir@
prefix = @prefix@
program_transform_name = @program_transform_name@
psdir = @psdir@
sbindir = @sbindir@
sharedstatedir = @sharedstatedir@
sysconfdir = @sysconfdir@
target_alias = @target_alias@
TOP_DIR = $(OPENAIR1_DIR)
emos_gui_SOURCES = emos_gui.c emos_gui_forms.c emos_callbacks.c \
$(TOP_DIR)/PHY/CONFIG/openair_configure.c $(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c FFT.c matrix_util.c
# set the include path found by configure
INCLUDES = -I$(TOP_DIR) -I/usr/realtime/include -I/usr/include/X11 $(all_includes)
# the library search path.
emos_gui_LDFLAGS = $(all_libraries)
noinst_HEADERS = emos_gui.h emos_gui_forms.h matrix_util.h
AM_CFLAGS = -DUSER_MODE -DPC_TARGET -DPC_DSP -DNB_ANTENNAS_TXRX=2 -DNB_ANTENNAS_RX=2 -DNB_ANTENNAS_TX=2 -DEMOS -DNODE_RG -DCBMIMO1 -DPHY_CONTEXT -msse2 -mmmx -msse
emos_gui_LDADD = -L/usr/lib -L/usr/local/lib -L/usr/realtime/lib\
-L/usr/X11R6/lib -lm -lforms -llxrt -lpthread -lX11 -lXpm -lgps
all: all-am
.SUFFIXES:
.SUFFIXES: .c .o .obj
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
@for dep in $?; do \
case '$(am__configure_deps)' in \
*$$dep*) \
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \
&& exit 0; \
exit 1;; \
esac; \
done; \
echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/Makefile'; \
cd $(top_srcdir) && \
$(AUTOMAKE) --foreign src/Makefile
.PRECIOUS: Makefile
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
@case '$?' in \
*config.status*) \
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
*) \
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
esac;
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(top_srcdir)/configure: $(am__configure_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
install-binPROGRAMS: $(bin_PROGRAMS)
@$(NORMAL_INSTALL)
test -z "$(bindir)" || $(mkdir_p) "$(DESTDIR)$(bindir)"
@list='$(bin_PROGRAMS)'; for p in $$list; do \
p1=`echo $$p|sed 's/$(EXEEXT)$$//'`; \
if test -f $$p \
; then \
f=`echo "$$p1" | sed 's,^.*/,,;$(transform);s/$$/$(EXEEXT)/'`; \
echo " $(INSTALL_PROGRAM_ENV) $(binPROGRAMS_INSTALL) '$$p' '$(DESTDIR)$(bindir)/$$f'"; \
$(INSTALL_PROGRAM_ENV) $(binPROGRAMS_INSTALL) "$$p" "$(DESTDIR)$(bindir)/$$f" || exit 1; \
else :; fi; \
done
uninstall-binPROGRAMS:
@$(NORMAL_UNINSTALL)
@list='$(bin_PROGRAMS)'; for p in $$list; do \
f=`echo "$$p" | sed 's,^.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/'`; \
echo " rm -f '$(DESTDIR)$(bindir)/$$f'"; \
rm -f "$(DESTDIR)$(bindir)/$$f"; \
done
clean-binPROGRAMS:
-test -z "$(bin_PROGRAMS)" || rm -f $(bin_PROGRAMS)
emos_gui$(EXEEXT): $(emos_gui_OBJECTS) $(emos_gui_DEPENDENCIES)
@rm -f emos_gui$(EXEEXT)
$(LINK) $(emos_gui_LDFLAGS) $(emos_gui_OBJECTS) $(emos_gui_LDADD) $(LIBS)
mostlyclean-compile:
-rm -f *.$(OBJEXT)
distclean-compile:
-rm -f *.tab.c
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/FFT.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/emos_callbacks.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/emos_gui.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/emos_gui_forms.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/matrix_util.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/openair_configure.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/openair_readconfigfile.Po@am__quote@
.c.o:
@am__fastdepCC_TRUE@ if $(COMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \
@am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(COMPILE) -c $<
.c.obj:
@am__fastdepCC_TRUE@ if $(COMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ `$(CYGPATH_W) '$<'`; \
@am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'`
openair_configure.o: $(TOP_DIR)/PHY/CONFIG/openair_configure.c
@am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT openair_configure.o -MD -MP -MF "$(DEPDIR)/openair_configure.Tpo" -c -o openair_configure.o `test -f '$(TOP_DIR)/PHY/CONFIG/openair_configure.c' || echo '$(srcdir)/'`$(TOP_DIR)/PHY/CONFIG/openair_configure.c; \
@am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/openair_configure.Tpo" "$(DEPDIR)/openair_configure.Po"; else rm -f "$(DEPDIR)/openair_configure.Tpo"; exit 1; fi
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(TOP_DIR)/PHY/CONFIG/openair_configure.c' object='openair_configure.o' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o openair_configure.o `test -f '$(TOP_DIR)/PHY/CONFIG/openair_configure.c' || echo '$(srcdir)/'`$(TOP_DIR)/PHY/CONFIG/openair_configure.c
openair_configure.obj: $(TOP_DIR)/PHY/CONFIG/openair_configure.c
@am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT openair_configure.obj -MD -MP -MF "$(DEPDIR)/openair_configure.Tpo" -c -o openair_configure.obj `if test -f '$(TOP_DIR)/PHY/CONFIG/openair_configure.c'; then $(CYGPATH_W) '$(TOP_DIR)/PHY/CONFIG/openair_configure.c'; else $(CYGPATH_W) '$(srcdir)/$(TOP_DIR)/PHY/CONFIG/openair_configure.c'; fi`; \
@am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/openair_configure.Tpo" "$(DEPDIR)/openair_configure.Po"; else rm -f "$(DEPDIR)/openair_configure.Tpo"; exit 1; fi
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(TOP_DIR)/PHY/CONFIG/openair_configure.c' object='openair_configure.obj' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o openair_configure.obj `if test -f '$(TOP_DIR)/PHY/CONFIG/openair_configure.c'; then $(CYGPATH_W) '$(TOP_DIR)/PHY/CONFIG/openair_configure.c'; else $(CYGPATH_W) '$(srcdir)/$(TOP_DIR)/PHY/CONFIG/openair_configure.c'; fi`
openair_readconfigfile.o: $(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c
@am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT openair_readconfigfile.o -MD -MP -MF "$(DEPDIR)/openair_readconfigfile.Tpo" -c -o openair_readconfigfile.o `test -f '$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c' || echo '$(srcdir)/'`$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c; \
@am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/openair_readconfigfile.Tpo" "$(DEPDIR)/openair_readconfigfile.Po"; else rm -f "$(DEPDIR)/openair_readconfigfile.Tpo"; exit 1; fi
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c' object='openair_readconfigfile.o' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o openair_readconfigfile.o `test -f '$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c' || echo '$(srcdir)/'`$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c
openair_readconfigfile.obj: $(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c
@am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT openair_readconfigfile.obj -MD -MP -MF "$(DEPDIR)/openair_readconfigfile.Tpo" -c -o openair_readconfigfile.obj `if test -f '$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c'; then $(CYGPATH_W) '$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c'; else $(CYGPATH_W) '$(srcdir)/$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c'; fi`; \
@am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/openair_readconfigfile.Tpo" "$(DEPDIR)/openair_readconfigfile.Po"; else rm -f "$(DEPDIR)/openair_readconfigfile.Tpo"; exit 1; fi
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c' object='openair_readconfigfile.obj' libtool=no @AMDEPBACKSLASH@
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
@am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o openair_readconfigfile.obj `if test -f '$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c'; then $(CYGPATH_W) '$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c'; else $(CYGPATH_W) '$(srcdir)/$(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c'; fi`
uninstall-info-am:
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) ' { files[$$0] = 1; } \
END { for (i in files) print i; }'`; \
mkid -fID $$unique
tags: TAGS
TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
tags=; \
here=`pwd`; \
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) ' { files[$$0] = 1; } \
END { for (i in files) print i; }'`; \
if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \
test -n "$$unique" || unique=$$empty_fix; \
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
$$tags $$unique; \
fi
ctags: CTAGS
CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
$(TAGS_FILES) $(LISP)
tags=; \
here=`pwd`; \
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
unique=`for i in $$list; do \
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
done | \
$(AWK) ' { files[$$0] = 1; } \
END { for (i in files) print i; }'`; \
test -z "$(CTAGS_ARGS)$$tags$$unique" \
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
$$tags $$unique
GTAGS:
here=`$(am__cd) $(top_builddir) && pwd` \
&& cd $(top_srcdir) \
&& gtags -i $(GTAGS_ARGS) $$here
distclean-tags:
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
distdir: $(DISTFILES)
@srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \
list='$(DISTFILES)'; for file in $$list; do \
case $$file in \
$(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \
$(top_srcdir)/*) file=`echo "$$file" | sed "s|^$$topsrcdirstrip/|$(top_builddir)/|"`;; \
esac; \
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \
if test "$$dir" != "$$file" && test "$$dir" != "."; then \
dir="/$$dir"; \
$(mkdir_p) "$(distdir)$$dir"; \
else \
dir=''; \
fi; \
if test -d $$d/$$file; then \
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \
fi; \
cp -pR $$d/$$file $(distdir)$$dir || exit 1; \
else \
test -f $(distdir)/$$file \
|| cp -p $$d/$$file $(distdir)/$$file \
|| exit 1; \
fi; \
done
check-am: all-am
check: check-am
all-am: Makefile $(PROGRAMS) $(HEADERS)
installdirs:
for dir in "$(DESTDIR)$(bindir)"; do \
test -z "$$dir" || $(mkdir_p) "$$dir"; \
done
install: install-am
install-exec: install-exec-am
install-data: install-data-am
uninstall: uninstall-am
install-am: all-am
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
installcheck: installcheck-am
install-strip:
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
`test -z '$(STRIP)' || \
echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install
mostlyclean-generic:
clean-generic:
distclean-generic:
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
maintainer-clean-generic:
@echo "This command is intended for maintainers to use"
@echo "it deletes files that may require special tools to rebuild."
clean: clean-am
clean-am: clean-binPROGRAMS clean-generic mostlyclean-am
distclean: distclean-am
-rm -rf ./$(DEPDIR)
-rm -f Makefile
distclean-am: clean-am distclean-compile distclean-generic \
distclean-tags
dvi: dvi-am
dvi-am:
html: html-am
info: info-am
info-am:
install-data-am:
install-exec-am: install-binPROGRAMS
install-info: install-info-am
install-man:
installcheck-am:
maintainer-clean: maintainer-clean-am
-rm -rf ./$(DEPDIR)
-rm -f Makefile
maintainer-clean-am: distclean-am maintainer-clean-generic
mostlyclean: mostlyclean-am
mostlyclean-am: mostlyclean-compile mostlyclean-generic
pdf: pdf-am
pdf-am:
ps: ps-am
ps-am:
uninstall-am: uninstall-binPROGRAMS uninstall-info-am
.PHONY: CTAGS GTAGS all all-am check check-am clean clean-binPROGRAMS \
clean-generic ctags distclean distclean-compile \
distclean-generic distclean-tags distdir dvi dvi-am html \
html-am info info-am install install-am install-binPROGRAMS \
install-data install-data-am install-exec install-exec-am \
install-info install-info-am install-man install-strip \
installcheck installcheck-am installdirs maintainer-clean \
maintainer-clean-generic mostlyclean mostlyclean-compile \
mostlyclean-generic pdf pdf-am ps ps-am tags uninstall \
uninstall-am uninstall-binPROGRAMS uninstall-info-am
# Tell versions [3.59,3.63) of GNU make to not export all variables.
# Otherwise a system limit (for SysV at least) may be exceeded.
.NOEXPORT:
openair1/EMOS/GUI/src/emos_callbacks.c
-39
View File
@@ -1,39 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <forms.h>
#include "emos_gui.h"
#include "emos_gui_forms.h"
openair1/EMOS/GUI/src/emos_gui.c
-1808
View File
File diff suppressed because it is too large Load Diff
openair1/EMOS/GUI/src/emos_gui.h
-82
View File
@@ -1,82 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
#include "SCHED/phy_procedures_emos.h"
#define TERM_MODE_SINGL 0
#define TERM_MODE_MULTI 1
#define TERM_ON 1
#define TERM_OFF 0
#define SCREEN_COLOR_ON FL_CHARTREUSE
#define SCREEN_COLOR_OFF FL_RIGHT_BCOL
#define SCREEN_COLOR_BG FL_BLACK
#define SCREEN_COLOR_HL FL_RED
#define LED_COLOR_ON FL_RED
#define LED_COLOR_OFF FL_RIGHT_BCOL
#define REC_ON 1
#define REC_OFF 0
#define EMOS_NOT_READY 0
#define EMOS_READY 1
#define TIME_DOMAIN 0
#define FREQ_DOMAIN 1
#define N0 0
#define SNR 1
#define REC_FRAMES_MAX 22500
#define REC_FRAMES_PER_FILE 18750
#define REC_FILE_IDX_MAX 100
#define CHANSOUNDER_FIFO_DEV "/dev/rtf3"
#define NO_ESTIMATES_DISK 100 //No. of estimates that are aquired before dumped to disk
/*
#define TIMESTAMP_SIZE 8
#define PDU_ERRORS_SIZE 4
#define RX_RSSI_SIZE 2
#define COMPLEX16_SIZE 4
#define NO_OF_OFDM_CARRIERS 256
#define CHANNEL_BUFFER_SIZE (NB_ANTENNAS*COMPLEX16_SIZE*NO_OF_OFDM_CARRIERS+TIMESTAMP_SIZE+PDU_ERRORS_SIZE+RX_RSSI_SIZE) //in bytes
*/
#define CHANNEL_BUFFER_SIZE sizeof(fifo_read_emos) //in bytes
#define SCREEN_MEMORY_SIZE 32
#define DISP_MAX_POWER 4194304 //maximum value for the display of the frequency response
#define GPSD_BUFFER_SIZE 64
//struct gps_data_struct {}
openair1/EMOS/GUI/src/emos_gui_forms.c
-437
View File
@@ -1,437 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
/* Form definition file generated with fdesign. */
#include "forms.h"
#include <stdlib.h>
#include "emos_gui_forms.h"
FD_main_frm *create_form_main_frm(void)
{
FL_OBJECT *obj;
FD_main_frm *fdui = (FD_main_frm *) fl_calloc(1, sizeof(*fdui));
fdui->main_frm = fl_bgn_form(FL_NO_BOX, 1010, 710);
obj = fl_add_box(FL_FLAT_BOX,0,0,1010,710,"Main form");
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_MCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
obj = fl_add_box(FL_ROUNDED_BOX,10,610,230,90,"");
fl_set_object_color(obj,FL_DARKER_COL1,FL_COL1);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
obj = fl_add_box(FL_ROUNDED3D_DOWNBOX,5,5,850,600,"");
fl_set_object_color(obj,FL_BLACK,FL_BLACK);
fdui->sync_lbl = obj = fl_add_text(FL_NORMAL_TEXT,635,15,40,20,"sync");
fl_set_object_boxtype(obj,FL_ROUNDED_BOX);
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->rec_lbl = obj = fl_add_text(FL_NORMAL_TEXT,720,15,40,20,"rec");
fl_set_object_boxtype(obj,FL_ROUNDED_BOX);
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->pwr1_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,20,45,300,110,"Power");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->pwr2_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,330,45,300,110,"Power");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->rx2_lbl = obj = fl_add_text(FL_NORMAL_TEXT,345,10,80,40,"RX 2");
fl_set_object_color(obj,FL_BLACK,FL_MCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lsize(obj,FL_HUGE_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->noise1_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,20,170,300,110,"N0/SNR");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->noise2_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,330,170,300,110,"N0/SNR");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->ch11_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,15,310,140,110,"CH TX1");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->ch12_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,180,310,140,110,"CH TX2");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->ch13_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,15,450,140,110,"CH TX3");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->ch14_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,180,450,140,110,"CH TX4");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->ch21_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,325,310,140,110,"CH TX1");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->ch22_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,490,310,140,110,"CH TX2");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->ch23_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,325,450,140,110,"CH TX3");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->ch24_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,490,450,140,110,"CH TX4");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->error_lbl = obj = fl_add_text(FL_NORMAL_TEXT,680,15,40,20,"error");
fl_set_object_boxtype(obj,FL_ROUNDED_BOX);
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->gps_lbl = obj = fl_add_text(FL_NORMAL_TEXT,640,65,60,30,"gps");
fl_set_object_boxtype(obj,FL_ROUNDED_BOX);
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->date_lbl = obj = fl_add_text(FL_NORMAL_TEXT,655,130,170,30,"date: ");
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->gps_lat_lbl = obj = fl_add_text(FL_NORMAL_TEXT,700,65,150,30,"lat: 0");
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->gps_lon_lbl = obj = fl_add_text(FL_NORMAL_TEXT,700,95,150,30,"lon: 0");
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->mode_lbl = obj = fl_add_text(FL_NORMAL_TEXT,640,160,90,20,"Mode: SGL");
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->idx_lbl = obj = fl_add_text(FL_NORMAL_TEXT,730,160,110,20,"Idx: ");
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_RIGHT|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
obj = fl_add_box(FL_ROUNDED_BOX,460,610,140,90,"");
fl_set_object_color(obj,FL_DARKCYAN,FL_COL1);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fdui->power_btn = obj = fl_add_button(FL_NORMAL_BUTTON,130,620,100,70,"PWR");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_MEDIUM_SIZE);
fl_set_object_callback(obj,power_callback,0);
fdui->buffer_lbl = obj = fl_add_text(FL_NORMAL_TEXT,760,15,90,20,"Buffer: 100%");
fl_set_object_boxtype(obj,FL_ROUNDED_BOX);
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->cap_xyp = obj = fl_add_xyplot(FL_NORMAL_XYPLOT,640,310,200,250,"Capacity");
fl_set_object_color(obj,FL_BLACK,FL_RIGHT_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fdui->refresh_lbl = obj = fl_add_text(FL_NORMAL_TEXT,655,185,170,20,"Refresh interval: 1s");
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
obj = fl_add_box(FL_ROUNDED_BOX,860,90,140,220,"");
fl_set_object_color(obj,FL_DARKER_COL1,FL_COL1);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fdui->refresh_dial = obj = fl_add_dial(FL_NORMAL_DIAL,890,110,80,70,"screen refresh rate");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_RIGHT_BCOL);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fl_set_object_callback(obj,refresh_callback,0);
fl_set_dial_bounds(obj, 0, 5);
fl_set_dial_angles(obj, 45, 315);
fl_set_dial_value(obj, 1);
fl_set_dial_step(obj, 1);
fl_set_dial_return(obj, FL_RETURN_CHANGED);
obj = fl_add_box(FL_ROUNDED_BOX,860,460,140,140,"");
fl_set_object_color(obj,FL_INDIANRED,FL_COL1);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fdui->bler_lbl = obj = fl_add_text(FL_NORMAL_TEXT,650,210,180,20,"BLER:: 0");
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->n_recd_frames_lbl = obj = fl_add_text(FL_NORMAL_TEXT,650,235,180,20,"Rec'd frms: 0");
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->msg_text = obj = fl_add_text(FL_NORMAL_TEXT,25,570,810,30,"");
fl_set_object_color(obj,FL_BLACK,FL_MCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
obj = fl_add_pixmapbutton(FL_NORMAL_BUTTON,860,5,140,70,"");
fl_set_object_boxtype(obj,FL_ROUNDED_BOX);
fl_set_object_color(obj,FL_WHITE,FL_YELLOW);
fl_set_pixmapbutton_file(obj, "Eurecom_Logo.xpm");
fdui->rx1_lbl = obj = fl_add_text(FL_NORMAL_TEXT,35,10,80,40,"RX 1");
fl_set_object_color(obj,FL_BLACK,FL_MCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lsize(obj,FL_HUGE_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
obj = fl_add_box(FL_ROUNDED_BOX,610,610,180,90,"");
fl_set_object_color(obj,FL_WHEAT,FL_COL1);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fdui->terminal_mode_btn = obj = fl_add_button(FL_NORMAL_BUTTON,635,620,130,20,"terminal mode");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,terminal_mode_callback,0);
fdui->single_led = obj = fl_add_box(FL_EMBOSSED_BOX,640,650,10,10,"Single user");
fl_set_object_color(obj,FL_RIGHT_BCOL,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_RIGHT);
fdui->multi_led = obj = fl_add_box(FL_EMBOSSED_BOX,640,670,10,10,"Multi user");
fl_set_object_color(obj,FL_RIGHT_BCOL,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_RIGHT);
fdui->mmse_btn = obj = fl_add_button(FL_PUSH_BUTTON,480,655,100,20,"MMSE");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,rx_mode_button_callback,1);
fdui->ml_btn = obj = fl_add_button(FL_PUSH_BUTTON,480,675,100,20,"ML");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,rx_mode_button_callback,2);
fdui->cbmimo_lbl = obj = fl_add_text(FL_NORMAL_TEXT,665,40,70,20,"cbmimo");
fl_set_object_boxtype(obj,FL_ROUNDED_BOX);
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->file_index_dial = obj = fl_add_dial(FL_NORMAL_DIAL,890,485,80,70,"file index");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_RIGHT_BCOL);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fl_set_object_callback(obj,file_index_callback,0);
fl_set_dial_bounds(obj, 0, 100);
fl_set_dial_angles(obj, 10, 350);
fl_set_dial_value(obj, 0);
fl_set_dial_step(obj, 10);
obj = fl_add_button(FL_NORMAL_BUTTON,870,560,40,30,"+");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fl_set_object_callback(obj,file_index_callback,1);
obj = fl_add_button(FL_NORMAL_BUTTON,950,560,40,30,"-");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fl_set_object_callback(obj,file_index_callback,-1);
obj = fl_add_box(FL_ROUNDED_BOX,860,320,140,130,"");
fl_set_object_color(obj,FL_PALEGREEN,FL_COL1);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fdui->num_sym_dial = obj = fl_add_dial(FL_NORMAL_DIAL,890,340,80,70,"number of symbols");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_RIGHT_BCOL);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_TOP);
fl_set_dial_bounds(obj, 0, 5);
fl_set_dial_angles(obj, 30, 360);
fl_set_dial_value(obj, 0);
fl_set_dial_step(obj, 0.5);
fdui->fix_lbl = obj = fl_add_text(FL_NORMAL_TEXT,640,95,60,30,"NO");
fl_set_object_boxtype(obj,FL_ROUNDED_BOX);
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
obj = fl_add_box(FL_ROUNDED_BOX,800,610,200,90,"");
fl_set_object_color(obj,FL_INDIANRED,FL_COL1);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fdui->rec_btn = obj = fl_add_button(FL_PUSH_BUTTON,820,620,160,70,"Record");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,record_callback,0);
fdui->exit_btn = obj = fl_add_button(FL_NORMAL_BUTTON,20,660,90,30,"exit");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_TOMATO,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,exit_callback,0);
fdui->config_btn = obj = fl_add_button(FL_NORMAL_BUTTON,20,620,90,30,"config");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,config_btn_callback,0);
obj = fl_add_box(FL_ROUNDED_BOX,250,610,200,90,"");
fl_set_object_color(obj,FL_PALEGREEN,FL_COL1);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fdui->terminal_btn1 = obj = fl_add_button(FL_PUSH_BUTTON,270,650,40,40,"CH1");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fl_set_object_callback(obj,terminal_button_callback,1);
fdui->terminal_btn2 = obj = fl_add_button(FL_PUSH_BUTTON,310,650,40,40,"CH2");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fl_set_object_callback(obj,terminal_button_callback,2);
fdui->terminal_btn3 = obj = fl_add_button(FL_PUSH_BUTTON,350,650,40,40,"MR1");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fl_set_object_callback(obj,terminal_button_callback,3);
fdui->terminal_btn4 = obj = fl_add_button(FL_PUSH_BUTTON,390,650,40,40,"MR2");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fl_set_object_callback(obj,terminal_button_callback,4);
obj = fl_add_text(FL_NORMAL_TEXT,300,620,110,20,"terminal number");
fl_set_object_color(obj,FL_PALEGREEN,FL_MCOL);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
obj = fl_add_button(FL_NORMAL_BUTTON,870,180,40,30,"+");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fl_set_object_callback(obj,refresh_callback,1);
obj = fl_add_button(FL_NORMAL_BUTTON,950,180,40,30,"-");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fl_set_object_callback(obj,refresh_callback,-1);
fdui->time_domain_btn = obj = fl_add_button(FL_PUSH_BUTTON,870,235,60,20,"time");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,time_freq_callback,0);
fdui->freq_domain_btn = obj = fl_add_button(FL_PUSH_BUTTON,930,235,60,20,"freq");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,time_freq_callback,1);
obj = fl_add_text(FL_NORMAL_TEXT,875,215,110,20,"channel display");
fl_set_object_color(obj,FL_DARKER_COL1,FL_MCOL);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fdui->refresh_timer = obj = fl_add_timer(FL_HIDDEN_TIMER,810,720,10,10,"timer");
fl_set_object_callback(obj,refresh_timer_callback,0);
obj = fl_add_text(FL_NORMAL_TEXT,875,260,110,20,"N0/SNR");
fl_set_object_color(obj,FL_DARKER_COL1,FL_MCOL);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fdui->n0_btn = obj = fl_add_button(FL_PUSH_BUTTON,870,280,60,20,"N0");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,noise_snr_callback,0);
fdui->snr_btn = obj = fl_add_button(FL_PUSH_BUTTON,930,280,60,20,"SNR");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,noise_snr_callback,1);
fdui->num_sym_plus = obj = fl_add_button(FL_NORMAL_BUTTON,870,415,40,30,"+");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->num_sym_minus = obj = fl_add_button(FL_NORMAL_BUTTON,950,415,40,30,"-");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->rx_mode_lbl = obj = fl_add_text(FL_NORMAL_TEXT,650,260,180,20,"RX mode:");
fl_set_object_color(obj,FL_BLACK,FL_TOP_BCOL);
fl_set_object_lcolor(obj,FL_RIGHT_BCOL);
fl_set_object_lalign(obj,FL_ALIGN_CENTER|FL_ALIGN_INSIDE);
fl_set_object_lstyle(obj,FL_BOLD_STYLE);
fdui->single_btn = obj = fl_add_button(FL_PUSH_BUTTON,480,635,100,20,"SINGLE");
fl_set_object_boxtype(obj,FL_ROUNDED3D_UPBOX);
fl_set_object_color(obj,FL_LIGHTER_COL1,FL_COL1);
fl_set_object_lsize(obj,FL_TINY_SIZE);
fl_set_object_callback(obj,rx_mode_button_callback,0);
obj = fl_add_text(FL_NORMAL_TEXT,480,615,100,20,"receiver mode");
fl_set_object_boxtype(obj,FL_NO_BOX);
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fl_end_form();
fdui->main_frm->fdui = fdui;
return fdui;
}
/*---------------------------------------*/
FD_splash_frm *create_form_splash_frm(void)
{
FL_OBJECT *obj;
FD_splash_frm *fdui = (FD_splash_frm *) fl_calloc(1, sizeof(*fdui));
fdui->splash_frm = fl_bgn_form(FL_NO_BOX, 390, 280);
obj = fl_add_box(FL_FLAT_BOX,0,0,390,280,"");
obj = fl_add_pixmap(FL_NORMAL_PIXMAP,40,20,310,100,"");
obj = fl_add_text(FL_NORMAL_TEXT,70,150,80,30,"text");
fl_set_object_lalign(obj,FL_ALIGN_LEFT|FL_ALIGN_INSIDE);
fl_end_form();
fdui->splash_frm->fdui = fdui;
return fdui;
}
/*---------------------------------------*/
FD_config_dialog *create_form_config_dialog(void)
{
FL_OBJECT *obj;
FD_config_dialog *fdui = (FD_config_dialog *) fl_calloc(1, sizeof(*fdui));
fdui->config_dialog = fl_bgn_form(FL_NO_BOX, 410, 120);
obj = fl_add_box(FL_UP_BOX,0,0,410,120,"");
fdui->cancel_btn = obj = fl_add_button(FL_NORMAL_BUTTON,80,75,100,30,"Cancel");
fl_set_object_callback(obj,get_dir_callback,-1);
fdui->ok_btn = obj = fl_add_button(FL_RETURN_BUTTON,225,75,100,30,"OK");
fl_set_object_callback(obj,get_dir_callback,0);
fdui->dir_input = obj = fl_add_input(FL_NORMAL_INPUT,80,30,300,30,"Directory");
fl_end_form();
fdui->config_dialog->fdui = fdui;
return fdui;
}
/*---------------------------------------*/
openair1/EMOS/GUI/src/emos_gui_forms.fd
-1519
View File
File diff suppressed because it is too large Load Diff
openair1/EMOS/GUI/src/emos_gui_forms.h
-137
View File
@@ -1,137 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
/** Header file generated with fdesign on Fri Apr 24 14:16:53 2009.**/
#ifndef FD_main_frm_h_
#define FD_main_frm_h_
/** Callbacks, globals and object handlers **/
extern void power_callback(FL_OBJECT *, long);
extern void refresh_callback(FL_OBJECT *, long);
extern void terminal_mode_callback(FL_OBJECT *, long);
extern void rx_mode_button_callback(FL_OBJECT *, long);
extern void file_index_callback(FL_OBJECT *, long);
extern void record_callback(FL_OBJECT *, long);
extern void exit_callback(FL_OBJECT *, long);
extern void config_btn_callback(FL_OBJECT *, long);
extern void terminal_button_callback(FL_OBJECT *, long);
extern void time_freq_callback(FL_OBJECT *, long);
extern void refresh_timer_callback(FL_OBJECT *, long);
extern void noise_snr_callback(FL_OBJECT *, long);
extern void get_dir_callback(FL_OBJECT *, long);
/**** Forms and Objects ****/
typedef struct {
FL_FORM *main_frm;
void *vdata;
char *cdata;
long ldata;
FL_OBJECT *sync_lbl;
FL_OBJECT *rec_lbl;
FL_OBJECT *pwr1_xyp;
FL_OBJECT *pwr2_xyp;
FL_OBJECT *rx2_lbl;
FL_OBJECT *noise1_xyp;
FL_OBJECT *noise2_xyp;
FL_OBJECT *ch11_xyp;
FL_OBJECT *ch12_xyp;
FL_OBJECT *ch13_xyp;
FL_OBJECT *ch14_xyp;
FL_OBJECT *ch21_xyp;
FL_OBJECT *ch22_xyp;
FL_OBJECT *ch23_xyp;
FL_OBJECT *ch24_xyp;
FL_OBJECT *error_lbl;
FL_OBJECT *gps_lbl;
FL_OBJECT *date_lbl;
FL_OBJECT *gps_lat_lbl;
FL_OBJECT *gps_lon_lbl;
FL_OBJECT *mode_lbl;
FL_OBJECT *idx_lbl;
FL_OBJECT *power_btn;
FL_OBJECT *buffer_lbl;
FL_OBJECT *cap_xyp;
FL_OBJECT *refresh_lbl;
FL_OBJECT *refresh_dial;
FL_OBJECT *bler_lbl;
FL_OBJECT *n_recd_frames_lbl;
FL_OBJECT *msg_text;
FL_OBJECT *rx1_lbl;
FL_OBJECT *terminal_mode_btn;
FL_OBJECT *single_led;
FL_OBJECT *multi_led;
FL_OBJECT *mmse_btn;
FL_OBJECT *ml_btn;
FL_OBJECT *cbmimo_lbl;
FL_OBJECT *file_index_dial;
FL_OBJECT *num_sym_dial;
FL_OBJECT *fix_lbl;
FL_OBJECT *rec_btn;
FL_OBJECT *exit_btn;
FL_OBJECT *config_btn;
FL_OBJECT *terminal_btn1;
FL_OBJECT *terminal_btn2;
FL_OBJECT *terminal_btn3;
FL_OBJECT *terminal_btn4;
FL_OBJECT *time_domain_btn;
FL_OBJECT *freq_domain_btn;
FL_OBJECT *refresh_timer;
FL_OBJECT *n0_btn;
FL_OBJECT *snr_btn;
FL_OBJECT *num_sym_plus;
FL_OBJECT *num_sym_minus;
FL_OBJECT *rx_mode_lbl;
FL_OBJECT *single_btn;
} FD_main_frm;
extern FD_main_frm * create_form_main_frm(void);
typedef struct {
FL_FORM *splash_frm;
void *vdata;
char *cdata;
long ldata;
} FD_splash_frm;
extern FD_splash_frm * create_form_splash_frm(void);
typedef struct {
FL_FORM *config_dialog;
void *vdata;
char *cdata;
long ldata;
FL_OBJECT *cancel_btn;
FL_OBJECT *ok_btn;
FL_OBJECT *dir_input;
} FD_config_dialog;
extern FD_config_dialog * create_form_config_dialog(void);
#endif /* FD_main_frm_h_ */
openair1/EMOS/GUI/src/make_links.sh
-11
View File
@@ -1,11 +0,0 @@
#!/bin/bash
# Make all the symlinks required for the emos_dump project
# Leonardo Cardoso
#
# V20070924
OPENAIR_PATH="../../../";
ln -sf ${OPENAIR_PATH}PHY/CONFIG/emos.cfg config.cfg
ln -sf ${OPENAIR_PATH}PHY/CONFIG/emos.scn scenario.scn
openair1/EMOS/GUI/src/matrix_util.c
-106
View File
@@ -1,106 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
// Matrix Utilities for Capacity Calculations
// by Florian Kaltenberger
// Created 10.10.2007
# include "matrix_util.h"
#include <stdio.h>
#include <stdlib.h>
// This function calculates HxH^H for a complex matrix H
// HH must be a pre-allocated matrix of size rows x rows
// The function returns NULL on error and a pointer to the
// calculated matrix otherwise
struct complexf **square_mat(struct complexf **H, int rows, int cols, struct complexf **HH)
{
int r,r2,c;
if (H==NULL || HH==NULL || rows == 0 || cols == 0)
return NULL;
for (r=0; r<rows; r++) {
for (r2=0; r2<rows; r2++) {
HH[r][r2].r = 0;
HH[r][r2].i = 0;
for (c=0; c<cols; c++) {
HH[r][r2].r += H[r][c].r * H[r2][c].r + H[r][c].i * H[r2][c].i;
HH[r][r2].i += H[r][c].i * H[r2][c].r - H[r][c].r * H[r2][c].i;
}
}
}
return HH;
}
// This function scales the matrix H with the factor scale and adds I
// The original matrix is overwritten
struct complexf **addI_scale_mat(struct complexf **H, int rows, float scale)
{
int r,r2;
if (H==NULL || rows == 0)
return NULL;
for (r=0; r<rows; r++) {
for (r2=0; r2<rows; r2++) {
H[r][r2].r *= scale;
H[r][r2].i *= scale;
if (r==r2) {
H[r][r2].r += 1;
H[r][r2].i += 1;
}
}
}
return H;
}
// This function calculates the determinant of a 2x2 Hermitian matrix H
// The result will be real
float det(struct complexf **H)
{
return H[0][0].r * H[1][1].r - (H[0][1].r * H[0][1].r + H[0][1].i * H[0][1].i);
}
float norm_fro_sq(struct complexf**H, int rows, int cols)
{
float norm=0;
int ar,ac;
for (ar=0; ar<rows; ar++) {
for (ac=0; ac<cols; ac++) {
norm += H[ar][ac].r * H[ar][ac].r + H[ar][ac].i * H[ar][ac].i;
}
}
return norm;
}
openair1/EMOS/GUI/src/matrix_util.h
-41
View File
@@ -1,41 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
// Matrix Utilities for Capacity Calculations
// by Florian Kaltenberger
// Created 10.10.2007
# include "PHY/TOOLS/defs.h"
struct complexf **square_mat(struct complexf **H, int rows, int cols, struct complexf **HH);
struct complexf **addI_scale_mat(struct complexf **H, int rows, float scale);
float det(struct complexf **H);
float norm_fro_sq(struct complexf**H, int rows, int cols);
openair1/EMOS/LTE/GUI/COPYING
-674
View File
@@ -1,674 +0,0 @@
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>.
openair1/EMOS/LTE/GUI/Eurecom_Logo.png
BIN
View File
Binary file not shown.
Side by Side

Before

Width:  |  Height:  |  Size: 2.5 KiB

openair1/EMOS/LTE/GUI/Eurecom_Logo.xpm
-554
View File
@@ -1,554 +0,0 @@
/* XPM */
static char * Eurecom_Logo_xpm[] = {
"106 50 501 2",
" c None",
". c #FFFFFF",
"+ c #FCFCFC",
"@ c #DADADC",
"# c #D5D5D6",
"$ c #E2E2E3",
"% c #F7F7F7",
"& c #C2C2C4",
"* c #BDBEC1",
"= c #DBDADC",
"- c #EFEFEF",
"; c #BDC0C3",
"> c #BFC0C3",
", c #BEC0C3",
"' c #BDBFC3",
") c #B2BEC4",
"! c #B2BEC5",
"~ c #B3BFC5",
"{ c #DBE6EA",
"] c #EFFAFE",
"^ c #F9FDFF",
"/ c #FEFFFE",
"( c #FBFBFB",
"_ c #F4F4F4",
": c #B8DEEC",
"< c #16B0EB",
"[ c #21B7F0",
"} c #22B8F0",
"| c #BFEAFA",
"1 c #FEFEFD",
"2 c #FEFEFE",
"3 c #87D7F3",
"4 c #02ADEF",
"5 c #0AAEED",
"6 c #D8F2FB",
"7 c #F0F0F1",
"8 c #EEEEEF",
"9 c #EEEFEF",
"0 c #74C9EA",
"a c #34B3E3",
"b c #35B3E3",
"c c #35B3E4",
"d c #37B6E6",
"e c #3DBCEB",
"f c #3DBCEC",
"g c #47C1EF",
"h c #F1FAFD",
"i c #C2C1C3",
"j c #BBBDC0",
"k c #BBBDC1",
"l c #BABDC0",
"m c #BCBEC1",
"n c #D3D6D8",
"o c #F9FDFD",
"p c #F8FDFD",
"q c #F9FDFC",
"r c #FAFDFD",
"s c #FDFEFF",
"t c #F6F6F7",
"u c #BEBFC1",
"v c #E1E1E1",
"w c #FFFFFE",
"x c #F6F6F6",
"y c #DCDCDE",
"z c #DDDDDF",
"A c #DCDDDE",
"B c #AFCDDA",
"C c #52B5DC",
"D c #5DB6D9",
"E c #5AB6DA",
"F c #59B6DA",
"G c #5CB6DA",
"H c #5BB6DA",
"I c #5BB6D9",
"J c #6BC6E8",
"K c #80D1F0",
"L c #80D1EF",
"M c #DCF2F8",
"N c #86D8F7",
"O c #13B2EF",
"P c #D6F1F9",
"Q c #FDFDFD",
"R c #5EC9F0",
"S c #06AEEF",
"T c #05AEEF",
"U c #07AFEF",
"V c #26B9F1",
"W c #EEF9FC",
"X c #FAFAFA",
"Y c #CBCDD0",
"Z c #C9C9CB",
"` c #C6C8CA",
" . c #A5C2CC",
".. c #9BC1CE",
"+. c #9AC0CD",
"@. c #9BC0CD",
"#. c #99BFCC",
"$. c #97BECB",
"%. c #98BECC",
"&. c #ABD2E0",
"*. c #C4ECF9",
"=. c #C5EDFB",
"-. c #CDEFFA",
";. c #FCFEFC",
">. c #F2F2F2",
",. c #C0C0C3",
"'. c #BEBEC1",
"). c #BEBEC0",
"!. c #BFBEC0",
"~. c #C0BFC0",
"{. c #E2E1E1",
"]. c #EDECEC",
"^. c #C4C4C6",
"/. c #C5C4C6",
"(. c #BCC1C5",
"_. c #9CBECB",
":. c #9BBECB",
"<. c #9DBECB",
"[. c #9EBECA",
"}. c #A5BCC4",
"|. c #A0BDC8",
"1. c #9BBECC",
"2. c #BFDDE9",
"3. c #CBEEFB",
"4. c #CAEEFB",
"5. c #CAEEFA",
"6. c #E9F8FB",
"7. c #AEE4F9",
"8. c #03ADEF",
"9. c #B1E3F4",
"0. c #FDFEFC",
"a. c #DAF3FC",
"b. c #9BDDF6",
"c. c #61CBF4",
"d. c #67CDF4",
"e. c #F7FDFD",
"f. c #FEFFFD",
"g. c #DDDCDD",
"h. c #DEDDDE",
"i. c #F7F6F6",
"j. c #F8F8F8",
"k. c #E5E6E7",
"l. c #E8E8E9",
"m. c #E3E4E5",
"n. c #E1E1E2",
"o. c #E5E4E5",
"p. c #D0CFCF",
"q. c #BAB9BA",
"r. c #C4C3C3",
"s. c #F8F7F8",
"t. c #D2D1D2",
"u. c #BCBBBB",
"v. c #C3C1C2",
"w. c #E7E9EA",
"x. c #E9E9EA",
"y. c #DDDDDD",
"z. c #EDEDED",
"A. c #DCDCDC",
"B. c #F0F1F2",
"C. c #7D7C7D",
"D. c #2A2728",
"E. c #2D2A2B",
"F. c #393637",
"G. c #DAD9DA",
"H. c #B3B2B2",
"I. c #312D2E",
"J. c #EEEEEE",
"K. c #514F50",
"L. c #858384",
"M. c #B0AEAF",
"N. c #292627",
"O. c #2F2C2D",
"P. c #312E2F",
"Q. c #2E2C2D",
"R. c #4B4848",
"S. c #CDCCCD",
"T. c #EAE9EA",
"U. c #343031",
"V. c #2C292A",
"W. c #757374",
"X. c #FBFAFB",
"Y. c #9F9D9E",
"Z. c #403D3E",
"`. c #3A3738",
" + c #4A4748",
".+ c #373435",
"++ c #6F6D6F",
"@+ c #F3F4F5",
"#+ c #C1C0C1",
"$+ c #4D4A4B",
"%+ c #363334",
"&+ c #4B4849",
"*+ c #373434",
"=+ c #333031",
"-+ c #A1A1A3",
";+ c #5D5A5B",
">+ c #2A2627",
",+ c #B3B1B2",
"'+ c #4A4A4C",
")+ c #282526",
"!+ c #BDBFC1",
"~+ c #484546",
"{+ c #7E7C7C",
"]+ c #E6E6E7",
"^+ c #E7E7E7",
"/+ c #E5E7E8",
"(+ c #807E7F",
"_+ c #4D4C4E",
":+ c #E2E1E2",
"<+ c #7E7C7D",
"[+ c #4F4E50",
"}+ c #F0F0F0",
"|+ c #D7D9DA",
"1+ c #434041",
"2+ c #4E4D4F",
"3+ c #F6F7F7",
"4+ c #BFBEBF",
"5+ c #2B2728",
"6+ c #CDCDCE",
"7+ c #E7E6E7",
"8+ c #F1F2F2",
"9+ c #F7F7F8",
"0+ c #767475",
"a+ c #B5B6B7",
"b+ c #FAF9F9",
"c+ c #BAB9B9",
"d+ c #615E5F",
"e+ c #ABAAAB",
"f+ c #2D292A",
"g+ c #989798",
"h+ c #F2F4F5",
"i+ c #F3F3F3",
"j+ c #7F7D7E",
"k+ c #221E1F",
"l+ c #CBCBCB",
"m+ c #322F30",
"n+ c #484646",
"o+ c #797778",
"p+ c #828081",
"q+ c #2B2829",
"r+ c #E8E8E8",
"s+ c #292526",
"t+ c #B7B5B6",
"u+ c #F8F9F9",
"v+ c #BDBCBD",
"w+ c #252122",
"x+ c #E6E6E6",
"y+ c #F7F8F8",
"z+ c #4B4A4B",
"A+ c #8B898A",
"B+ c #3F3D3F",
"C+ c #F2F2F3",
"D+ c #8D8B8C",
"E+ c #474445",
"F+ c #F5F5F5",
"G+ c #A5A4A4",
"H+ c #2F2B2C",
"I+ c #9B999A",
"J+ c #383536",
"K+ c #808183",
"L+ c #C6C5C5",
"M+ c #4D494A",
"N+ c #3E3A3B",
"O+ c #7B7A7A",
"P+ c #F7F6F7",
"Q+ c #292628",
"R+ c #D0D2D3",
"S+ c #F0EFEF",
"T+ c #EAEAEA",
"U+ c #B2B1B1",
"V+ c #8C8A8B",
"W+ c #3F3D3E",
"X+ c #B4B3B3",
"Y+ c #504D4E",
"Z+ c #737272",
"`+ c #5A5758",
" @ c #706D6E",
".@ c #F2F1F1",
"+@ c #3F3B3C",
"@@ c #868485",
"#@ c #7D7B7B",
"$@ c #474547",
"%@ c #F2F3F4",
"&@ c #555253",
"*@ c #696667",
"=@ c #999898",
"-@ c #D6D6D6",
";@ c #E3E2E2",
">@ c #E9E9E9",
",@ c #444142",
"'@ c #B5B4B4",
")@ c #585556",
"!@ c #7A7879",
"~@ c #322E2F",
"{@ c #353132",
"]@ c #C2C1C2",
"^@ c #5D5B5C",
"/@ c #737374",
"(@ c #C2C1C1",
"_@ c #D1D0D0",
":@ c #787676",
"<@ c #454243",
"[@ c #DFDFDF",
"}@ c #FEFDFE",
"|@ c #CCCBCC",
"1@ c #262223",
"2@ c #CFCECE",
"3@ c #747375",
"4@ c #636263",
"5@ c #868484",
"6@ c #F1F1F1",
"7@ c #3D393A",
"8@ c #B8B9BA",
"9@ c #737172",
"0@ c #7C7B7C",
"a@ c #AAA9A9",
"b@ c #5B595A",
"c@ c #696767",
"d@ c #D7D6D6",
"e@ c #D5D5D5",
"f@ c #EBEBEC",
"g@ c #A8A6A7",
"h@ c #8F8D8E",
"i@ c #E6E5E5",
"j@ c #CBCBCC",
"k@ c #282425",
"l@ c #B7B6B6",
"m@ c #D7D6D7",
"n@ c #E4E3E3",
"o@ c #A9A8A8",
"p@ c #DFDEDF",
"q@ c #383435",
"r@ c #9E9D9E",
"s@ c #373536",
"t@ c #B2B3B5",
"u@ c #6A6768",
"v@ c #494647",
"w@ c #ECEBEC",
"x@ c #CFCECF",
"y@ c #EAEAEB",
"z@ c #373335",
"A@ c #AAA8A9",
"B@ c #5C5A5B",
"C@ c #6B696A",
"D@ c #CBCACB",
"E@ c #D8D7D7",
"F@ c #595758",
"G@ c #6A696A",
"H@ c #D9D8D8",
"I@ c #878585",
"J@ c #9B9A9B",
"K@ c #3B3839",
"L@ c #9D9B9C",
"M@ c #343132",
"N@ c #D5D4D4",
"O@ c #BEBDBD",
"P@ c #272324",
"Q@ c #D8D8D9",
"R@ c #9A9B9C",
"S@ c #242122",
"T@ c #CECDCE",
"U@ c #9C9B9C",
"V@ c #3E3C3D",
"W@ c #F0F2F2",
"X@ c #231F20",
"Y@ c #DAD9D9",
"Z@ c #7B797A",
"`@ c #514E4F",
" # c #332F30",
".# c #A1A2A3",
"+# c #ABA9AA",
"@# c #262324",
"## c #CAC9C9",
"$# c #696768",
"%# c #5E5C5D",
"&# c #AFAEAF",
"*# c #CFD0D1",
"=# c #E2E4E5",
"-# c #9A9899",
";# c #EDEEEE",
"># c #4C4A4C",
",# c #716F6F",
"'# c #A9A7A8",
")# c #E4E4E4",
"!# c #C0BFBF",
"~# c #656466",
"{# c #686566",
"]# c #9E9C9D",
"^# c #F9F9F9",
"/# c #59595A",
"(# c #F1F0F1",
"_# c #B8B7B8",
":# c #B9B8B8",
"<# c #605D5E",
"[# c #4E4B4C",
"}# c #F4F3F3",
"|# c #959494",
"1# c #FAF9FA",
"2# c #605E60",
"3# c #8D8C8D",
"4# c #595657",
"5# c #403C3D",
"6# c #DADBDD",
"7# c #E8E7E8",
"8# c #E6E5E6",
"9# c #747172",
"0# c #706E6F",
"a# c #9C9A9B",
"b# c #6F6D6D",
"c# c #E3E3E3",
"d# c #CCCCCC",
"e# c #575455",
"f# c #ABADAE",
"g# c #9F9FA0",
"h# c #E6E6E5",
"i# c #302D2E",
"j# c #8E8C8D",
"k# c #2E2B2C",
"l# c #7A7878",
"m# c #C3C2C3",
"n# c #524F50",
"o# c #484547",
"p# c #C6C6C6",
"q# c #DFDEDE",
"r# c #4C494A",
"s# c #525051",
"t# c #A7A6A6",
"u# c #CDCCCC",
"v# c #DBDADA",
"w# c #D3D3D3",
"x# c #B6B4B5",
"y# c #A4A3A4",
"z# c #E2E4E4",
"A# c #D9D8D9",
"B# c #D8D7D8",
"C# c #FDFCFC",
"D# c #D0D0D0",
"E# c #EEEDEE",
"F# c #A5A3A4",
"G# c #AFAEAE",
"H# c #D3D2D3",
"I# c #C5C4C4",
"J# c #A7A5A5",
"K# c #D4D3D3",
"L# c #F3F4F4",
"M# c #F9F9FA",
"N# c #FBFAFA",
"O# c #D4D3D4",
"P# c #D2D2D4",
"Q# c #DEDEDF",
"R# c #EAE9E9",
"S# c #C3C4C6",
"T# c #E9EAEB",
"U# c #F5F5F6",
"V# c #BFC1C2",
"W# c #C6C5C6",
"X# c #ECECEC",
"Y# c #F6F7F8",
"Z# c #DBDBDC",
"`# c #FDFCFD",
" $ c #F4F3F2",
".$ c #D4D5D6",
"+$ c #E1E0E1",
"@$ c #E2E2E2",
"#$ c #BCBEBF",
"$$ c #DCDEE0",
"%$ c #CECECF",
"&$ c #D3D5D6",
"*$ c #C5C4C5",
"=$ c #CACACA",
"-$ c #ACABAC",
";$ c #BFBFC0",
">$ c #CECECE",
",$ c #C2C2C3",
"'$ c #DBDADB",
")$ c #C9C9CA",
"!$ c #C8C7C8",
"~$ c #CDCFD0",
"{$ c #C9CACA",
"]$ c #E3E3E4",
"^$ c #E8EAEA",
"/$ c #B7B6B7",
"($ c #E4E4E5",
"_$ c #C5C5C6",
":$ c #E0E0E0",
"<$ c #BBBABB",
"[$ c #D2D4D5",
"}$ c #CCCCCD",
"|$ c #CACACB",
"1$ c #FEFFFF",
"2$ c #E4E6E7",
"3$ c #D7D9DB",
"4$ c #D7D7D8",
"5$ c #D8DADB",
"6$ c #F9FAF9",
"7$ c #B0AFB0",
"8$ c #FEFDFD",
"9$ c #D7D7D7",
"0$ c #C9C9C9",
"a$ c #DEDEDE",
"b$ c #C9C8C9",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . + @ # # # # # # # # # # # # # # # # # # # # $ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . % & * * * * * * * * * * * * * * * * * * * * = . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ; ; > , ; ; ; ' ) ! ~ ~ ~ ~ ~ ~ ~ ~ ~ ! ) { ] ] ] ] ] ] ] ^ / . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ( _ _ _ _ _ _ _ : < < < < < < < < < < < < < [ } } } } } } } | 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 . . . . . . . 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 8 9 9 9 9 9 9 0 a a a a a a b a c a c a d e e e e e e f g h . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 i * * * * * * * * j j j j j j k l m l m j n o p p q q q r s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . t u * * * * * * * * * * * * * * * * * * * * v w w w w w w w / . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x y z z z z z A B C D D E F F D D G F F H I J K K K K K K L M / . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . N 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 O P . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Q Q Q Q Q Q Q Q R S S S S S T S S S T S S S U U U U U U U V W . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . X Y Z Z Z Z Z Z ` ...+.@.@.#.$.@.@.@.%.#.@.&.*.=.=.=.=.=.=.-.;.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . >.,.* * * * * * * '.).!.!.!.!.!.!.!.!.!.!.~.{.1 1 1 1 1 1 / 1 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ].^././././././.(._.:.<.[.}.|.<.<.|.}.[.<.1.2.3.4.4.4.4.4.5.6.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Q Q Q Q Q Q Q 7.4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8.9.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0.3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8.a.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . w 0.b.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.c.d.e.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 f.. . . . . . . . . . . . . . . . . . . . f.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . - g.g.g.g.g.h.i.. . . . % h.j.. . . . k.l.. . . . . % h.g.g.m.X . . . . . . . Q n.g.g.g.g.g.o.2 . . . . . . >.p.q.r.{.2 . . . . . . . s.t.u.v.w.. . . . . . . . x.y.x . . . . z.A.B.. . . . . . . . ",
". . . . . . . . C.D.E.E.E.E.F.G.. . . . H.I.J.. . . ( K.L.. . . . . M.N.O.P.Q.R.S.. . . . . . T.U.V.E.E.E.E.W.Q . . . . X.Y.Z.`. +.+V.++@+. . . 2 2 #+$+%+&+*+=+-+2 . . . . . ( ;+>+,+. . . _ '+)+!+. . . . . . . . ",
". . . . . . . Q ~+{+]+]+]+^+/++ . . . 2 (+_+X . . . :+V.q.. . . . 2 <+[+- }+|+1+2+3+. . . . . 4+5+6+7+7+7+k.8+. . . . 9+0+`.a+b+. s.c+d+x . . . 2 e+f+g+h+. i+j+k+l+. . . . . ^+m+n+o+. . Q p+m+q+^+. . . . . . . . ",
". . . . . . . r+s+t+. . . . . . . . . u+_+<+2 . . . v+w+x+. . . . y+z+L.2 . . A+B+C+. . . . . D+E+F+. . . . . . . . . G+E.t.. . . . 2 i+2 . . . y.H+I++ . . . J.J+K+. . . . 2 L+O.Y.M+x . ~.N+O+~+P+. . . . . . . . ",
". . . . . . . 4+Q+R+S+S+S+S+b+. . . . T+q+U+. . . . V+W+Q . . . . T+D.X+. . + Y+Z++ . . . . 2 `+ @- S+S+S+.@. . . . F++@@@2 . . . . 2 . . . . . #@$@%@. . . . 2 &@*@. . . . 2 =@Y+-@P.;@>@,@'@)@!@2 . . . . . . . . ",
". . . . . . . A+k+~@{@{@{@=+S.. . . . ]@>+A.. . . X ^@/@. . . . . ~.w+(@v _@:@<@[@. . . . . B.~@>+{@{@{@{@d+}@. . . |@1@2@. . . . . . . . . . i.F.D+. . . . . Q $+3@. . . . + 4@5@6@7@8@9@0@}+V.a@. . . . . . . . . ",
". . . . . . Q b@c@d@d@d@d@e@X . . . . D+1+i+. . . f@=+g@. . . . . h@k+U.I.s+o+i@. . . . . . j@k@l@d@d@d@m@n@. . . . o@m+x+. . . . . . . . . . p@k@l@. . . . . J.q@r@. . . . i+s@t@Q u@$+v@w@x@k@m@. . . . . . . . . ",
". . . . . . y@z@A@. . . . . . . . . . B@C@. . . . D@1@E@. . . . . F@G@z.H@%+I@2 . . . . . . J@K@_ . . . . . . . . . L@M@>@. . . . . . . . . . N@1@O@. . . . . '@P@p@. . . . Q@O.h.. R@S@T@2 U@V@W@. . . . . . . . . ",
". . . . . . l+X@Y@. . . . . . . . . . E+p+. . . 2 Z@`@x . . . . }+ #.#. . +#@###. . . . . 2 $#%#. . . . . . . . . . &#w+*#. . . . . W@. . . . =#N.-#. . . . ;#>#,#. . . . . '#<@_ . )#!#. . ~#{#2 . . . . . . . . . ",
". . . . . . ]#.+}+^#^#^#^#Q . . . . . /#Y+(#. Q _#>+:#. . . . . T@s+t.. . j.<#[#}#. . . . >.Z.|#1#^#^#^#X . . . . . r+P.2#S+. . i+Y.3#. . . . + 4#5#6#. . 7#;+~+8#. . . . . 9#0#2 . . . . F+K@a#. . . . . . . . . . ",
". . . . . Q b#k@I.I.I.I.`.c#. . . . . d#{@.+e#~+F.f#2 . . . . . g#`._ . . . h#i#j#Q . . . Y@k#H+I.I.I.I.l#. . . . . . m#Z.=+&@n#F.o#p#. . . . . q#r#5+s#s#m+C@7#2 . . . . + v@t#. . . . . -@i#u#. . . . . . . . . . ",
". . . . . 2 v#_@_@_@_@_@w#( . . . . . 2 i@x#y#u.7#w . . . . . . z#A#. . . . . g.B#C#. . . >._@_@_@_@_@D#^+. . . . . . . E#!#F#G#H#j.. . . . . . . i+I#J#G#e@Q . . . . . . + K#6@. . . . . .@_@^#. . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . Q L#+ . . . . . . . . . . . . . . . . ^#. . . . . Q + . . . . . . . . . . . . . . . 2 X . . . . . . . . . . . Q . . . . ( 2 . . . . . . . . . . . . . . . 2 M#. . . . N#. . . . . . . . . . . . . . . . . ",
". . . . . O#P#- . . . + Q#x . . . 2 :+R#. . . . S#y.. . . . T#.@. . . U#A.+ . . . . . . . . . v V#. . . . i+A.( . . . - W#2 . . . c#^#2 . . X#Q#Q . . . Y#Z#`#. . . $.$. . . 1#$ . . . C#+$F+. . . . . . . . . . . ",
". . . . . @$#$>.. . . $$%$&$. . . }+D@W#. . . Q *$!#. . . . =$X . . . G.-$F+. . . . . . . . Q e+;$2 . . . >$,$6@. . . @$'$. . . Q )$Q . . 2 p#!$% . . . ~${$>@. . . q#]$. . . ^$v#. . . 6@/$_ . . . . . . . . . . . ",
". . . . . t.%$y+. . . ($_$6@. . . :$<$8#. . . % A.[$. . . w N@. . . . }$|$1$. . . . . . . . 2$^+3$Q . . . 4$5$6$. . . @$[@. . . ^#v#. . . ( 7$R+8$. . . 9$0$Q . . . a$j.. . . ]+}+. . . J.b$_ . . . . . . . . . . . ",
". . . . . 2 2 . . . . . 2 . . . . J.x 2 . . . . 2 2 . . . . . . . . . 2 . . . . . . . . . . . . . . . . . . 2 2 . . . . 2 . . . . . . . . Q >@2 . . . . . 2 . . . . . . . . 2 2 . . . . . 2 . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ",
". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . "};
openair1/EMOS/LTE/GUI/FFT.c
-97
View File
@@ -1,97 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
#include <math.h>
// ******* FFT function **********************************************************
#define PI 3.14159264359
#define SWAP(a,b) tempr=(a); (a)=(b); (b)=tempr
void FFT(float *data, // the vector with the outputs
// real part in even indexes
// imaginary part in the odd indexes
// for power conservation, the output should be normalized by 1/sqrt(nn)
unsigned long nn, // number of complex samples
int isign) // isign = 1 -> FFT, -1 -> iFFT
{
unsigned long n,mmax,m,j,istep,i;
float wtemp,wr,wpr,wpi,wi,theta;
float tempr,tempi;
n = nn << 1;
j = 1;
for( i = 1 ; i < n ; i += 2) { // The bit-reversal
if(j > i) {
SWAP(data[j-1],data[i-1]); // Exchanging the two complex number
SWAP(data[j],data[i]);
}
m = n >> 1;
while((m >= 2)&&(j > m)) {
j -= m;
m >>= 1;
}
j += m;
}
mmax = 2;
while(n > mmax) {
istep = mmax << 1;
theta = isign*(-2*PI/mmax);
wtemp = sin(0.5 * theta);
wpr = -2.0 * wtemp * wtemp;
wpi = sin(theta);
wr = 1.0;
wi = 0.0;
for (m = 1; m < mmax; m += 2) {
for (i = m; i <= n; i += istep) {
j = i + mmax;
tempr = wr*data[j-1] - wi*data[j];
tempi = wr*data[j] + wi*data[j-1];
data[j-1] = data[i-1] - tempr;
data[j] = data[i] - tempi;
data[i-1] += tempr;
data[i] += tempi;
}
wr = (wtemp=wr)*wpr - wi*wpi + wr;
wi = wi*wpr + wtemp*wpi + wi;
}
mmax = istep;
}
}
openair1/EMOS/LTE/GUI/Makefile
-29
View File
@@ -1,29 +0,0 @@
include $(OPENAIR_HOME)/common/utils/Makefile.inc
TOP_DIR = $(OPENAIR1_DIR)
bin_PROGRAMS = emos_gui
#emos_gui_SOURCES = emos_gui.c emos_gui_forms.c $(TOP_DIR)/PHY/CONFIG/openair_configure.c $(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.c FFT.c matrix_util.c
#emos_gui_HEADERS = emos_gui.h emos_gui_forms.h matrix_util.h
emos_gui_OBJS = emos_gui.o emos_gui_forms.o FFT.o matrix_util.o \
$(TOP_DIR)/PHY/CONFIG/openair_configure.o $(TOP_DIR)/PHY/CONFIG/openair_readconfigfile.o $(TOP_DIR)/PHY/TOOLS/fft.o $(TOP_DIR)/PHY/CODING/ccoding_byte.o $(TOP_DIR)/PHY/CODING/crc_byte.o $(TOP_DIR)/PHY/CODING/viterbi.o $(TOP_DIR)/PHY/TOOLS/cdot_prod.o $(TOP_DIR)/PHY/INIT/lte_init.o $(TOP_DIR)/PHY/LTE_ESTIMATION/lte_sync_time.o $(TOP_DIR)/PHY/LTE_REFSIG/lte_ul_ref.o $(TOP_DIR)/PHY/LTE_TRANSPORT/srs_modulation.o $(TOP_DIR)/PHY/CODING/ccoding_byte_lte.o $(TOP_DIR)/PHY/CODING/viterbi_lte.o $(TOP_DIR)/PHY/LTE_REFSIG/lte_gold.o $(TOP_DIR)/PHY/LTE_TRANSPORT/lte_mcs.o $(TOP_DIR)/PHY/LTE_TRANSPORT/pcfich.o $(TOP_DIR)/PHY/LTE_TRANSPORT/phich.o $(TOP_DIR)/PHY/LTE_TRANSPORT/dci_tools.o $(TOP_DIR)/PHY/LTE_TRANSPORT/uci_tools.o $(TOP_DIR)/SIMULATION/TOOLS/taus.o $(TOP_DIR)/PHY/LTE_TRANSPORT/dlsch_modulation.o
# $(TOP_DIR)/PHY/INIT/init_top.o
# set the include path found by configure
INCLUDES = -I$(TOP_DIR) -I/usr/realtime/include -I/usr/include/X11
# the library search path.
CFLAGS += -DUSER_MODE -DPC_TARGET -DPC_DSP -DNB_ANTENNAS_TXRX=2 -DNB_ANTENNAS_RX=2 -DNB_ANTENNAS_TX=2 -DEMOS -DNODE_RG -DCBMIMO1 -DPHY_CONTEXT -DOPENAIR_LTE
emos_gui_LDADD = -L/usr/lib -L/usr/local/lib -L/usr/realtime/lib -L/usr/X11R6/lib -lm -lforms -llxrt -lpthread -lX11 -lXpm -lgps
all: emos_gui
$(emos_gui_OBJS) : %.o : %.c
$(CC) -c $(CFLAGS) $(INCLUDES) -o $@ $<
emos_gui : $(emos_gui_OBJS)
$(CC) -o emos_gui $(CFLAGS) $(emos_gui_OBJS) $(emos_gui_LDADD)
clean:
rm -f $(emos_gui_OBJS)
openair1/EMOS/LTE/GUI/emos_gui.c
-1734
View File
File diff suppressed because it is too large Load Diff
openair1/EMOS/LTE/GUI/emos_gui.h
-70
View File
@@ -1,70 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
#define TERM_MODE_SINGL 0
#define TERM_MODE_MULTI 1
#define TERM_ON 1
#define TERM_OFF 0
#define SCREEN_COLOR_ON FL_CHARTREUSE
#define SCREEN_COLOR_OFF FL_RIGHT_BCOL
#define SCREEN_COLOR_BG FL_BLACK
#define SCREEN_COLOR_HL FL_RED
#define LED_COLOR_ON FL_RED
#define LED_COLOR_OFF FL_RIGHT_BCOL
#define REC_ON 1
#define REC_OFF 0
#define EMOS_NOT_READY 0
#define EMOS_READY 1
#define TIME_DOMAIN 0
#define FREQ_DOMAIN 1
#define N0 0
#define SNR 1
#define REC_FRAMES_MAX (100*60*5) //5min
#define REC_FRAMES_PER_FILE (100*(60*5-5)) //4min55sec
#define REC_FILE_IDX_MAX 100
#define CHANSOUNDER_FIFO_DEV "/dev/rtf3"
#define NO_ESTIMATES_DISK 100 //No. of estimates that are aquired before dumped to disk
//#define CHANNEL_BUFFER_SIZE sizeof(fifo_dump_emos_UE) //in bytes
#define SCREEN_MEMORY_SIZE 32
#define DISP_MAX_POWER 4194304 //maximum value for the display of the frequency response
//#define GPSD_BUFFER_SIZE 64
openair1/EMOS/LTE/GUI/emos_gui_forms.c
-579
View File
@@ -1,579 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
/* Form definition file generated by fdesign */
#include <stdlib.h>
#include "emos_gui_forms.h"
/***************************************
***************************************/
FD_main_frm *
create_form_main_frm( void )
{
FL_OBJECT *obj;
FD_main_frm *fdui = fl_malloc( sizeof *fdui );
fdui->vdata = fdui->cdata = NULL;
fdui->ldata = 0;
fdui->main_frm = fl_bgn_form( FL_NO_BOX, 1010, 710 );
obj = fl_add_box( FL_FLAT_BOX, 0, 0, 1010, 710, "Main form" );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_MCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
obj = fl_add_box( FL_ROUNDED_BOX, 10, 610, 230, 90, "" );
fl_set_object_color( obj, FL_DARKER_COL1, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
obj = fl_add_box( FL_ROUNDED3D_DOWNBOX, 5, 5, 850, 600, "" );
fl_set_object_color( obj, FL_BLACK, FL_BLACK );
fdui->sync_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 635, 15, 40, 20, "sync" );
fl_set_object_boxtype( obj, FL_ROUNDED_BOX );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->rec_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 720, 15, 40, 20, "rec" );
fl_set_object_boxtype( obj, FL_ROUNDED_BOX );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->pwr1_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 20, 45, 300, 110, "Power" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->pwr2_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 330, 45, 300, 110, "Power" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->rx2_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 345, 10, 80, 40, "RX 2" );
fl_set_object_color( obj, FL_BLACK, FL_MCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lsize( obj, FL_HUGE_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->noise1_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 20, 170, 300, 110, "N0/SNR" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->noise2_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 330, 170, 300, 110, "N0/SNR" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch11_sec0_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 10, 325, 140, 110, "CH 11" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch12_sec0_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 145, 325, 140, 110, "CH 12" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch21_sec0_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 10, 455, 140, 110, "CH 21" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch22_sec0_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 145, 455, 140, 110, "CH 22" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch11_sec1_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 290, 325, 140, 110, "CH 11" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch12_sec1_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 430, 325, 140, 110, "CH 12" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch21_sec1_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 290, 455, 140, 110, "CH 21" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch22_sec1_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 430, 455, 140, 110, "CH 22" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->error_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 680, 15, 40, 20, "error" );
fl_set_object_boxtype( obj, FL_ROUNDED_BOX );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->gps_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 640, 65, 60, 30, "gps" );
fl_set_object_boxtype( obj, FL_ROUNDED_BOX );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->date_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 655, 120, 170, 30, "date: " );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->gps_lat_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 700, 65, 150, 30, "lat: 0" );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->gps_lon_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 700, 95, 150, 30, "lon: 0" );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->idx_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 685, 150, 110, 20, "Idx: " );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
obj = fl_add_box( FL_ROUNDED_BOX, 485, 610, 140, 90, "" );
fl_set_object_color( obj, FL_DARKCYAN, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
fdui->power_btn = obj = fl_add_button( FL_NORMAL_BUTTON, 130, 620, 100, 70, "PWR" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_MEDIUM_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, power_callback, 0 );
fdui->buffer_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 760, 15, 90, 20, "Buffer: 100%" );
fl_set_object_boxtype( obj, FL_ROUNDED_BOX );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->refresh_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 655, 175, 170, 20, "Refresh interval: 1s" );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
obj = fl_add_box( FL_ROUNDED_BOX, 860, 90, 140, 220, "" );
fl_set_object_color( obj, FL_DARKER_COL1, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
fdui->refresh_dial = obj = fl_add_dial( FL_NORMAL_DIAL, 890, 110, 80, 70, "screen refresh rate" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_RIGHT_BCOL );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fl_set_object_callback( obj, refresh_callback, 0 );
fl_set_object_return( obj, FL_RETURN_CHANGED );
fl_set_dial_bounds( obj, 0, 5 );
fl_set_dial_angles( obj, 45, 315 );
fl_set_dial_value( obj, 1 );
fl_set_dial_step( obj, 1 );
obj = fl_add_box( FL_ROUNDED_BOX, 860, 528, 137, 72, "" );
fl_set_object_color( obj, FL_INDIANRED, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
fdui->bler_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 650, 200, 180, 20, "BLER:" );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->n_recd_frames_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 650, 225, 180, 20, "Rec'd frms:" );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->msg_text = obj = fl_add_text( FL_NORMAL_TEXT, 25, 570, 810, 30, "" );
fl_set_object_color( obj, FL_BLACK, FL_MCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
obj = fl_add_pixmapbutton( FL_NORMAL_BUTTON, 860, 5, 140, 70, "" );
fl_set_object_boxtype( obj, FL_ROUNDED_BOX );
fl_set_object_color( obj, FL_WHITE, FL_YELLOW );
fl_set_pixmapbutton_file( obj, "Eurecom_Logo.xpm" );
fdui->rx1_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 35, 10, 80, 40, "RX 1" );
fl_set_object_color( obj, FL_BLACK, FL_MCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lsize( obj, FL_HUGE_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->alamouti_btn = obj = fl_add_button( FL_PUSH_BUTTON, 505, 655, 100, 20, "2: ALAMOUTI" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, rx_mode_button_callback, 2 );
fdui->precoding_btn = obj = fl_add_button( FL_PUSH_BUTTON, 505, 675, 100, 20, "6: PRECODING" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, rx_mode_button_callback, 6 );
fdui->cbmimo_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 665, 40, 70, 20, "cbmimo" );
fl_set_object_boxtype( obj, FL_ROUNDED_BOX );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->fix_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 640, 95, 60, 30, "NO" );
fl_set_object_boxtype( obj, FL_ROUNDED_BOX );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
obj = fl_add_box( FL_ROUNDED_BOX, 800, 610, 200, 90, "" );
fl_set_object_color( obj, FL_INDIANRED, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
fdui->rec_btn = obj = fl_add_button( FL_NORMAL_BUTTON, 820, 620, 160, 70, "Record" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, record_callback, 0 );
fdui->exit_btn = obj = fl_add_button( FL_NORMAL_BUTTON, 20, 660, 90, 30, "exit" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_TOMATO, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, exit_callback, 0 );
fdui->config_btn = obj = fl_add_button( FL_NORMAL_BUTTON, 20, 620, 90, 30, "config" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, config_btn_callback, 0 );
obj = fl_add_button( FL_NORMAL_BUTTON, 870, 180, 40, 30, "+" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fl_set_object_callback( obj, refresh_callback, 1 );
obj = fl_add_button( FL_NORMAL_BUTTON, 950, 180, 40, 30, "-" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fl_set_object_callback( obj, refresh_callback, -1 );
fdui->time_domain_btn = obj = fl_add_button( FL_PUSH_BUTTON, 870, 235, 60, 20, "time" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, time_freq_callback, 0 );
fdui->freq_domain_btn = obj = fl_add_button( FL_PUSH_BUTTON, 930, 235, 60, 20, "freq" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, time_freq_callback, 1 );
obj = fl_add_text( FL_NORMAL_TEXT, 875, 215, 110, 20, "channel display" );
fl_set_object_color( obj, FL_DARKER_COL1, FL_MCOL );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fdui->refresh_timer = obj = fl_add_timer( FL_HIDDEN_TIMER, 810, 720, 10, 10, "timer" );
fl_set_object_callback( obj, refresh_timer_callback, 0 );
obj = fl_add_text( FL_NORMAL_TEXT, 875, 260, 110, 20, "N0/SNR" );
fl_set_object_color( obj, FL_DARKER_COL1, FL_MCOL );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fdui->n0_btn = obj = fl_add_button( FL_PUSH_BUTTON, 870, 280, 60, 20, "N0" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, noise_snr_callback, 0 );
fdui->snr_btn = obj = fl_add_button( FL_PUSH_BUTTON, 930, 280, 60, 20, "SNR" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, noise_snr_callback, 1 );
fdui->rx_mode_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 650, 250, 180, 20, "RX mode:" );
fl_set_object_color( obj, FL_BLACK, FL_TOP_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fdui->siso_btn = obj = fl_add_button( FL_PUSH_BUTTON, 505, 635, 100, 20, "1: SISO" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, rx_mode_button_callback, 1 );
obj = fl_add_text( FL_NORMAL_TEXT, 505, 615, 100, 20, "TX mode" );
fl_set_object_boxtype( obj, FL_NO_BOX );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fdui->ch11_sec2_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 570, 325, 140, 110, "CH 11" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch12_sec2_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 710, 325, 140, 110, "CH 12" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch21_sec2_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 570, 455, 140, 110, "CH 21" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->ch22_sec2_xyp = obj = fl_add_xyplot( FL_NORMAL_XYPLOT, 710, 455, 140, 110, "CH 22" );
fl_set_object_color( obj, FL_BLACK, FL_RIGHT_BCOL );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fdui->sec0_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 85, 285, 140, 20, "Sector 0" );
fl_set_object_color( obj, FL_BLACK, FL_BLACK );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lsize( obj, FL_MEDIUM_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fdui->sec1_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 380, 285, 140, 20, "Sector 1" );
fl_set_object_color( obj, FL_BLACK, FL_BLACK );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lsize( obj, FL_MEDIUM_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
fdui->sec2_lbl = obj = fl_add_text( FL_NORMAL_TEXT, 650, 285, 140, 20, "Sector 2" );
fl_set_object_color( obj, FL_BLACK, FL_BLACK );
fl_set_object_lcolor( obj, FL_RIGHT_BCOL );
fl_set_object_lsize( obj, FL_MEDIUM_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
obj = fl_add_box( FL_ROUNDED_BOX, 250, 610, 130, 90, "" );
fl_set_object_color( obj, FL_PALEGREEN, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
fdui->terminal_btn1 = obj = fl_add_button( FL_PUSH_BUTTON, 265, 650, 40, 40, "eNb" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fl_set_object_callback( obj, terminal_button_callback, 1 );
fdui->terminal_btn3 = obj = fl_add_button( FL_PUSH_BUTTON, 320, 650, 40, 40, "UE" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fl_set_object_callback( obj, terminal_button_callback, 3 );
obj = fl_add_text( FL_NORMAL_TEXT, 260, 620, 110, 20, "terminal type" );
fl_set_object_color( obj, FL_PALEGREEN, FL_MCOL );
fl_set_object_lalign( obj, FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
obj = fl_add_box( FL_ROUNDED_BOX, 630, 610, 160, 90, "" );
fl_set_object_color( obj, FL_WHEAT, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
obj = fl_add_button( FL_NORMAL_BUTTON, 645, 660, 90, 30, "Checkpoint" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, checkpoint_callback, 0 );
obj = fl_add_button( FL_NORMAL_BUTTON, 740, 620, 40, 30, "+" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fl_set_object_callback( obj, checkpoint_callback, 1 );
obj = fl_add_button( FL_NORMAL_BUTTON, 740, 660, 40, 30, "-" );
fl_set_object_boxtype( obj, FL_ROUNDED3D_UPBOX );
fl_set_object_color( obj, FL_LIGHTER_COL1, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_lstyle( obj, FL_BOLD_STYLE );
fl_set_object_callback( obj, checkpoint_callback, -1 );
fdui->next_cp = obj = fl_add_text( FL_NORMAL_TEXT, 650, 625, 90, 20, "Next CP: 1" );
fl_set_object_color( obj, FL_WHEAT, FL_MCOL );
obj = fl_add_box( FL_ROUNDED_BOX, 860, 320, 142, 199, "" );
fl_set_object_color( obj, FL_PALEGREEN, FL_COL1 );
fdui->rf_gain_txt = obj = fl_add_input( FL_NORMAL_INPUT, 925, 340, 60, 20, "RF gain" );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_callback( obj, input_callback, 0 );
fl_set_object_return( obj, FL_RETURN_END_CHANGED );
fdui->digital_gain_txt = obj = fl_add_input( FL_NORMAL_INPUT, 925, 374, 60, 20, "digital gain" );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_callback( obj, input_callback, 0 );
fl_set_object_return( obj, FL_RETURN_END_CHANGED );
fdui->rf_mode_txt = obj = fl_add_input( FL_NORMAL_INPUT, 925, 409, 60, 20, "RF mode" );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_callback( obj, input_callback, 0 );
fl_set_object_return( obj, FL_RETURN_END_CHANGED );
obj = fl_add_box( FL_ROUNDED_BOX, 390, 610, 90, 90, "" );
fl_set_object_color( obj, FL_DARKCYAN, FL_COL1 );
fl_set_object_lalign( obj, FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
fdui->la_btn = obj = fl_add_lightbutton( FL_PUSH_BUTTON, 405, 645, 60, 40, "LA" );
fl_set_object_callback( obj, link_adpt_callback, 0 );
fl_set_button( obj, 1 );
obj = fl_add_text( FL_NORMAL_TEXT, 400, 620, 70, 20, "link adpt." );
fl_set_object_color( obj, FL_DARKCYAN, FL_MCOL );
fdui->label_input = obj = fl_add_input( FL_NORMAL_INPUT, 880, 569, 100, 20, "" );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_lalign( obj, FL_ALIGN_TOP );
fl_set_object_callback( obj, label_callback, 0 );
fl_set_object_return( obj, FL_RETURN_END_CHANGED );
fdui->label_button = obj = fl_add_checkbutton( FL_PUSH_BUTTON, 877, 539, 60, 30, "manual label" );
fl_set_object_callback( obj, label_btn_callback, 0 );
fdui->freq_txt = obj = fl_add_input( FL_NORMAL_INPUT, 925, 444, 60, 20, "frequency" );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_callback( obj, input_callback, 0 );
fl_set_object_return( obj, FL_RETURN_END_CHANGED );
fdui->tcxo_txt = obj = fl_add_input( FL_NORMAL_INPUT, 925, 479, 60, 20, "TCXO" );
fl_set_object_lsize( obj, FL_TINY_SIZE );
fl_set_object_callback( obj, input_callback, 0 );
fl_set_object_return( obj, FL_RETURN_END_CHANGED );
fl_end_form( );
fdui->main_frm->fdui = fdui;
return fdui;
}
/***************************************
***************************************/
FD_splash_frm *
create_form_splash_frm( void )
{
FL_OBJECT *obj;
FD_splash_frm *fdui = fl_malloc( sizeof *fdui );
fdui->vdata = fdui->cdata = NULL;
fdui->ldata = 0;
fdui->splash_frm = fl_bgn_form( FL_NO_BOX, 390, 280 );
obj = fl_add_box( FL_FLAT_BOX, 0, 0, 390, 280, "" );
obj = fl_add_pixmap( FL_NORMAL_PIXMAP, 40, 20, 310, 100, "" );
obj = fl_add_text( FL_NORMAL_TEXT, 70, 150, 80, 30, "text" );
fl_end_form( );
fdui->splash_frm->fdui = fdui;
return fdui;
}
/***************************************
***************************************/
FD_config_dialog *
create_form_config_dialog( void )
{
FL_OBJECT *obj;
FD_config_dialog *fdui = fl_malloc( sizeof *fdui );
fdui->vdata = fdui->cdata = NULL;
fdui->ldata = 0;
fdui->config_dialog = fl_bgn_form( FL_NO_BOX, 410, 120 );
obj = fl_add_box( FL_UP_BOX, 0, 0, 410, 120, "" );
fdui->cancel_btn = obj = fl_add_button( FL_NORMAL_BUTTON, 80, 75, 100, 30, "Cancel" );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, get_dir_callback, -1 );
fdui->ok_btn = obj = fl_add_button( FL_RETURN_BUTTON, 225, 75, 100, 30, "OK" );
fl_set_object_lalign( obj, FL_ALIGN_CENTER );
fl_set_object_callback( obj, get_dir_callback, 0 );
fdui->dir_input = obj = fl_add_input( FL_NORMAL_INPUT, 80, 30, 300, 30, "Directory" );
fl_set_object_return( obj, FL_RETURN_END_CHANGED );
fl_end_form( );
fdui->config_dialog->fdui = fdui;
return fdui;
}
openair1/EMOS/LTE/GUI/emos_gui_forms.fd
-1664
View File
File diff suppressed because it is too large Load Diff
openair1/EMOS/LTE/GUI/emos_gui_forms.h
-149
View File
@@ -1,149 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
/* Header file generated by fdesign on Thu Jun 3 18:41:21 2010 */
#ifndef FD_main_frm_h_
#define FD_main_frm_h_
#include <forms.h>
/* Callbacks, globals and object handlers */
extern void power_callback( FL_OBJECT *, long );
extern void refresh_callback( FL_OBJECT *, long );
extern void rx_mode_button_callback( FL_OBJECT *, long );
extern void record_callback( FL_OBJECT *, long );
extern void exit_callback( FL_OBJECT *, long );
extern void config_btn_callback( FL_OBJECT *, long );
extern void time_freq_callback( FL_OBJECT *, long );
extern void refresh_timer_callback( FL_OBJECT *, long );
extern void noise_snr_callback( FL_OBJECT *, long );
extern void terminal_button_callback( FL_OBJECT *, long );
extern void checkpoint_callback( FL_OBJECT *, long );
extern void input_callback( FL_OBJECT *, long );
extern void link_adpt_callback( FL_OBJECT *, long );
extern void label_callback( FL_OBJECT *, long );
extern void label_btn_callback( FL_OBJECT *, long );
extern void get_dir_callback( FL_OBJECT *, long );
/* Forms and Objects */
typedef struct {
FL_FORM * main_frm;
void * vdata;
char * cdata;
long ldata;
FL_OBJECT * sync_lbl;
FL_OBJECT * rec_lbl;
FL_OBJECT * pwr1_xyp;
FL_OBJECT * pwr2_xyp;
FL_OBJECT * rx2_lbl;
FL_OBJECT * noise1_xyp;
FL_OBJECT * noise2_xyp;
FL_OBJECT * ch11_sec0_xyp;
FL_OBJECT * ch12_sec0_xyp;
FL_OBJECT * ch21_sec0_xyp;
FL_OBJECT * ch22_sec0_xyp;
FL_OBJECT * ch11_sec1_xyp;
FL_OBJECT * ch12_sec1_xyp;
FL_OBJECT * ch21_sec1_xyp;
FL_OBJECT * ch22_sec1_xyp;
FL_OBJECT * error_lbl;
FL_OBJECT * gps_lbl;
FL_OBJECT * date_lbl;
FL_OBJECT * gps_lat_lbl;
FL_OBJECT * gps_lon_lbl;
FL_OBJECT * idx_lbl;
FL_OBJECT * power_btn;
FL_OBJECT * buffer_lbl;
FL_OBJECT * refresh_lbl;
FL_OBJECT * refresh_dial;
FL_OBJECT * bler_lbl;
FL_OBJECT * n_recd_frames_lbl;
FL_OBJECT * msg_text;
FL_OBJECT * rx1_lbl;
FL_OBJECT * alamouti_btn;
FL_OBJECT * precoding_btn;
FL_OBJECT * cbmimo_lbl;
FL_OBJECT * fix_lbl;
FL_OBJECT * rec_btn;
FL_OBJECT * exit_btn;
FL_OBJECT * config_btn;
FL_OBJECT * time_domain_btn;
FL_OBJECT * freq_domain_btn;
FL_OBJECT * refresh_timer;
FL_OBJECT * n0_btn;
FL_OBJECT * snr_btn;
FL_OBJECT * rx_mode_lbl;
FL_OBJECT * siso_btn;
FL_OBJECT * ch11_sec2_xyp;
FL_OBJECT * ch12_sec2_xyp;
FL_OBJECT * ch21_sec2_xyp;
FL_OBJECT * ch22_sec2_xyp;
FL_OBJECT * sec0_lbl;
FL_OBJECT * sec1_lbl;
FL_OBJECT * sec2_lbl;
FL_OBJECT * terminal_btn1;
FL_OBJECT * terminal_btn3;
FL_OBJECT * next_cp;
FL_OBJECT * rf_gain_txt;
FL_OBJECT * digital_gain_txt;
FL_OBJECT * rf_mode_txt;
FL_OBJECT * la_btn;
FL_OBJECT * label_input;
FL_OBJECT * label_button;
FL_OBJECT * freq_txt;
FL_OBJECT * tcxo_txt;
} FD_main_frm;
extern FD_main_frm * create_form_main_frm( void );
typedef struct {
FL_FORM * splash_frm;
void * vdata;
char * cdata;
long ldata;
} FD_splash_frm;
extern FD_splash_frm * create_form_splash_frm( void );
typedef struct {
FL_FORM * config_dialog;
void * vdata;
char * cdata;
long ldata;
FL_OBJECT * cancel_btn;
FL_OBJECT * ok_btn;
FL_OBJECT * dir_input;
} FD_config_dialog;
extern FD_config_dialog * create_form_config_dialog( void );
#endif /* FD_main_frm_h_ */
openair1/EMOS/LTE/GUI/matrix_util.c
-106
View File
@@ -1,106 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
// Matrix Utilities for Capacity Calculations
// by Florian Kaltenberger
// Created 10.10.2007
# include "matrix_util.h"
#include <stdio.h>
#include <stdlib.h>
// This function calculates HxH^H for a complex matrix H
// HH must be a pre-allocated matrix of size rows x rows
// The function returns NULL on error and a pointer to the
// calculated matrix otherwise
struct complexf **square_mat(struct complexf **H, int rows, int cols, struct complexf **HH)
{
int r,r2,c;
if (H==NULL || HH==NULL || rows == 0 || cols == 0)
return NULL;
for (r=0; r<rows; r++) {
for (r2=0; r2<rows; r2++) {
HH[r][r2].r = 0;
HH[r][r2].i = 0;
for (c=0; c<cols; c++) {
HH[r][r2].r += H[r][c].r * H[r2][c].r + H[r][c].i * H[r2][c].i;
HH[r][r2].i += H[r][c].i * H[r2][c].r - H[r][c].r * H[r2][c].i;
}
}
}
return HH;
}
// This function scales the matrix H with the factor scale and adds I
// The original matrix is overwritten
struct complexf **addI_scale_mat(struct complexf **H, int rows, float scale)
{
int r,r2;
if (H==NULL || rows == 0)
return NULL;
for (r=0; r<rows; r++) {
for (r2=0; r2<rows; r2++) {
H[r][r2].r *= scale;
H[r][r2].i *= scale;
if (r==r2) {
H[r][r2].r += 1;
H[r][r2].i += 1;
}
}
}
return H;
}
// This function calculates the determinant of a 2x2 Hermitian matrix H
// The result will be real
float det(struct complexf **H)
{
return H[0][0].r * H[1][1].r - (H[0][1].r * H[0][1].r + H[0][1].i * H[0][1].i);
}
float norm_fro_sq(struct complexf**H, int rows, int cols)
{
float norm=0;
int ar,ac;
for (ar=0; ar<rows; ar++) {
for (ac=0; ac<cols; ac++) {
norm += H[ar][ac].r * H[ar][ac].r + H[ar][ac].i * H[ar][ac].i;
}
}
return norm;
}
openair1/EMOS/LTE/GUI/matrix_util.h
-41
View File
@@ -1,41 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
// Matrix Utilities for Capacity Calculations
// by Florian Kaltenberger
// Created 10.10.2007
# include "PHY/TOOLS/defs.h"
struct complexf **square_mat(struct complexf **H, int rows, int cols, struct complexf **HH);
struct complexf **addI_scale_mat(struct complexf **H, int rows, float scale);
float det(struct complexf **H);
float norm_fro_sq(struct complexf**H, int rows, int cols);
openair1/EMOS/LTE/IMPORT_FILTER/COPYING
-674
View File
@@ -1,674 +0,0 @@
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>.
openair1/EMOS/LTE/IMPORT_FILTER/Makefile
-41
View File
@@ -1,41 +0,0 @@
include $(OPENAIR_HOME)/common/utils/Makefile.inc
SRC = dump_size.c
#CFLAGS = $(shell rtai-config --lxrt-cflags)
#LDFLAGS = $(shell rtai-config --lxrt-ldflags) -lpthread -lm -lgps -lforms #-llxrt
CFLAGS += -I$(OPENAIR1_DIR) -I$(OPENAIR2_DIR)/RRC/LITE/MESSAGES -I$(OPENAIR_HOME)/common/utils -I$(OPENAIR2_DIR) -I$(OPENAIR2_DIR)/COMMON
CFLAGS += -DPHYSIM -DNODE_RG -DUSER_MODE -DPC_TARGET -DPC_DSP -DNB_ANTENNAS_RX=2 -DNB_ANTENNAS_TXRX=2 -DNB_ANTENNAS_TX=2 -DPHY_CONTEXT=1
CFLAGS += -DOPENAIR_LTE -DENABLE_FXP -DOPENAIR1 #-DDLSCH_THREAD -DULSCH_THREAD
CFLAGS += -DEMOS -DEXMIMO -DNO_RTAI
ifeq ($(EMOS_CHANNEL),1)
CFLAGS += -DEMOS_CHANNEL
endif
all: dump_size cstruct
$(OBJ): %.o : %.c
@echo Compiling $< ...
@$(CC) -c $(CFLAGS) -o $@ $<
cstruct: cstruct.c MatlabCStruct.c
mkoctfile --mex cstruct.c MatlabCStruct.c
dump_size: dump_size.c
$(CC) $(CFLAGS) $(LDFLAGS) dump_size.c -o dump_size
cleanall:
rm -rf dump_size cstruct.oct cstruct.mex
clean:
rm -rf dump_size
show:
@echo $(CFLAGS)
beautiful:
astyle --style=gnu -s2 $(SRC)
openair1/EMOS/LTE/IMPORT_FILTER/MatlabCStruct.c
-466
View File
@@ -1,466 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
//--------------------------------------------------------------
// file: MatlabCStruct.c - Computes the amount of storages that
// would be required to represent a Matlab array in a C lngusage
// struture. It also moves data between C structures and Matlab
// arrays.
// This is particularly usful when reading/writing data from a
// byte stream, such as a file or socket interface, which contains
// formatted data, but needs to be re-represented in a Matlab array
// from its raw binary layout, or vice versa.
// 05/24/2004 jaj Replaced __int64 with INT64_T for portability
//--------------------------------------------------------------
#include <stdio.h>
#include <memory.h>
#include <mex.h>
#include "MatlabCStruct.h"
int MatlabCStruct_DebugFlag = 0;
#ifndef MAX
#define MAX(a,b) ((a)>=(b)?(a):(b))
#define MIN(a,b) ((a)<=(b)?(a):(b))
#endif
//--------------------------------------------------------------
// ClassIDText() - Simply return the name of the class
//--------------------------------------------------------------
char *ClassIDText(const mxArray *pArray)
{
switch(mxGetClassID(pArray)) {
case mxUNKNOWN_CLASS :
return "UNKNOWN";
case mxCELL_CLASS :
return "CELL";
case mxFUNCTION_CLASS:
return "FUNCTION";
//case mxOBJECT_CLASS : return "OBJECT";
case mxSTRUCT_CLASS :
return "STRUCT";
case mxCHAR_CLASS :
return "CHAR";
case mxLOGICAL_CLASS :
return "LOGICAL";
case mxDOUBLE_CLASS :
return "DOUBLE";
case mxSINGLE_CLASS :
return "SINGLE";
case mxINT8_CLASS :
return "INT8";
case mxUINT8_CLASS :
return "UINT8";
case mxINT16_CLASS :
return "INT16";
case mxUINT16_CLASS :
return "UINT16";
case mxINT32_CLASS :
return "INT32";
case mxUINT32_CLASS :
return "UINT32";
case mxINT64_CLASS :
return "INT64";
default:
return "INVALID";
}
} // end ClassIDText()
//--------------------------------------------------------------
// SwapBytes() - size must be even.
//--------------------------------------------------------------
void SwapBytes(char *p0, int size, int count)
{
char t; // Temporory register for byte swaps
int inc0 = size/2; // pointer increments
int inc1 = size+inc0;
char *p1 = p0+(size-1);
while (count-- > 0) {
while (p1>p0) {
t = *p0;
*p0 = *p1;
p0++;
*p1 = t;
p1--;
}
p0 += inc0;
p1 += inc1;
}
}
#define SWAP(x) SwapBytes(&(x), sizeof(x))
//--------------------------------------------------------------
// funciton: MatlabCStruct() - Traverse the structure tree
// to determine the storage requirements when converted to a
// C structure.
// INPUTS:
// pArray - Pointer to Matlab array to be analyzed
// MemoryAlignment - 1, 2, 4, or 8, indicating desired (maximum) element
// alignment in the C structure.
// NestLevel - For recursing strucutres containing structures.
// pDataDest - NULL, or a pointer to the beginning of a C structure/
// memory area to which to move Matlab array data.
// pDataSource - NULL, or a pointer to the beginning of a C structure/
// memory area from which to move Matlab array data.
// RETURNS:
// ELEMENT_ATTRIBUTES structure, containing information about the
// Matlab array being analyzed.
// NOTES:
// Call with both pDataDest and pDataSource equal to NULL to simply
// determine how much C storage is required for a given Matlab
// array. That amount can then be allocated, or compared to
// expected.
//--------------------------------------------------------------
ELEMENT_ATTRIBUTES MatlabCStruct(const mxArray *pArray, int MemoryAlignment, int NestLevel,
unsigned char *pDataDest, unsigned char *pDataSource, int SwapFlag)
{
#define SPACES {int k;for (k=0; k<NestLevel; k++) printf(" "); }
ELEMENT_ATTRIBUTES Attributes;
int i, j;
// Initialize attributes
Attributes.ElementCount;
Attributes.StorageSize = 0;
Attributes.Alignment = 0;
Attributes.ElementSize = 0; // This field meaningless for a structure
if (pArray == NULL)
return Attributes; // Uninitialized array
Attributes.ElementCount = mxGetNumberOfElements(pArray);
switch(mxGetClassID(pArray)) {
case mxUNKNOWN_CLASS :
case mxFUNCTION_CLASS:
//case mxOBJECT_CLASS : Attributes.StorageSize = 0; Attributes.Alignment = 1; return Attributes;
case mxCELL_CLASS :
break; // Fall down to code below
case mxSTRUCT_CLASS :
break; // Fall down to code below
case mxCHAR_CLASS :
Attributes.ElementSize = sizeof(mxChar);
break;
case mxLOGICAL_CLASS :
Attributes.ElementSize = sizeof(mxLogical);
break;
case mxDOUBLE_CLASS :
Attributes.ElementSize = sizeof(double);
break;
case mxSINGLE_CLASS :
Attributes.ElementSize = sizeof(float);
break;
case mxINT8_CLASS :
Attributes.ElementSize = sizeof(char);
break;
case mxUINT8_CLASS :
Attributes.ElementSize = sizeof(unsigned char);
break;
case mxINT16_CLASS :
Attributes.ElementSize = sizeof(short);
break;
case mxUINT16_CLASS :
Attributes.ElementSize = sizeof(unsigned short);
break;
case mxINT32_CLASS :
Attributes.ElementSize = sizeof(int);
break;
case mxUINT32_CLASS :
Attributes.ElementSize = sizeof(unsigned int);
break;
// case mxINT64_CLASS : Attributes.ElementSize = sizeof(__int64); break;
case mxINT64_CLASS :
Attributes.ElementSize = sizeof(INT64_T);
break; // jaj 05/24/2004
default:
mexErrMsgTxt("Unknown MX class");
}
if (mxIsCell(pArray)) { // Array is a cell array
int nElem;
mxArray *pCell; // One field in the structure
nElem = mxGetNumberOfElements(pArray);
for (i=0; i<nElem; i++) {
ELEMENT_ATTRIBUTES CellAttributes;
pCell = mxGetCell(pArray, i);
CellAttributes = MatlabCStruct(pCell, MemoryAlignment, NestLevel+1, NULL, NULL, SwapFlag);
// See if padding needs to be added before the element
if (Attributes.StorageSize % CellAttributes.Alignment > 0) {
int Padding;
Padding = CellAttributes.Alignment - (Attributes.StorageSize % CellAttributes.Alignment);
if (MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [%d bytes of padding]\n", Attributes.StorageSize, Padding);
}
Attributes.StorageSize += Padding;
}
if (MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [cell %d of %d]: %dx%d bytes of %s data\n", Attributes.StorageSize, i, nElem, CellAttributes.StorageSize, CellAttributes.ElementCount, ClassIDText(pCell));
}
if (pDataDest)
if ((long)pDataDest == -1)
CellAttributes = MatlabCStruct(pCell, MemoryAlignment, NestLevel+1, pDataDest, NULL, SwapFlag);
else
CellAttributes = MatlabCStruct(pCell, MemoryAlignment, NestLevel+1, pDataDest+Attributes.StorageSize, NULL, SwapFlag);
if (pDataSource)
if ((long)pDataSource == -1)
CellAttributes = MatlabCStruct(pCell, MemoryAlignment, NestLevel+1, NULL, pDataSource, SwapFlag);
else
CellAttributes = MatlabCStruct(pCell, MemoryAlignment, NestLevel+1, NULL, pDataSource+Attributes.StorageSize, SwapFlag);
Attributes.StorageSize += CellAttributes.StorageSize * CellAttributes.ElementCount;
Attributes.Alignment = MAX(Attributes.Alignment, CellAttributes.Alignment);
}
// See if padding needs to be added at the end of the structure
if (Attributes.StorageSize % Attributes.Alignment > 0) {
int Padding;
Padding = Attributes.Alignment - (Attributes.StorageSize % Attributes.Alignment);
if (MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [%d bytes of padding]\n", Attributes.StorageSize, Padding);
}
Attributes.StorageSize += Padding;
}
if (MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [end of cell array]\n", Attributes.StorageSize);
}
// 08/14/03 jaj Make the element count 1 for cell arrays
Attributes.ElementCount = 1;
} // end array is Cell array
else if (mxIsChar(pArray)) {
mxChar *pChar;
Attributes.StorageSize = sizeof(char); // special case
Attributes.Alignment = MIN(Attributes.StorageSize, MemoryAlignment);
if (pDataDest && (long)pDataDest != -1) {
pChar = (mxChar *)mxGetData(pArray);
for (i=0; i<Attributes.ElementCount; i++)
pDataDest[i] = (unsigned char)pChar[i];
}
if (pDataSource && (long)pDataSource != -1) {
pChar = (mxChar *)mxGetData(pArray);
for (i=0; i<Attributes.ElementCount; i++)
pChar[i] = (mxChar)pDataSource[i];
}
}
else if (mxIsStruct(pArray)) { // Array is a Structure
int nElem; // 08/14/03 jaj
int nField;
mxArray *pField; // One field in the structure
// Initialize attributes (ElementCount has already been assigned)
Attributes.StorageSize = 0;
Attributes.Alignment = 0;
Attributes.ElementSize = 0; // This field meaningless for a structure
nField = mxGetNumberOfFields(pArray);
nElem = mxGetNumberOfElements(pArray);
for (j=0; j<nElem; j++) { // 08/14/03 jaj
ELEMENT_ATTRIBUTES LocalAttributes;
LocalAttributes.StorageSize = 0;
LocalAttributes.Alignment = 0;
LocalAttributes.ElementSize = 0; // This field meaningless for a structure
if (nElem > 1 && MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [index %d of %d]\n", Attributes.StorageSize, j, nElem);
NestLevel++;
}
for (i=0; i<nField; i++) {
const char *FieldName; // For debug purposes
ELEMENT_ATTRIBUTES FieldAttributes;
FieldName = mxGetFieldNameByNumber(pArray, i);
pField = mxGetFieldByNumber(pArray, j, i);
FieldAttributes = MatlabCStruct(pField, MemoryAlignment, NestLevel+1, NULL, NULL, SwapFlag);
// See if padding needs to be added before the element
if (LocalAttributes.StorageSize % FieldAttributes.Alignment > 0) {
int Padding;
Padding = FieldAttributes.Alignment - (LocalAttributes.StorageSize % FieldAttributes.Alignment);
if (MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [%d bytes of padding]\n", LocalAttributes.StorageSize, Padding);
}
LocalAttributes.StorageSize += Padding;
}
if (MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [%s] %dx%d bytes of %s data\n", LocalAttributes.StorageSize, FieldName, FieldAttributes.StorageSize, FieldAttributes.ElementCount, ClassIDText(pField));
}
if (pDataDest) {
if ((long)pDataDest == -1)
FieldAttributes = MatlabCStruct(pField, MemoryAlignment, NestLevel+1, pDataDest, NULL, SwapFlag);
else
FieldAttributes = MatlabCStruct(pField, MemoryAlignment, NestLevel+1, pDataDest+LocalAttributes.StorageSize+Attributes.StorageSize, NULL, SwapFlag);
}
if (pDataSource) {
if ((long)pDataSource == -1)
FieldAttributes = MatlabCStruct(pField, MemoryAlignment, NestLevel+1, NULL, pDataSource, SwapFlag);
else
FieldAttributes = MatlabCStruct(pField, MemoryAlignment, NestLevel+1, NULL, pDataSource+LocalAttributes.StorageSize+Attributes.StorageSize, SwapFlag);
}
LocalAttributes.StorageSize += FieldAttributes.StorageSize * FieldAttributes.ElementCount;
LocalAttributes.Alignment = MAX(LocalAttributes.Alignment, FieldAttributes.Alignment);
LocalAttributes.ElementCount = 1;
}
// See if padding needs to be added at the end of the structure
if (LocalAttributes.StorageSize % LocalAttributes.Alignment > 0) {
int Padding;
Padding = LocalAttributes.Alignment - (LocalAttributes.StorageSize % LocalAttributes.Alignment);
if (MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [%d bytes of padding]\n", LocalAttributes.StorageSize, Padding);
}
LocalAttributes.StorageSize += Padding;
}
Attributes.StorageSize += LocalAttributes.StorageSize * LocalAttributes.ElementCount;
Attributes.Alignment = MAX(Attributes.Alignment, LocalAttributes.Alignment);
if (nElem > 1 && MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
NestLevel--;
}
} // end for(j)
// See if padding needs to be added at the end of the structure
if (Attributes.StorageSize % Attributes.Alignment > 0) {
int Padding;
Padding = Attributes.Alignment - (Attributes.StorageSize % Attributes.Alignment);
if (MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [%d bytes of padding]\n", Attributes.StorageSize, Padding);
}
Attributes.StorageSize += Padding;
}
if (MatlabCStruct_DebugFlag && (pDataDest || pDataSource)) {
SPACES printf("%3d: [end of structure]\n", Attributes.StorageSize);
}
// 08/14/03 jaj Make the element count 1 for structure arrays
Attributes.ElementCount = 1;
} // end array is Structure
else {
// Array is any of the basic, non-aggregate types, except mxChar
// Handle byte-swapping on Windows WIN32 platform
Attributes.StorageSize = Attributes.ElementSize;
Attributes.Alignment = MIN(Attributes.StorageSize, MemoryAlignment);
if (pDataDest && (long)pDataDest != -1) {
memcpy(pDataDest, mxGetData(pArray), Attributes.ElementSize * Attributes.ElementCount);
if (SwapFlag)
SwapBytes((char *)pDataDest, Attributes.ElementSize, Attributes.ElementCount);
}
if (pDataSource && (long)pDataSource != -1) {
if (SwapFlag)
SwapBytes((char *)pDataSource, Attributes.ElementSize, Attributes.ElementCount);
memcpy(mxGetData(pArray), pDataSource, Attributes.ElementSize * Attributes.ElementCount);
// and un-swap
if (SwapFlag)
SwapBytes((char *)pDataSource, Attributes.ElementSize, Attributes.ElementCount);
}
} // end basic type (except mxChar)
return Attributes;
} // end MatlabCStruct()
openair1/EMOS/LTE/IMPORT_FILTER/MatlabCStruct.h
-55
View File
@@ -1,55 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
//--------------------------------------------------------------
// file: MatlabCStruct.h - Include file for MatlabCStruct.c
//--------------------------------------------------------------
//--------------------------------------------------------------
// ELEMENT_ATTRIBUTES
//--------------------------------------------------------------
typedef struct {
int ElementSize; // Number of bytes required for storage of a single element in a Matlab array
int ElementCount; // Number of elements in array
int StorageSize; // Number of bytes required for storage of a single element in a C Structure
int Alignment; // 1, 2, 4, or 8 denoting required byte alignment for this structure.
} ELEMENT_ATTRIBUTES;
extern int MatlabCStruct_DebugFlag;
// Function prototypes
ELEMENT_ATTRIBUTES MatlabCStruct(const mxArray *pArray, int MemoryAlignment, int NestLevel,
unsigned char *pDataDest, unsigned char *pDataSource,
int SwapFlag);
char *ClassIDText(const mxArray *pArray);
void SwapBytes(char *p0, int size, int count);
#define SWAP(x) SwapBytes(&(x), sizeof(x))
openair1/EMOS/LTE/IMPORT_FILTER/binread.m
-53
View File
@@ -1,53 +0,0 @@
function s=binread(fid,fmt,count,varargin)
% BINREAD - Read formatted binary data from a file
% S=BINREAD(FID,TEMPLATE) reads binary data from an open file handle and
% formats it according to TEMPLATE. TEMPLATE is typically a structure, but
% it may be any data or aggregate type. Refer to CSTRUCT for more details
% on formatting.
%
% S=BINREAD(...,COUNT) reads sucessive records from the file. If COUNT is
% INF, then all data possible is read from the file. If omitted, or empty,
% only one data record will be read.
%
% S=BINREAD(...,COUNT,OPTS) passes the OPTS along to the call to CSTRUCT
% which allows the byte alignment or order to be changed from default.
%
% Example: (modeled from C structures)
% header_template = struct('DataType',uint32(0),'DataCount',uint32(0));
% data_template = struct('SampleTime',double(0),'Data',int16(zeros(1,16)));
% fid = fopen('myfile.bin','rb');
% header = binread(fid,header_template);
% data = binread(fid,data_template,double(header.DataCount));
%
% See also BINREAD, FOPEN, CSTRUCT
% 11/14/2003 fixed OBOB thanks to Olaf Bousche
if nargin < 3
count = 1;
end
attrib = cstruct(fmt,[],varargin{:});
if isinf(count)
s=cell(0,0);
else
s = cell(count,1); % Preallocate cell structure
end
i=1;
while i <= count % 11/14/2003 '<' changed to '<='
b = uint8(fread(fid,attrib.size,'uint8'));
if length(b) < attrib.size
if length(b) > 0
warning('partial data record at end of file');
end
s(i:end) = []; % Out of data, remove extraneous elements
break;
end
s{i} = cstruct(fmt,b,varargin{:});
i = i+1;
end
try
% Try de-celling the data, if possible
s = [s{:}];
end
openair1/EMOS/LTE/IMPORT_FILTER/binwrite.m
-25
View File
@@ -1,25 +0,0 @@
function n=binwrite(fid,data,varargin)
%BINWRITE - Write data to a formatted binary file
% BINWRITE(FID,DATA) writes data to an open file handle in a binary
% format, according to the structure of DATA, and returns the number of
% bytes written to the file. DATA is typically a structure, but it may
% be any data or aggregate type. Refer to CSTRUCT for more details on
% formatting.
%
% S=BINWRITE(...,,OPTS) passes the OPTS along to the call to CSTRUCT
% which allows the byte alignment or order to be changed from default.
%
% Example: (modeled from C structures)
% data(1) = struct('SampleTime',double(8),'Data',int16(1:16));
% data(2) = struct('SampleTime',double(9),'Data',int16(101:116));
% data(3) = struct('SampleTime',double(10),'Data',int16(201:216));
% header = struct('DataType',uint32(1),'DataCount',uint32(length(data)));
% fid = fopen('myfile.bin','wb');
% binwrite(fid,header);
% binwrite(fid,data);
% fclose(fid);
%
% See also BINREAD, FOPEN, CSTRUCT
[attrib,bytes] = cstruct(data);
n = fwrite(fid,bytes,'uint8');
openair1/EMOS/LTE/IMPORT_FILTER/cstruct.c
-161
View File
@@ -1,161 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
//--------------------------------------------------------------
// file: cstruct.c - Analyze a Matlab array, to determine how it
// would fit into C structure.
// 05/25/2004 jaj Removed <windows.h> include; stricter type
// type compatibility when calling mxCreateStructMatrix();
//--------------------------------------------------------------
#include "mex.h"
#include <math.h>
//#include <windows.h> jaj 05/25/2004 removed
#include "MatlabCStruct.h"
// TODO: Add you supporting functions here
//--------------------------------------------------------------
// function: mexFunction - Entry point from Matlab environment
// INPUTS:
// nlhs - number of left hand side arguments (outputs)
// plhs[] - pointer to table where created matrix pointers are
// to be placed
// nrhs - number of right hand side arguments (inputs)
// prhs[] - pointer to table of input matrices
//--------------------------------------------------------------
void mexFunction( int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[] )
{
ELEMENT_ATTRIBUTES Attributes;
int ByteCount; // Total number of bytes required for C structure
int Alignment = 8;
int SwapFlag; // Byte Swapping Flag
int LittleEndian = 0; // 0/1=local machine is big/litle Endian
int ii;
// Determine local byte ordering
{
unsigned char pattern[2] = {0x12, 0x34};
unsigned short word1 = 0x1234;
unsigned short word2 = *(unsigned short *)&pattern;
LittleEndian = (word1 == word2) ? 0 : 1;
}
SwapFlag = LittleEndian; // Default = assume data is big endian
if (nlhs == 0)
MatlabCStruct_DebugFlag = 1;
else
MatlabCStruct_DebugFlag = 0;
if (nrhs < 1)
mexErrMsgTxt("Not enough input arguments.");
if (nrhs >= 3) {
for (ii=2; ii<nrhs; ii++) {
// Double = alignment specifier
if (mxIsDouble(prhs[ii])) {
if (mxGetNumberOfElements(prhs[ii]) != 1)
mexErrMsgTxt("Alignment specifier must be single element (1, 2, 4, or 8)");
Alignment = (int)*mxGetPr(prhs[ii]);
if (Alignment != 1 && Alignment != 2 && Alignment != 4 && Alignment != 8)
mexWarnMsgTxt("Alignment specifier normally has of value of 1, 2, 4, or 8");
} else if (mxIsChar(prhs[ii])) {
char ch;
if (mxGetNumberOfElements(prhs[ii]) != 1)
mexErrMsgTxt("Byte-ordering specifier must be single element ('n','l','b' or 'r')");
ch = *(char *)mxGetData(prhs[ii]);
switch(ch) {
case 'n':
SwapFlag = 0;
break; // Native byte ordering requested
case 'b':
SwapFlag = LittleEndian;
break; // Big Endian data
case 'l':
SwapFlag = !LittleEndian;
break; // Big Endian data
case 'r':
SwapFlag = 1;
break; // Reverse byte ordering
default:
mexErrMsgTxt("Byte-ordering specifier must be one if 'n','l','b' or 'r'");
}
} else
mexErrMsgTxt("Optional Arguments must be either Aligmnent Specifier (1,2,4,8), or Byte-orderin Specifier ('n','l','b','r')");
}
}
Attributes = MatlabCStruct(prhs[0], Alignment, 0, (unsigned char *)-1, NULL, SwapFlag);
ByteCount = Attributes.ElementCount*Attributes.StorageSize;
if (nrhs >= 2 && !mxIsEmpty(prhs[1])) {
mxClassID ClassID;
ClassID = mxGetClassID(prhs[1]);
if (ClassID != mxUINT8_CLASS && ClassID != mxINT8_CLASS)
mexErrMsgTxt("Byte data vector must be of type INT8 or UINT8");
if (ByteCount != mxGetNumberOfElements(prhs[1])) {
char msg[100];
sprintf(msg, "Number of elements in Byte data vector (%d) does not match structure size (%d)",
mxGetNumberOfElements(prhs[1]), ByteCount);
mexErrMsgTxt(msg);
}
plhs[0] = mxDuplicateArray(prhs[0]);
MatlabCStruct(plhs[0], Alignment, 0, NULL, mxGetData(prhs[1]), SwapFlag);
} else
// Create output structure for Attributes
{
const char *FieldNames[] = {"size","align"}; // jaj 05/24/2004 added const
plhs[0] = mxCreateStructMatrix(1, 1, 2, &FieldNames[0]);// jaj 05/24/2004 slightly altered
mxSetField(plhs[0], 0, "size", mxCreateDoubleScalar(ByteCount));
mxSetField(plhs[0], 0, "align", mxCreateDoubleScalar(Attributes.Alignment));
if (nlhs >= 2) {
// Extract C Data from array
plhs[1] = mxCreateNumericMatrix(1, ByteCount, mxUINT8_CLASS, mxREAL);
MatlabCStruct(prhs[0], Alignment, 0, mxGetData(plhs[1]), NULL, SwapFlag);
}
}
} // end mexFunction()
openair1/EMOS/LTE/IMPORT_FILTER/cstruct.dll
BIN
View File
Binary file not shown.
openair1/EMOS/LTE/IMPORT_FILTER/cstruct.m
-48
View File
@@ -1,48 +0,0 @@
%CSTRUCT Analyze a Matlab array to be packed into a C structure
% ATTRIB = CSTRUCT(FORMAT) analyzes a Matlab array, to determine how many
% bytes required to pack the data into a C language structure, and its
% byte alignment. FORMAT is any numerical or aggregate (CELL or STRUCT)
% data type. ATTRIB is a structure containing fields SIZE, which
% determines how many bytes are required to store data organized lie
% FORMAT, and ALIGN which is the data's byte alignment.
%
% DATA = CSTRUCT(FORMAT,BYTES) - packs the INT8 or UINT8 type values in
% BYTES, organizes them according to FORMAT, and returns the bytes as
% DATA.
%
% [ATTRIB,BYTES] = CSTRUCT(DATA) allows conversion of a Matlab structure
% to a UINT8 vector BYTES as would be stored by a C structure.
%
% ATTRIB = CSTRUCT(FORMAT,[],...) and
% [ATTRIB,BYTES] = CSTRUCT(DATA,[],...) and
% DATA = CSTRUCT(FORMAT,BYTES,...) allows options to be specified starting
% at the third argument.
%
% [...] = CSTRUCT(...,ALIGNEMNT) allows the default byte
% alignment of 8 to be changed to the specified value, typically 1, 2, 4,
% 8, depending on how the C (or other) compiler organizes the data within
% BYTES.
%
% [...] = CSTRUCT(...,BYTEORDER) allows the default byte order (big Endian)
% of the binary data to be changed using one of the following characters:
% 'n' - Native byte ordering (byte are not swapped, regarless of platform)
% 'l' - Little Endian byte ordering
% 'b' - Big Endian byte ordering
% 'r' - Reverse byte ordering (bytes always swapped)
%
% CSTRUCT is particularly useful when reading or writing data to/from a
% file or socket interface which contains data that was created in
% another language, such as C. As an example, lets say the following C
% structure as written to a file:
% struct { long A; double B; char C[5]; };
% Because double values are (typically) aligned on 8-byte boundaries,
% padding gets added to the structure. The memory-byte representation
% or BYTES would be (24 bytes):
% A A A A x x x x B B B B B B B B C C C C C x x x
% To convert this vector of bytes to a matlab structure, the following
% would work:
% DATA = CSTRUCT(struct('A',int32(0),'B',double(0),'C','xxxxx'},BYTES)
% DATA would be STRUCT fields A, B and C with data types INT32, DOUBLE
% and CHAR, respectively.
%
% See also BINREAD, BINWRITE, COMPUTER
openair1/EMOS/LTE/IMPORT_FILTER/cstruct.mex
BIN
View File
Binary file not shown.
openair1/EMOS/LTE/IMPORT_FILTER/cstruct.mexa64
BIN
View File
Binary file not shown.
openair1/EMOS/LTE/IMPORT_FILTER/cstruct.mexglx
BIN
View File
Binary file not shown.
openair1/EMOS/LTE/IMPORT_FILTER/cstruct.mexw64
BIN
View File
Binary file not shown.
openair1/EMOS/LTE/IMPORT_FILTER/dump_size.c
-45
View File
@@ -1,45 +0,0 @@
/*******************************************************************************
OpenAirInterface
Copyright(c) 1999 - 2014 Eurecom
OpenAirInterface 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.
OpenAirInterface 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 OpenAirInterface.The full GNU General Public License is
included in this distribution in the file called "COPYING". If not,
see <http://www.gnu.org/licenses/>.
Contact Information
OpenAirInterface Admin: openair_admin@eurecom.fr
OpenAirInterface Tech : openair_tech@eurecom.fr
OpenAirInterface Dev : openair4g-devel@eurecom.fr
Address : Eurecom, Campus SophiaTech, 450 Route des Chappes, CS 50193 - 06904 Biot Sophia Antipolis cedex, FRANCE
*******************************************************************************/
#include <gps.h>
#include "SCHED/phy_procedures_emos.h"
int main(void)
{
printf("MAX_CQI_BITS = %zu;\n",MAX_CQI_BITS);
printf("PHY_measurements_size = %zu;\n",sizeof(PHY_MEASUREMENTS));
printf("PHY_measurements_eNb_size = %zu;\n",sizeof(PHY_MEASUREMENTS_eNB));
//printf("UCI_data_t_size = %zu;\n",sizeof(UCI_DATA_t));
//printf("DCI_alloc_t_size = %zu;\n",sizeof(DCI_ALLOC_t));
printf("eNb_UE_stats_size = %zu;\n",sizeof(LTE_eNB_UE_stats));
printf("fifo_dump_emos_UE_size = %zu;\n",sizeof(fifo_dump_emos_UE));
printf("fifo_dump_emos_eNb_size = %zu;\n",sizeof(fifo_dump_emos_eNB));
printf("gps_fix_t_size = %zu;\n",sizeof(struct gps_fix_t));
printf("align = %zu;\n",sizeof(void*));
return(0);
}
openair1/EMOS/LTE/IMPORT_FILTER/example.m
-89
View File
@@ -1,89 +0,0 @@
clear all
close all
addpath('../IMPORT_FILTER');
% [estimates_eNB,NFrames_eNB]=load_estimates_lte_new('E:\EMOS\recip_exmimo2\eNB_data_20130327_163635.EMOS',inf,1,1);
% [estimates_UE,NFrames_UE]=load_estimates_lte_new('E:\EMOS\recip_exmimo2\UE_data_20130327_163721.EMOS',inf,1,0);
[estimates_eNB,NFrames_eNB]=load_estimates_lte_new('E:\EMOS\recip_exmimo2\eNB_data_20130328_114006.EMOS',inf,1,1);
[estimates_UE,NFrames_UE]=load_estimates_lte_new('E:\EMOS\recip_exmimo2\UE_data_20130328_115128.EMOS',inf,1,0);
%load eNB_estimates2
%load UE_estimates2
% use r3531 for measuremnts taken march 2013
struct_template_new
%%
NFrames = 1000;
decimation = 1;
NFrames_eNB = size(estimates_eNB,2);
NFrames_UE = size(estimates_UE,2);
H_eNB = complex(zeros(floor(NFrames/decimation),size(fifo_dump_emos_struct_eNb.channel,1)/2,size(fifo_dump_emos_struct_eNb.channel,2)));
H_UE = complex(zeros(floor(NFrames/decimation),size(fifo_dump_emos_struct_UE.channel,1)/2,size(fifo_dump_emos_struct_UE.channel,2),size(fifo_dump_emos_struct_UE.channel,3)));
% find the indices to align the eNB and the UE data
frames_eNB = [estimates_eNB.frame_tx]; %frame counter at eNB
frames_UE = [estimates_UE.frame_rx]; %frame counter at UE
%frame0 = frames_UE(3);
%idx0_eNB = find(frames_eNB==frame0);
%idx0_UE = find(frames_UE==frame0);
idx0_eNB = 1;
idx0_UE = 4354;
%%
for k=1:NFrames %-max(idx0_eNB,idx0_UE)
%disp([frame0+k-1 frames_eNB(idx0_eNB+k-1) frames_UE(idx0_UE+k-1)]);
H_eNB(k,:,:) = double(estimates_eNB(idx0_eNB+k-1).channel(1:2:end,:)) + 1j*double(estimates_eNB(idx0_eNB+k-1).channel(2:2:end,:));
H_UE(k,:,:,:) = double(estimates_UE(idx0_UE+k-1).channel(1:2:end,:,:)) + 1j*double(estimates_UE(idx0_UE+k-1).channel(2:2:end,:,:));
end
% size(H_eNB) = [NFrames,N_RB_UL_EMOS*12*N_PILOTS_UL_EMOS*N_SUBFRAMES_UL_EMOS,NB_ANTENNAS_RX_EMOS]
% where N_RB_UL_EMOS*12 = 25*12 = 300 is the number of usefull subcarriers
% N_PILOTS_UL_EMOS = 2 is the number of OFDM symbols per subframe that have pilots
% N_SUBFRAMES_UL_EMOS = 3 is the number of UL subframes per frame*
% size(H_UE) =
% [NFrames,NUMBER_OF_OFDM_CARRIERS_EMOS*N_PILOTS_DL_EMOS*N_SUBFRAMES_DL_EMOS,NB_ANTENNAS_TX_EMOS]
% where NUMBER_OF_OFDM_CARRIERS_EMOS = 512 is the number of OFDM carrier
% (out of which only the first 300 are non-zero)
% N_PILOTS_DL_EMOS = 4 is the number of OFDM carriers that have pilots
% (linear interpolation in the frequency domain has already been
% performed)
% N_SUBFRAMES_DL_EMOS = 5 is the number of DL subframes per frame*
% NB_ANTENNAS_TX_EMOS = NB_ANTENNAS_RX =2 is the number of antennas at the eNB
% (the UE has one antenna for TX/RX)
% *here we are using TDD configuration 3 which looks like this (S = special subframe)
% [DL | S | UL | UL | UL | DL | DL | DL | DL | DL]
%%
figure(1)
hold off
%plot(idx0_eNB:idx0_eNB+NFrames_eNB-1,[estimates_eNB.frame_tx]-1024*4)
%hold on
plot(idx0_UE:idx0_UE+NFrames_UE-1,[estimates_UE.frame_rx],'r')
%%
txant = 1;
rxant = 1;
frames = 201:210;
%H_UE2 = reshape(permute(H_UE(frames,2049:2560,:),[2 1 3]),512,[],2);
%H_UE2 = reshape(permute(H_UE(:,2561:3072,:),[2 1 3]),512,[],2);
H_UE2 = reshape(permute(H_UE(:,1:512,:),[2 1 3]),512,NFrames,2,2);
H_UE3 = complex(zeros(size(H_UE2)));
H_UE3(363:512,:,:,:) = H_UE2(6:155,:,:,:);
H_UE3(1:151,:,:,:) = H_UE2(156:306,:,:,:);
H_UE_t = ifft(conj(H_UE3),512,1); %the channel estimates are stored in conjugated format
H_UE_t = circshift(H_UE_t,[-15,0,0]); %shift the peak to the desired position
figure(2)
hold off
%waterfall(squeeze(20*log10(abs(H_UE_t))).')
plot(squeeze(20*log10(abs(H_UE_t(:,frames,txant,rxant)))))
title('PDP DL channel')
openair1/EMOS/LTE/IMPORT_FILTER/get_dump_size.m
-3
View File
@@ -1,3 +0,0 @@
system(sprintf('make clean && make dump_size EMOS_CHANNEL=%d',EMOS_CHANNEL));
[status,result] = system('./dump_size');
eval(result);
openair1/EMOS/LTE/IMPORT_FILTER/load_estimates_lte.m
-158
View File
@@ -1,158 +0,0 @@
function [H, H_fq, estimates, gps_data, NFrames] = load_estimates_lte(filename, NFrames_max, decimation, is_eNb, version)
%
% EMOS Single User Import Filter
%
% [H, H_fq, estimates, gps_data, NFrames] =
% load_estimates_lte(filename, NFrames_max, version)
%
% Parameters:
% filename - filename(s) of the EMOS data file
% NFrames_max - Maximum number of estimates. Leave it blank to get up to the
% maximum file contents
% decimation - read every 'decimation' frame
% is_eNb - if ~= 0 we load data from an eNb
% version - for backward compatibility (see details below)
%
% Returns:
% estimates - A structure array containing timestamp, etc
% gps_data - A structure array containing gps data
% NFrames - the number of read estimates
% Author: Florian Kaltenberger
% Copyright: Eurecom Sophia Antipolis
% Version History
% Date Version Comment
% 20100317 0.1 Created based on load_estimates
if nargin < 5
version = Inf;
end
if nargin < 4
is_eNb = 0;
end
if nargin < 3
decimation = 1;
end
if nargin < 2
NFrames_max = Inf;
end
% NTx = 2;
% NRx = 2;
% NFreq = 512;
% NZFreq = 300;
% Logfile structure:
% - 100 entries of type fifo_dump_emos (defined in phy_procedures_emos.h)
% - 1 entry of type gps_fix_t defined in gps.h
if exist('../IMPORT_FILTER/a.out','file') && isunix
[dummy,result] = system('../IMPORT_FILTER/a.out');
eval(result);
else
warning('File dump_size.c has to be compiled to enable error checking of sizes');
%PHY_measurements_size = 1120;
%UCI_data_t_size = 49;
%DCI_alloc_t_size = 16;
%eNb_UE_stats_size = 20;
%fifo_dump_emos_UE_size = 33492;
%fifo_dump_emos_eNb_size = 36980;
%gps_fix_t_size = 108;
end
struct_template;
if (version < 1)
fifo_dump_emos_struct_eNb = fifo_dump_emos_struct_eNb_old;
fifo_dump_emos_struct_eNb_a = fifo_dump_emos_struct_eNb_old_a;
end
gps_fix_t_size = gps_data_struct_a.size;
fifo_dump_emos_UE_size = fifo_dump_emos_struct_UE_a.size;
fifo_dump_emos_eNb_size = fifo_dump_emos_struct_eNb_a.size;
NO_ESTIMATES_DISK = 100;
if (is_eNb)
CHANNEL_BUFFER_SIZE = NO_ESTIMATES_DISK * fifo_dump_emos_eNb_size + gps_fix_t_size;
else
CHANNEL_BUFFER_SIZE = NO_ESTIMATES_DISK * fifo_dump_emos_UE_size + gps_fix_t_size;
end
if (mod(NO_ESTIMATES_DISK,decimation) ~= 0)
error('Decimation must be a divisor of %d',NO_ESTIMATES_DISK);
end
% Estimate the size of the file for a pre-allocation of memory
if ~iscell(filename)
filename = {filename};
end
NFiles = length(filename);
NFrames_file = zeros(1,NFiles);
for n=1:NFiles
if ~exist(filename{n},'file')
error('File does not exist!')
end
info_file = dir(filename{n});
NFrames_file(n) = floor(info_file.bytes/CHANNEL_BUFFER_SIZE)*NO_ESTIMATES_DISK;
if (mod(info_file.bytes,CHANNEL_BUFFER_SIZE) ~= 0)
warning('File size not a multiple of buffer size. File might be corrupt or is_eNb flag is wrong.');
end
end
NFrames = min(sum(NFrames_file), NFrames_max);
if (is_eNb)
estimates = repmat(fifo_dump_emos_struct_eNb,1,floor(NFrames/decimation));
else
estimates = repmat(fifo_dump_emos_struct_UE,1,floor(NFrames/decimation));
end
gps_data = repmat(gps_data_struct,1,NFrames/100);
k = 1;
l = 1;
for n=1:NFiles
fid = fopen(filename{n},'r');
while (~feof(fid) && (k <= min(sum(NFrames_file(1:n)),NFrames_max)))
if (is_eNb)
estimates_tmp = binread(fid,fifo_dump_emos_struct_eNb,1,4,'l');
else
estimates_tmp = binread(fid,fifo_dump_emos_struct_UE,1,4,'l');
end
if (mod((k-1),decimation) == 0)
estimates(((k-1)/decimation)+1) = estimates_tmp;
end
%read GPS data
if ((mod(k,NO_ESTIMATES_DISK)==0) && ~feof(fid))
gps_data(l) = binread(fid,gps_data_struct,1,4,'l');
l=l+1;
end
%I will have to add it here if the data is huge
%enough************************************************************
%******************************************************************
%******************************************************************
k=k+1;
end
fclose(fid);
end
H=[];
H_fq=[];
% H_fq = complex(zeros(NRx,NTx,NFreq/NTx,NFrames));
% H_fq(1,:,:,:) = reshape(chan0,NTx,NFreq/NTx,NFrames);
% H_fq(2,:,:,:) = reshape(chan1,NTx,NFreq/NTx,NFrames);
%
% H = ifft(H_fq,[],3);
%
% % remove zero carriers from Frequency response
% NZFreq_ind = [(176/NTx+1):(256/NTx) 1:(80/NTx)]; % Non-zero frequency indices
% H_fq = H_fq(:,:,NZFreq_ind,:);
%
openair1/EMOS/LTE/IMPORT_FILTER/load_estimates_lte_new.m
-128
View File
@@ -1,128 +0,0 @@
function [estimates, NFrames, gps_data, H] = load_estimates_lte_new(filename, NFrames_max, decimation, is_eNb, EMOS_CHANNEL, align)
%
% EMOS Single User Import Filter
%
% [estimates, NFrames] =
% load_estimates_lte(filename, NFrames_max, decimation, is_eNb, EMOS_CHANNEL, align)
%
% Parameters:
% filename - filename(s) of the EMOS data file
% NFrames_max - Maximum number of estimates. Leave it blank to get up to the
% maximum file contents
% decimation - read every 'decimation' frame
% is_eNb - if ~= 0 we load data from an eNb
% EMOS_CHANNEL - if the measurement contains the full channel estimate, set this to 1
% align - alignment of the data structures. If data was recorded on a 64bit
% machine set this to 8, for 32bit use 4.
%
% Returns:
% estimates - A structure array containing timestamp, etc
% gps_data - A structure array containing gps data
% NFrames - the number of read estimates
% Author: Florian Kaltenberger
% Copyright: Eurecom Sophia Antipolis
% Version History
% Date Version Comment
% 20100317 0.1 Created based on load_estimates
if nargin < 6
align=4;
end
if nargin < 5
EMOS_CHANNEL = 0;
end
if nargin < 4
is_eNb = 1;
end
if nargin < 3
decimation = 1;
end
if nargin < 2
NFrames_max = Inf;
end
% Logfile structure:
% - 100 entries of type fifo_dump_emos (defined in phy_procedures_emos.h)
struct_template_new;
gps_fix_t_size = gps_data_struct_a.size;
fifo_dump_emos_UE_size = fifo_dump_emos_struct_UE_a.size;
fifo_dump_emos_eNb_size = fifo_dump_emos_struct_eNb_a.size;
NO_ESTIMATES_DISK = 100;
if (is_eNb)
CHANNEL_BUFFER_SIZE = NO_ESTIMATES_DISK * fifo_dump_emos_eNb_size + gps_fix_t_size;
else
CHANNEL_BUFFER_SIZE = NO_ESTIMATES_DISK * fifo_dump_emos_UE_size + gps_fix_t_size;
end
if (mod(NO_ESTIMATES_DISK,decimation) ~= 0)
error('Decimation must be a divisor of %d',NO_ESTIMATES_DISK);
end
% Estimate the size of the file for a pre-allocation of memory
if ~iscell(filename)
filename = {filename};
end
NFiles = length(filename);
NFrames_file = zeros(1,NFiles);
for n=1:NFiles
if ~exist(filename{n},'file')
error('File does not exist!')
end
info_file = dir(filename{n});
NFrames_file(n) = floor(info_file.bytes/CHANNEL_BUFFER_SIZE)*NO_ESTIMATES_DISK;
if (mod(info_file.bytes,CHANNEL_BUFFER_SIZE) ~= 0)
warning('File size not a multiple of buffer size. File might be corrupt or is_eNb flag or alignment is wrong.');
end
end
NFrames = min(sum(NFrames_file), NFrames_max);
if (is_eNb)
estimates = repmat(fifo_dump_emos_struct_eNb,1,floor(NFrames/decimation));
if nargout==4
H = complex(zeros(floor(NFrames/decimation),size(fifo_dump_emos_struct_eNb.channel,1)/2,size(fifo_dump_emos_struct_eNb.channel,2)));
end
else
estimates = repmat(fifo_dump_emos_struct_UE,1,floor(NFrames/decimation));
if nargout==4
H = complex(zeros(floor(NFrames/decimation),size(fifo_dump_emos_struct_UE.channel,1)/2,size(fifo_dump_emos_struct_UE.channel,2)));
end
end
%gps_data = repmat(gps_data_struct,1,NFrames/100);
k = 1;
l = 1;
for n=1:NFiles
fid = fopen(filename{n},'r');
while (~feof(fid) && (k <= min(sum(NFrames_file(1:n)),NFrames_max)))
if (is_eNb)
estimates_tmp = binread(fid,fifo_dump_emos_struct_eNb,1,align,'l');
else
estimates_tmp = binread(fid,fifo_dump_emos_struct_UE,1,align,'l');
end
if (mod((k-1),decimation) == 0)
estimates(((k-1)/decimation)+1) = estimates_tmp;
end
if nargout==4
H(k,:,:) = (double(estimates_tmp.channel(1:2:end,:)) + 1j*double(estimates_tmp.channel(2:2:end,:)));
end
%read GPS data
if ((mod(k,NO_ESTIMATES_DISK)==0) && ~feof(fid))
gps_data(l) = binread(fid,gps_data_struct,1,align,'l');
l=l+1;
end
k=k+1;
end
fclose(fid);
end
openair1/EMOS/LTE/IMPORT_FILTER/struct_template.m
-290
View File
@@ -1,290 +0,0 @@
% file: struct_template.m
% author: florian.kaltenberger@eurecom.fr
% date: 13.3.2010
% purpose: this file reconstructs the structures fifo_dump_emos_struct_UE
% and fifo_dump_emos_struct_UE which are defined in
% SCHED/phy_procedures_emos.h
NUMBER_OF_OFDM_CARRIERS_EMOS = 512;
NUMBER_OF_USEFUL_CARRIERS_EMOS = 300;
N_RB_DL_EMOS = 25;
N_PILOTS_PER_RB = 4;
N_SLOTS_EMOS = 4;
N_RB_UL_EMOS = 25;
N_SRS_SYMBOLS = 3;
N_PILOTS_PER_RB_UL = 12;
N_SRS_SYMBOLS_OLD = 5;
MAX_DCI_PER_FRAME = 20;
MAX_UCI_PER_FRAME = 20;
PBCH_PDU_SIZE = 6;
NUMBER_OF_eNB_MAX = 3;
NUMBER_OF_UE_MAX = 1;
NUMBER_OF_SUBBANDS = 7;
NB_ANTENNAS_RX = 2;
NB_ANTENNAS_TX = 2;
MAX_CQI_BITS = 40;
MAX_DCI_SIZE_BITS = 45;
phy_measurements_struct = struct(...
'n0_power', uint32(zeros(1,NB_ANTENNAS_RX)),...
'n0_power_dB', uint16(zeros(1,NB_ANTENNAS_RX)),...
'n0_power_tot', uint32(0),...
'n0_power_tot_dB', uint16(0),...
'n0_power_tot_dBm', int16(0),...
'rx_spatial_power', uint32(zeros(2,2,NUMBER_OF_eNB_MAX)),...
'rx_spatial_power_dB', uint16(zeros(2,2,NUMBER_OF_eNB_MAX)),...
'rx_rssi_dBm', int16(zeros(1,NUMBER_OF_eNB_MAX)),...
'rx_correlation', int32(zeros(2,NUMBER_OF_eNB_MAX)),...
'rx_correlation_dB', int32(zeros(2,NUMBER_OF_eNB_MAX)),...
'wideband_cqi', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'wideband_cqi_dB', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'wideband_cqi_tot', int32(zeros(1,NUMBER_OF_eNB_MAX)),...
'precoded_cqi_dB', int32(zeros(4,NUMBER_OF_eNB_MAX)),...
'subband_cqi', int32(zeros(NUMBER_OF_SUBBANDS,NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'subband_cqi_tot', int32(zeros(NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'subband_cqi_dB', int32(zeros(NUMBER_OF_SUBBANDS,NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'subband_cqi_tot_dB', int32(zeros(NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'wideband_pmi_re', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'wideband_pmi_im', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'subband_pmi_re', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'subband_pmi_im', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'selected_rx_antennas', int8(zeros(NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'rank', uint8(zeros(1,NUMBER_OF_eNB_MAX)));
phy_measurements_struct_a = cstruct(phy_measurements_struct,[],4);
if (exist('PHY_measurements_size','var') && (phy_measurements_struct_a.size ~= PHY_measurements_size))
error('PHY_measurements_size does not match');
end
phy_measurements_eNb_struct = struct(...
'n0_power', uint32(zeros(1,NB_ANTENNAS_RX)),...
'n0_power_dB', uint16(zeros(1,NB_ANTENNAS_RX)),...
'n0_power_tot', uint32(0),...
'n0_power_tot_dB', uint16(0),...
'n0_power_tot_dBm', int16(0),...
'n0_subband_power', uint16(zeros(N_RB_UL_EMOS,NB_ANTENNAS_RX)),...
'n0_subband_power_dB', uint16(zeros(N_RB_UL_EMOS,NB_ANTENNAS_RX)),...
'n0_subband_power_tot_dB', int16(zeros(1,N_RB_UL_EMOS)),...
'n0_subband_power_tot_dBm', int16(zeros(1,N_RB_UL_EMOS)),...
'rx_spatial_power', uint32(zeros(2,2,NUMBER_OF_UE_MAX)),...
'rx_spatial_power_dB', uint16(zeros(2,2,NUMBER_OF_UE_MAX)),...
'rx_rssi_dBm', int16(zeros(1,NUMBER_OF_UE_MAX)),...
'rx_correlation', int32(zeros(2,NUMBER_OF_UE_MAX)),...
'rx_correlation_dB', int32(zeros(2,NUMBER_OF_UE_MAX)),...
'wideband_cqi', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_UE_MAX)),...
'wideband_cqi_dB', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_UE_MAX)),...
'wideband_cqi_tot', int8(zeros(1,NUMBER_OF_UE_MAX)),...
'subband_cqi', int32(zeros(N_RB_UL_EMOS,NB_ANTENNAS_RX,NUMBER_OF_UE_MAX)),...
'subband_cqi_tot', int32(zeros(N_RB_UL_EMOS,NUMBER_OF_UE_MAX)),...
'subband_cqi_dB', int32(zeros(N_RB_UL_EMOS,NB_ANTENNAS_RX,NUMBER_OF_UE_MAX)),...
'subband_cqi_tot_dB', int32(zeros(N_RB_UL_EMOS,NUMBER_OF_UE_MAX)));
phy_measurements_eNb_struct_a = cstruct(phy_measurements_eNb_struct,[],4);
if (exist('PHY_measurements_eNb_size','var') && (phy_measurements_eNb_struct_a.size ~= PHY_measurements_eNb_size))
error('PHY_measurements_eNb_size does not match');
end
uci_data_struct = struct(...
'o',uint8(zeros(1,MAX_CQI_BITS)),...
'O',uint8(0),...
'o_RI',uint8(zeros(1,2)),...
'O_RI',uint8(0),...
'o_ACK',uint8(zeros(1,4)),...
'O_ACK',uint8(0));
uci_data_struct_a = cstruct(uci_data_struct,[],4);
if (exist('UCI_data_t_size','var') && (uci_data_struct_a.size ~= UCI_data_t_size))
error('UCI_data_t_size does not match');
end
dci_alloc_struct = struct(...
'dci_length',uint8(0),...
'L',uint8(0),...
'rnti',uint16(0),...
'format',uint32(0),...
'dci_pdu',uint16(zeros(1,1+floor(MAX_DCI_SIZE_BITS/16))));
% this one does not work unfortunately
% dci_alloc_struct = struct(...
% 'dci_length',uint8(0),...
% 'L',uint8(0),...
% 'rnti',uint16(0),...
% 'format',uint32(0),...
% 'rah',logical(0),...
% 'rballoc',logical(zeros(1,13)),...
% 'TPC',logical(zeros(1,2)),... %16
%
% 'dai',logical(zeros(1,2)),... 1:2
% 'harq_pid',logical(zeros(1,4)),... 3:6
% 'tb_swap',logical(0),... 7
% 'mcs1',logical(zeros(1,5)),... 8:12
% 'ndi1',logical(0),... 13
% 'rv1',logical(zeros(1,2)),... 14:15
% 'tpmi',logical(zeros(1,3)),... 16:17:...
% 'mcs2',logical(zeros(1,5)),...
% 'ndi2',logical(0),...
% 'rv2',logical(zeros(1,2)),...
% 'padding',logical(zeros(1,6)));
dci_alloc_struct_a = cstruct(dci_alloc_struct,[],4);
if (exist('DCI_alloc_t_size','var') && (dci_alloc_struct_a.size ~= DCI_alloc_t_size))
error('DCI_alloc_t_size does not match');
end
eNb_UE_stats_struct = struct(...
'UL_rssi',int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_UE_MAX)),...
'DL_cqi',uint8(zeros(2,NUMBER_OF_UE_MAX)),...
'DL_diffcqi',uint8(zeros(2,NUMBER_OF_UE_MAX)),...
'DL_pmi_single',uint16(zeros(1,NUMBER_OF_UE_MAX)),...
'DL_pmi_dual',uint16(zeros(1,NUMBER_OF_UE_MAX)),...
'rank',uint8(zeros(1,NUMBER_OF_UE_MAX)),...
'UE_id',uint16(zeros(1,NUMBER_OF_UE_MAX)),...
'UE_timing_offset',int16(zeros(1,NUMBER_OF_UE_MAX)),...
'UE_mode',uint32(zeros(1,NUMBER_OF_UE_MAX)),...
'sector',uint8(zeros(1,NUMBER_OF_UE_MAX)));
eNb_UE_stats_struct_a = cstruct(eNb_UE_stats_struct,[],4);
if (exist('eNb_UE_stats_size','var') && (eNb_UE_stats_struct_a.size ~= eNb_UE_stats_size))
error('eNb_UE_stats_size does not match');
end
complex_struct = struct('real',int16(0),'imag',int16(0));
fifo_dump_emos_struct_UE = struct(...
'timestamp',int64(0),...
'frame_tx',uint32(0),...
'frame_rx',uint32(0),...
'UE_mode',uint32(0),...
'phy_measurements', repmat(phy_measurements_struct,1,20),...
'pbch_pdu',uint8(zeros(PBCH_PDU_SIZE,NUMBER_OF_eNB_MAX)),...
'pbch_errors',uint32(zeros(1,NUMBER_OF_eNB_MAX)),...
'pbch_errors_last',uint32(zeros(1,NUMBER_OF_eNB_MAX)),...
'pbch_errors_conseq',uint32(zeros(1,NUMBER_OF_eNB_MAX)),...
'pbch_fer',uint32(zeros(1,NUMBER_OF_eNB_MAX)),...
'dci_cnt',uint32(zeros(1,10)),...
'dci_errors',uint32(0),...
'dci_received',uint32(0),...
'dci_false',uint32(0),...
'dci_missed',uint32(0),...
'dci_alloc',repmat(dci_alloc_struct,10,2),...
'dlsch_errors',uint32(0),...
'dlsch_errors_last',uint32(0),...
'dlsch_received',uint32(0),...
'dlsch_received_last',uint32(0),...
'dlsch_fer',uint32(0),...
'dlsch_cntl_errors',uint32(0),...
'dlsch_ra_errors',uint32(0),...
'timing_offset',int32(0),...
'timing_advance',int32(0),...
'freq_offset',int32(0),...
'rx_total_gain_dB',uint32(0),...
'eNb_id',uint8(0),...
'mimo_mode',uint8(0),...
'channel',int32(zeros(N_RB_DL_EMOS*N_PILOTS_PER_RB*N_SLOTS_EMOS,NB_ANTENNAS_RX*NB_ANTENNAS_TX,NUMBER_OF_eNB_MAX)),...
'uci_cnt',uint32(zeros(1,10)),...
'uci_data',repmat(uci_data_struct,10,2));
fifo_dump_emos_struct_UE_a = cstruct(fifo_dump_emos_struct_UE,[],4);
if (exist('fifo_dump_emos_UE_size','var') && (fifo_dump_emos_struct_UE_a.size ~= fifo_dump_emos_UE_size))
error('fifo_dump_emos_UE_size does not match');
end
fifo_dump_emos_struct_eNb_old = struct(...
'timestamp',int64(0),...
'frame_tx',uint32(0),...
'dci_cnt',uint32(zeros(1,10)),...
'dci_alloc',repmat(dci_alloc_struct,10,2),...
'mimo_mode',uint8(0),...
'phy_measurements_eNb',repmat(phy_measurements_eNb_struct,1,3),...
'eNb_UE_stats',repmat(eNb_UE_stats_struct,10,NUMBER_OF_eNB_MAX),...
'ulsch_errors',uint32(0),...
'rx_total_gain_dB',uint32(0),...
'channel',int16(zeros(N_RB_DL_EMOS*N_PILOTS_PER_RB_UL*2,NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX,N_SRS_SYMBOLS_OLD)));
fifo_dump_emos_struct_eNb_old_a = cstruct(fifo_dump_emos_struct_eNb_old,[],4);
fifo_dump_emos_struct_eNb = struct(...
'timestamp',int64(0),...
'frame_tx',uint32(0),...
'dci_cnt',uint32(zeros(1,10)),...
'dci_alloc',repmat(dci_alloc_struct,10,2),...
'mimo_mode',uint8(0),...
'phy_measurements_eNb',repmat(phy_measurements_eNb_struct,1,3),...
'eNb_UE_stats',repmat(eNb_UE_stats_struct,3,1),...
'ulsch_errors',uint32(0),...
'rx_total_gain_dB',uint32(0),...
'channel',int16(zeros(NUMBER_OF_OFDM_CARRIERS_EMOS*2,NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX,N_SRS_SYMBOLS)));
fifo_dump_emos_struct_eNb_a = cstruct(fifo_dump_emos_struct_eNb,[],4);
if (exist('fifo_dump_emos_eNb_size','var') && (fifo_dump_emos_struct_eNb_a.size ~= fifo_dump_emos_eNb_size))
error('fifo_dump_emos_eNb_size does not match');
end
gps_data_struct = struct(...
'timestamp', double(0),...
'mode', int32(0),...
'ept',double(0),...
'latitude',double(0),...
'longitude',double(0),...
'eph',double(0),...
'altitude',double(0),...
'epv',double(0),...
'track',double(0),...
'epd',double(0),...
'speed',double(0),...
'eps',double(0),...
'climb',double(0),...
'epc',double(0));
gps_data_struct_a = cstruct(gps_data_struct,[],4);
if (exist('gps_fix_t_size','var') && (gps_data_struct_a.size ~= gps_fix_t_size))
error('gps_data_struct_size does not match');
end
min_estimates_struct = struct(...
'mcs',double(0),...
'tbs',double(0),...
'rx_rssi_dBm',int16(0),...
'frame_tx',uint32(0),...
'frame_rx',uint32(0),...
'pbch_fer',uint32(0),...
'timestamp',int64(0),...
'UE_mode',uint32(0),...
'phy_measurements', repmat(phy_measurements_struct,1,1),...
'dlsch_fer',uint32(0),...
'dlsch_errors',uint32(0),...
'mimo_mode',uint8(0),...
'eNb_id',uint8(0));
min_estimates_struct_a = cstruct(min_estimates_struct,[],4);
min_estimates_struct_eNb = struct(...
'mcs',double(0),...
'tbs',double(0),...
'rx_rssi_dBm',int16(0),...
'frame_tx',uint32(0),...
'timestamp',int64(0),...
'UE_mode',uint32(0),...
'phy_measurements', repmat(phy_measurements_eNb_struct,1,1),...
'ulsch_errors',uint32(0),...
'mimo_mode',uint8(0),...
'eNb_id',uint8(0));
min_estimates_struct_eNb_a = cstruct(min_estimates_struct,[],4);
openair1/EMOS/LTE/IMPORT_FILTER/struct_template_new.m
-335
View File
@@ -1,335 +0,0 @@
% file: struct_template.m
% author: florian.kaltenberger@eurecom.fr
% date: 13.3.2010
% purpose: this file reconstructs the structures fifo_dump_emos_struct_UE
% and fifo_dump_emos_struct_UE which are defined in
% SCHED/phy_procedures_emos.h
NUMBER_OF_OFDM_CARRIERS_EMOS = 512;
NUMBER_OF_USEFUL_CARRIERS_EMOS = 300;
N_RB_UL_EMOS = 25;
N_PILOTS_DL_EMOS = 2; % ofdm symbols with pilots per slot
N_PILOTS_UL_EMOS = 2; % ofdm symbols with pilots per subframe
N_SLOTS_DL_EMOS = 2; % we take slots 10,11
N_SUBFRAMES_UL_EMOS = 1; % we take subframes 3
NB_ANTENNAS_TX_EMOS = 2; % antennas at eNB
NB_ANTENNAS_RX_EMOS = 2; % antennas at UE
MAX_DCI_PER_FRAME = 20;
MAX_UCI_PER_FRAME = 20;
PBCH_PDU_SIZE = 6;
NUMBER_OF_eNB_MAX = 3;
NUMBER_OF_UE_MAX = 2;
NUMBER_OF_SUBBANDS = 13;
NB_ANTENNAS_RX = 2; % maximum number of antennas (for memory allocation only)
%NB_ANTENNAS_TX = 2;
MAX_CQI_BITS = 40;
MAX_DCI_SIZE_BITS = 45;
% enable this line to enable error checking
if exist('check_errors','var') && (check_errors==1)
if isunix
get_dump_size
else
warning('Error checking of sizes only possible in Linux');
end
end
if ~exist('align','var')
error('variable align must be specified');
else
if ((align~=4) && (align~=8))
error('variable align must be either 4 or 8');
end
end
if ~exist('EMOS_CHANNEL','var')
error('variable EMOS_CHANNEL must be specified');
end
phy_measurements_struct = struct(...
'rssi', uint32(0),...
'n_adj_cells', int32(0),...
'n_adj_cells_id', uint32(zeros(1,6)),...
'rsrq', uint32(zeros(1,7)),...
'rsrp', uint32(zeros(1,7)),...
'rsrp_filtered', single(zeros(1,7)),...
'rsrq_filtered', single(zeros(1,7)),...
'n0_power', uint32(zeros(1,NB_ANTENNAS_RX)),...
'n0_power_dB', uint16(zeros(1,NB_ANTENNAS_RX)),...
'n0_power_tot', uint32(0),...
'n0_power_tot_dB', uint16(0),...
'n0_power_avg', uint32(0),...
'n0_power_avg_dB', uint16(0),...
'n0_power_tot_dBm', int16(0),...
'rx_spatial_power', int32(zeros(2,2,NUMBER_OF_eNB_MAX)),...
'rx_spatial_power_dB', uint16(zeros(2,2,NUMBER_OF_eNB_MAX)),...
'rx_power', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'rx_power_dB', uint16(zeros(NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'rx_power_tot', int32(zeros(1,NUMBER_OF_eNB_MAX)),...
'rx_power_tot_dB', uint16(zeros(1,NUMBER_OF_eNB_MAX)),...
'rx_power_avg', int32(zeros(1,NUMBER_OF_eNB_MAX)),...
'rx_power_avg_dB', uint16(zeros(1,NUMBER_OF_eNB_MAX)),...
'wideband_cqi_tot', int32(zeros(1,NUMBER_OF_eNB_MAX)),...
'wideband_cqi_avg', int32(zeros(1,NUMBER_OF_eNB_MAX)),...
'rx_rssi_dBm', int16(zeros(1,NUMBER_OF_eNB_MAX)),...
'rx_correlation', int32(zeros(2,NUMBER_OF_eNB_MAX)),...
'rx_correlation_dB', int32(zeros(2,NUMBER_OF_eNB_MAX)),...
'precoded_cqi_dB', int32(zeros(4,NUMBER_OF_eNB_MAX+1)),...
'subband_cqi', int32(zeros(NUMBER_OF_SUBBANDS,NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'subband_cqi_tot', int32(zeros(NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'subband_cqi_dB', int32(zeros(NUMBER_OF_SUBBANDS,NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'subband_cqi_tot_dB', int32(zeros(NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'wideband_pmi_re', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'wideband_pmi_im', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_eNB_MAX)),...
'subband_pmi_re', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'subband_pmi_im', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'selected_rx_antennas', int8(zeros(NUMBER_OF_SUBBANDS,NUMBER_OF_eNB_MAX)),...
'rank', uint8(zeros(1,NUMBER_OF_eNB_MAX)),...
'nb_antennas_rx', uint8(0));
phy_measurements_struct_a = cstruct(phy_measurements_struct,[],align);
if (exist('PHY_measurements_size','var') && (phy_measurements_struct_a.size ~= PHY_measurements_size))
warning('PHY_measurements_size does not match');
end
phy_measurements_eNb_struct = struct(...
'n0_power', uint32(zeros(1,NB_ANTENNAS_RX)),...
'n0_power_dB', uint16(zeros(1,NB_ANTENNAS_RX)),...
'n0_power_tot', uint32(0),...
'n0_power_tot_dB', uint16(0),...
'n0_power_tot_dBm', int16(0),...
'n0_subband_power', uint16(zeros(N_RB_UL_EMOS,NB_ANTENNAS_RX)),...
'n0_subband_power_dB', uint16(zeros(N_RB_UL_EMOS,NB_ANTENNAS_RX)),...
'n0_subband_power_tot_dB', int16(zeros(1,N_RB_UL_EMOS)),...
'n0_subband_power_tot_dBm', int16(zeros(1,N_RB_UL_EMOS)),...
'rx_spatial_power', uint32(zeros(2,2,NUMBER_OF_UE_MAX)),...
'rx_spatial_power_dB', uint16(zeros(2,2,NUMBER_OF_UE_MAX)),...
'rx_rssi_dBm', int16(zeros(1,NUMBER_OF_UE_MAX)),...
'rx_correlation', int32(zeros(2,NUMBER_OF_UE_MAX)),...
'rx_correlation_dB', int32(zeros(2,NUMBER_OF_UE_MAX)),...
'wideband_cqi', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_UE_MAX)),...
'wideband_cqi_dB', int32(zeros(NB_ANTENNAS_RX,NUMBER_OF_UE_MAX)),...
'wideband_cqi_tot', int8(zeros(1,NUMBER_OF_UE_MAX)),...
'subband_cqi', int32(zeros(N_RB_UL_EMOS,NB_ANTENNAS_RX,NUMBER_OF_UE_MAX)),...
'subband_cqi_tot', int32(zeros(N_RB_UL_EMOS,NUMBER_OF_UE_MAX)),...
'subband_cqi_dB', int32(zeros(N_RB_UL_EMOS,NB_ANTENNAS_RX,NUMBER_OF_UE_MAX)),...
'subband_cqi_tot_dB', int32(zeros(N_RB_UL_EMOS,NUMBER_OF_UE_MAX)));
phy_measurements_eNb_struct_a = cstruct(phy_measurements_eNb_struct,[],align);
if (exist('PHY_measurements_eNb_size','var') && (phy_measurements_eNb_struct_a.size ~= PHY_measurements_eNb_size))
warning('PHY_measurements_eNb_size does not match');
end
uci_data_struct = struct(...
'o',uint8(zeros(1,MAX_CQI_BITS)),...
'O',uint8(0),...
'o_RI',uint8(zeros(1,2)),...
'O_RI',uint8(0),...
'o_ACK',uint8(zeros(1,4)),...
'O_ACK',uint8(0));
uci_data_struct_a = cstruct(uci_data_struct,[],align);
if (exist('UCI_data_t_size','var') && (uci_data_struct_a.size ~= UCI_data_t_size))
warning('UCI_data_t_size does not match');
end
dci_alloc_struct = struct(...
'dci_length',uint8(0),...
'L',uint8(0),...
'rnti',uint16(0),...
'format',uint32(0),...
'dci_pdu',uint16(zeros(1,1+floor(MAX_DCI_SIZE_BITS/16))));
% this one does not work unfortunately
% dci_alloc_struct = struct(...
% 'dci_length',uint8(0),...
% 'L',uint8(0),...
% 'rnti',uint16(0),...
% 'format',uint32(0),...
% 'rah',logical(0),...
% 'rballoc',logical(zeros(1,13)),...
% 'TPC',logical(zeros(1,2)),... %16
%
% 'dai',logical(zeros(1,2)),... 1:2
% 'harq_pid',logical(zeros(1,4)),... 3:6
% 'tb_swap',logical(0),... 7
% 'mcs1',logical(zeros(1,5)),... 8:12
% 'ndi1',logical(0),... 13
% 'rv1',logical(zeros(1,2)),... 14:15
% 'tpmi',logical(zeros(1,3)),... 16:17:...
% 'mcs2',logical(zeros(1,5)),...
% 'ndi2',logical(0),...
% 'rv2',logical(zeros(1,2)),...
% 'padding',logical(zeros(1,6)));
dci_alloc_struct_a = cstruct(dci_alloc_struct,[],align);
if (exist('DCI_alloc_t_size','var') && (dci_alloc_struct_a.size ~= DCI_alloc_t_size))
warning('DCI_alloc_t_size does not match');
end
eNb_UE_stats_struct = struct(...
'UL_rssi',int32(zeros(1,NB_ANTENNAS_RX)),...
'DL_cqi',uint8(zeros(1,2)),...
'DL_subband_cqi',uint8(zeros(13,2)),...
'DL_pmi_single',uint16(0),...
'DL_pmi_dual',uint16(0),...
'rank',uint8(0),...
'crnti',uint16(0),...
'UE_timing_offset',int32(0),...
'timing_advance_update',int32(0),...
'UE_mode',uint32(0),...
'sector',uint8(0),...
'dlsch_l2_errors', uint32(zeros(1,8)),...
'dlsch_trials', uint32(zeros(8,8)),...
'dlsch_ACK', uint32(zeros(8,8)),...
'dlsch_NAK', uint32(zeros(8,8)),...
'ulsch_errors', uint32(zeros(1,8)),...
'ulsch_consecutive_errors', uint32(0),...
'ulsch_decoding_attempts', uint32(zeros(8,8)),...
'ulsch_round_errors', uint32(zeros(8,8)),...
'ulsch_decoding_attempts_last', uint32(zeros(8,8)),...
'ulsch_round_errors_last', uint32(zeros(8,8)),...
'ulsch_round_fer', uint32(zeros(8,8)),...
'sr_received', uint32(0), ...
'sr_total', uint32(0), ...
'dlsch_sliding_cnt', uint32(0),...
'dlsch_NAK_round0', uint32(0),...
'dlsch_mcs_offset', int8(0),...
'dlsch_mcs1', uint8(0),...
'dlsch_mcs2', uint8(0),...
'total_TBS_MAC', int32(0),...
'total_TBS', int32(0),...
'total_TBS_last', int32(0),...
'dlsch_bitrate', uint32(0));
eNb_UE_stats_struct_a = cstruct(eNb_UE_stats_struct,[],align);
if (exist('eNb_UE_stats_size','var') && (eNb_UE_stats_struct_a.size ~= eNb_UE_stats_size))
warning('eNb_UE_stats_size does not match');
end
complex_struct = struct('real',int16(0),'imag',int16(0));
fifo_dump_emos_struct_UE = struct(...
'timestamp',int64(0),...
'frame_tx',uint32(0),...
'frame_rx',uint32(0),...
'UE_mode',uint32(0),...
'phy_measurements', phy_measurements_struct,...
'pbch_errors',uint32(0),...
'pbch_errors_last',uint32(0),...
'pbch_errors_conseq',uint32(0),...
'pbch_fer',uint32(0),...
'dlsch_errors',uint32(0),...
'dlsch_errors_last',uint32(0),...
'dlsch_received',uint32(0),...
'dlsch_received_last',uint32(0),...
'dlsch_fer',uint32(0),...
'dlsch_cntl_errors',uint32(0),...
'dlsch_ra_errors',uint32(0),...
'total_TBS',uint32(0),...
'total_TBS_last',uint32(0),...
'bitrate',uint32(0),...
'total_received_bits',uint32(0),...
'timing_offset',int32(0),...
'timing_advance',int32(0),...
'freq_offset',int32(0),...
'use_ia_receiver',int32(0),...
'pmi_saved',uint16(0),...
'mcs',uint16(0),...
'rx_total_gain_dB',uint32(0),...
'eNb_id',uint8(0),...
'mimo_mode',uint8(0));
if (EMOS_CHANNEL)
fifo_dump_emos_struct_UE.channel=int16(zeros(2*NUMBER_OF_OFDM_CARRIERS_EMOS*N_PILOTS_DL_EMOS*N_SLOTS_DL_EMOS,NB_ANTENNAS_TX_EMOS,NB_ANTENNAS_RX_EMOS));
end
fifo_dump_emos_struct_UE_a = cstruct(fifo_dump_emos_struct_UE,[],align);
if (exist('fifo_dump_emos_UE_size','var') && (fifo_dump_emos_struct_UE_a.size ~= fifo_dump_emos_UE_size))
warning('fifo_dump_emos_UE_size does not match');
end
fifo_dump_emos_struct_eNb = struct(...
'timestamp',int64(0),...
'frame_tx',uint32(0),...
'mimo_mode',uint8(0),...
'phy_measurements_eNb',phy_measurements_eNb_struct,...
'eNb_UE_stats',repmat(eNb_UE_stats_struct,1,NUMBER_OF_UE_MAX),...
'rx_total_gain_dB',uint32(0));
if (EMOS_CHANNEL)
fifo_dump_emos_struct_eNb.channel = int16(zeros(2*N_RB_UL_EMOS*12*N_PILOTS_UL_EMOS*N_SUBFRAMES_UL_EMOS,NB_ANTENNAS_RX_EMOS));
end
fifo_dump_emos_struct_eNb_a = cstruct(fifo_dump_emos_struct_eNb,[],align);
if (exist('fifo_dump_emos_eNb_size','var') && (fifo_dump_emos_struct_eNb_a.size ~= fifo_dump_emos_eNb_size))
warning('fifo_dump_emos_eNb_size does not match');
end
gps_data_struct = struct(...
'timestamp', double(0),...
'mode', int32(0),...
'ept',double(0),...
'latitude',double(0),...
'epy',double(0),...
'longitude',double(0),...
'epx',double(0),...
'altitude',double(0),...
'epv',double(0),...
'track',double(0),...
'epd',double(0),...
'speed',double(0),...
'eps',double(0),...
'climb',double(0),...
'epc',double(0));
gps_data_struct_a = cstruct(gps_data_struct,[],align);
if (exist('gps_fix_t_size','var') && (gps_data_struct_a.size ~= gps_fix_t_size))
warning('gps_data_struct_size does not match');
end
min_estimates_struct = struct(...
'mcs',double(0),...
'tbs',double(0),...
'rx_rssi_dBm',int16(0),...
'frame_tx',uint32(0),...
'frame_rx',uint32(0),...
'pbch_fer',uint32(0),...
'timestamp',int64(0),...
'UE_mode',uint32(0),...
'phy_measurements', repmat(phy_measurements_struct,1,1),...
'dlsch_fer',uint32(0),...
'dlsch_errors',uint32(0),...
'mimo_mode',uint8(0),...
'eNb_id',uint8(0));
min_estimates_struct_a = cstruct(min_estimates_struct,[],align);
min_estimates_struct_eNb = struct(...
'mcs',double(0),...
'tbs',double(0),...
'rx_rssi_dBm',int16(0),...
'frame_tx',uint32(0),...
'timestamp',int64(0),...
'UE_mode',uint32(0),...
'phy_measurements', repmat(phy_measurements_eNb_struct,1,1),...
'ulsch_errors',uint32(0),...
'mimo_mode',uint8(0),...
'eNb_id',uint8(0));
min_estimates_struct_eNb_a = cstruct(min_estimates_struct,[],align);
openair1/EMOS/LTE/MU-MIMO/eval_results.m
-76
View File
@@ -1,76 +0,0 @@
%% Script for reading in the EMOS input
clear all;
%close all;
addpath('E:\Synchro\kaltenbe\My Documents\openair4G\openair1\EMOS\LTE\IMPORT_FILTER')
% 2rx
% [estimates,NFrames]=load_estimates_lte_new('E:\Synchro\kaltenbe\My Documents\openair4G\openair1\EMOS\DUMP\UE_data_20130315_142130.EMOS',inf,1,0);
% 1rx
% estimates = load_estimates_lte_new('E:\EMOS\globecom\UE_data_20130315_155139.EMOS', inf, 1, 0);
% 2rx long test
% estimates = load_estimates_lte_new('/home/wagner/GC/UE_data_20130315_142130.EMOS', 250000, 1, 0);
% 1rx short test
% estimates = load_estimates_lte_new('/home/wagner/GC/UE_data_20130315_153101.EMOS', inf, 1, 0);
% ITJ
%Nrx = 1;
%estimates = load_estimates_lte_new('E:\EMOS\ITJ (globecom bis)\UE_data_20130916_175331.EMOS', inf, 1, 0, 0);
Nrx = 2;
%estimates = load_estimates_lte_new('E:\EMOS\ITJ (globecom bis)\UE_data_20130916_174719.EMOS', inf, 1, 0, 0);
%estimates = load_estimates_lte_new('E:\EMOS\ITJ (globecom bis)\UE_data_20130924_143804.EMOS', inf, 1, 0, 0);
%estimates = load_estimates_lte_new('E:\EMOS\ITJ (globecom bis)\UE_data_20130924_143250.EMOS', inf, 1, 0, 0);
% outdoor messungen 2013-10-10
filepath = 'E:\EMOS\MU-MIMO\ITJ3\';
filename = 'UE_data_20131030_143345';
estimates = load_estimates_lte_new([filepath filename '.EMOS'], inf, 1, 0, 0);
%% frame
frame_rx = double([estimates.frame_rx]);
%throughput = [0 diff(double([estimates.total_TBS]))*100];
throughput = double([estimates.bitrate]);
mcs = double([estimates.mcs]);
use_iu_receiver = ([estimates.use_ia_receiver]==0);
use_ia_receiver = ([estimates.use_ia_receiver]==1);
use_iag_receiver = ([estimates.use_ia_receiver]==2);
%% average
avg_tp_ia = zeros(28,1);
avg_tp_iag = zeros(28,1);
avg_tp_iu = zeros(28,1);
num_ia = zeros(28,1);
num_iag = zeros(28,1);
num_iu = zeros(28,1);
for imcs=0:1:27
mcs_window = (mcs==imcs);
throughput_iag_mcs = throughput(use_iag_receiver & mcs_window);
num_iag(imcs+1) = sum(use_iag_receiver & mcs_window);
avg_tp_iag(imcs+1) = mean(throughput_iag_mcs);
throughput_ia_mcs = throughput(use_ia_receiver & mcs_window);
num_ia(imcs+1) = sum(use_ia_receiver & mcs_window);
avg_tp_ia(imcs+1) = mean(throughput_ia_mcs);
throughput_iu_mcs = throughput(use_iu_receiver & mcs_window);
num_iu(imcs+1) = sum(use_iu_receiver & mcs_window);
avg_tp_iu(imcs+1) = mean(throughput_iu_mcs);
end
%% Plot
figure(2)
hold off
colormap hot
bar(0:1:27,[avg_tp_iu avg_tp_ia avg_tp_iag])
grid on
xlim([-1 28])
h = legend('IU Receiver','IA Receiver','IA genie');
set(h,'FontSize',14);
xlabel('MCS','FontSize',14)
ylabel('Throughput [bps]','FontSize',14)
%saveas(gcf, filename, 'eps')
%save(filename,'avg_tp*', 'mcs*', 'throughput*', 'use*', 'frame*');
%csvwrite([filename '.csv'],[(0:1:27).' avg_tp_iu avg_tp_ia avg_tp_iag])
openair1/EMOS/LTE/MU-MIMO/eval_results_sam.m
-149
View File
@@ -1,149 +0,0 @@
%% Script for reading in the EMOS input
clear all;
close all;
addpath('E:\Synchro\kaltenbe\My Documents\openair4G\openair1\EMOS\LTE\IMPORT_FILTER')
% outdoor messungen 2013-10-10 fuer ITJ paper
%filepath = 'E:\EMOS\MU-MIMO\ITJ3\';
%filename = 'UE_data_20131030_143345';
% indoor messungen 20140220 fuer SAM paper
filepath = 'E:\EMOS\MU-MIMO\SAM\';
% outdoor messungen for SAM paper
%filename = 'UE_data_pmi_fixed_all';
filename = 'UE_data_20140220_163107';
%filename = 'UE_data_all';
[estimates, NFrames] = load_estimates_lte_new([filepath filename '.EMOS'], inf, 1, 0, 0);
%% frame
frame_rx = double([estimates.frame_rx]);
%throughput = [0 diff(double([estimates.total_TBS]))*100];
throughput = double([estimates.bitrate]);
mcs = double([estimates.mcs]);
use_iu_receiver = ([estimates.use_ia_receiver]==0);
use_ia_receiver = ([estimates.use_ia_receiver]==1);
use_iag_receiver = ([estimates.use_ia_receiver]==2);
%% phy measurements
SNR_dB = zeros(1,NFrames);
INR_dB = zeros(1,NFrames);
for i=2:NFrames
SNR_dB(i-1) = estimates(i).phy_measurements.precoded_cqi_dB(1,1);
INR_dB(i-1) = estimates(i).phy_measurements.precoded_cqi_dB(1,2);
end
SIR_dB = SNR_dB - INR_dB;
%% average
avg_tp_ia = zeros(28,1);
avg_tp_iag = zeros(28,1);
avg_tp_iu = zeros(28,1);
avg_SIR_ia = zeros(28,1);
avg_SIR_iag = zeros(28,1);
num_ia = zeros(28,1);
num_iag = zeros(28,1);
num_iu = zeros(28,1);
for imcs=16 %[0:11 13:25]
%%
mcs_window = (mcs==imcs);
throughput_iag_mcs = throughput(use_iag_receiver & mcs_window);
num_iag(imcs+1) = sum(use_iag_receiver & mcs_window);
avg_tp_iag(imcs+1) = mean(throughput_iag_mcs);
throughput_ia_mcs = throughput(use_ia_receiver & mcs_window);
num_ia(imcs+1) = sum(use_ia_receiver & mcs_window);
avg_tp_ia(imcs+1) = mean(throughput_ia_mcs);
throughput_iu_mcs = throughput(use_iu_receiver & mcs_window);
num_iu(imcs+1) = sum(use_iu_receiver & mcs_window);
avg_tp_iu(imcs+1) = mean(throughput_iu_mcs);
SIR_iu_mcs = SIR_dB(use_iu_receiver & mcs_window);
SIR_ia_mcs = SIR_dB(use_ia_receiver & mcs_window);
SIR_iag_mcs = SIR_dB(use_iag_receiver & mcs_window);
avg_SIR_ia(imcs+1) = mean(SIR_ia_mcs);
avg_SIR_iag(imcs+1) = mean(SIR_iag_mcs);
isir=0;
for sir=min(SIR_dB):max(SIR_dB)
ia(1,isir+1) = sum(use_ia_receiver & mcs_window & (SIR_dB==sir));
if ia(1,isir+1)>=5
IA(1,isir+1) = mean(throughput(use_ia_receiver & mcs_window & (SIR_dB==sir)));
else
IA(1,isir+1) = NaN;
end
iu(1,isir+1) = sum(use_iu_receiver & mcs_window & (SIR_dB==sir));
if iu(1,isir+1)>=5
IU(1,isir+1) = mean(throughput(use_iu_receiver & mcs_window & (SIR_dB==sir)));
else
IU(1,isir+1) = NaN;
end
iag(1,isir+1) = sum(use_iag_receiver & mcs_window & (SIR_dB==sir));
if iag(1,isir+1)>=5
IAG(1,isir+1) = mean(throughput(use_iag_receiver & mcs_window & (SIR_dB==sir)));
else
IAG(1,isir+1) = NaN;
end
isir = isir+1;
end
end
%% Plot
f = figure(1);
hold off
colormap hot
bar(0:1:27,[avg_tp_iu avg_tp_ia avg_tp_iag])
grid on
xlim([-1 28])
h = legend('IU Receiver','IA Receiver','IA genie');
set(h,'FontSize',14);
xlabel('MCS','FontSize',14)
ylabel('Throughput [bps]','FontSize',14)
saveas(f, ['tp_vs_mcs' filename '.eps'], 'epsc2')
%save(filename,'avg_tp*', 'mcs*', 'throughput*', 'use*', 'frame*');
%csvwrite([filename '.csv'],[(0:1:27).' avg_tp_iu avg_tp_ia avg_tp_iag])
%% Plot2
plot_style = {'b-*';'r-*';'g-*';'y-*';'k-*';...
'b-o';'r-o';'g-o';'y-o';'k-o';...
'b-s';'r-s';'g-s';'y-s';'k-s';...
'b-d';'r-d';'g-d';'y-d';'k-d';...
'b-x';'r-x';'g-x';'y-x';'k-x';...
'b-+';'r-+';'g-+';'y-+';'k-+'};
legend_str = {};
f = figure(2);
hold off
plot(min(SIR_dB):max(SIR_dB),IAG/1000,'r-x','Markersize',10)
hold on
plot(min(SIR_dB):max(SIR_dB),IA/1000,'b--o')
plot(min(SIR_dB):max(SIR_dB),IU/1000,'k:s')
h=legend('NA-IA','IA','IU','Location','NorthWest');
set(h,'FontSize',14);
%for imcs=0:27
%plot(avg_SIR_ia(imcs+1),avg_tp_ia(imcs+1)-avg_tp_iu(imcs+1),plot_style{imcs+1},'Markersize',10);
%hold on
%legend_str{imcs+1} = sprintf('mcs %d',imcs);
%end
%legend(legend_str)
xlabel('SIR [dB]');
ylabel('Throughput [kbps]')
saveas(f, ['tp_vs_sir' filename '.eps'], 'epsc2')
%% Plot 3
f = figure(3);
hold off
bar(min(SIR_dB):max(SIR_dB),[ia; iu; iag].')
h=legend('NA-IA','IA','IU','Location','NorthWest');
set(h,'FontSize',14);
xlabel('SIR [dB]');
ylabel('Occurrence');
shading flat
% plot([0:4], X(15:2:23,:).')
% legend('mcs 14', 'mcs 16', 'mcs 18', 'mcs 20', 'mcs 22')
% xlabel('SIR [dB]')
% ylabel('delta TP [bps]')
saveas(f,['hist_sir' filename '.eps'], 'epsc2')
openair1/EMOS/LTE/POST_PROCESSING/CapCom/Cat.m
-18
View File
@@ -1,18 +0,0 @@
close all
clear all
root_path = '/emos/AMBIALET/Mode2/';
d = dir(fullfile(root_path, '*MODE2*'));
dir_names = {d.name};
for d_idx=1:length(dir_names)
pathname = fullfile(root_path,dir_names{d_idx});
disp(pathname)
Concatenate_results_UE_quick
%Concatenate_results_eNb_quick
end
openair1/EMOS/LTE/POST_PROCESSING/CapCom/Cat_UE_comp.m
-39
View File
@@ -1,39 +0,0 @@
%% This file concatenates all the matlab results files from different folders and then saves the resulting file in root_path folder.
clear all;
close all;
start_idx = 1;
root_path = '/emos/AMBIALET/Mode2/';
d = dir(fullfile(root_path, '*MODE2*'));
dir_names = {d.name};
%%
for d_idx=1:length(dir_names)
pathname = fullfile(root_path,dir_names{d_idx})
try
temp = load(fullfile(pathname, 'results_cat_UE.mat'));
catch exception
disp(exception.getReport)
disp(sprintf('Detected error in folder %s, skipping it',pathname));
continue
end
% vars = whos('*_cat');
% nn = {vars.name};
nn = fieldnames(temp);
if (start_idx==1)
for n = 1:length(nn)
eval([nn{n} ' = [];']);
end
end
for n = 1:length(nn)
eval([nn{n} ' = [' nn{n} ' ' 'temp.' nn{n} '];']);
end
save(fullfile(root_path,'results_cat_UE.mat'), '*_cat');
start_idx = start_idx + 1;
end
openair1/EMOS/LTE/POST_PROCESSING/CapCom/Cat_eNB_comp.m
-39
View File
@@ -1,39 +0,0 @@
%% This file concatenates all the matlab results files from different folders and then saves the resulting file in root_path folder.
clear all;
close all;
clc
start_idx = 1;
root_path = '/extras/kaltenbe/CNES/emos_postprocessed_data/Mode2/';
d = dir(fullfile(root_path, '*mode*'));
dir_names = {d.name};
for d_idx=1:length(dir_names)
pathname = fullfile(root_path,dir_names{d_idx})
try
temp = load(fullfile(pathname, 'results_cat_eNb.mat'));
catch exception
disp(exception.getReport)
disp(sprintf('Detected error in folder %s, skipping it',pathname));
continue
end
% vars = whos('*_cat');
% nn = {vars.name};
nn = fieldnames(temp);
if (start_idx==1)
for n = 1:length(nn)
eval([nn{n} ' = [];']);
end
end
for n = 1:length(nn)
eval([nn{n} ' = [' nn{n} ' ' 'temp.' nn{n} '];']);
end
save(fullfile(root_path,'results_cat_eNb.mat'), '*_cat');
start_idx = start_idx + 1;
end
openair1/EMOS/LTE/POST_PROCESSING/CapCom/Concatenate_results_UE_quick.m
-54
View File
@@ -1,54 +0,0 @@
%pathname = '/extras/kaltenbe/CNES/emos_postprocessed_data/20100510_mode2_parcours1_part1/';
d = dir(fullfile(pathname, 'data_term3*.mat'));
d1 = dir(fullfile(pathname, 'data_term3*.EMOS'));
filenames = {d.name};
filedates = {d1.date};
[filedates,idx] = sort(filedates);
filenames = filenames(idx);
gps_data_cat = [];
%minestimates_cat = [];
UE_mode_cat = [];
K_fac_cat = [];
%%
for f = 1:length(filenames)
s = fullfile(pathname, filenames{f});
load(s);
nn = fieldnames(throughput);
if (f==1)
for n = 1:length(nn)
eval([nn{n} '_cat = [];']);
end
end
for n = 1:length(nn)
eval([nn{n} '_cat = [' nn{n} '_cat throughput.' nn{n} '];']);
end
nn = fieldnames(SNR);
if (f==1)
for n = 1:length(nn)
eval([nn{n} '_cat = [];']);
end
end
for n = 1:length(nn)
eval([nn{n} '_cat = [' nn{n} '_cat SNR.' nn{n} '];']);
end
gps_data_cat = cat(2,gps_data_cat,gps_data);
%minestimates_cat = cat(2,minestimates_cat,minestimates);
UE_mode_cat = cat(2,UE_mode_cat,[minestimates.UE_mode]);
K_fac_cat = cat(2,K_fac_cat,K_fac);
save(fullfile(pathname,'results_cat_UE.mat'),'*_cat');
end
openair1/EMOS/LTE/POST_PROCESSING/CapCom/Concatenate_results_eNB_quick.m
-44
View File
@@ -1,44 +0,0 @@
d = dir(fullfile(pathname, 'data_term1*.mat'));
filenames = {d.name};
gps_data_cat = [];
%minestimates_cat = [];
%K_fac_cat = [];
%%
for f = 1:length(filenames)
s = fullfile(pathname, filenames{f});
load(s);
nn = fieldnames(throughput);
if (f==1)
for n = 1:length(nn)
eval([nn{n} '_cat = [];']);
end
end
for n = 1:length(nn)
eval([nn{n} '_cat = [' nn{n} '_cat throughput.' nn{n} '];']);
end
nn = fieldnames(SNR);
if (f==1)
for n = 1:length(nn)
eval([nn{n} '_cat = [];']);
end
end
for n = 1:length(nn)
eval([nn{n} '_cat = [' nn{n} '_cat SNR.' nn{n} '];']);
end
gps_data_cat = cat(2,gps_data_cat,gps_data);
%minestimates_cat = cat(2,minestimates_cat,minestimates);
%K_fac_cat = cat(2,K_fac_cat,K_fac);
save(fullfile(pathname,'results_cat_eNB.mat'),'*_cat');
end
openair1/EMOS/LTE/POST_PROCESSING/CapCom/Dist_Calc_from_GPS.m
-42
View File
@@ -1,42 +0,0 @@
function [DISTANCE] = Dist_Calc_from_GPS(LAT1, LONG1, LAT2, LONG2)
%% Distance Calculator between two GPS coordinates
% [DISTANCE] = Dist_Calc_from_GPS(LAT1, LONG1, LAT2, LONG2)
% DISTANCE is in Kilometers.
% LAT1 is the latitude value of first point in decimal degrees
% LONG1 is the longitude value of first point in decimal degrees
% LAT2 is the latitude value of second point in decimal degrees
% LONG2 is the longitude value of second point in decimal degrees
%
% For Example
%
% DISTANCE = Dist_Calc_from_GPS(43.62785, 7.052418, 43.629224, 7.040884);
%
% Date: 20-04-2010
% Author: Imran Latif (imran.latif@eurecom.fr)
% Source: http://www.mathforum.com/library/drmath/view/51711.html
% all converted to radians: degree/57.29577951
A = LAT1/57.29577951;
B = LONG1/57.29577951;
C = LAT2/57.29577951;
D = LONG2/57.29577951;
if (A == C && B == D)
DISTANCE = 0;
else
if ((sin(A) * sin(C) + cos(A) * cos(C) * cos(B-D)) > 1)
DISTANCE = 6378 * acos(1);
else
DISTANCE = 6378 * acos(sin(A) * sin(C) + cos(A) * cos(C) * cos(B-D));
end
end
% disp('distance in Kilometers: ');
% DISTANCE
if isnan(DISTANCE)
DISTANCE = 0;
end
openair1/EMOS/LTE/POST_PROCESSING/CapCom/Rice_Factor_Plot.m
-66
View File
@@ -1,66 +0,0 @@
%% Concatenating Script
lat_cat= [];
lon_cat=[];
K_fac_cat=[];
root_path = '/media/Expansion_Drive/Mode2/';
d = dir(fullfile(root_path, '*mode2_parcours*'));
dir_names = {d.name};
% post processing for vehicular measurements
for i=1:length(dir_names)
pathname = fullfile(root_path,dir_names{i});
%pathname = '/homes/latif/Mode2_UE_matFiles/';
d = dir(fullfile(pathname, '*_K_factor.mat'));
filenames = {d.name};
for f = 1:length(filenames)
s = fullfile(pathname, filenames{f});
load(s);
lat_cat = [lat_cat [gps_data.latitude]];
lon_cat = [lon_cat [gps_data.longitude]];
K_fac_cat=[K_fac_cat K_fac];
end
end
save(fullfile(root_path, 'mode2_K_factor.mat'), 'lat_cat', 'lon_cat','K_fac_cat');
mm='cordes';
%% Plotting Script
in = 0;
in = in + 1;
h_fig = figure(in);
hold off
plot_gps_coordinates(mm,lon_cat,lat_cat,10*log10(K_fac_cat(1:4:end)));
title('Ricean Factor for First Antenna Pair(H11)')
saveas(h_fig,fullfile(root_path,'K_factor_h11.jpg'),'jpg')
in = in + 1;
h_fig = figure(in);
hold off
plot_gps_coordinates(mm,lon_cat,lat_cat,10*log10(K_fac_cat(2:4:end)));
title('Ricean Factor for Second Antenna Pair(H12)')
saveas(h_fig,fullfile(pathname,'K_factor_h12.jpg'),'jpg')
in = in + 1;
h_fig = figure(in);
hold off
plot_gps_coordinates(mm,lon_cat,lat_cat,10*log10(K_fac_cat(3:4:end)));
title('Ricean Factor for third Antenna Pair(H21)')
saveas(h_fig,fullfile(pathname,'K_factor_h21.jpg'),'jpg')
in = in + 1;
h_fig = figure(in);
hold off
plot_gps_coordinates(mm,lon_cat,lat_cat,10*log10(K_fac_cat(4:4:end)));
title('Ricean Factor for Fourth Antenna Pair(H22)')
saveas(h_fig,fullfile(pathname,'K_factor_h22.jpg'),'jpg')
openair1/EMOS/LTE/POST_PROCESSING/CapCom/calc_dist.m
-41
View File
@@ -1,41 +0,0 @@
function [dist, dist_travelled] = calc_dist(MS_Lat, MS_Long, site)
% [dist, dist_traveled] = calc_dist(MS_Lat, MS_Long)
% Calculates distance from Base Station as well as distance travelled in km.
% We take the reference of the BS in Cordes
% Source http://itouchmap.com/latlong.html
if nargin<3
site = 'cordes';
end
switch(site)
case 'cordes'
BS_Lat = 44.084015;
BS_Long = 1.965765;
case 'penne'
BS_Lat = 44.079722;
BS_Long = 1.714722;
case 'ambialet'
BS_Lat = 43.945;
BS_Long = 2.373889;
end
dist = zeros(1,length(MS_Lat));
for i = 1:length(MS_Lat)
if (MS_Lat(i)~=0 && MS_Long(i)~=0)
dist(i) = Dist_Calc_from_GPS(BS_Lat, BS_Long, MS_Lat(i), MS_Long(i));
else
dist(i) = nan;
end
end
dist_travelled = zeros(1,length(MS_Lat));
for i = 2:length(MS_Lat);
if (MS_Lat(i-1)~=0 && MS_Long(i-1)~=0 && MS_Lat(i)~=0 && MS_Long(i)~=0)
dist_travelled(i) = Dist_Calc_from_GPS(MS_Lat(i-1), MS_Long(i-1), MS_Lat(i), MS_Long(i));
else
dist_travelled(i) = nan;
end
end
dist_travelled = cumsum(dist_travelled);
openair1/EMOS/LTE/POST_PROCESSING/CapCom/calc_rps_Alamouti.m
-107
View File
@@ -1,107 +0,0 @@
function [Rate_4Qam_1stRx,Rate_16Qam_1stRx,Rate_64Qam_1stRx,Rate_4Qam_2ndRx,...
Rate_16Qam_2ndRx,Rate_64Qam_2ndRx, alam_SNR_1stRx_persecond,alam_SNR_2ndRx_persecond,...
Rate_4Qam_2Rx,Rate_16Qam_2Rx,Rate_64Qam_2Rx,alam_SNR_2Rx_persecond,...
Rate_SupportedQam_1stRx,Rate_SupportedQam_2ndRx,Rate_SupportedQam_2Rx] = calc_rps_Alamouti(estimates_UE)
capacity_Alamouti_1
alam_SNR_1stRx_persecond = mean(SNR_eNB_1stRx(:));
alam_SNR_2ndRx_persecond = mean(SNR_eNB_2ndRx(:));
alam_SNR_2Rx_persecond = mean(SNR_eNB_2Rx(:));
%plot(SNR_eNB1, 'g-x');
%[x y z] = size(chcap_siso_single_stream_4Qam_eNB1);
% Following will hold the data rate of one whole Frame
Frame_DL_sum_4Qam_1stRx = zeros(1, length(estimates_UE));
Frame_DL_sum_16Qam_1stRx = zeros(1,length(estimates_UE));
Frame_DL_sum_64Qam_1stRx = zeros(1,length(estimates_UE));
Frame_DL_sum_supportedQam_1stRx = zeros(1,length(estimates_UE));
Frame_DL_sum_4Qam_2ndRx = zeros(1, length(estimates_UE));
Frame_DL_sum_16Qam_2ndRx = zeros(1,length(estimates_UE));
Frame_DL_sum_64Qam_2ndRx = zeros(1,length(estimates_UE));
Frame_DL_sum_supportedQam_2ndRx = zeros(1,length(estimates_UE));
Frame_DL_sum_4Qam_2Rx = zeros(1, length(estimates_UE));
Frame_DL_sum_16Qam_2Rx = zeros(1,length(estimates_UE));
Frame_DL_sum_64Qam_2Rx = zeros(1,length(estimates_UE));
Frame_DL_sum_supportedQam_2Rx = zeros(1,length(estimates_UE));
for i = 1:length(estimates_UE)
%following holds accumulated data rate of 200 resource elements
RS_sum_4Qam_1stRx = sum(chcap_alamouti_4Qam_1stRx(1,:,i));
RS_sum_16Qam_1stRx = sum(chcap_alamouti_16Qam_1stRx(1,:,i));
RS_sum_64Qam_1stRx = sum(chcap_alamouti_64Qam_1stRx(1,:,i));
RS_sum_supportedQam_1stRx = sum(chcap_alamouti_supportedQam_1stRx(1,:,i));
RS_sum_4Qam_2ndRx = sum(chcap_alamouti_4Qam_2ndRx(1,:,i));
RS_sum_16Qam_2ndRx = sum(chcap_alamouti_16Qam_2ndRx(1,:,i));
RS_sum_64Qam_2ndRx = sum(chcap_alamouti_64Qam_2ndRx(1,:,i));
RS_sum_supportedQam_2ndRx = sum(chcap_alamouti_supportedQam_2ndRx(1,:,i));
RS_sum_4Qam_2Rx = sum(chcap_alamouti_4Qam_2Rx(1,:,i));
RS_sum_16Qam_2Rx = sum(chcap_alamouti_16Qam_2Rx(1,:,i));
RS_sum_64Qam_2Rx = sum(chcap_alamouti_64Qam_2Rx(1,:,i));
RS_sum_supportedQam_2Rx = sum(chcap_alamouti_supportedQam_2Rx(1,:,i));
% since 4200/200 = 21 groups of 200 resource elements are there in one subframe, so to get
% the estimate of whole subframe we need to multiply RS_sum_XQam by 21.
Subframe_DL_sum_4Qam_1stRx = RS_sum_4Qam_1stRx * 12;
Subframe_DL_sum_16Qam_1stRx = RS_sum_16Qam_1stRx * 12;
Subframe_DL_sum_64Qam_1stRx = RS_sum_64Qam_1stRx * 12;
Subframe_DL_sum_supportedQam_1stRx = RS_sum_supportedQam_1stRx * 12;
Subframe_DL_sum_4Qam_2ndRx = RS_sum_4Qam_2ndRx * 12;
Subframe_DL_sum_16Qam_2ndRx = RS_sum_16Qam_2ndRx * 12;
Subframe_DL_sum_64Qam_2ndRx = RS_sum_64Qam_2ndRx * 12;
Subframe_DL_sum_supportedQam_2ndRx = RS_sum_supportedQam_2ndRx * 12;
Subframe_DL_sum_4Qam_2Rx = RS_sum_4Qam_2Rx * 12;
Subframe_DL_sum_16Qam_2Rx = RS_sum_16Qam_2Rx * 12;
Subframe_DL_sum_64Qam_2Rx = RS_sum_64Qam_2Rx * 12;
Subframe_DL_sum_supportedQam_2Rx = RS_sum_supportedQam_2Rx * 12;
%In LTE Confguration 3 we have 6 downlink subframes in one frame so
Frame_DL_sum_4Qam_1stRx(i) = Subframe_DL_sum_4Qam_1stRx * 6;
Frame_DL_sum_16Qam_1stRx(i) = Subframe_DL_sum_16Qam_1stRx * 6;
Frame_DL_sum_64Qam_1stRx(i) = Subframe_DL_sum_64Qam_1stRx * 6;
Frame_DL_sum_supportedQam_1stRx(i) = Subframe_DL_sum_supportedQam_1stRx * 6;
Frame_DL_sum_4Qam_2ndRx(i) = Subframe_DL_sum_4Qam_2ndRx * 6;
Frame_DL_sum_16Qam_2ndRx(i) = Subframe_DL_sum_16Qam_2ndRx * 6;
Frame_DL_sum_64Qam_2ndRx(i) = Subframe_DL_sum_64Qam_2ndRx * 6;
Frame_DL_sum_supportedQam_2ndRx(i) = Subframe_DL_sum_supportedQam_2ndRx * 6;
Frame_DL_sum_4Qam_2Rx(i) = Subframe_DL_sum_4Qam_2Rx * 6;
Frame_DL_sum_16Qam_2Rx(i) = Subframe_DL_sum_16Qam_2Rx * 6;
Frame_DL_sum_64Qam_2Rx(i) = Subframe_DL_sum_64Qam_2Rx * 6;
Frame_DL_sum_supportedQam_2Rx(i) = Subframe_DL_sum_supportedQam_2Rx * 6;
end
% add rate of all 100 frames each of 10ms length to compute data rate/sec
Rate_4Qam_1stRx = sum(Frame_DL_sum_4Qam_1stRx(:));
Rate_16Qam_1stRx = sum(Frame_DL_sum_16Qam_1stRx(:));
Rate_64Qam_1stRx = sum(Frame_DL_sum_64Qam_1stRx(:));
Rate_SupportedQam_1stRx = sum(Frame_DL_sum_supportedQam_1stRx(:));
Rate_4Qam_2ndRx = sum(Frame_DL_sum_4Qam_2ndRx(:));
Rate_16Qam_2ndRx = sum(Frame_DL_sum_16Qam_2ndRx(:));
Rate_64Qam_2ndRx = sum(Frame_DL_sum_64Qam_2ndRx(:));
Rate_SupportedQam_2ndRx = sum(Frame_DL_sum_supportedQam_2ndRx(:));
Rate_4Qam_2Rx = sum(Frame_DL_sum_4Qam_2Rx(:));
Rate_16Qam_2Rx = sum(Frame_DL_sum_16Qam_2Rx(:));
Rate_64Qam_2Rx = sum(Frame_DL_sum_64Qam_2Rx(:));
Rate_SupportedQam_2Rx = sum(Frame_DL_sum_supportedQam_2Rx(:));
openair1/EMOS/LTE/POST_PROCESSING/CapCom/calc_rps_Beamforming.m
-131
View File
@@ -1,131 +0,0 @@
function [Rate_4Qam_1Rx_maxq,Rate_16Qam_1Rx_maxq,Rate_64Qam_1Rx_maxq, Rate_4Qam_1Rx_feedbackq,...
Rate_16Qam_1Rx_feedbackq,Rate_64Qam_1Rx_feedbackq,bmfr_optmq_SNR_1Rx, bmfr_feedbkq_SNR_1Rx,...
Rate_4Qam_2Rx_maxq,Rate_16Qam_2Rx_maxq,Rate_64Qam_2Rx_maxq, Rate_4Qam_2Rx_feedbackq,...
Rate_16Qam_2Rx_feedbackq,Rate_64Qam_2Rx_feedbackq,bmfr_optmq_SNR_2Rx,...
bmfr_feedbkq_SNR_2Rx, Rate_supportedQam_1Rx_maxq, Rate_supportedQam_1Rx_feedbackq,...
Rate_supportedQam_2Rx_maxq,Rate_supportedQam_2Rx_feedbackq] = calc_rps_Beamforming(estimates_UE)
capacity_Mode6_beamforming_1
bmfr_optmq = SNR_eNB_1Rx(1,1:200,:);
bmfr_optmq_SNR_1Rx = mean(bmfr_optmq(:));
bmfr_optmq = SNR_eNB_2Rx(1,1:200,:);
bmfr_optmq_SNR_2Rx = mean(bmfr_optmq(:));
bmfr_feedbkq = SNR_eNB_1Rx(1,201:end,:);
bmfr_feedbkq_SNR_1Rx = mean(bmfr_feedbkq(:));
bmfr_feedbkq = SNR_eNB_2Rx(1,201:end,:);
bmfr_feedbkq_SNR_2Rx = mean(bmfr_feedbkq(:));
%[x y z] = size(chcap_siso_single_stream_4Qam_1Rx_eNB1);
% Following will hold the data rate of one whole Frame
Frame_DL_sum_4Qam_1Rx = zeros(1, length(estimates_UE));
Frame_DL_sum_16Qam_1Rx = zeros(1,length(estimates_UE));
Frame_DL_sum_64Qam_1Rx = zeros(1,length(estimates_UE));
Frame_DL_sum_supportedQam_1Rx = zeros(1,length(estimates_UE));
Frame_DL_sum_4Qam_2Rx = zeros(1, length(estimates_UE));
Frame_DL_sum_16Qam_2Rx = zeros(1,length(estimates_UE));
Frame_DL_sum_64Qam_2Rx = zeros(1,length(estimates_UE));
Frame_DL_sum_supportedQam_2Rx = zeros(1,length(estimates_UE));
for i = 1:length(estimates_UE)
%following holds accumulated data rate of 200 resource elements
% first 200 values corresponds to q which maximizes the over all sum
% rate, and next 200 values correspond to the calculations which are
% done on the basis of fedback q
RS_sum_4Qam_1Rx_maxq = sum(chcap_beamforming_4Qam_1Rx(1,1:200,i));
RS_sum_16Qam_1Rx_maxq = sum(chcap_beamforming_16Qam_1Rx(1,1:200,i));
RS_sum_64Qam_1Rx_maxq = sum(chcap_beamforming_64Qam_1Rx(1,1:200,i));
RS_sum_supportedQam_1Rx_maxq = sum(chcap_beamforming_supportedQam_1Rx(1,1:200,i));
RS_sum_4Qam_2Rx_maxq = sum(chcap_beamforming_4Qam_2Rx(1,1:200,i));
RS_sum_16Qam_2Rx_maxq = sum(chcap_beamforming_16Qam_2Rx(1,1:200,i));
RS_sum_64Qam_2Rx_maxq = sum(chcap_beamforming_64Qam_2Rx(1,1:200,i));
RS_sum_supportedQam_2Rx_maxq = sum(chcap_beamforming_supportedQam_2Rx(1,1:200,i));
RS_sum_4Qam_1Rx_feedbackq = sum(chcap_beamforming_4Qam_1Rx(1,201:end,i));
RS_sum_16Qam_1Rx_feedbackq = sum(chcap_beamforming_16Qam_1Rx(1,201:end,i));
RS_sum_64Qam_1Rx_feedbackq = sum(chcap_beamforming_64Qam_1Rx(1,201:end,i));
RS_sum_supportedQam_1Rx_feedbackq = sum(chcap_beamforming_supportedQam_1Rx(1,201:end,i));
RS_sum_4Qam_2Rx_feedbackq = sum(chcap_beamforming_4Qam_2Rx(1,201:end,i));
RS_sum_16Qam_2Rx_feedbackq = sum(chcap_beamforming_16Qam_2Rx(1,201:end,i));
RS_sum_64Qam_2Rx_feedbackq = sum(chcap_beamforming_64Qam_2Rx(1,201:end,i));
RS_sum_supportedQam_2Rx_feedbackq = sum(chcap_beamforming_supportedQam_2Rx(1,201:end,i));
% since 4200/200 = 21 groups of 200 resource elements are there in one subframe, so to get
% the estimate of whole subframe we need to multiply RS_sum_XQam_1Rx by 21.
Subframe_DL_sum_4Qam_1Rx_maxq = RS_sum_4Qam_1Rx_maxq * 12;
Subframe_DL_sum_16Qam_1Rx_maxq = RS_sum_16Qam_1Rx_maxq * 12;
Subframe_DL_sum_64Qam_1Rx_maxq = RS_sum_64Qam_1Rx_maxq * 12;
Subframe_DL_sum_supportedQam_1Rx_maxq = RS_sum_supportedQam_1Rx_maxq * 12;
Subframe_DL_sum_4Qam_1Rx_feedbackq = RS_sum_4Qam_1Rx_feedbackq * 12;
Subframe_DL_sum_16Qam_1Rx_feedbackq = RS_sum_16Qam_1Rx_feedbackq * 12;
Subframe_DL_sum_64Qam_1Rx_feedbackq = RS_sum_64Qam_1Rx_feedbackq * 12;
Subframe_DL_sum_supportedQam_1Rx_feedbackq = RS_sum_supportedQam_1Rx_feedbackq * 12;
Subframe_DL_sum_4Qam_2Rx_maxq = RS_sum_4Qam_2Rx_maxq * 12;
Subframe_DL_sum_16Qam_2Rx_maxq = RS_sum_16Qam_2Rx_maxq * 12;
Subframe_DL_sum_64Qam_2Rx_maxq = RS_sum_64Qam_2Rx_maxq * 12;
Subframe_DL_sum_supportedQam_2Rx_maxq = RS_sum_supportedQam_2Rx_maxq * 12;
Subframe_DL_sum_4Qam_2Rx_feedbackq = RS_sum_4Qam_2Rx_feedbackq * 12;
Subframe_DL_sum_16Qam_2Rx_feedbackq = RS_sum_16Qam_2Rx_feedbackq * 12;
Subframe_DL_sum_64Qam_2Rx_feedbackq = RS_sum_64Qam_2Rx_feedbackq * 12;
Subframe_DL_sum_supportedQam_2Rx_feedbackq = RS_sum_supportedQam_2Rx_feedbackq * 12;
%In LTE Confguration 3 we have 6 downlink subframes in one frame so
Frame_DL_sum_4Qam_1Rx_feedbackq(i) = Subframe_DL_sum_4Qam_1Rx_feedbackq * 6;
Frame_DL_sum_16Qam_1Rx_feedbackq(i) = Subframe_DL_sum_16Qam_1Rx_feedbackq * 6;
Frame_DL_sum_64Qam_1Rx_feedbackq(i) = Subframe_DL_sum_64Qam_1Rx_feedbackq * 6;
Frame_DL_sum_supportedQam_1Rx_feedbackq(i) = Subframe_DL_sum_supportedQam_1Rx_feedbackq * 6;
Frame_DL_sum_4Qam_1Rx_maxq(i) = Subframe_DL_sum_4Qam_1Rx_maxq * 6;
Frame_DL_sum_16Qam_1Rx_maxq(i) = Subframe_DL_sum_16Qam_1Rx_maxq * 6;
Frame_DL_sum_64Qam_1Rx_maxq(i) = Subframe_DL_sum_64Qam_1Rx_maxq * 6;
Frame_DL_sum_supportedQam_1Rx_maxq(i) = Subframe_DL_sum_supportedQam_1Rx_maxq * 6;
Frame_DL_sum_4Qam_2Rx_feedbackq(i) = Subframe_DL_sum_4Qam_2Rx_feedbackq * 6;
Frame_DL_sum_16Qam_2Rx_feedbackq(i) = Subframe_DL_sum_16Qam_2Rx_feedbackq * 6;
Frame_DL_sum_64Qam_2Rx_feedbackq(i) = Subframe_DL_sum_64Qam_2Rx_feedbackq * 6;
Frame_DL_sum_supportedQam_2Rx_feedbackq(i) = Subframe_DL_sum_supportedQam_2Rx_feedbackq * 6;
Frame_DL_sum_4Qam_2Rx_maxq(i) = Subframe_DL_sum_4Qam_2Rx_maxq * 6;
Frame_DL_sum_16Qam_2Rx_maxq(i) = Subframe_DL_sum_16Qam_2Rx_maxq * 6;
Frame_DL_sum_64Qam_2Rx_maxq(i) = Subframe_DL_sum_64Qam_2Rx_maxq * 6;
Frame_DL_sum_supportedQam_2Rx_maxq(i) = Subframe_DL_sum_supportedQam_2Rx_maxq * 6;
end
% add rate of all 100 frames each of 10ms length to compute data rate/sec
Rate_4Qam_1Rx_maxq = sum(Frame_DL_sum_4Qam_1Rx_maxq(:));
Rate_16Qam_1Rx_maxq = sum(Frame_DL_sum_16Qam_1Rx_maxq(:));
Rate_64Qam_1Rx_maxq = sum(Frame_DL_sum_64Qam_1Rx_maxq(:));
Rate_supportedQam_1Rx_maxq = sum(Frame_DL_sum_supportedQam_1Rx_maxq(:));
Rate_4Qam_1Rx_feedbackq = sum(Frame_DL_sum_4Qam_1Rx_feedbackq(:));
Rate_16Qam_1Rx_feedbackq = sum(Frame_DL_sum_16Qam_1Rx_feedbackq(:));
Rate_64Qam_1Rx_feedbackq = sum(Frame_DL_sum_64Qam_1Rx_feedbackq(:));
Rate_supportedQam_1Rx_feedbackq = sum(Frame_DL_sum_supportedQam_1Rx_feedbackq(:));
Rate_4Qam_2Rx_maxq = sum(Frame_DL_sum_4Qam_2Rx_maxq(:));
Rate_16Qam_2Rx_maxq = sum(Frame_DL_sum_16Qam_2Rx_maxq(:));
Rate_64Qam_2Rx_maxq = sum(Frame_DL_sum_64Qam_2Rx_maxq(:));
Rate_supportedQam_2Rx_maxq = sum(Frame_DL_sum_supportedQam_2Rx_maxq(:));
Rate_4Qam_2Rx_feedbackq = sum(Frame_DL_sum_4Qam_2Rx_feedbackq(:));
Rate_16Qam_2Rx_feedbackq = sum(Frame_DL_sum_16Qam_2Rx_feedbackq(:));
Rate_64Qam_2Rx_feedbackq = sum(Frame_DL_sum_64Qam_2Rx_feedbackq(:));
Rate_supportedQam_2Rx_feedbackq = sum(Frame_DL_sum_supportedQam_2Rx_feedbackq(:));
openair1/EMOS/LTE/POST_PROCESSING/CapCom/calc_rps_SISO.m
-108
View File
@@ -1,108 +0,0 @@
function [Rate_4Qam_1stRx,Rate_16Qam_1stRx,Rate_64Qam_1stRx,Rate_4Qam_2ndRx,...
Rate_16Qam_2ndRx,Rate_64Qam_2ndRx,siso_SNR_1stRx_persecond,...
siso_SNR_2ndRx_persecond,Rate_4Qam_2Rx,Rate_16Qam_2Rx,Rate_64Qam_2Rx,...
siso_SNR_2Rx_persecond,Rate_supportedQam_1stRx,Rate_supportedQam_2ndRx, Rate_supportedQam_2Rx] = calc_rps_SISO(estimates_UE)
capacity_siso_1
[x y z] = size(chcap_siso_single_stream_4Qam_1stRx);
siso_SNR_1stRx_persecond = mean(SNR_eNB_1stRx(:));
siso_SNR_2ndRx_persecond = mean(SNR_eNB_2ndRx(:));
siso_SNR_2Rx_persecond = mean(SNR_eNB_2Rx(:));
% figure
% hold on
% plot(SNR_eNB1, 'b-x');
% Following will hold the data rate of one whole Frame
Frame_DL_sum_4Qam_1stRx = zeros(1, length(estimates_UE));
Frame_DL_sum_16Qam_1stRx = zeros(1,length(estimates_UE));
Frame_DL_sum_64Qam_1stRx = zeros(1,length(estimates_UE));
Frame_DL_sum_supportedQam_1stRx = zeros(1,length(estimates_UE));
Frame_DL_sum_4Qam_2ndRx = zeros(1, length(estimates_UE));
Frame_DL_sum_16Qam_2ndRx = zeros(1,length(estimates_UE));
Frame_DL_sum_64Qam_2ndRx = zeros(1,length(estimates_UE));
Frame_DL_sum_supportedQam_2ndRx = zeros(1,length(estimates_UE));
Frame_DL_sum_4Qam_2Rx = zeros(1, length(estimates_UE));
Frame_DL_sum_16Qam_2Rx = zeros(1,length(estimates_UE));
Frame_DL_sum_64Qam_2Rx = zeros(1,length(estimates_UE));
Frame_DL_sum_supportedQam_2Rx = zeros(1,length(estimates_UE));
for i = 1:length(estimates_UE)
%following holds accumulated data rate of 200 resource elements
RS_sum_4Qam_1stRx = sum(chcap_siso_single_stream_4Qam_1stRx(1,:,i));
RS_sum_16Qam_1stRx = sum(chcap_siso_single_stream_16Qam_1stRx(1,:,i));
RS_sum_64Qam_1stRx = sum(chcap_siso_single_stream_64Qam_1stRx(1,:,i));
RS_sum_supportedQam_1stRx = sum(chcap_siso_single_stream_supportedQam_1stRx(1,:,i));
RS_sum_4Qam_2ndRx = sum(chcap_siso_single_stream_4Qam_2ndRx(1,:,i));
RS_sum_16Qam_2ndRx = sum(chcap_siso_single_stream_16Qam_2ndRx(1,:,i));
RS_sum_64Qam_2ndRx = sum(chcap_siso_single_stream_64Qam_2ndRx(1,:,i));
RS_sum_supportedQam_2ndRx = sum(chcap_siso_single_stream_supportedQam_2ndRx(1,:,i));
RS_sum_4Qam_2Rx = sum(chcap_siso_single_stream_4Qam_2Rx(1,:,i));
RS_sum_16Qam_2Rx = sum(chcap_siso_single_stream_16Qam_2Rx(1,:,i));
RS_sum_64Qam_2Rx = sum(chcap_siso_single_stream_64Qam_2Rx(1,:,i));
RS_sum_supportedQam_2Rx = sum(chcap_siso_single_stream_supportedQam_2Rx(1,:,i));
% The number of RE availiable for the DLSCH is 9 OFDM symbols * 300
% subcarriers - 300 pilots = 2400.
% since 2400/200 = 12 groups of 200 resource elements are there in one subframe, so to get
% the estimate of whole subframe we need to multiply RS_sum_XQam by 12.
Subframe_DL_sum_4Qam_1stRx = RS_sum_4Qam_1stRx * 12;
Subframe_DL_sum_16Qam_1stRx = RS_sum_16Qam_1stRx * 12;
Subframe_DL_sum_64Qam_1stRx = RS_sum_64Qam_1stRx * 12;
Subframe_DL_sum_supportedQam_1stRx = RS_sum_supportedQam_1stRx * 12;
Subframe_DL_sum_4Qam_2ndRx = RS_sum_4Qam_2ndRx * 12;
Subframe_DL_sum_16Qam_2ndRx = RS_sum_16Qam_2ndRx * 12;
Subframe_DL_sum_64Qam_2ndRx = RS_sum_64Qam_2ndRx * 12;
Subframe_DL_sum_supportedQam_2ndRx = RS_sum_supportedQam_2ndRx * 12;
Subframe_DL_sum_4Qam_2Rx = RS_sum_4Qam_2Rx * 12;
Subframe_DL_sum_16Qam_2Rx = RS_sum_16Qam_2Rx * 12;
Subframe_DL_sum_64Qam_2Rx = RS_sum_64Qam_2Rx * 12;
Subframe_DL_sum_supportedQam_2Rx = RS_sum_supportedQam_2Rx * 12;
%In LTE Confguration 3 we have 6 downlink subframes in one frame so
Frame_DL_sum_4Qam_1stRx(i) = Subframe_DL_sum_4Qam_1stRx * 6;
Frame_DL_sum_16Qam_1stRx(i) = Subframe_DL_sum_16Qam_1stRx * 6;
Frame_DL_sum_64Qam_1stRx(i) = Subframe_DL_sum_64Qam_1stRx * 6;
Frame_DL_sum_supportedQam_1stRx(i) = Subframe_DL_sum_supportedQam_1stRx * 6;
Frame_DL_sum_4Qam_2ndRx(i) = Subframe_DL_sum_4Qam_2ndRx * 6;
Frame_DL_sum_16Qam_2ndRx(i) = Subframe_DL_sum_16Qam_2ndRx * 6;
Frame_DL_sum_64Qam_2ndRx(i) = Subframe_DL_sum_64Qam_2ndRx * 6;
Frame_DL_sum_supportedQam_2ndRx(i) = Subframe_DL_sum_supportedQam_2ndRx * 6;
Frame_DL_sum_4Qam_2Rx(i) = Subframe_DL_sum_4Qam_2Rx * 6;
Frame_DL_sum_16Qam_2Rx(i) = Subframe_DL_sum_16Qam_2Rx * 6;
Frame_DL_sum_64Qam_2Rx(i) = Subframe_DL_sum_64Qam_2Rx * 6;
Frame_DL_sum_supportedQam_2Rx(i) = Subframe_DL_sum_supportedQam_2Rx * 6;
end
% add rate of all 100 frames each of 10ms length to compute data rate/sec
Rate_4Qam_1stRx = sum(Frame_DL_sum_4Qam_1stRx(:));
Rate_16Qam_1stRx = sum(Frame_DL_sum_16Qam_1stRx(:));
Rate_64Qam_1stRx = sum(Frame_DL_sum_64Qam_1stRx(:));
Rate_supportedQam_1stRx = sum(Frame_DL_sum_supportedQam_1stRx(:));
Rate_4Qam_2ndRx = sum(Frame_DL_sum_4Qam_2ndRx(:));
Rate_16Qam_2ndRx = sum(Frame_DL_sum_16Qam_2ndRx(:));
Rate_64Qam_2ndRx = sum(Frame_DL_sum_64Qam_2ndRx(:));
Rate_supportedQam_2ndRx = sum(Frame_DL_sum_supportedQam_2ndRx(:));
Rate_4Qam_2Rx = sum(Frame_DL_sum_4Qam_2Rx(:));
Rate_16Qam_2Rx = sum(Frame_DL_sum_16Qam_2Rx(:));
Rate_64Qam_2Rx = sum(Frame_DL_sum_64Qam_2Rx(:));
Rate_supportedQam_2Rx = sum(Frame_DL_sum_supportedQam_2Rx(:));
openair1/EMOS/LTE/POST_PROCESSING/CapCom/calc_rps_SISO_UL.m
-93
View File
@@ -1,93 +0,0 @@
function [Rate_4Qam,Rate_16Qam,Rate_64Qam, siso_SNR_persecond] = calc_rps_SISO_UL(estimates_eNB, nb_rx, version, avg)
% Channel Capacity of SISO system
% [Rate_4Qam,Rate_16Qam,Rate_64Qam, siso_SNR_persecond] = calc_rps_SISO_UL(estimates_eNB, nb_rx, version, avg)
%
% set version=0 if using measurements with the storage bug.
% All measurements before the 10.6.2010 did not store the UL properly.
% In fact only the first 133 carriers of the 1st Rx antenna of sector 0
% was stored. So if version==0 and sector~=0, we return 0. If version==0
% and sector==0, we extrapolate and assume the same signal on both RX
% antennas.
%
% set avg=1 if averaging should be performed over all estimates
load 'SISO.mat';
if version<1
srs_len = 113;
else
srs_len = 144;
end
chcap_siso_single_stream_4Qam = zeros(1, 3*srs_len, length(estimates_eNB));
chcap_siso_single_stream_16Qam = zeros(1, 3*srs_len, length(estimates_eNB));
chcap_siso_single_stream_64Qam = zeros(1, 3*srs_len, length(estimates_eNB));
SNR_eNB = zeros(1,3*srs_len,length(estimates_eNB));
for est=1:length(estimates_eNB)
% choose the right sector
if (version<1)
sector = estimates_eNB(est).eNb_UE_stats(3,1).sector;
if sector~=0
chcap_siso_single_stream_4Qam(1, :, est) = nan;
chcap_siso_single_stream_16Qam(1, :, est) = nan;
chcap_siso_single_stream_64Qam(1, :, est) = nan;
continue
end
else
sector = estimates_eNB(est).eNb_UE_stats(1,1).sector;
end
N0 = double(estimates_eNB(est).phy_measurements_eNb(sector+1).n0_power(1));
H_abs_sqr = double(estimates_eNB(est).channel(1:2:end,:,:,1:3)).^2 + ...
double(estimates_eNB(est).channel(2:2:end,:,:,1:3)).^2;
% extract 144 carriers with constitute SRS
if version<1
H_abs_sqr = reshape(H_abs_sqr,450,2,2,3);
ind = [363:2:450 2:2:138 ];
H_abs_sqr_tot = sum(H_abs_sqr(ind,ones(1,nb_rx),1,:),2);
else
ind = [363:2:512 2:2:138];
H_abs_sqr_tot = sum(H_abs_sqr(ind,1:nb_rx,sector+1,:),2);
end
SNR_eNB(1, :, est) = 10*log10(H_abs_sqr_tot(:)/N0);
% SNR_eNB(isnan(SNR_eNB)) = 0;
%
% index = (SNR_eNB(1, :, est) < -20);
% SNR_eNB(1, index, est) = -20;
%
% index = (SNR_eNB(1, :, est) > 40);
% SNR_eNB(1, index, est) = 40;
chcap_siso_single_stream_4Qam(1, :, est) = interp1(SNR,c_siso_4Qam,SNR_eNB(1, :, est),'nearest','extrap');
chcap_siso_single_stream_16Qam(1, :, est) = interp1(SNR,c_siso_16Qam,SNR_eNB(1, :, est),'nearest','extrap');
chcap_siso_single_stream_64Qam(1, :, est) = interp1(SNR,c_siso_64Qam,SNR_eNB(1, :, est),'nearest','extrap');
end
% for the UL we have 300 subcarriers times 9 symbols (2 are DRS, 1 is SRS)
if avg
siso_SNR_persecond = mean(SNR_eNB(:));
Rate_4Qam = sum(sum(chcap_siso_single_stream_4Qam,2)*300/srs_len*9,3);
Rate_16Qam = sum(sum(chcap_siso_single_stream_16Qam,2)*300/srs_len*9,3);
Rate_64Qam = sum(sum(chcap_siso_single_stream_64Qam,2)*300/srs_len*9,3);
else
siso_SNR_persecond = squeeze(mean(SNR_eNB,2));
Rate_4Qam = squeeze(sum(chcap_siso_single_stream_4Qam,2)*300/srs_len*9);
Rate_16Qam = squeeze(sum(chcap_siso_single_stream_16Qam,2)*300/srs_len*9);
Rate_64Qam = squeeze(sum(chcap_siso_single_stream_64Qam,2)*300/srs_len*9);
end
openair1/EMOS/LTE/POST_PROCESSING/CapCom/calc_rps_alamouti_2.m
-41
View File
@@ -1,41 +0,0 @@
function [Ratepersec_4Qam_alamouti,Ratepersec_16Qam_alamouti,Ratepersec_64Qam_alamouti] = ...
calc_rps_alamouti_2(estimates_UE_1)
% this function calculates the MU-MIMO rate of the two users
% first we have to determine the compatible subbands (based on PMI feedback)
% on the compatible subbands we should use the MU-MIMO capacity, on the
% others we use the single layer precoding capacity and select the user
% with the higher capacity
capacity_mode2_alamouti
Frame_DL_sum_4Qam = zeros(1, 100);
Frame_DL_sum_16Qam = zeros(1, 100);
Frame_DL_sum_64Qam = zeros(1, 100);
for i = 1:length(estimates_UE_1)
RS_sum_4Qam = sum(chcap_alamouti(1,:,i));
RS_sum_16Qam = sum(chcap_alamouti_16(1,:,i));
RS_sum_64Qam = sum(chcap_alamouti_64(1,:,i));
% Since RS_sum_4Qam contains the throughput for the 4 symobols and there
% are total 12 symbols in exteded cyclic prefix subframe of LTE out of
% which 3 are used for control signals and rest of the 9 are used for
% DLSCH with 12*25 = 300 cell specific reference signals in between
% them. so basically we need to measure the throughput for in total 8
% symbols.
Subframe_DL_sum_4Qam = (RS_sum_4Qam * 2);
Subframe_DL_sum_16Qam = (RS_sum_16Qam * 2);
Subframe_DL_sum_64Qam = (RS_sum_64Qam * 2);
%In LTE TDD Confguration 3 we have 6 downlink subframes in one frame so
Frame_DL_sum_4Qam(i) = Subframe_DL_sum_4Qam * 6;
Frame_DL_sum_16Qam(i) = Subframe_DL_sum_16Qam * 6;
Frame_DL_sum_64Qam(i) = Subframe_DL_sum_64Qam * 6;
end
% add rate of all 100 frames each of 10ms length to compute data rate/sec
Ratepersec_4Qam_alamouti = sum(Frame_DL_sum_4Qam(:));
Ratepersec_16Qam_alamouti = sum(Frame_DL_sum_16Qam(:));
Ratepersec_64Qam_alamouti = sum(Frame_DL_sum_64Qam(:));
openair1/EMOS/LTE/POST_PROCESSING/CapCom/calc_rps_mu_mimo.m
-33
View File
@@ -1,33 +0,0 @@
function [Ratepersec_4Qam_MUMIMO] = ...
calc_rps_mu_mimo(estimates_UE_1)
% this function calculates the MU-MIMO rate of the two users
% first we have to determine the compatible subbands (based on PMI feedback)
% on the compatible subbands we should use the MU-MIMO capacity, on the
% others we use the single layer precoding capacity and select the user
% with the higher capacity
capacity_mode5_mumimo
Frame_DL_sum_4Qam = zeros(1, 100);
for i = 1:length(estimates_UE_1)
RS_sum_4Qam = sum(chcap_mumimo(1,:,i));
% Since RS_sum_4Qam contains the throughput for the 4 symobols and there
% are total 12 symbols in exteded cyclic prefix subframe of LTE out of
% which 3 are used for control signals and rest of the 9 are used for
% DLSCH with 12*25 = 300 cell specific reference signals in between
% them. so basically we need to measure the throughput for in total 8
% symbols.
Subframe_DL_sum_4Qam = (RS_sum_4Qam * 2);
%In LTE TDD Confguration 3 we have 6 downlink subframes in one frame so
Frame_DL_sum_4Qam(i) = Subframe_DL_sum_4Qam * 6;
end
% add rate of all 100 frames each of 10ms length to compute data rate/sec
Ratepersec_4Qam_MUMIMO = sum(Frame_DL_sum_4Qam(:));
openair1/EMOS/LTE/POST_PROCESSING/CapCom/calc_rps_siso_2.m
-40
View File
@@ -1,40 +0,0 @@
function [Ratepersec_4Qam_siso,Ratepersec_16Qam_siso,Ratepersec_64Qam_siso ] = ...
calc_rps_siso_2(estimates_UE_1)
% this function calculates the MU-MIMO rate of the two users
% first we have to determine the compatible subbands (based on PMI feedback)
% on the compatible subbands we should use the MU-MIMO capacity, on the
% others we use the single layer precoding capacity and select the user
% with the higher capacity
capacity_mode1_siso
Frame_DL_sum_4Qam = zeros(1, 100);
Frame_DL_sum_16Qam = zeros(1, 100);
Frame_DL_sum_64Qam = zeros(1, 100);
for i = 1:length(estimates_UE_1)
RS_sum_4Qam = sum(chcap_siso(1,:,i));
RS_sum_16Qam = sum(chcap_siso_16(1,:,i));
RS_sum_64Qam = sum(chcap_siso_64(1,:,i));
% Since RS_sum_4Qam contains the throughput for the 4 symobols and there
% are total 12 symbols in exteded cyclic prefix subframe of LTE out of
% which 3 are used for control signals and rest of the 9 are used for
% DLSCH with 12*25 = 300 cell specific reference signals in between
% them. so basically we need to measure the throughput for in total 8
% symbols.
Subframe_DL_sum_4Qam = (RS_sum_4Qam * 2);
Subframe_DL_sum_16Qam = (RS_sum_16Qam * 2);
Subframe_DL_sum_64Qam = (RS_sum_64Qam * 2);
%In LTE TDD Confguration 3 we have 6 downlink subframes in one frame so
Frame_DL_sum_4Qam(i) = Subframe_DL_sum_4Qam * 6;
Frame_DL_sum_16Qam(i) = Subframe_DL_sum_16Qam * 6;
Frame_DL_sum_64Qam(i) = Subframe_DL_sum_64Qam * 6;
end
% add rate of all 100 frames each of 10ms length to compute data rate/sec
Ratepersec_4Qam_siso = sum(Frame_DL_sum_4Qam(:));
Ratepersec_16Qam_siso = sum(Frame_DL_sum_16Qam(:));
Ratepersec_64Qam_siso = sum(Frame_DL_sum_64Qam(:));
openair1/EMOS/LTE/POST_PROCESSING/CapCom/capacity_Alamouti_1.m
-205
View File
@@ -1,205 +0,0 @@
%Channel Capacity of Alamouti MIMO system
load 'SISO.mat';
[x, y, z] = size(estimates_UE(1).channel);
z = x/4;
%MultiAntenna_Rx = 1; % 0 for Single antenna
% 1 for Multi Antenna (2 antennas here)
h = zeros(1,z);
chcap_alamouti_4Qam_1stRx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_16Qam_1stRx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_64Qam_1stRx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_supportedQam_1stRx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_4Qam_2ndRx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_16Qam_2ndRx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_64Qam_2ndRx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_supportedQam_2ndRx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_4Qam_2Rx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_16Qam_2Rx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_64Qam_2Rx = zeros(1,length(h), length(estimates_UE));
chcap_alamouti_supportedQam_2Rx = zeros(1,length(h), length(estimates_UE));
SNR_eNB_1stRx = zeros(1,length(h), length(estimates_UE));
SNR_eNB_2ndRx = zeros(1,length(h), length(estimates_UE));
SNR_eNB_2Rx = zeros(1,length(h), length(estimates_UE));
for est=1:length(estimates_UE)
NO_1stRx = double(estimates_UE(est).phy_measurements(11).n0_power(1));
NO_2ndRx = double(estimates_UE(est).phy_measurements(11).n0_power(2));
% for checking the connected Sector
H = estimates_UE(est).channel;
Hc = double(H(1:2:end,:,:))+1j*double(H(2:2:end,:,:));
Hs = squeeze(10*log10(sum(sum(abs(Hc).^2,1),2)));
[val, ind] = max(Hs);
h11_eNB = double(estimates_UE(est).channel(2*z+1:2:end,1,ind)) + 1j*double(estimates_UE(est).channel(2*z+2:2:end,1,ind));
h12_eNB = double(estimates_UE(est).channel(2*z+1:2:end,2,ind)) + 1j*double(estimates_UE(est).channel(2*z+2:2:end,2,ind));
h21_eNB = double(estimates_UE(est).channel(2*z+1:2:end,3,ind)) + 1j*double(estimates_UE(est).channel(2*z+2:2:end,3,ind));
h22_eNB = double(estimates_UE(est).channel(2*z+1:2:end,4,ind)) + 1j*double(estimates_UE(est).channel(2*z+2:2:end,4,ind));
%SNR calculation for Alamouti Scheme
SNR_eNB_1stRx(1, :, est) = 10*log10(((abs(h11_eNB).^2) + (abs(h21_eNB).^2))/NO_1stRx);
SNR_eNB_2ndRx(1, :, est) = 10*log10(((abs(h12_eNB).^2) + (abs(h22_eNB).^2))/NO_2ndRx);
SNR_eNB_2Rx(1, :, est) = 10*log10((((abs(h11_eNB).^2) + (abs(h12_eNB).^2))/NO_1stRx) + (((abs(h21_eNB).^2) + (abs(h22_eNB).^2))/NO_2ndRx));
nan_in_SNR = isnan(SNR_eNB_1stRx);
SNR_eNB_1stRx(nan_in_SNR) = 0;
nan_in_SNR = isnan(SNR_eNB_2ndRx);
SNR_eNB_2ndRx(nan_in_SNR) = 0;
nan_in_SNR = isnan(SNR_eNB_2Rx);
SNR_eNB_2Rx(nan_in_SNR) = 0;
chcap_alamouti_4Qam_1stRx(1, :, est) = interp1(SNR,c_siso_4Qam,SNR_eNB_1stRx(1, :, est),'nearest','extrap');
chcap_alamouti_4Qam_2ndRx(1, :, est) = interp1(SNR,c_siso_4Qam,SNR_eNB_2ndRx(1, :, est),'nearest','extrap');
chcap_alamouti_4Qam_2Rx(1, :, est) = interp1(SNR,c_siso_4Qam,SNR_eNB_2Rx(1, :, est),'nearest','extrap');
chcap_alamouti_16Qam_1stRx(1, :, est) = interp1(SNR,c_siso_16Qam,SNR_eNB_1stRx(1, :, est),'nearest','extrap');
chcap_alamouti_16Qam_2ndRx(1, :, est) = interp1(SNR,c_siso_16Qam,SNR_eNB_2ndRx(1, :, est),'nearest','extrap');
chcap_alamouti_16Qam_2Rx(1, :, est) = interp1(SNR,c_siso_16Qam,SNR_eNB_2Rx(1, :, est),'nearest','extrap');
chcap_alamouti_64Qam_1stRx(1, :, est) = interp1(SNR,c_siso_64Qam,SNR_eNB_1stRx(1, :, est),'nearest','extrap');
chcap_alamouti_64Qam_2ndRx(1, :, est) = interp1(SNR,c_siso_64Qam,SNR_eNB_2ndRx(1, :, est),'nearest','extrap');
chcap_alamouti_64Qam_2Rx(1, :, est) = interp1(SNR,c_siso_64Qam,SNR_eNB_2Rx(1, :, est),'nearest','extrap');
%%
while (min(SNR_eNB_1stRx(1, :, est)) < -20)
[value, index] = min(SNR_eNB_1stRx(1, :, est));
SNR_eNB_1stRx(1, index, est) = -20;
continue
end
while (max(SNR_eNB_1stRx(1, :, est)) > 40)
[value, index] = max(SNR_eNB_1stRx(1, :, est));
SNR_eNB_1stRx(1, index, est) = 40;
continue
end
while (min(SNR_eNB_2ndRx(1, :, est)) < -20)
[value, index] = min(SNR_eNB_2ndRx(1, :, est));
SNR_eNB_2ndRx(1, index, est) = -20;
continue
end
while (max(SNR_eNB_2ndRx(1, :, est)) > 40)
[value, index] = max(SNR_eNB_2ndRx(1, :, est));
SNR_eNB_2ndRx(1, index, est) = 40;
continue
end
while (min(SNR_eNB_2Rx(1, :, est)) < -20)
[value, index] = min(SNR_eNB_2Rx(1, :, est));
SNR_eNB_2Rx(1, index, est) = -20;
continue
end
while (max(SNR_eNB_2Rx(1, :, est)) > 40)
[value, index] = max(SNR_eNB_2Rx(1, :, est));
SNR_eNB_2Rx(1, index, est) = 40;
continue
end
MI = log2(abs((1 + SNR_eNB_1stRx(1,:,est))));
C1 = mean(MI);
MI = log2(abs((1 + SNR_eNB_2ndRx(1,:,est))));
C2 = mean(MI);
MI = log2(abs((1 + SNR_eNB_2Rx(1,:,est))));
C3 = mean(MI);
if C1 <2
for c=1:z
chcap_alamouti_supportedQam_1stRx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_1stRx(1, c, est))));
end
else
if C1 >2 && C1 < 4
for c=1:z
chcap_alamouti_supportedQam_1stRx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_1stRx(1, c, est))));
end
else
for c=1:z
chcap_alamouti_supportedQam_1stRx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_1stRx(1, c, est))));
end
end
end
if C2 <2
for c=1:z
chcap_alamouti_supportedQam_2ndRx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_2ndRx(1, c, est))));
end
else
if C2 >2 && C2 < 4
for c=1:z
chcap_alamouti_supportedQam_2ndRx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_2ndRx(1, c, est))));
end
else
for c=1:z
chcap_alamouti_supportedQam_2ndRx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_2ndRx(1, c, est))));
end
end
end
if C3 <2
for c=1:z
chcap_alamouti_supportedQam_2Rx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
end
else
if C3 >2 && C3 < 4
for c=1:z
chcap_alamouti_supportedQam_2Rx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
end
else
for c=1:z
chcap_alamouti_supportedQam_2Rx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
end
end
end
% for const=1:3
% if const ==1
% for c=1:length(h)
% chcap_alamouti_4Qam_1stRx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_1stRx(1, c, est))));
% chcap_alamouti_4Qam_2ndRx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_2ndRx(1, c, est))));
% chcap_alamouti_4Qam_2Rx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
% end
% else if const==2
% for c=1:length(h)
% chcap_alamouti_16Qam_1stRx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_1stRx(1, c, est))));
% chcap_alamouti_16Qam_2ndRx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_2ndRx(1, c, est))));
% chcap_alamouti_16Qam_2Rx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
% end
% else
% for c=1:length(h)
% chcap_alamouti_64Qam_1stRx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_1stRx(1, c, est))));
% chcap_alamouti_64Qam_2ndRx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_2ndRx(1, c, est))));
% chcap_alamouti_64Qam_2Rx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
% end
% end
% end
% end
end
% if MultiAntenna_Rx == 1
% save 'chcap_alamouti_MultiAntennaUE_Measurements.mat' 'chcap_alamouti*' 'SNR_eNB*'
% else
% save 'chcap_alamouti_SingleAntennaUE_Measurements.mat' 'chcap_alamouti*' 'SNR_eNB*'
% end
openair1/EMOS/LTE/POST_PROCESSING/CapCom/capacity_Mode6_beamforming_1.m
-229
View File
@@ -1,229 +0,0 @@
%Channel Capacity for LTE Mode 6 Beamforming
load 'SISO.mat'
[x, y, z] = size(estimates_UE(1).channel);
z = x/4;
h = zeros(1,2*z);
%precoding matrix values q
qi = [1 -1 1i -1i];
chcap_beamforming_4Qam_1Rx = zeros(1,length(h), length(estimates_UE));
chcap_beamforming_16Qam_1Rx = zeros(1,length(h), length(estimates_UE));
chcap_beamforming_64Qam_1Rx = zeros(1,length(h), length(estimates_UE));
chcap_beamforming_supportedQam_1Rx = zeros(1,length(h), length(estimates_UE));
chcap_beamforming_4Qam_2Rx = zeros(1,length(h), length(estimates_UE));
chcap_beamforming_16Qam_2Rx = zeros(1,length(h), length(estimates_UE));
chcap_beamforming_64Qam_2Rx = zeros(1,length(h), length(estimates_UE));
chcap_beamforming_supportedQam_2Rx = zeros(1,length(h), length(estimates_UE));
SNR_eNB_1Rx = zeros(1,length(h), length(estimates_UE));
SNR_eNB_2Rx = zeros(1,length(h), length(estimates_UE));
index(1).subband = [1:8 51:58 101:108 151:158];
index(2).subband = [9:16 59:66 109:116 159:166];
index(3).subband = [17:24 67:74 117:124 167:174];
index(4).subband = [25:32 75:82 125:132 175:182];
index(5).subband = [33:40 83:90 133:140 183:190];
index(6).subband = [41:48 91:98 141:148 191:198];
index(7).subband = [49 50 99 100 149 150 199 200];
for est=1:length(estimates_UE)
NO_1Rx = double(estimates_UE(est).phy_measurements(11).n0_power(1));
NO_2ndRx = double(estimates_UE(est).phy_measurements(11).n0_power(2));
% for checking the connected Sector
H = estimates_UE(est).channel;
Hc = double(H(1:2:end,:,:))+1j*double(H(2:2:end,:,:));
Hs = squeeze(10*log10(sum(sum(abs(Hc).^2,1),2)));
[val, ind] = max(Hs);
antenna_index = estimates_UE(est).phy_measurements(11).selected_rx_antennas(:,1);
h11_eNB = double(estimates_UE(est).channel(2*z+1:2:end,1,ind)) + 1j*double(estimates_UE(est).channel(2*z+2:2:end,1,ind));
h12_eNB = double(estimates_UE(est).channel(2*z+1:2:end,2,ind)) + 1j*double(estimates_UE(est).channel(2*z+2:2:end,2,ind));
h21_eNB = double(estimates_UE(est).channel(2*z+1:2:end,3,ind)) + 1j*double(estimates_UE(est).channel(2*z+2:2:end,3,ind));
h22_eNB = double(estimates_UE(est).channel(2*z+1:2:end,4,ind)) + 1j*double(estimates_UE(est).channel(2*z+2:2:end,4,ind));
for i=1:1:7
for qq=1:4
Rx1(qq).eNB = abs(h11_eNB(index(i).subband) + qi(qq)*h21_eNB(index(i).subband)).^2;
Rx2(qq).eNB = abs(h12_eNB(index(i).subband) + qi(qq)*h22_eNB(index(i).subband)).^2;
end
for ii=1:4
SNR_eNB_q_1Rx(ii).snr = 10*log10((Rx1(ii).eNB)/NO_1Rx);
sum_eNB_q_1Rx(ii) = sum(SNR_eNB_q_1Rx(ii).snr);
SNR_eNB_q_2Rx(ii).snr = 10*log10(((Rx1(ii).eNB)/NO_1Rx) + ((Rx2(ii).eNB)/NO_2ndRx));
sum_eNB_q_2Rx(ii) = sum(SNR_eNB_q_2Rx(ii).snr);
end
[value_eNB_1Rx, index_eNB_1Rx] = max(sum_eNB_q_1Rx);
[value_eNB_2Rx, index_eNB_2Rx] = max(sum_eNB_q_2Rx);
%SNR calculation
SNR_eNB_1Rx(1, (index(i).subband), est) = SNR_eNB_q_1Rx(index_eNB_1Rx).snr;
SNR_eNB_2Rx(1, (index(i).subband), est) = SNR_eNB_q_2Rx(index_eNB_2Rx).snr;
end
% after feedback in 3rd subframe
Rx111 = [];
Rx222 = [];
% q = double(estimates_UE(est).phy_measurements(1).subband_pmi_re((antenna_index(i)+1),i,ind))+1j*double(estimates_UE(est).phy_measurements(1).subband_pmi_im((antenna_index(i)+1),i,ind));
% q = double(estimates_UE(est).phy_measurements(1).subband_pmi_re(ind,:,1))+1j*double(estimates_UE(est).phy_measurements(1).subband_pmi_im(ind,:,1));
for i =1:1:7
q = double(estimates_UE(est).phy_measurements(1).subband_pmi_re((antenna_index(i)+1),i,1))+1j*double(estimates_UE(est).phy_measurements(1).subband_pmi_im((antenna_index(i)+1),i,1));
qq(i) = quantize_q(q);
Rx11 = abs(h11_eNB(index(i).subband) + qq(i)*h21_eNB(index(i).subband)).^2;
Rx22 = abs(h12_eNB(index(i).subband) + qq(i)*h22_eNB(index(i).subband)).^2;
Rx111 = [Rx111 Rx11'];
Rx222 = [Rx222 Rx22'];
end
SNR_eNB_1Rx(1, 201:end, est) = 10*log10((Rx111)/NO_1Rx);
SNR_eNB_2Rx(1, 201:end, est) = 10*log10((Rx111/NO_1Rx) + (Rx222/NO_2ndRx));
nan_in_SNR = isnan(SNR_eNB_1Rx);
SNR_eNB_1Rx(nan_in_SNR) = 0;
nan_in_SNR = isnan(SNR_eNB_2Rx);
SNR_eNB_2Rx(nan_in_SNR) = 0;
chcap_beamforming_4Qam_1Rx(1, :, est) = interp1(SNR,c_siso_4Qam,SNR_eNB_1Rx(1, :, est),'nearest','extrap');
chcap_beamforming_4Qam_2Rx(1, :, est) = interp1(SNR,c_siso_4Qam,SNR_eNB_2Rx(1, :, est),'nearest','extrap');
chcap_beamforming_16Qam_1Rx(1, :, est) = interp1(SNR,c_siso_16Qam,SNR_eNB_1Rx(1, :, est),'nearest','extrap');
chcap_beamforming_16Qam_2Rx(1, :, est) = interp1(SNR,c_siso_16Qam,SNR_eNB_2Rx(1, :, est),'nearest','extrap');
chcap_beamforming_64Qam_1Rx(1, :, est) = interp1(SNR,c_siso_64Qam,SNR_eNB_1Rx(1, :, est),'nearest','extrap');
chcap_beamforming_64Qam_2Rx(1, :, est) = interp1(SNR,c_siso_64Qam,SNR_eNB_2Rx(1, :, est),'nearest','extrap');
%%
while (min(SNR_eNB_1Rx(1, :, est)) < -20)
[value, index1] = min(SNR_eNB_1Rx(1, :, est));
SNR_eNB_1Rx(1, index1, est) = -20;
continue
end
while (max(SNR_eNB_1Rx(1, :, est)) > 40)
[value, index1] = max(SNR_eNB_1Rx(1, :, est));
SNR_eNB_1Rx(1, index1, est) = 40;
continue
end
while (min(SNR_eNB_2Rx(1, :, est)) < -20)
[value, index1] = min(SNR_eNB_2Rx(1, :, est));
SNR_eNB_2Rx(1, index1, est) = -20;
continue
end
while (max(SNR_eNB_2Rx(1, :, est)) > 40)
[value, index1] = max(SNR_eNB_2Rx(1, :, est));
SNR_eNB_2Rx(1, index1, est) = 40;
continue
end
MI = log2(abs((1 + SNR_eNB_1Rx(1,1:200,est))));
C1 = mean(MI);
MI = log2(abs((1 + SNR_eNB_1Rx(1,201:end,est))));
C2 = mean(MI);
MI = log2(abs((1 + SNR_eNB_2Rx(1,1:200,est))));
C3 = mean(MI);
MI = log2(abs((1 + SNR_eNB_2Rx(1,201:end,est))));
C4 = mean(MI);
% MI = log2(abs((1 + SNR_eNB_2ndRx(1,:,est))));
% C2 = mean(MI);
if C1 <2
for c=1:z
chcap_beamforming_supportedQam_1Rx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_1Rx(1, c, est))));
end
else
if C1 >2 && C1 < 4
for c=1:z
chcap_beamforming_supportedQam_1Rx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_1Rx(1, c, est))));
end
else
for c=1:z
chcap_beamforming_supportedQam_1Rx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_1Rx(1, c, est))));
end
end
end
if C2 <2
for c=201:2*z
chcap_beamforming_supportedQam_1Rx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_1Rx(1, c, est))));
end
else
if C2 >2 && C2 < 4
for c=201:2*z
chcap_beamforming_supportedQam_1Rx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_1Rx(1, c, est))));
end
else
for c=201:2*z
chcap_beamforming_supportedQam_1Rx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_1Rx(1, c, est))));
end
end
end
if C3 <2
for c=1:z
chcap_beamforming_supportedQam_2Rx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
end
else
if C3 >2 && C3 < 4
for c=1:z
chcap_beamforming_supportedQam_2Rx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
end
else
for c=1:z
chcap_beamforming_supportedQam_2Rx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
end
end
end
if C4 <2
for c=201:2*z
chcap_beamforming_supportedQam_2Rx(1, c, est) = c_siso_4Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
end
else
if C4 >2 && C4 < 4
for c=201:2*z
chcap_beamforming_supportedQam_2Rx(1, c, est) = c_siso_16Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
end
else
for c=201:2*z
chcap_beamforming_supportedQam_2Rx(1, c, est) = c_siso_64Qam(find(SNR == round(SNR_eNB_2Rx(1, c, est))));
end
end
end
end
openair1/EMOS/LTE/POST_PROCESSING/CapCom/capacity_mode5_mumimo.m
-340
View File
@@ -1,340 +0,0 @@
global mumimo_count beamforming_count
load 'table_LTE_MODE_4_5.mat';
load 'SISO.mat';
[x, y, z] = size(estimates_UE_1(1).channel);
estimates_UE1 = estimates_UE_1(1,:);
estimates_UE2 = estimates_UE_1(2,:);
chcap_mumimo = zeros(1,1200, length(estimates_UE1));
chcap_mumimo_ue1 = zeros(1,1200, length(estimates_UE1));
chcap_mumimo_ue2 = zeros(1,1200, length(estimates_UE1));
subband_indices = 1:48:288;
subband_indices(7) = 289;
subband_indices(8) = 301;
for est=1:length(estimates_UE1)
try
N0_1Rx = (double(estimates_UE1(est).phy_measurements(11).n0_power(1)));
N0_2ndRx = (double(estimates_UE2(est).phy_measurements(11).n0_power(1)));
catch exception
disp(exception.getReport)
fprintf('Detected error in reading N0_2ndRx, Making it zero');
N0_2ndRx = 0;
continue
end
H = estimates_UE1(est).channel;
Hc = double(H(1:2:end,:,:))+1j*double(H(2:2:end,:,:));
Hs = squeeze(10*log10(sum(sum(abs(Hc).^2,1),2)));
[val, ind1] = max(Hs);
antenna_index1 = estimates_UE1(est).phy_measurements(11).selected_rx_antennas(:,1);
H = estimates_UE2(est).channel;
Hc = double(H(1:2:end,:,:))+1j*double(H(2:2:end,:,:));
Hs = squeeze(10*log10(sum(sum(abs(Hc).^2,1),2)));
[val, ind2] = max(Hs);
antenna_index2 = estimates_UE2(est).phy_measurements(11).selected_rx_antennas(:,1);
%h11_eNB1 = double([estimates_UE1(est).channel(z+1:end,1,ind1).real]) + 1j*double([estimates_UE1(est).channel(z+1:end,1,ind1).imag]);
channel_tmp = typecast(estimates_UE1(est).channel(201:end,1,ind1),'int16');
h11_eNB1 = double(channel_tmp(1:2:end,1)) + 1j*double(channel_tmp(2:2:end,1));
%% h11_eNB1 = double(channel_tmp(2:2:end,1)) + 1j*double(channel_tmp(1:2:end,1));
h11_eNB1_srs1 = interp1(1:6:300,h11_eNB1(1:50),1:1:300,'linear','extrap');
h11_eNB1_srs2 = interp1(4:6:300,h11_eNB1(51:100),1:1:300,'linear','extrap');
h11_eNB1_srs3 = interp1(1:6:300,h11_eNB1(101:150),1:1:300,'linear','extrap');
h11_eNB1_srs4 = interp1(4:6:300,h11_eNB1(151:200),1:1:300,'linear','extrap');
h11_eNB1_comp = [h11_eNB1_srs1' h11_eNB1_srs2' h11_eNB1_srs3' h11_eNB1_srs4']';
channel_tmp = typecast(estimates_UE1(est).channel(201:end,2,ind1),'int16');
h12_eNB1 = double(channel_tmp(1:2:end,1)) + 1j*double(channel_tmp(2:2:end,1));
%%h12_eNB1 = double(channel_tmp(2:2:end,1)) + 1j*double(channel_tmp(1:2:end,1));
h12_eNB1_srs1 = interp1(1:6:300,h12_eNB1(1:50),1:1:300,'linear','extrap');
h12_eNB1_srs2 = interp1(4:6:300,h12_eNB1(51:100),1:1:300,'linear','extrap');
h12_eNB1_srs3 = interp1(1:6:300,h12_eNB1(101:150),1:1:300,'linear','extrap');
h12_eNB1_srs4 = interp1(4:6:300,h12_eNB1(151:200),1:1:300,'linear','extrap');
h12_eNB1_comp = [h12_eNB1_srs1' h12_eNB1_srs2' h12_eNB1_srs3' h12_eNB1_srs4']';
channel_tmp = typecast(estimates_UE1(est).channel(201:end,3,ind1),'int16');
h21_eNB1 = double(channel_tmp(1:2:end,1)) + 1j*double(channel_tmp(2:2:end,1));
%%h21_eNB1 = double(channel_tmp(2:2:end,1)) + 1j*double(channel_tmp(1:2:end,1));
h21_eNB1_srs1 = interp1(4:6:300,h21_eNB1(1:50),1:1:300,'linear','extrap');
h21_eNB1_srs2 = interp1(1:6:300,h21_eNB1(51:100),1:1:300,'linear','extrap');
h21_eNB1_srs3 = interp1(4:6:300,h21_eNB1(101:150),1:1:300,'linear','extrap');
h21_eNB1_srs4 = interp1(1:6:300,h21_eNB1(151:200),1:1:300,'linear','extrap');
h21_eNB1_comp = [h21_eNB1_srs1' h21_eNB1_srs2' h21_eNB1_srs3' h21_eNB1_srs4']';
channel_tmp = typecast(estimates_UE1(est).channel(201:end,4,ind1),'int16');
h22_eNB1 = double(channel_tmp(1:2:end,1)) + 1j*double(channel_tmp(2:2:end,1));
%%h22_eNB1 = double(channel_tmp(2:2:end,1)) + 1j*double(channel_tmp(1:2:end,1));
h22_eNB1_srs1 = interp1(4:6:300,h22_eNB1(1:50),1:1:300,'linear','extrap');
h22_eNB1_srs2 = interp1(1:6:300,h22_eNB1(51:100),1:1:300,'linear','extrap');
h22_eNB1_srs3 = interp1(4:6:300,h22_eNB1(101:150),1:1:300,'linear','extrap');
h22_eNB1_srs4 = interp1(1:6:300,h22_eNB1(151:200),1:1:300,'linear','extrap');
h22_eNB1_comp = [h22_eNB1_srs1' h22_eNB1_srs2' h22_eNB1_srs3' h22_eNB1_srs4']';
channel_tmp = typecast(estimates_UE2(est).channel(201:end,1,ind2),'int16');
h11_eNB2 = double(channel_tmp(1:2:end,1)) + 1j*double(channel_tmp(2:2:end,1));
%%h11_eNB2 = double(channel_tmp(2:2:end,1)) + 1j*double(channel_tmp(1:2:end,1));
h11_eNB2_srs1 = interp1(1:6:300,h11_eNB2(1:50),1:1:300,'linear','extrap');
h11_eNB2_srs2 = interp1(4:6:300,h11_eNB2(51:100),1:1:300,'linear','extrap');
h11_eNB2_srs3 = interp1(1:6:300,h11_eNB2(101:150),1:1:300,'linear','extrap');
h11_eNB2_srs4 = interp1(4:6:300,h11_eNB2(151:200),1:1:300,'linear','extrap');
h11_eNB2_comp = [h11_eNB2_srs1' h11_eNB2_srs2' h11_eNB2_srs3' h11_eNB2_srs4']';
channel_tmp = typecast(estimates_UE2(est).channel(201:end,2,ind2),'int16');
h12_eNB2 = double(channel_tmp(1:2:end,1)) + 1j*double(channel_tmp(2:2:end,1));
%% h12_eNB2 = double(channel_tmp(2:2:end,1)) + 1j*double(channel_tmp(1:2:end,1));
h12_eNB2_srs1 = interp1(1:6:300,h12_eNB2(1:50),1:1:300,'linear','extrap');
h12_eNB2_srs2 = interp1(4:6:300,h12_eNB2(51:100),1:1:300,'linear','extrap');
h12_eNB2_srs3 = interp1(1:6:300,h12_eNB2(101:150),1:1:300,'linear','extrap');
h12_eNB2_srs4 = interp1(4:6:300,h12_eNB2(151:200),1:1:300,'linear','extrap');
h12_eNB2_comp = [h12_eNB2_srs1' h12_eNB2_srs2' h12_eNB2_srs3' h12_eNB2_srs4']';
channel_tmp = typecast(estimates_UE2(est).channel(201:end,3,ind2),'int16');
h21_eNB2 = double(channel_tmp(1:2:end,1)) + 1j*double(channel_tmp(2:2:end,1));
%% h21_eNB2 = double(channel_tmp(2:2:end,1)) + 1j*double(channel_tmp(1:2:end,1));
h21_eNB2_srs1 = interp1(4:6:300,h21_eNB2(1:50),1:1:300,'linear','extrap');
h21_eNB2_srs2 = interp1(1:6:300,h21_eNB2(51:100),1:1:300,'linear','extrap');
h21_eNB2_srs3 = interp1(4:6:300,h21_eNB2(101:150),1:1:300,'linear','extrap');
h21_eNB2_srs4 = interp1(1:6:300,h21_eNB2(151:200),1:1:300,'linear','extrap');
h21_eNB2_comp = [h21_eNB2_srs1' h21_eNB2_srs2' h21_eNB2_srs3' h21_eNB2_srs4']';
channel_tmp = typecast(estimates_UE2(est).channel(201:end,4,ind2),'int16');
h22_eNB2 = double(channel_tmp(1:2:end,1)) + 1j*double(channel_tmp(2:2:end,1));
%% h22_eNB2 = double(channel_tmp(2:2:end,1)) + 1j*double(channel_tmp(1:2:end,1));
h22_eNB2_srs1 = interp1(4:6:300,h22_eNB2(1:50),1:1:300,'linear','extrap');
h22_eNB2_srs2 = interp1(1:6:300,h22_eNB2(51:100),1:1:300,'linear','extrap');
h22_eNB2_srs3 = interp1(4:6:300,h22_eNB2(101:150),1:1:300,'linear','extrap');
h22_eNB2_srs4 = interp1(1:6:300,h22_eNB2(151:200),1:1:300,'linear','extrap');
h22_eNB2_comp = [h22_eNB2_srs1' h22_eNB2_srs2' h22_eNB2_srs3' h22_eNB2_srs4']';
% plot(10*log10(abs(h12_eNB2).^2),'go');
% pause
%end
%if 0
q1=zeros(1,7);
q2=zeros(1,7);
pmi_ue1=zeros(1,7);
pmi_ue2=zeros(1,7);
for i = 1:7
if (antenna_index1(i) == 0)
h11 = h11_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1));
h21 = h21_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1));
q1(i) = mean(conj(h11(:)).*h21(:));
pmi_ue1(i) = quantize_q(q1(i));
else
h12 = h12_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1));
h22 = h22_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1));
q1(i) = mean(conj(h12(:)).*h22(:));
pmi_ue1(i) = quantize_q(q1(i));
end
if (antenna_index2(i) == 0)
h11 = h11_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1));
h21 = h21_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1));
q2(i) = mean(conj(h11(:)).*h21(:));
pmi_ue2(i) = quantize_q(q2(i));
else
h12 = h12_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1));
h22 = h22_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1));
q2(i) = mean(conj(h12(:)).*h22(:));
pmi_ue2(i) = quantize_q(q2(i));
end
% q1(i) = double(estimates_UE1(est).phy_measurements(11).subband_pmi_re((antenna_index1(i)+1),i,1))+1j*double(estimates_UE1(est).phy_measurements(11).subband_pmi_im((antenna_index1(i)+1),i,1));
% q2(i) = double(estimates_UE2(est).phy_measurements(11).subband_pmi_re((antenna_index2(i)+1),i,1))+1j*double(estimates_UE2(est).phy_measurements(11).subband_pmi_im((antenna_index2(i)+1),i,1));
end
%q_ext; % calculating the maximizing precoder
%qq1 = q_ue1;
%qq2 = q_ue2;
Rx_ue1 = [];
Rx_ue2 = [];
Ry_ue1 = [];
Ry_ue2 = [];
chcap_mumimo_1 = [];
chcap_mumimo_2 = [];
chcap_mumimo_3 = [];
for i = 1:1:7
SNR_eNB_ue1=zeros(1,((subband_indices(i+1) - subband_indices(i))*4));
SNR_eNB_ue2=zeros(1,((subband_indices(i+1) - subband_indices(i))*4));
Rx_ue1 = [];
Rx_ue2 = [];
Ry_ue1 = [];
Ry_ue2 = [];
if (mumimo_on == 0)
ran(i)=0;
else
qq11(i) = map_q(pmi_ue1(i));
qq22(i) = map_q(pmi_ue2(i));
if ((qq11(i)==0 && qq22(i)==1) || (qq11(i)==1 && qq22(i)==0) || (qq11(i)==2 && qq22(i)==3) || (qq11(i)==3 && qq22(i)==2))
ran(i) = 1;
else
ran(i) = 0;
end
end
if(ran(i)==1) %MU-MIMO
mumimo_count = mumimo_count +1;
%for i =1:1:7
if(antenna_index1(i) == 0)
Rx_ue1 = (abs(h11_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1)) + pmi_ue1(i)*h21_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)./2;
Ry_ue1 = (abs(h11_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1)) - pmi_ue1(i)*h21_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)./2;
else
Rx_ue1 = (abs(h12_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1)) + pmi_ue1(i)*h22_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)./2;
Ry_ue1 = (abs(h12_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1)) - pmi_ue1(i)*h22_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)./2;
end
if(antenna_index2(i) == 0)
Rx_ue2 = (abs(h11_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1)) + pmi_ue2(i)*h21_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)./2;
Ry_ue2 = (abs(h11_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1)) - pmi_ue2(i)*h21_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)./2;
else
Rx_ue2 = (abs(h12_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1)) + pmi_ue2(i)*h22_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)./2;
Ry_ue2 = (abs(h12_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1)) - pmi_ue2(i)*h22_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)./2;
end
% Rx1_ue1 = [Rx1_ue1 Rx_ue1'];
% Rx1_ue2 = [Rx1_ue2 Rx_ue2'];
%
% Ry1_ue1 = [Ry1_ue1 Ry_ue1'];
% Ry1_ue2 = [Ry1_ue2 Ry_ue2'];
%Rx222_ue2 = [Rx222_ue2 Rx22_ue2'];
%end
SNR_eNB_ue1 = 10*log10((Rx_ue1(:)/N0_1Rx));
nan_in_SNR = isnan(SNR_eNB_ue1);
SNR_eNB_ue1(nan_in_SNR) = 0;
SNR_eNB_ue1(SNR_eNB_ue1 < 0) = 0;
SNR_eNB_ue1(SNR_eNB_ue1 > 50) = 50;
SNR_eNB_ue2 = 10*log10((Rx_ue2(:)/N0_2ndRx));
nan_in_SNR = isnan(SNR_eNB_ue2);
SNR_eNB_ue2(nan_in_SNR) = 0;
SNR_eNB_ue2(SNR_eNB_ue2 < 0) = 0;
SNR_eNB_ue2(SNR_eNB_ue2 > 50) = 50;
%******************************************************************
%% Red Zone
I_ue1 = Ry_ue1(:)./Rx_ue1(:);
I_ue2 = Ry_ue2(:)./Rx_ue2(:);
% plot(I_ue1);
% pause
I_ue1 = round(I_ue1*10+1);
I_ue2 = round(I_ue2*10+1);
I_ue1(isnan(I_ue1))=11;
I_ue2(isnan(I_ue2))=11;
I_ue1(I_ue1>11) = 11;
I_ue2(I_ue2>11) = 11;
cap_mumimo_ue1 = [];
cap_mumimo_ue2 = [];
% Read Tables here ... MUMIMO QPSK-QPSK
for c=1:((subband_indices(i+1) - subband_indices(i))*4)
cap_mumimo_ue1(c) = chcap_mode5_4_4_user1_cat(I_ue1(c), round(SNR_eNB_ue1(c))+1);
cap_mumimo_ue2(c) = chcap_mode5_4_4_user2_cat(I_ue2(c), round(SNR_eNB_ue2(c))+1);
end
%interp1(SNR_4_4_cat,chcap_mode5_4_4_user1_cat, SNR_eNB_ue1(1, :, est),'nearest','extrap');
%chcap_mumimo_ue2(1, :, est) = interp1(SNR_4_4_cat,chcap_mode5_4_4_user2_cat, SNR_eNB_ue2(1, :, est),'nearest','extrap');
chcap_mumimo_1 = [chcap_mumimo_1 (cap_mumimo_ue1 + cap_mumimo_ue2)];
chcap_mumimo_2 = [chcap_mumimo_2 cap_mumimo_ue1];
chcap_mumimo_3 = [chcap_mumimo_3 cap_mumimo_ue2];
%******************************************************************
%
% call capacity_Mode5_mumimo_1 with parameters Channels, qq1,qq2, and
% antenna index1 and 2
else
% select the user with the stronger precoded SNR and calculate its
% capacity
beamforming_count = beamforming_count + 1;
if (antenna_index1(i) == 0)
Rx1 = (abs(h11_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1)) + pmi_ue1(i)*h21_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)';
else
Rx1 = (abs(h12_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1)) + pmi_ue1(i)*h22_eNB1_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)';
end
SNR_eNB_ue1 = 10*log10((Rx1(:))/N0_1Rx);
nan_in_SNR = isnan(SNR_eNB_ue1);
SNR_eNB_ue1(nan_in_SNR) = 0;
if ((antenna_index2(i) == 0))
Rx2 = (abs(h11_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1)) + pmi_ue2(i)*h21_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)';
else
Rx2 = (abs(h12_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1)) + pmi_ue2(i)*h22_eNB2_comp(:,(subband_indices(i):subband_indices(i+1)-1))).^2)';
end
SNR_eNB_ue2 = 10*log10((Rx2(:))/N0_2ndRx);
nan_in_SNR = isnan(SNR_eNB_ue2);
SNR_eNB_ue2(nan_in_SNR) = 0;
if(sum(SNR_eNB_ue2) < sum(SNR_eNB_ue1))
tmp = interp1(SNR,c_siso_4Qam,SNR_eNB_ue1','nearest','extrap');
chcap_mumimo_1 = [chcap_mumimo_1 tmp];
chcap_mumimo_2 = [chcap_mumimo_2 interp1(SNR,c_siso_16Qam,SNR_eNB_ue1','nearest','extrap')];
chcap_mumimo_3 = [chcap_mumimo_3 interp1(SNR,c_siso_64Qam,SNR_eNB_ue1','nearest','extrap')];
if(mumimo_on)
chcap_mumimo_2 = [chcap_mumimo_2 tmp];
chcap_mumimo_3 = [chcap_mumimo_3 interp1(SNR,c_siso_4Qam,SNR_eNB_ue2','nearest','extrap')];
end
else
tmp = interp1(SNR,c_siso_4Qam,SNR_eNB_ue2','nearest','extrap');
chcap_mumimo_1 = [chcap_mumimo_1 tmp];
chcap_mumimo_2 = [chcap_mumimo_2 interp1(SNR,c_siso_16Qam,SNR_eNB_ue2','nearest','extrap')];
chcap_mumimo_3 = [chcap_mumimo_3 interp1(SNR,c_siso_64Qam,SNR_eNB_ue2','nearest','extrap')];
if(mumimo_on)
chcap_mumimo_3 = [chcap_mumimo_3 tmp];
chcap_mumimo_2 = [chcap_mumimo_2 interp1(SNR,c_siso_4Qam,SNR_eNB_ue1','nearest','extrap')];
end
end
end
end
chcap_mumimo(1,:,est) = chcap_mumimo_1;
% if (mumimo_on)
chcap_mumimo_ue1(1,:,est) = chcap_mumimo_2;
chcap_mumimo_ue2(1,:,est) = chcap_mumimo_3;
% end
end

Some files were not shown because too many files have changed in this diff Show More