├── LICENSE ├── README.md ├── ViewRF.pro ├── _kiss_fft_guts.h ├── dialog.cpp ├── dialog.h ├── dialog.ui ├── kiss_fft.c ├── kiss_fft.h ├── kiss_fft_bfly2_neon.S ├── kiss_fft_bfly4_neon.S ├── main.cpp ├── sdrcapture.cpp ├── sdrcapture.h ├── spectrumplot.cpp └── spectrumplot.h /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ViewRF 2 | ====== 3 | 4 | RTL-SDR Spectrum Analyzer for BeagleBone Black (BBB) 5 | 6 | http://robotics.ong.id.au/ 7 | -------------------------------------------------------------------------------- /ViewRF.pro: -------------------------------------------------------------------------------- 1 | #------------------------------------------------- 2 | # 3 | # Project created by QtCreator 2013-06-15T14:58:14 4 | # 5 | #------------------------------------------------- 6 | 7 | QT += core gui 8 | 9 | # Comment this out to build on x86 or other !NEON platforms 10 | CONFIG += neon 11 | 12 | include (/opt/qwt-6.1.0/features/qwt.prf) 13 | 14 | greaterThan(QT_MAJOR_VERSION, 4): QT += widgets 15 | 16 | TARGET = ViewRF 17 | target.files = ViewRF 18 | target.path = /home/root 19 | 20 | INSTALLS += target 21 | 22 | TEMPLATE = app 23 | 24 | 25 | 26 | SOURCES += main.cpp\ 27 | dialog.cpp \ 28 | spectrumplot.cpp \ 29 | sdrcapture.cpp \ 30 | kiss_fft.c 31 | 32 | neon:SOURCES += kiss_fft_bfly2_neon.S \ 33 | kiss_fft_bfly4_neon.S 34 | 35 | HEADERS += dialog.h \ 36 | spectrumplot.h \ 37 | sdrcapture.h \ 38 | kiss_fft.h \ 39 | _kiss_fft_guts.h 40 | 41 | FORMS += dialog.ui 42 | 43 | INCLUDEPATH += /opt/rtl-sdr/include 44 | LIBS += -L/opt/rtl-sdr/lib -lrtlsdr -L/opt/libusb-1.0/lib -lusb-1.0 -L/opt/libav/lib -lavdevice -lavfilter -lavformat -lavresample -lavcodec -lswscale -lavutil 45 | 46 | INCLUDEPATH += /opt/libav/include 47 | 48 | OTHER_FILES += 49 | 50 | QMAKE_CXXFLAGS += -Wno-psabi 51 | -------------------------------------------------------------------------------- /_kiss_fft_guts.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (c) 2003-2010, Mark Borgerding 3 | 4 | All rights reserved. 5 | 6 | Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 7 | 8 | * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 9 | * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 10 | * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission. 11 | 12 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 13 | */ 14 | 15 | /* kiss_fft.h 16 | defines kiss_fft_scalar as either short or a float type 17 | and defines 18 | typedef struct { kiss_fft_scalar r; kiss_fft_scalar i; }kiss_fft_cpx; */ 19 | #include "kiss_fft.h" 20 | #include 21 | 22 | #define MAXFACTORS 32 23 | //#define MAXFACTORS 64 24 | 25 | /* e.g. an fft of length 128 has 4 factors 26 | as far as kissfft is concerned 27 | 4*4*4*2 28 | */ 29 | 30 | struct kiss_fft_state{ 31 | int nfft; 32 | int inverse; 33 | int factors[2*MAXFACTORS]; 34 | kiss_fft_cpx twiddles[1]; 35 | }; 36 | 37 | /* 38 | Explanation of macros dealing with complex math: 39 | 40 | C_MUL(m,a,b) : m = a*b 41 | C_FIXDIV( c , div ) : if a fixed point impl., c /= div. noop otherwise 42 | C_SUB( res, a,b) : res = a - b 43 | C_SUBFROM( res , a) : res -= a 44 | C_ADDTO( res , a) : res += a 45 | * */ 46 | #ifdef FIXED_POINT 47 | #if (FIXED_POINT==32) 48 | # define FRACBITS 31 49 | # define SAMPPROD int64_t 50 | #define SAMP_MAX 2147483647 51 | #else 52 | # define FRACBITS 15 53 | # define SAMPPROD int32_t 54 | #define SAMP_MAX 32767 55 | #endif 56 | 57 | #define SAMP_MIN -SAMP_MAX 58 | 59 | #if defined(CHECK_OVERFLOW) 60 | # define CHECK_OVERFLOW_OP(a,op,b) \ 61 | if ( (SAMPPROD)(a) op (SAMPPROD)(b) > SAMP_MAX || (SAMPPROD)(a) op (SAMPPROD)(b) < SAMP_MIN ) { \ 62 | fprintf(stderr,"WARNING:overflow @ " __FILE__ "(%d): (%d " #op" %d) = %ld\n",__LINE__,(a),(b),(SAMPPROD)(a) op (SAMPPROD)(b) ); } 63 | #endif 64 | 65 | 66 | # define smul(a,b) ( (SAMPPROD)(a)*(b) ) 67 | # define sround( x ) (kiss_fft_scalar)( ( (x) + (1<<(FRACBITS-1)) ) >> FRACBITS ) 68 | 69 | # define S_MUL(a,b) sround( smul(a,b) ) 70 | 71 | # define C_MUL(m,a,b) \ 72 | do{ (m).r = sround( smul((a).r,(b).r) - smul((a).i,(b).i) ); \ 73 | (m).i = sround( smul((a).r,(b).i) + smul((a).i,(b).r) ); }while(0) 74 | 75 | # define DIVSCALAR(x,k) \ 76 | (x) = sround( smul( x, SAMP_MAX/k ) ) 77 | 78 | # define C_FIXDIV(c,div) \ 79 | do { DIVSCALAR( (c).r , div); \ 80 | DIVSCALAR( (c).i , div); }while (0) 81 | 82 | # define C_MULBYSCALAR( c, s ) \ 83 | do{ (c).r = sround( smul( (c).r , s ) ) ;\ 84 | (c).i = sround( smul( (c).i , s ) ) ; }while(0) 85 | 86 | #else /* not FIXED_POINT*/ 87 | 88 | # define S_MUL(a,b) ( (a)*(b) ) 89 | #define C_MUL(m,a,b) \ 90 | do{ (m).r = (a).r*(b).r - (a).i*(b).i;\ 91 | (m).i = (a).r*(b).i + (a).i*(b).r; }while(0) 92 | # define C_FIXDIV(c,div) /* NOOP */ 93 | # define C_MULBYSCALAR( c, s ) \ 94 | do{ (c).r *= (s);\ 95 | (c).i *= (s); }while(0) 96 | #endif 97 | 98 | #ifndef CHECK_OVERFLOW_OP 99 | # define CHECK_OVERFLOW_OP(a,op,b) /* noop */ 100 | #endif 101 | 102 | #define C_ADD( res, a,b)\ 103 | do { \ 104 | CHECK_OVERFLOW_OP((a).r,+,(b).r)\ 105 | CHECK_OVERFLOW_OP((a).i,+,(b).i)\ 106 | (res).r=(a).r+(b).r; (res).i=(a).i+(b).i; \ 107 | }while(0) 108 | #define C_SUB( res, a,b)\ 109 | do { \ 110 | CHECK_OVERFLOW_OP((a).r,-,(b).r)\ 111 | CHECK_OVERFLOW_OP((a).i,-,(b).i)\ 112 | (res).r=(a).r-(b).r; (res).i=(a).i-(b).i; \ 113 | }while(0) 114 | #define C_ADDTO( res , a)\ 115 | do { \ 116 | CHECK_OVERFLOW_OP((res).r,+,(a).r)\ 117 | CHECK_OVERFLOW_OP((res).i,+,(a).i)\ 118 | (res).r += (a).r; (res).i += (a).i;\ 119 | }while(0) 120 | 121 | #define C_SUBFROM( res , a)\ 122 | do {\ 123 | CHECK_OVERFLOW_OP((res).r,-,(a).r)\ 124 | CHECK_OVERFLOW_OP((res).i,-,(a).i)\ 125 | (res).r -= (a).r; (res).i -= (a).i; \ 126 | }while(0) 127 | 128 | 129 | #ifdef FIXED_POINT 130 | # define KISS_FFT_COS(phase) floor(.5+SAMP_MAX * cos (phase)) 131 | # define KISS_FFT_SIN(phase) floor(.5+SAMP_MAX * sin (phase)) 132 | # define HALF_OF(x) ((x)>>1) 133 | #elif defined(USE_SIMD) 134 | # define KISS_FFT_COS(phase) _mm_set1_ps( cos(phase) ) 135 | # define KISS_FFT_SIN(phase) _mm_set1_ps( sin(phase) ) 136 | # define HALF_OF(x) ((x)*_mm_set1_ps(.5)) 137 | #else 138 | # define KISS_FFT_COS(phase) (kiss_fft_scalar) cos(phase) 139 | # define KISS_FFT_SIN(phase) (kiss_fft_scalar) sin(phase) 140 | # define HALF_OF(x) ((x)*.5) 141 | #endif 142 | 143 | #define kf_cexp(x,phase) \ 144 | do{ \ 145 | (x)->r = KISS_FFT_COS(phase);\ 146 | (x)->i = KISS_FFT_SIN(phase);\ 147 | }while(0) 148 | 149 | 150 | /* a debugging function */ 151 | #define pcpx(c)\ 152 | fprintf(stderr,"%g + %gi\n",(double)((c)->r),(double)((c)->i) ) 153 | 154 | 155 | #ifdef KISS_FFT_USE_ALLOCA 156 | // define this to allow use of alloca instead of malloc for temporary buffers 157 | // Temporary buffers are used in two case: 158 | // 1. FFT sizes that have "bad" factors. i.e. not 2,3 and 5 159 | // 2. "in-place" FFTs. Notice the quotes, since kissfft does not really do an in-place transform. 160 | #include 161 | #define KISS_FFT_TMP_ALLOC(nbytes) alloca(nbytes) 162 | #define KISS_FFT_TMP_FREE(ptr) 163 | #else 164 | #define KISS_FFT_TMP_ALLOC(nbytes) KISS_FFT_MALLOC(nbytes) 165 | #define KISS_FFT_TMP_FREE(ptr) KISS_FFT_FREE(ptr) 166 | #endif 167 | -------------------------------------------------------------------------------- /dialog.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | ViewRF - RTL-SDR Spectrum Analyzer for the BeagleBone 3 | Copyright (C) 2013 Stephen Ong 4 | 5 | This program is free software: you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation, either version 3 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License 16 | along with this program. If not, see . 17 | 18 | */ 19 | 20 | #include "dialog.h" 21 | #include "ui_dialog.h" 22 | #include "spectrumplot.h" 23 | 24 | #include 25 | #include 26 | #include 27 | #include "sdrcapture.h" 28 | 29 | #include "math.h" 30 | 31 | 32 | #include 33 | 34 | /*************************************************************************** 35 | * Constructor 36 | * Initialize UI elements 37 | * Initialize fft engine 38 | * Connects signals to slots 39 | ***************************************************************************/ 40 | Dialog::Dialog(QWidget *parent) : 41 | QDialog(parent), 42 | ui(new Ui::Dialog) 43 | { 44 | 45 | count = 0; 46 | display_locked_frequency = 0; 47 | 48 | overflow_warning_displayed = false; 49 | save_next = false; 50 | 51 | plot = new SpectrumPlot(this); 52 | plot->setGeometry(10, 10, 780, 330); 53 | 54 | ui->setupUi(this); 55 | ui->tabWidget->setCurrentIndex(0); 56 | ui->label_gainhigh->setVisible(false); 57 | ui->label_targetfrequency->setVisible(false); 58 | 59 | ui->pushButton_Capture->setVisible(false); // hide capture pushbutton 60 | ui->label_counter->setVisible(false); // hide counter text 61 | 62 | #ifdef USE_KISSFFT 63 | mycfg = kiss_fft_alloc(FFT_LENGTH, 0, NULL, NULL); 64 | #endif 65 | 66 | #ifdef USE_AVFFT 67 | fft_context = av_fft_init(FFT_LENGTH_2N,0); 68 | fft_data = (FFTComplex*) av_malloc(FFT_LENGTH * sizeof(FFTComplex)); 69 | #endif 70 | 71 | #ifdef BLACKMANNUTALL_WINDOW 72 | float a0 = 0.3635819; 73 | float a1 = 0.4891775; 74 | float a2 = 0.1365995; 75 | float a3 = 0.0106411; 76 | 77 | for(int i=0; iisE4000()){ 99 | ui->checkBox_offsettuning->setEnabled(true); 100 | ui->checkBox_offsettuning->setVisible(true); 101 | } 102 | else{ 103 | ui->checkBox_offsettuning->setEnabled(false); 104 | ui->checkBox_offsettuning->setVisible(false); 105 | } 106 | num_gains = sdrCapture->get_num_gains(); 107 | ui->horizontalSlider->setMaximum(num_gains-1); 108 | sdrThread = new QThread(); 109 | sdrCapture->moveToThread(sdrThread); 110 | 111 | // Connects slots 112 | sdrCapture->connect(this, SIGNAL(startCapture()), SLOT(threadFunction())); 113 | this->connect(sdrCapture, SIGNAL(packetCaptured()), SLOT(doneCapture())); 114 | sdrCapture->connect(this, SIGNAL(setRtlFrequency(unsigned)), SLOT(set_frequency(unsigned))); 115 | sdrCapture->connect(this, SIGNAL(setRtlGain(unsigned)), SLOT(set_gain(unsigned))); 116 | sdrCapture->connect(this, SIGNAL(setRtlOffsetTuning(bool)), SLOT(set_offset_tuning(bool))); 117 | 118 | sdr_buffer = sdrCapture->getBuffer(); 119 | sdrThread->start(); 120 | set_target_frequency(DEFAULT_CENTER_FREQUENCY); 121 | set_target_gain(1); 122 | emit startCapture(); 123 | if(sdrCapture->isE4000()){ 124 | ui->checkBox_offsettuning->click(); 125 | } 126 | set_target_gain(num_gains/2); 127 | } 128 | 129 | /***************************************************************************** 130 | * Destructor 131 | ****************************************************************************/ 132 | Dialog::~Dialog() 133 | { 134 | delete ui; 135 | } 136 | 137 | /***************************************************************************** 138 | * Function is called after a block of IQ data has been captured. 139 | * Calculates PSD 140 | * retriggers the collection of another block of IQ data 141 | ****************************************************************************/ 142 | void Dialog::doneCapture() 143 | { 144 | count++; //Counter for working out FFT update rate 145 | QString text; 146 | text.sprintf("%d", count); 147 | ui->label_counter->setText(text); 148 | 149 | uint8_t re,im; 150 | float ref, imf; 151 | float ptr, pti; 152 | bool overflow = false; 153 | 154 | int i,j; 155 | for (i = 0; i < FFT_LENGTH; i++) { 156 | data_result[i] = 0; //Initialize PSD output 157 | re = sdr_buffer[2*i]; //Check for overflow 158 | im = sdr_buffer[2*i+1]; 159 | if(re<5 || re>250 || im<5 || im>250) overflow = true; 160 | } 161 | 162 | //calc block DC average 163 | ptr = pti = 0; 164 | for (i=0; ilabel_gainhigh->setVisible(true); 220 | } 221 | else{ 222 | ui->label_gainhigh->setVisible(false); 223 | } 224 | overflow_warning_displayed = overflow; 225 | } 226 | 227 | //Update graph display range and title if frequency changes 228 | QString title; 229 | if(sdrCapture->is_locked){ 230 | if(display_locked_frequency!= sdrCapture->locked_frequency){ 231 | double freq_MHz = sdrCapture->locked_frequency/1000000.0; 232 | title.sprintf("Center %4.1f MHz", freq_MHz); 233 | plot->setTitle(title); 234 | plot->SetXRange(freq_MHz-1.2, freq_MHz+1.2); 235 | display_locked_frequency = sdrCapture->locked_frequency; 236 | } 237 | } 238 | else{ 239 | title.sprintf("Frequency Not Locked [%4.1f MHz]", target_frequency/1000000.); 240 | plot->setTitle(title); 241 | } 242 | 243 | plot->SetData(data_result); 244 | 245 | //Save IQ and FFT block if requested 246 | if(save_next){ 247 | FILE* fp = fopen("sample_dump.txt", "w"); 248 | for(int i=0; ipushButton_Inc01->isDown()) update_target_frequency(100000); 272 | if(ui->pushButton_Dec01->isDown()) update_target_frequency(-100000); 273 | 274 | emit startCapture(); 275 | } 276 | 277 | 278 | /***************************************************************************** 279 | * Set target frequency 280 | ****************************************************************************/ 281 | void Dialog::set_target_frequency(u_int32_t frequency) 282 | { 283 | target_frequency = frequency; 284 | QString text; 285 | text.sprintf("Target: %4.1f MHz", target_frequency/1000000.); 286 | ui->label_targetfrequency->setText(text); 287 | emit setRtlFrequency(frequency); 288 | } 289 | 290 | /***************************************************************************** 291 | * Change target frequency by the amount delta 292 | ****************************************************************************/ 293 | void Dialog::update_target_frequency(int32_t delta) 294 | { 295 | u_int32_t new_frequency = target_frequency + delta; 296 | if((20000000unum_gains-1) target_gain = num_gains-1; 308 | ui->horizontalSlider->setValue(target_gain); 309 | emit setRtlGain(target_gain); 310 | } 311 | 312 | 313 | /***************************************************************************** 314 | * Event handlers for changing frequency. 315 | ****************************************************************************/ 316 | void Dialog::on_pushButton_Inc100_clicked() 317 | { 318 | update_target_frequency(100000000); 319 | } 320 | 321 | void Dialog::on_pushButton_Dec100_clicked() 322 | { 323 | update_target_frequency(-100000000); 324 | } 325 | 326 | void Dialog::on_pushButton_Inc10_clicked() 327 | { 328 | update_target_frequency(10000000); 329 | } 330 | 331 | void Dialog::on_pushButton_Dec10_clicked() 332 | { 333 | update_target_frequency(-10000000); 334 | } 335 | 336 | void Dialog::on_pushButton_Inc1_clicked() 337 | { 338 | update_target_frequency(1000000); 339 | } 340 | 341 | void Dialog::on_pushButton_Dec1_clicked() 342 | { 343 | update_target_frequency(-1000000); 344 | } 345 | 346 | void Dialog::on_pushButton_Inc01_clicked() 347 | { 348 | update_target_frequency(100000); 349 | } 350 | 351 | void Dialog::on_pushButton_Dec01_clicked() 352 | { 353 | update_target_frequency(-100000); 354 | } 355 | 356 | /***************************************************************************** 357 | * Event handlers for increasing or decreasing gain 358 | ****************************************************************************/ 359 | void Dialog::on_pushButton_GainInc_2_clicked() 360 | { 361 | set_target_gain(target_gain+1); 362 | } 363 | 364 | void Dialog::on_pushButton_GainDec_clicked() 365 | { 366 | if(target_gain>0) set_target_gain(target_gain-1); 367 | } 368 | 369 | /***************************************************************************** 370 | * Event handler for enable/disable offset tuning for the E4000 tuner 371 | ****************************************************************************/ 372 | void Dialog::on_checkBox_offsettuning_clicked(bool checked) 373 | { 374 | emit setRtlOffsetTuning(checked); 375 | } 376 | 377 | /***************************************************************************** 378 | * Event handler for capture button, triggers the saving of next IQ block to 379 | * file. 380 | ****************************************************************************/ 381 | void Dialog::on_pushButton_Capture_clicked() 382 | { 383 | save_next = true; 384 | } 385 | 386 | /***************************************************************************** 387 | * Exit 388 | ****************************************************************************/ 389 | void Dialog::on_pushButton_Exit_clicked() 390 | { 391 | this->close(); 392 | } 393 | 394 | // End of dialog.cpp 395 | -------------------------------------------------------------------------------- /dialog.h: -------------------------------------------------------------------------------- 1 | /* 2 | ViewRF - RTL-SDR Spectrum Analyzer for the BeagleBone 3 | Copyright (C) 2013 Stephen Ong 4 | 5 | This program is free software: you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation, either version 3 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License 16 | along with this program. If not, see . 17 | 18 | */ 19 | 20 | #ifndef DIALOG_H 21 | #define DIALOG_H 22 | 23 | #include 24 | #include "spectrumplot.h" 25 | #include "sdrcapture.h" 26 | 27 | 28 | 29 | #ifdef USE_KISSFFT 30 | #include "kiss_fft.h" 31 | #endif 32 | 33 | #ifdef USE_AVFFT 34 | extern "C" { 35 | #include "libavcodec/avfft.h" 36 | #include "libavutil/mem.h" 37 | } 38 | #endif 39 | 40 | namespace Ui { 41 | class Dialog; 42 | } 43 | 44 | class Dialog : public QDialog 45 | { 46 | Q_OBJECT 47 | 48 | public: 49 | explicit Dialog(QWidget *parent = 0); 50 | ~Dialog(); 51 | 52 | private slots: 53 | 54 | void doneCapture(); 55 | void on_pushButton_Inc100_clicked(); 56 | void on_pushButton_Dec100_clicked(); 57 | void on_pushButton_Inc10_clicked(); 58 | void on_pushButton_Dec10_clicked(); 59 | void on_pushButton_Inc1_clicked(); 60 | void on_pushButton_Dec1_clicked(); 61 | void on_pushButton_Inc01_clicked(); 62 | void on_pushButton_Dec01_clicked(); 63 | void on_pushButton_GainInc_2_clicked(); 64 | void on_pushButton_GainDec_clicked(); 65 | void on_checkBox_offsettuning_clicked(bool checked); 66 | void on_pushButton_Capture_clicked(); 67 | void on_pushButton_Exit_clicked(); 68 | 69 | private: 70 | Ui::Dialog *ui; 71 | 72 | QTimer *timer; 73 | 74 | SDRCapture *sdrCapture; 75 | QThread *sdrThread; 76 | SpectrumPlot *plot; 77 | uint8_t* sdr_buffer; 78 | int count; 79 | 80 | float window[FFT_LENGTH]; 81 | 82 | double data_result[RESULT_LENGTH]; 83 | 84 | int data_counter; 85 | u_int32_t target_frequency; 86 | unsigned target_gain; 87 | 88 | void set_target_frequency(u_int32_t frequency); 89 | void update_target_frequency(int32_t delta); 90 | 91 | void set_target_gain(unsigned gain_index); 92 | u_int32_t display_locked_frequency; 93 | bool display_is_locked; 94 | 95 | bool overflow_warning_displayed; 96 | 97 | bool save_next; 98 | 99 | float dc_i_average; 100 | float dc_q_average; 101 | 102 | float gain_correction; 103 | float phase_correction; 104 | 105 | unsigned num_gains; 106 | #ifdef USE_KISSFFT 107 | kiss_fft_cfg mycfg; 108 | kiss_fft_cpx fin[FFT_LENGTH]; 109 | kiss_fft_cpx fout[FFT_LENGTH]; 110 | #endif 111 | 112 | #ifdef USE_AVFFT 113 | FFTContext* fft_context; 114 | FFTComplex* fft_data; 115 | #endif 116 | 117 | signals: 118 | void startCapture(); 119 | void setRtlFrequency(unsigned freq); 120 | void setRtlGain(unsigned gain_index); 121 | void setRtlOffsetTuning(bool on); 122 | 123 | }; 124 | 125 | #endif // DIALOG_H 126 | -------------------------------------------------------------------------------- /dialog.ui: -------------------------------------------------------------------------------- 1 | 2 | 3 | Dialog 4 | 5 | 6 | 7 | 0 8 | 0 9 | 800 10 | 480 11 | 12 | 13 | 14 | Dialog 15 | 16 | 17 | 18 | 19 | 10 20 | 330 21 | 561 22 | 141 23 | 24 | 25 | 26 | 27 | 14 28 | 29 | 30 | 31 | Qt::NoFocus 32 | 33 | 34 | QTabWidget::North 35 | 36 | 37 | QTabWidget::Rounded 38 | 39 | 40 | 2 41 | 42 | 43 | 44 | Frequency 45 | 46 | 47 | 48 | 49 | 10 50 | 15 51 | 86 52 | 40 53 | 54 | 55 | 56 | 57 | 14 58 | 59 | 60 | 61 | Qt::NoFocus 62 | 63 | 64 | + 100 MHz 65 | 66 | 67 | true 68 | 69 | 70 | 500 71 | 72 | 73 | 300 74 | 75 | 76 | 77 | 78 | 79 | 10 80 | 65 81 | 86 82 | 40 83 | 84 | 85 | 86 | 87 | 14 88 | 89 | 90 | 91 | Qt::NoFocus 92 | 93 | 94 | - 100 MHz 95 | 96 | 97 | true 98 | 99 | 100 | 500 101 | 102 | 103 | 300 104 | 105 | 106 | 107 | 108 | 109 | 105 110 | 15 111 | 86 112 | 40 113 | 114 | 115 | 116 | 117 | 14 118 | 119 | 120 | 121 | Qt::NoFocus 122 | 123 | 124 | + 10 MHz 125 | 126 | 127 | true 128 | 129 | 130 | 400 131 | 132 | 133 | 200 134 | 135 | 136 | 137 | 138 | 139 | 105 140 | 65 141 | 86 142 | 40 143 | 144 | 145 | 146 | 147 | 14 148 | 149 | 150 | 151 | Qt::NoFocus 152 | 153 | 154 | - 10 MHz 155 | 156 | 157 | true 158 | 159 | 160 | 400 161 | 162 | 163 | 200 164 | 165 | 166 | 167 | 168 | 169 | 200 170 | 15 171 | 86 172 | 40 173 | 174 | 175 | 176 | 177 | 14 178 | 179 | 180 | 181 | Qt::NoFocus 182 | 183 | 184 | + 1 MHz 185 | 186 | 187 | true 188 | 189 | 190 | 191 | 192 | 193 | 200 194 | 65 195 | 86 196 | 40 197 | 198 | 199 | 200 | 201 | 14 202 | 203 | 204 | 205 | Qt::NoFocus 206 | 207 | 208 | - 1 MHz 209 | 210 | 211 | true 212 | 213 | 214 | 215 | 216 | 217 | 295 218 | 15 219 | 86 220 | 40 221 | 222 | 223 | 224 | 225 | 14 226 | 227 | 228 | 229 | Qt::NoFocus 230 | 231 | 232 | + 0.1 MHz 233 | 234 | 235 | 236 | 237 | 238 | 295 239 | 65 240 | 86 241 | 40 242 | 243 | 244 | 245 | 246 | 14 247 | 248 | 249 | 250 | Qt::NoFocus 251 | 252 | 253 | - 0.1 MHz 254 | 255 | 256 | 257 | 258 | 259 | 510 260 | 25 261 | 241 262 | 16 263 | 264 | 265 | 266 | Target: xy.z MHz 267 | 268 | 269 | 270 | 271 | 272 | 400 273 | 75 274 | 151 275 | 21 276 | 277 | 278 | 279 | Offset tuning 280 | 281 | 282 | 283 | 284 | 285 | Gain 286 | 287 | 288 | 289 | 290 | 205 291 | 40 292 | 60 293 | 40 294 | 295 | 296 | 297 | 298 | 14 299 | 300 | 301 | 302 | Qt::NoFocus 303 | 304 | 305 | + 306 | 307 | 308 | 309 | 310 | 311 | 10 312 | 40 313 | 60 314 | 40 315 | 316 | 317 | 318 | 319 | 14 320 | 321 | 322 | 323 | Qt::NoFocus 324 | 325 | 326 | - 327 | 328 | 329 | 330 | 331 | false 332 | 333 | 334 | 335 | 80 336 | 40 337 | 111 338 | 30 339 | 340 | 341 | 342 | Qt::NoFocus 343 | 344 | 345 | 17 346 | 347 | 348 | 3 349 | 350 | 351 | Qt::Horizontal 352 | 353 | 354 | false 355 | 356 | 357 | false 358 | 359 | 360 | QSlider::TicksBelow 361 | 362 | 363 | 2 364 | 365 | 366 | 367 | 368 | 369 | 370 | 14 371 | 372 | 373 | 374 | About 375 | 376 | 377 | 378 | 379 | 5 380 | 5 381 | 546 382 | 101 383 | 384 | 385 | 386 | 387 | 10 388 | 389 | 390 | 391 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0//EN" "http://www.w3.org/TR/REC-html40/strict.dtd"> 392 | <html><head><meta name="qrichtext" content="1" /><style type="text/css"> 393 | p, li { white-space: pre-wrap; } 394 | </style></head><body style=" font-family:'Sans Serif'; font-size:10pt; font-weight:400; font-style:normal;"> 395 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt; font-weight:600;">ViewRF - RTL-SDR Spectrum Analyzer for BBB</span></p> 396 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">Copyright (C) 2013 Stephen Ong &lt;http://robotics.ong.id.au&gt;</span></p> 397 | <p style="-qt-paragraph-type:empty; margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px; font-size:14pt;"><br /></p> 398 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">This program is free software: you can redistribute it and/or modify</span></p> 399 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">it under the terms of the GNU General Public License as published by</span></p> 400 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">the Free Software Foundation, either version 3 of the License, or</span></p> 401 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">(at your option) any later version.</span></p> 402 | <p style="-qt-paragraph-type:empty; margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px; font-size:14pt;"><br /></p> 403 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">This program is distributed in the hope that it will be useful,</span></p> 404 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">but WITHOUT ANY WARRANTY; without even the implied warranty of</span></p> 405 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></p> 406 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">GNU General Public License for more details.</span></p> 407 | <p style="-qt-paragraph-type:empty; margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px; font-size:14pt;"><br /></p> 408 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">You should have received a copy of the GNU General Public License</span></p> 409 | <p style=" margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><span style=" font-size:14pt;">along with this program. If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></p></body></html> 410 | 411 | 412 | 413 | 414 | 415 | 416 | 417 | 660 418 | 425 419 | 120 420 | 40 421 | 422 | 423 | 424 | 425 | 14 426 | 427 | 428 | 429 | Exit 430 | 431 | 432 | 433 | 434 | 435 | 10 436 | 0 437 | 96 438 | 31 439 | 440 | 441 | 442 | 443 | 14 444 | 75 445 | true 446 | 447 | 448 | 449 | ViewRF 450 | 451 | 452 | 453 | 454 | 455 | 705 456 | 10 457 | 91 458 | 16 459 | 460 | 461 | 462 | Reduce gain!! 463 | 464 | 465 | 466 | 467 | 468 | 720 469 | 350 470 | 58 471 | 15 472 | 473 | 474 | 475 | TextLabel 476 | 477 | 478 | 479 | 480 | true 481 | 482 | 483 | 484 | 660 485 | 375 486 | 120 487 | 40 488 | 489 | 490 | 491 | 492 | 14 493 | 494 | 495 | 496 | Capture 497 | 498 | 499 | 500 | 501 | 502 | 503 | 504 | 505 | 5 506 | 507 | 508 | 5 509 | 510 | 511 | true 512 | 513 | 514 | true 515 | 516 | 517 | false 518 | 519 | 520 | 521 | -------------------------------------------------------------------------------- /kiss_fft.c: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (c) 2003-2010, Mark Borgerding 3 | 4 | All rights reserved. 5 | 6 | Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 7 | 8 | * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 9 | * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 10 | * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission. 11 | 12 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 13 | */ 14 | 15 | 16 | #include "_kiss_fft_guts.h" 17 | /* The guts header contains all the multiplication and addition macros that are defined for 18 | fixed or floating point complex numbers. It also delares the kf_ internal functions. 19 | */ 20 | #ifdef __arm__ 21 | void kf_bfly2(kiss_fft_cpx * Fout, 22 | const size_t fstride, 23 | const kiss_fft_cfg st, 24 | int m); 25 | 26 | void kf_bfly4(kiss_fft_cpx * Fout, 27 | const size_t fstride, 28 | const kiss_fft_cfg st, 29 | const size_t m); 30 | #else 31 | static void kf_bfly2( 32 | kiss_fft_cpx * Fout, 33 | const size_t fstride, 34 | const kiss_fft_cfg st, 35 | int m 36 | ) 37 | { 38 | kiss_fft_cpx * Fout2; 39 | kiss_fft_cpx * tw1 = st->twiddles; 40 | kiss_fft_cpx t; 41 | Fout2 = Fout + m; 42 | do{ 43 | C_FIXDIV(*Fout,2); C_FIXDIV(*Fout2,2); 44 | 45 | C_MUL (t, *Fout2 , *tw1); 46 | tw1 += fstride; 47 | C_SUB( *Fout2 , *Fout , t ); 48 | C_ADDTO( *Fout , t ); 49 | ++Fout2; 50 | ++Fout; 51 | }while (--m); 52 | } 53 | 54 | static void kf_bfly4( 55 | kiss_fft_cpx * Fout, 56 | const size_t fstride, 57 | const kiss_fft_cfg st, 58 | const size_t m 59 | ) 60 | { 61 | kiss_fft_cpx *tw1,*tw2,*tw3; 62 | kiss_fft_cpx scratch[6]; 63 | size_t k=m; 64 | const size_t m2=2*m; 65 | const size_t m3=3*m; 66 | 67 | 68 | tw3 = tw2 = tw1 = st->twiddles; 69 | 70 | do { 71 | C_FIXDIV(*Fout,4); C_FIXDIV(Fout[m],4); C_FIXDIV(Fout[m2],4); C_FIXDIV(Fout[m3],4); 72 | 73 | C_MUL(scratch[0],Fout[m] , *tw1 ); 74 | C_MUL(scratch[1],Fout[m2] , *tw2 ); 75 | C_MUL(scratch[2],Fout[m3] , *tw3 ); 76 | 77 | C_SUB( scratch[5] , *Fout, scratch[1] ); 78 | C_ADDTO(*Fout, scratch[1]); 79 | C_ADD( scratch[3] , scratch[0] , scratch[2] ); 80 | C_SUB( scratch[4] , scratch[0] , scratch[2] ); 81 | C_SUB( Fout[m2], *Fout, scratch[3] ); 82 | tw1 += fstride; 83 | tw2 += fstride*2; 84 | tw3 += fstride*3; 85 | C_ADDTO( *Fout , scratch[3] ); 86 | 87 | if(st->inverse) { 88 | Fout[m].r = scratch[5].r - scratch[4].i; 89 | Fout[m].i = scratch[5].i + scratch[4].r; 90 | Fout[m3].r = scratch[5].r + scratch[4].i; 91 | Fout[m3].i = scratch[5].i - scratch[4].r; 92 | }else{ 93 | Fout[m].r = scratch[5].r + scratch[4].i; 94 | Fout[m].i = scratch[5].i - scratch[4].r; 95 | Fout[m3].r = scratch[5].r - scratch[4].i; 96 | Fout[m3].i = scratch[5].i + scratch[4].r; 97 | } 98 | ++Fout; 99 | }while(--k); 100 | } 101 | #endif 102 | 103 | static void kf_bfly3( 104 | kiss_fft_cpx * Fout, 105 | const size_t fstride, 106 | const kiss_fft_cfg st, 107 | size_t m 108 | ) 109 | { 110 | size_t k=m; 111 | const size_t m2 = 2*m; 112 | kiss_fft_cpx *tw1,*tw2; 113 | kiss_fft_cpx scratch[5]; 114 | kiss_fft_cpx epi3; 115 | epi3 = st->twiddles[fstride*m]; 116 | 117 | tw1=tw2=st->twiddles; 118 | 119 | do{ 120 | C_FIXDIV(*Fout,3); C_FIXDIV(Fout[m],3); C_FIXDIV(Fout[m2],3); 121 | 122 | C_MUL(scratch[1],Fout[m] , *tw1); 123 | C_MUL(scratch[2],Fout[m2] , *tw2); 124 | 125 | C_ADD(scratch[3],scratch[1],scratch[2]); 126 | C_SUB(scratch[0],scratch[1],scratch[2]); 127 | tw1 += fstride; 128 | tw2 += fstride*2; 129 | 130 | Fout[m].r = Fout->r - HALF_OF(scratch[3].r); 131 | Fout[m].i = Fout->i - HALF_OF(scratch[3].i); 132 | 133 | C_MULBYSCALAR( scratch[0] , epi3.i ); 134 | 135 | C_ADDTO(*Fout,scratch[3]); 136 | 137 | Fout[m2].r = Fout[m].r + scratch[0].i; 138 | Fout[m2].i = Fout[m].i - scratch[0].r; 139 | 140 | Fout[m].r -= scratch[0].i; 141 | Fout[m].i += scratch[0].r; 142 | 143 | ++Fout; 144 | }while(--k); 145 | } 146 | 147 | static void kf_bfly5( 148 | kiss_fft_cpx * Fout, 149 | const size_t fstride, 150 | const kiss_fft_cfg st, 151 | int m 152 | ) 153 | { 154 | kiss_fft_cpx *Fout0,*Fout1,*Fout2,*Fout3,*Fout4; 155 | int u; 156 | kiss_fft_cpx scratch[13]; 157 | kiss_fft_cpx * twiddles = st->twiddles; 158 | kiss_fft_cpx *tw; 159 | kiss_fft_cpx ya,yb; 160 | ya = twiddles[fstride*m]; 161 | yb = twiddles[fstride*2*m]; 162 | 163 | Fout0=Fout; 164 | Fout1=Fout0+m; 165 | Fout2=Fout0+2*m; 166 | Fout3=Fout0+3*m; 167 | Fout4=Fout0+4*m; 168 | 169 | tw=st->twiddles; 170 | for ( u=0; ur += scratch[7].r + scratch[8].r; 185 | Fout0->i += scratch[7].i + scratch[8].i; 186 | 187 | scratch[5].r = scratch[0].r + S_MUL(scratch[7].r,ya.r) + S_MUL(scratch[8].r,yb.r); 188 | scratch[5].i = scratch[0].i + S_MUL(scratch[7].i,ya.r) + S_MUL(scratch[8].i,yb.r); 189 | 190 | scratch[6].r = S_MUL(scratch[10].i,ya.i) + S_MUL(scratch[9].i,yb.i); 191 | scratch[6].i = -S_MUL(scratch[10].r,ya.i) - S_MUL(scratch[9].r,yb.i); 192 | 193 | C_SUB(*Fout1,scratch[5],scratch[6]); 194 | C_ADD(*Fout4,scratch[5],scratch[6]); 195 | 196 | scratch[11].r = scratch[0].r + S_MUL(scratch[7].r,yb.r) + S_MUL(scratch[8].r,ya.r); 197 | scratch[11].i = scratch[0].i + S_MUL(scratch[7].i,yb.r) + S_MUL(scratch[8].i,ya.r); 198 | scratch[12].r = - S_MUL(scratch[10].i,yb.i) + S_MUL(scratch[9].i,ya.i); 199 | scratch[12].i = S_MUL(scratch[10].r,yb.i) - S_MUL(scratch[9].r,ya.i); 200 | 201 | C_ADD(*Fout2,scratch[11],scratch[12]); 202 | C_SUB(*Fout3,scratch[11],scratch[12]); 203 | 204 | ++Fout0;++Fout1;++Fout2;++Fout3;++Fout4; 205 | } 206 | } 207 | 208 | /* perform the butterfly for one stage of a mixed radix FFT */ 209 | static void kf_bfly_generic( 210 | kiss_fft_cpx * Fout, 211 | const size_t fstride, 212 | const kiss_fft_cfg st, 213 | int m, 214 | int p 215 | ) 216 | { 217 | int u,k,q1,q; 218 | kiss_fft_cpx * twiddles = st->twiddles; 219 | kiss_fft_cpx t; 220 | int Norig = st->nfft; 221 | 222 | kiss_fft_cpx * scratch = (kiss_fft_cpx*)KISS_FFT_TMP_ALLOC(sizeof(kiss_fft_cpx)*p); 223 | 224 | for ( u=0; u=Norig) twidx-=Norig; 239 | C_MUL(t,scratch[q] , twiddles[twidx] ); 240 | C_ADDTO( Fout[ k ] ,t); 241 | } 242 | k += m; 243 | } 244 | } 245 | KISS_FFT_TMP_FREE(scratch); 246 | } 247 | 248 | static 249 | void kf_work( 250 | kiss_fft_cpx * Fout, 251 | const kiss_fft_cpx * f, 252 | const size_t fstride, 253 | int in_stride, 254 | int * factors, 255 | const kiss_fft_cfg st 256 | ) 257 | { 258 | kiss_fft_cpx * Fout_beg=Fout; 259 | const int p=*factors++; /* the radix */ 260 | const int m=*factors++; /* stage's fft length/p */ 261 | const kiss_fft_cpx * Fout_end = Fout + p*m; 262 | 263 | #ifdef _OPENMP 264 | // use openmp extensions at the 265 | // top-level (not recursive) 266 | if (fstride==1 && p<=5) 267 | { 268 | int k; 269 | 270 | // execute the p different work units in different threads 271 | # pragma omp parallel for 272 | for (k=0;k floor_sqrt) 335 | p = n; /* no more factors, skip to end */ 336 | } 337 | n /= p; 338 | *facbuf++ = p; 339 | *facbuf++ = n; 340 | } while (n > 1); 341 | } 342 | 343 | /* 344 | * 345 | * User-callable function to allocate all necessary storage space for the fft. 346 | * 347 | * The return value is a contiguous block of memory, allocated with malloc. As such, 348 | * It can be freed with free(), rather than a kiss_fft-specific function. 349 | * */ 350 | kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem ) 351 | { 352 | kiss_fft_cfg st=NULL; 353 | size_t memneeded = sizeof(struct kiss_fft_state) 354 | + sizeof(kiss_fft_cpx)*(nfft-1); /* twiddle factors*/ 355 | 356 | if ( lenmem==NULL ) { 357 | st = ( kiss_fft_cfg)KISS_FFT_MALLOC( memneeded ); 358 | }else{ 359 | if (mem != NULL && *lenmem >= memneeded) 360 | st = (kiss_fft_cfg)mem; 361 | *lenmem = memneeded; 362 | } 363 | if (st) { 364 | int i; 365 | st->nfft=nfft; 366 | st->inverse = inverse_fft; 367 | 368 | for (i=0;iinverse) 372 | phase *= -1; 373 | kf_cexp(st->twiddles+i, phase ); 374 | } 375 | 376 | kf_factor(nfft,st->factors); 377 | } 378 | return st; 379 | } 380 | 381 | 382 | void kiss_fft_stride(kiss_fft_cfg st,const kiss_fft_cpx *fin,kiss_fft_cpx *fout,int in_stride) 383 | { 384 | if (fin == fout) { 385 | //NOTE: this is not really an in-place FFT algorithm. 386 | //It just performs an out-of-place FFT into a temp buffer 387 | kiss_fft_cpx * tmpbuf = (kiss_fft_cpx*)KISS_FFT_TMP_ALLOC( sizeof(kiss_fft_cpx)*st->nfft); 388 | kf_work(tmpbuf,fin,1,in_stride, st->factors,st); 389 | memcpy(fout,tmpbuf,sizeof(kiss_fft_cpx)*st->nfft); 390 | KISS_FFT_TMP_FREE(tmpbuf); 391 | }else{ 392 | kf_work( fout, fin, 1,in_stride, st->factors,st ); 393 | } 394 | } 395 | 396 | void kiss_fft(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout) 397 | { 398 | kiss_fft_stride(cfg,fin,fout,1); 399 | } 400 | 401 | 402 | void kiss_fft_cleanup(void) 403 | { 404 | // nothing needed any more 405 | } 406 | 407 | int kiss_fft_next_fast_size(int n) 408 | { 409 | while(1) { 410 | int m=n; 411 | while ( (m%2) == 0 ) m/=2; 412 | while ( (m%3) == 0 ) m/=3; 413 | while ( (m%5) == 0 ) m/=5; 414 | if (m<=1) 415 | break; /* n is completely factorable by twos, threes, and fives */ 416 | n++; 417 | } 418 | return n; 419 | } 420 | -------------------------------------------------------------------------------- /kiss_fft.h: -------------------------------------------------------------------------------- 1 | #ifndef KISS_FFT_H 2 | #define KISS_FFT_H 3 | 4 | #include 5 | #include 6 | #include 7 | #include 8 | 9 | #ifdef __cplusplus 10 | extern "C" { 11 | #endif 12 | 13 | /* 14 | ATTENTION! 15 | If you would like a : 16 | -- a utility that will handle the caching of fft objects 17 | -- real-only (no imaginary time component ) FFT 18 | -- a multi-dimensional FFT 19 | -- a command-line utility to perform ffts 20 | -- a command-line utility to perform fast-convolution filtering 21 | 22 | Then see kfc.h kiss_fftr.h kiss_fftnd.h fftutil.c kiss_fastfir.c 23 | in the tools/ directory. 24 | */ 25 | 26 | #ifdef USE_SIMD 27 | # include 28 | # define kiss_fft_scalar __m128 29 | #define KISS_FFT_MALLOC(nbytes) _mm_malloc(nbytes,16) 30 | #define KISS_FFT_FREE _mm_free 31 | #else 32 | #define KISS_FFT_MALLOC malloc 33 | #define KISS_FFT_FREE free 34 | #endif 35 | 36 | 37 | #ifdef FIXED_POINT 38 | #include 39 | # if (FIXED_POINT == 32) 40 | # define kiss_fft_scalar int32_t 41 | # else 42 | # define kiss_fft_scalar int16_t 43 | # endif 44 | #else 45 | # ifndef kiss_fft_scalar 46 | /* default is float */ 47 | # define kiss_fft_scalar float 48 | # endif 49 | #endif 50 | 51 | typedef struct { 52 | kiss_fft_scalar r; 53 | kiss_fft_scalar i; 54 | }kiss_fft_cpx; 55 | 56 | typedef struct kiss_fft_state* kiss_fft_cfg; 57 | 58 | /* 59 | * kiss_fft_alloc 60 | * 61 | * Initialize a FFT (or IFFT) algorithm's cfg/state buffer. 62 | * 63 | * typical usage: kiss_fft_cfg mycfg=kiss_fft_alloc(1024,0,NULL,NULL); 64 | * 65 | * The return value from fft_alloc is a cfg buffer used internally 66 | * by the fft routine or NULL. 67 | * 68 | * If lenmem is NULL, then kiss_fft_alloc will allocate a cfg buffer using malloc. 69 | * The returned value should be free()d when done to avoid memory leaks. 70 | * 71 | * The state can be placed in a user supplied buffer 'mem': 72 | * If lenmem is not NULL and mem is not NULL and *lenmem is large enough, 73 | * then the function places the cfg in mem and the size used in *lenmem 74 | * and returns mem. 75 | * 76 | * If lenmem is not NULL and ( mem is NULL or *lenmem is not large enough), 77 | * then the function returns NULL and places the minimum cfg 78 | * buffer size in *lenmem. 79 | * */ 80 | 81 | kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem); 82 | 83 | /* 84 | * kiss_fft(cfg,in_out_buf) 85 | * 86 | * Perform an FFT on a complex input buffer. 87 | * for a forward FFT, 88 | * fin should be f[0] , f[1] , ... ,f[nfft-1] 89 | * fout will be F[0] , F[1] , ... ,F[nfft-1] 90 | * Note that each element is complex and can be accessed like 91 | f[k].r and f[k].i 92 | * */ 93 | void kiss_fft(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout); 94 | 95 | /* 96 | A more generic version of the above function. It reads its input from every Nth sample. 97 | * */ 98 | void kiss_fft_stride(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout,int fin_stride); 99 | 100 | /* If kiss_fft_alloc allocated a buffer, it is one contiguous 101 | buffer and can be simply free()d when no longer needed*/ 102 | #define kiss_fft_free free 103 | 104 | /* 105 | Cleans up some memory that gets managed internally. Not necessary to call, but it might clean up 106 | your compiler output to call this before you exit. 107 | */ 108 | void kiss_fft_cleanup(void); 109 | 110 | 111 | /* 112 | * Returns the smallest integer k, such that k>=n and k has only "fast" factors (2,3,5) 113 | */ 114 | int kiss_fft_next_fast_size(int n); 115 | 116 | /* for real ffts, we need an even size */ 117 | #define kiss_fftr_next_fast_size_real(n) \ 118 | (kiss_fft_next_fast_size( ((n)+1)>>1)<<1) 119 | 120 | #ifdef __cplusplus 121 | } 122 | #endif 123 | 124 | #endif 125 | -------------------------------------------------------------------------------- /kiss_fft_bfly2_neon.S: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (C) 2012, Code Aurora Forum. All rights reserved. 3 | * 4 | * Redistribution and use in source and binary forms, with or without 5 | * modification, are permitted provided that the following conditions are 6 | * met: 7 | * * Redistributions of source code must retain the above copyright 8 | * notice, this list of conditions and the following disclaimer. 9 | * * Redistributions in binary form must reproduce the above 10 | * copyright notice, this list of conditions and the following 11 | * disclaimer in the documentation and/or other materials provided 12 | * with the distribution. 13 | * * Neither the name of Code Aurora Forum, Inc. nor the names of its 14 | * contributors may be used to endorse or promote products derived 15 | * from this software without specific prior written permission. 16 | * 17 | * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED 18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 19 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT 20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS 21 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 22 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 23 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR 24 | * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 25 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE 26 | * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN 27 | * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 | */ 29 | 30 | @ NEON optimized assembly routine of kf_bfly2() 31 | 32 | .text 33 | .fpu neon 34 | .align 4 35 | .global kf_bfly2 36 | .func kf_bfly2 37 | 38 | kf_bfly2: 39 | stmdb sp!, {r4, r5, r6, r7, r8, r9, sl, fp, lr} 40 | @ vstmdb sp!, {d8-d15} 41 | @ r0 - Fout| r1 - fstride | r2 - st | r3 - m 42 | pld [r0, #0] 43 | mov r8, r3, asl #3 @ convert m into bytes count (m*8) 44 | add r5, r0, r8 @ Fout2 = Fout + m; 45 | add r6, r2, #264 @ tw1 = st->twiddles 46 | pld [r6, #0] 47 | mov r1, r1, asl #3 @ convert fstride into bytes count (fstride*8) 48 | @ float32x4x2_t *Fout; q0, q1 (d0-d3) 49 | @ float32x4x2_t tmp; q2, q3 (d4-d7) 50 | @ float32x4x2_t *Fout2; q10, q11 (d20-d23) 51 | @ float32x4x2_t *tw1; q12, q13 (d24-d27) 52 | @ float32x4x2_t t; q8, q9 (d16-d19) 53 | asrs r4, r3, #2 @ size_t k=m/4; 54 | beq .bfly2_do_while1 55 | mov r7, r1, asl #2 @ convert fstride into bytes count (fstride*8*4 /*4 samples*/) 56 | 57 | .bfly2_do_while4: @ do { //process 4 samples per iteration 58 | vld2.32 {d20-d23}, [r5] @ load *Fout2; 59 | vld2.32 {d16-d19}, [r6], r7 @ load *tw1; tw1 += (fstride*4); 60 | pld [r6, #0] @ preload next tw1 61 | vmul.f32 q2, q10, q12 @ C_MUL (t, *Fout2 , *tw1); 62 | vmul.f32 q3, q11, q13 63 | vsub.f32 q8, q2, q3 64 | vmul.f32 q2, q10, q13 65 | vmul.f32 q3, q11, q12 66 | vadd.f32 q9, q2, q3 67 | 68 | vld2.32 {d0-d3}, [r0] @ load *Fout; 69 | vsub.f32 q10, q0, q8 @ C_SUB( *Fout2 , *Fout , t ); 70 | vsub.f32 q11, q1, q9 71 | vst2.32 {d20-d23}, [r5]! @ store *Fout2; Fout2+=4 72 | pld [r5, #0] @ preload next Fout2 73 | 74 | vadd.f32 q0, q0, q8 @ C_ADDTO( *Fout , t ); 75 | vadd.f32 q1, q1, q9 76 | vst2.32 {d0-d3}, [r0]! @ store *Fout; Fout+=4 77 | pld [r0, #0] @ preload next Fout 78 | 79 | subs r4, r4, #1 @ }while(--k); 80 | bne .bfly2_do_while4 81 | 82 | @.kf_bfly2_process_remaining: 83 | asr r8, r3, #31 84 | lsr r7, r8, #30 85 | add r4, r7, r3 86 | ands r3, r4, #3 @ if (k % 4 == 0) 87 | beq .kf_bfly2_done 88 | @ float32x4x2_t *Fout; d0 {s0,s1} 89 | @ float32x4x2_t tmp; d1 {s2,s3} 90 | @ float32x4x2_t *Fout2; d2 {s4,s5} 91 | @ float32x4x2_t *tw1; d3 {s6,s7} 92 | @ float32x4x2_t t; d4 {s8,s9} 93 | 94 | 95 | .bfly2_do_while1: @ do { //process 1 sample per iteration 96 | vld1.32 {d2}, [r5] @ load *Fout2;{s16,s17} 97 | vld1.32 {d3}, [r6], r1 @ load *tw1; tw1 += (fstride);{s24,s25} 98 | pld [r6, #0] @ preload next tw1 99 | vmul.f32 d1, d2, d3 @ @ C_MUL (t, *Fout2 , *tw1); 100 | vsub.f32 s8, s2, s3 101 | vmul.f32 s2, s4, s7 102 | vmul.f32 s3, s5, s6 103 | vadd.f32 s9, s2, s3 104 | 105 | vld1.32 {d0}, [r0] @ load *Fout; 106 | vsub.f32 d5, d0, d4 @ C_SUB( *Fout2 , *Fout , t ); 107 | vst1.32 {d5}, [r5]! @ store *Fout2; ++Fout2 108 | pld [r5, #0] @ preload next Fout2 109 | 110 | vadd.f32 d0, d0, d4 @ C_ADDTO( *Fout , t ); 111 | vst1.32 {d0}, [r0]! @ store *Fout; ++Fout 112 | pld [r0, #0] @ preload next Fout 113 | 114 | subs r3, r3, #1 @ }while(--k); 115 | bne .bfly2_do_while1 116 | 117 | .kf_bfly2_done: 118 | @ vldmia sp!, {d8-d15} 119 | ldmia sp!, {r4, r5, r6, r7, r8, r9, sl, fp, pc} 120 | nop 121 | 122 | .endfunc 123 | .end 124 | -------------------------------------------------------------------------------- /kiss_fft_bfly4_neon.S: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (C) 2012, Code Aurora Forum. All rights reserved. 3 | * 4 | * Redistribution and use in source and binary forms, with or without 5 | * modification, are permitted provided that the following conditions are 6 | * met: 7 | * * Redistributions of source code must retain the above copyright 8 | * notice, this list of conditions and the following disclaimer. 9 | * * Redistributions in binary form must reproduce the above 10 | * copyright notice, this list of conditions and the following 11 | * disclaimer in the documentation and/or other materials provided 12 | * with the distribution. 13 | * * Neither the name of Code Aurora Forum, Inc. nor the names of its 14 | * contributors may be used to endorse or promote products derived 15 | * from this software without specific prior written permission. 16 | * 17 | * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED 18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 19 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT 20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS 21 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 22 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 23 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR 24 | * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 25 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE 26 | * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN 27 | * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 | */ 29 | 30 | @ NEON optimized assembly routine of kf_bfly4() 31 | 32 | .text 33 | .fpu neon 34 | .align 4 35 | .global kf_bfly4 36 | .func kf_bfly4 37 | 38 | kf_bfly4: 39 | stmdb sp!, {r4, r5, r6, r7, r8, r9, r10, r11, r12, lr} 40 | @ vstmdb sp!, {d8-d15} 41 | @ r0 - Fout| r1 - fstride | r2 - st | r3 - m 42 | pld [r0, #0] 43 | mov r5, r3 44 | mov r3, r3, asl #3 @ convert m into bytes count (m*8) 45 | add r6, r2, #264 @ tw1 = st->twiddles 46 | pld [r6, #0] 47 | mov r7, r6 @ tw2 = st->twiddles 48 | mov r8, r7 @ tw3 = st->twiddles 49 | ldr r2, [r2, #4] @ st->inverse 50 | mov r1, r1, asl #3 @ convert fstride into bytes count (fstride*8) 51 | mov r9, r1, asl #1 @ fstride*2 52 | add r10, r1, r9 @ fstride*3 53 | @ float32x4x2_t rfout; q0, q1 (d0-d3) 54 | @ float32x4x2_t tmp; q2, q3 (d4-d7) 55 | @ float32x4x2_t scratch0; q12, q13 (d24-d27) 56 | @ float32x4x2_t scratch1; q14, q15 (d28-d31) 57 | @ float32x4x2_t scratch2; q8, q9 (d16-d19) 58 | @ float32x4x2_t scratch3; q10, q11 (d20-d23) 59 | asrs r4, r5, #2 @ size_t k=m/4; 60 | beq .kf_bfly4_do_while1 @ if(k==0) 61 | 62 | .kf_bfly4_do_while4: @ do { //process 4 samples per iteration 63 | add r11, r0, r3 @ fom = Fout+m; 64 | mov r12, r11 65 | pld [r7, #0] 66 | vld1.32 {d20}, [r6], r1 @ rtwd1 = vld1_f32((const float32_t*)tw1); tw1 += fstride; 67 | vld1.32 {d21}, [r6], r1 @ rtwd2 = vld1_f32((const float32_t*)tw1); tw1 += fstride; 68 | vld1.32 {d22}, [r6], r1 @ rtwd3 = vld1_f32((const float32_t*)tw1); tw1 += fstride; 69 | vld1.32 {d23}, [r6], r1 @ rtwd4 = vld1_f32((const float32_t*)tw1); tw1 += fstride; 70 | vuzp.32 q10, q11 @ scratch3 = vuzpq_f32(vcombine_f32(rtwd1, rtwd2), vcombine_f32(rtwd3, rtwd4)); 71 | vld2.32 {d0-d3}, [r11], r3 @ rfout = vld2q_f32((const float32_t*)(fom1)); fom2 = Fout+m2; 72 | vmul.f32 q2, q0, q10 @ C_MUL_NEON(scratch0, rfout, scratch3); 73 | vmul.f32 q3, q1, q11 74 | vsub.f32 q12, q2, q3 75 | vmul.f32 q2, q0, q11 76 | vmul.f32 q3, q1, q10 77 | vadd.f32 q13, q2, q3 78 | 79 | pld [r8, #0] 80 | vld1.32 {d20}, [r7], r9 @ rtwd1 = vld1_f32((const float32_t*)tw2); tw2 += fstride*2; 81 | vld1.32 {d21}, [r7], r9 @ rtwd2 = vld1_f32((const float32_t*)tw2); tw2 += fstride*2; 82 | vld1.32 {d22}, [r7], r9 @ rtwd3 = vld1_f32((const float32_t*)tw2); tw2 += fstride*2; 83 | vld1.32 {d23}, [r7], r9 @ trtwd4 = vld1_f32((const float32_t*)tw2); tw2 += fstride*2; 84 | vuzp.32 q10, q11 @ scratch3 = vuzpq_f32(vcombine_f32(rtwd1, rtwd2), vcombine_f32(rtwd3, rtwd4)); 85 | vld2.32 {d0-d3}, [r11], r3 @ rfout = vld2q_f32((const float32_t*)(fom2)); fom3 = Fout+m3; 86 | vmul.f32 q2, q0, q10 @ C_MUL_NEON(scratch1, rfout, scratch3); 87 | vmul.f32 q3, q1, q11 88 | vsub.f32 q14, q2, q3 89 | vmul.f32 q2, q0, q11 90 | vmul.f32 q3, q1, q10 91 | vadd.f32 q15, q2, q3 92 | 93 | pld [r0, #0] 94 | vld1.32 {d20}, [r8], r10 @ rtwd1 = vld1_f32((const float32_t*)tw3); tw3 += fstride*3; 95 | vld1.32 {d21}, [r8], r10 @ rtwd2 = vld1_f32((const float32_t*)tw3); tw3 += fstride*3; 96 | vld1.32 {d22}, [r8], r10 @ rtwd3 = vld1_f32((const float32_t*)tw3); tw3 += fstride*3; 97 | vld1.32 {d23}, [r8], r10 @ rtwd4 = vld1_f32((const float32_t*)tw3); tw3 += fstride*3; 98 | vuzp.32 q10, q11 @ scratch3 = vuzpq_f32(vcombine_f32(rtwd1, rtwd2), vcombine_f32(rtwd3, rtwd4)); 99 | vld2.32 {d0-d3}, [r11] @ rfout = vld2q_f32((const float32_t*)(fom3)); 100 | vmul.f32 q2, q0, q10 @ C_MUL_NEON(scratch2, rfout, scratch3); 101 | vmul.f32 q3, q1, q11 102 | vsub.f32 q8, q2, q3 103 | vmul.f32 q2, q0, q11 104 | vmul.f32 q3, q1, q10 105 | vadd.f32 q9, q2, q3 106 | 107 | vld2.32 {d0-d3}, [r0] @ rfout = vld2q_f32((const float32_t*)(Fout)); 108 | vsub.f32 q2, q0, q14 @ C_SUB_NEON(tmp, rfout, scratch1 ); 109 | vsub.f32 q3, q1, q15 110 | 111 | vadd.f32 q0, q0, q14 @ C_ADD_NEON(rfout, rfout, scratch1); 112 | vadd.f32 q1, q1, q15 113 | 114 | vadd.f32 q10, q12, q8 @ C_ADD_NEON(scratch3, scratch0, scratch2); 115 | vadd.f32 q11, q13, q9 116 | 117 | vsub.f32 q12, q12, q8 @ C_SUB_NEON(scratch0, scratch0, scratch2); 118 | vsub.f32 q13, q13, q9 119 | 120 | vsub.f32 q8, q0, q10 @ C_SUB_NEON(scratch2, rfout, scratch3); 121 | vsub.f32 q9, q1, q11 122 | 123 | vadd.f32 q0, q0, q10 @ C_ADD_NEON(rfout, rfout, scratch3); 124 | vadd.f32 q1, q1, q11 125 | vst2.32 {d0-d3}, [r0]! @ vst2q_f32((float32_t*)Fout, rfout); Fout+=4;; 126 | 127 | cmp r2, #0 128 | beq .not_inverse4 @ if(st->inverse) { 129 | vsub.f32 q10, q2, q13 @ scratch3.val[0] = vsubq_f32(tmp.val[0], scratch0.val[1]); 130 | vadd.f32 q11, q3, q12 @ scratch3.val[1] = vaddq_f32(tmp.val[1], scratch0.val[0]); 131 | vadd.f32 q14, q2, q13 @ scratch1.val[0] = vaddq_f32(tmp.val[0], scratch0.val[1]); 132 | vsub.f32 q15, q3, q12 @ scratch1.val[1] = vsubq_f32(tmp.val[1], scratch0.val[0]); 133 | b .c_end4 134 | .not_inverse4: @ } else { 135 | vadd.f32 q10, q2, q13 @ scratch3.val[0] = vaddq_f32(tmp.val[0], scratch0.val[1]); 136 | vsub.f32 q11, q3, q12 @ scratch3.val[1] = vsubq_f32(tmp.val[1], scratch0.val[0]); 137 | vsub.f32 q14, q2, q13 @ scratch1.val[0] = vsubq_f32(tmp.val[0], scratch0.val[1]); 138 | vadd.f32 q15, q3, q12 @ scratch1.val[1] = vaddq_f32(tmp.val[1], scratch0.val[0]); 139 | @ } 140 | .c_end4: 141 | vst2.32 {d20-d23}, [r12], r3 @ vst2q_f32((float32_t*)(fom), scratch3); fom2 = Fout+m2; 142 | vst2.32 {d16-d19}, [r12], r3 @ vst2q_f32((float32_t*)fom2, scratch2); fom3 = Fout+m3; 143 | vst2.32 {d28-d31}, [r12] @ vst2q_f32((float32_t*)(fom3), scratch1); 144 | 145 | pld [r6, #0] 146 | 147 | subs r4, r4, #1 @ }while(--k); 148 | bne .kf_bfly4_do_while4 149 | 150 | @.kf_bfly4_process_singles: 151 | asr r4, r5, #31 152 | lsr r4, r4, #30 153 | add r4, r4, r5 154 | ands r5, r4, #3 @ if (k%4 == 0) 155 | beq .kf_bfly4_done 156 | 157 | .kf_bfly4_do_while1: @ do { //process 1 sample per iteration 158 | pld [r7, #0] 159 | vld1.32 {d18}, [r6], r1 @ rtwd1 = vld1_f32((const float32_t*)tw1); tw1 += fstride; 160 | vuzp.32 d18, d19 @ scratch3 = vuzp_f32(rtwd1, rtwd2); //d11 is empty 161 | add r12, r0, r3 @ fom = Fout+m; 162 | vld1.32 {d0}, [r12], r3 @ rfout = vld2_f32((const float32_t*)(fom1)); fom2 = Fout+m2; 163 | vuzp.32 d0, d1 @ d1 is empty 164 | vmul.f32 q1, q0, q9 @ C_MUL_NEON(scratch0, rfout, scratch3); 165 | vsub.f32 d4, d2, d3 166 | vmul.f32 d2, d0, d19 167 | vmul.f32 d3, d1, d18 168 | vadd.f32 d5, d2, d3 169 | 170 | pld [r8, #0] 171 | vld1.32 {d18}, [r7], r9 @ rtwd1 = vld1_f32((const float32_t*)tw2); tw2+= fstride*2; 172 | vuzp.32 d18, d19 @ scratch3 = vuzp_f32(rtwd1, rtwd2); //d11 is empty 173 | vld1.32 {d0}, [r12], r3 @ rfout = vld2_f32((const float32_t*)(fom2)); fom3 = Fout+m3; 174 | vuzp.32 d0, d1 @ d1 is empty 175 | vmul.f32 q1, q0, q9 @ C_MUL_NEON(scratch1, rfout, scratch3); 176 | vsub.f32 d6, d2, d3 177 | vmul.f32 d2, d0, d19 178 | vmul.f32 d3, d1, d18 179 | vadd.f32 d7, d2, d3 180 | 181 | pld [r0, #0] 182 | vld1.32 {d18}, [r8], r10 @ rtwd1 = vld1_f32((const float32_t*)tw3); tw3 += fstride*3; 183 | vuzp.32 d18, d19 @ scratch3 = vuzp_f32(rtwd1, rtwd2); //d11 is empty 184 | vld1.32 {d0}, [r12] @ rfout = vld2_f32((const float32_t*)(fom3)); 185 | vuzp.32 d0, d1 @ d1 is empty 186 | vmul.f32 q1, q0, q9 @ C_MUL_NEON(scratch2, rfout, scratch3); 187 | vsub.f32 d16, d2, d3 188 | vmul.f32 d2, d0, d19 189 | vmul.f32 d3, d1, d18 190 | vadd.f32 d17, d2, d3 191 | 192 | vld1.32 {d0}, [r0] @ rfout = vld2_f32((const float32_t*)(Fout)); 193 | vuzp.32 d0, d1 194 | vsub.f32 q1, q0, q3 @ C_SUB_NEON(tmp, rfout, scratch1 ); 195 | 196 | vadd.f32 q0, q0, q3 @ C_ADD_NEON(rfout, rfout, scratch1); 197 | 198 | vadd.f32 q9, q2, q8 @ C_ADD_NEON(scratch3, scratch0, scratch2); 199 | 200 | vsub.f32 q2, q2, q8 @ C_SUB_NEON(scratch0, scratch0, scratch2); 201 | 202 | vsub.f32 q8, q0, q9 @ C_SUB_NEON(scratch2, rfout, scratch3); 203 | 204 | vadd.f32 q0, q0, q9 @ C_ADD_NEON(rfout, rfout, scratch3); 205 | 206 | cmp r2, #0 207 | beq .not_inverse1 @ if(st->inverse) { 208 | vsub.f32 d18, d2, d5 @ scratch3.val[0] = vsub_f32(tmp.val[0], scratch0.val[1]); 209 | vadd.f32 d19, d3, d4 @ scratch3.val[1] = vadd_f32(tmp.val[1], scratch0.val[0]); 210 | vadd.f32 d6, d2, d5 @ scratch1.val[0] = vadd_f32(tmp.val[0], scratch0.val[1]); 211 | vsub.f32 d7, d3, d4 @ scratch1.val[1] = vsub_f32(tmp.val[1], scratch0.val[0]); 212 | b .c_end1 213 | .not_inverse1: @ } else { 214 | vadd.f32 d18, d2, d5 @ scratch3.val[0] = vadd_f32(tmp.val[0], scratch0.val[1]); 215 | vsub.f32 d19, d3, d4 @ scratch3.val[1] = vsub_f32(tmp.val[1], scratch0.val[0]); 216 | vsub.f32 d6, d2, d5 @ scratch1.val[0] = vsub_f32(tmp.val[0], scratch0.val[1]); 217 | vadd.f32 d7, d3, d4 @ scratch1.val[1] = vadd_f32(tmp.val[1], scratch0.val[0]); 218 | @ } 219 | .c_end1: 220 | mov r12, r0 221 | vzip.32 d0, d1 222 | vst1.32 {d0}, [r12], r3 @ vst2_f32((float32_t*)Fout, rfout); fom = Fout+m; 223 | 224 | vzip.32 d18, d19 225 | vst1.32 {d18}, [r12], r3 @ vst2_f32((float32_t*)(fom), scratch3); fom2 = Fout+m2; 226 | 227 | vzip.32 d16, d17 228 | vst1.32 {d16}, [r12], r3 @ vst2_f32((float32_t*)fom2, scratch2); fom3 = Fout+m3; 229 | 230 | vzip.32 d6, d7 231 | vst1.32 {d6}, [r12] @ vst2_f32((float32_t*)(fom3), scratch1); 232 | 233 | add r0, r0, #8 @ Fout+=1; 234 | pld [r6, #0] 235 | 236 | subs r5, r5, #1 @ }while(--k); 237 | bne .kf_bfly4_do_while1 238 | 239 | .kf_bfly4_done: 240 | @ vldmia sp!, {d8-d15} 241 | ldmia sp!, {r4, r5, r6, r7, r8, r9, r10, r11, r12, pc} 242 | nop 243 | 244 | .endfunc 245 | .end 246 | 247 | -------------------------------------------------------------------------------- /main.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | ViewRF - RTL-SDR Spectrum Analyzer for the BeagleBone 3 | Copyright (C) 2013 Stephen Ong 4 | 5 | This program is free software: you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation, either version 3 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License 16 | along with this program. If not, see . 17 | 18 | */ 19 | 20 | #include "dialog.h" 21 | #include 22 | #include 23 | 24 | int main(int argc, char *argv[]) 25 | { 26 | QApplication a(argc, argv); 27 | Dialog w; 28 | //QWSServer::setCursorVisible(false); //Hide cursor, esp for touchscreen 29 | w.setWindowState(Qt::WindowFullScreen); 30 | w.show(); 31 | 32 | return a.exec(); 33 | } 34 | -------------------------------------------------------------------------------- /sdrcapture.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | ViewRF - RTL-SDR Spectrum Analyzer for the BeagleBone 3 | Copyright (C) 2013 Stephen Ong 4 | 5 | This program is free software: you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation, either version 3 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License 16 | along with this program. If not, see . 17 | 18 | */ 19 | 20 | #include "sdrcapture.h" 21 | #include 22 | 23 | /***************************************************************************** 24 | * Initializes hardware 25 | ****************************************************************************/ 26 | SDRCapture::SDRCapture(QObject *parent) : 27 | QObject(parent) 28 | { 29 | qDebug() << Q_FUNC_INFO << QThread::currentThreadId() << QThread::currentThread(); 30 | 31 | char vendor[256], product[256], serial[256]; 32 | dev = NULL; 33 | out_block_size = 2*BLOCK_LENGTH; 34 | buffer = (uint8_t *) malloc(out_block_size * sizeof(uint8_t)); 35 | 36 | int device_count = rtlsdr_get_device_count(); 37 | qDebug() << device_count; 38 | for (int i = 0; i < device_count; i++) { 39 | rtlsdr_get_device_usb_strings(i, vendor, product, serial); 40 | qDebug() << i << ", " << vendor <<", "<< product << ", " << serial; 41 | 42 | } 43 | int r = rtlsdr_open(&dev, 0); 44 | if (r < 0) qDebug() << "Fail rtlsdr_open"; 45 | r = rtlsdr_set_sample_rate(dev, DEFAULT_SAMPLE_RATE); 46 | if (r < 0) qDebug() << "Fail rtlsdr_set_sample_rate"; 47 | 48 | set_frequency(DEFAULT_CENTER_FREQUENCY); 49 | 50 | 51 | //Set Manual gain 52 | r = rtlsdr_set_tuner_gain_mode(dev, 1); 53 | if (r < 0) qDebug() << "WARNING: Failed to enable manual gain.\n"; 54 | 55 | //Use offset tuning 56 | set_offset_tuning(false); 57 | 58 | 59 | //rtlsdr_set_testmode(dev, 1); //Test mode for detecting lost samples 60 | 61 | /* Reset endpoint before we start reading from it (mandatory) */ 62 | r = rtlsdr_reset_buffer(dev); 63 | if (r < 0) qDebug() << "WARNING: Failed to reset buffers.\n"; 64 | 65 | is_locked = FALSE; 66 | 67 | num_gains = rtlsdr_get_tuner_gains(dev, gain_table); 68 | } 69 | 70 | /***************************************************************************** 71 | * Is the tuner Elonics E4000. 72 | ****************************************************************************/ 73 | bool SDRCapture::isE4000() 74 | { 75 | if(rtlsdr_get_tuner_type(dev)==RTLSDR_TUNER_E4000) return TRUE; 76 | return FALSE; 77 | 78 | } 79 | 80 | /***************************************************************************** 81 | * How many gain settings are available for this tuner 82 | ****************************************************************************/ 83 | unsigned SDRCapture::get_num_gains() 84 | { 85 | return (unsigned) num_gains; 86 | } 87 | 88 | /***************************************************************************** 89 | * Get IQ data buffer 90 | ****************************************************************************/ 91 | uint8_t *SDRCapture::getBuffer() 92 | { 93 | return buffer; 94 | } 95 | 96 | /***************************************************************************** 97 | * Event handler for gathering IQ block 98 | ****************************************************************************/ 99 | void SDRCapture::threadFunction() 100 | { 101 | int n_read; 102 | int r; 103 | 104 | r = rtlsdr_reset_buffer(dev); 105 | if (r < 0) qDebug() << "rtlsdr_reset_buffer1 fail\n"; 106 | 107 | r = rtlsdr_read_sync(dev, buffer, out_block_size, &n_read); 108 | if (r < 0) qDebug() << "rtlsdr_read_sync fail\n"; 109 | 110 | emit packetCaptured(); 111 | } 112 | 113 | /***************************************************************************** 114 | * Sets frequency 115 | ****************************************************************************/ 116 | void SDRCapture::set_frequency(unsigned freq) 117 | { 118 | int r = rtlsdr_set_center_freq(dev, freq); 119 | if (r < 0) { 120 | qDebug() << "Fail rtlsdr_set_center_freq"; 121 | is_locked = FALSE; 122 | } 123 | else{ 124 | locked_frequency = freq; 125 | is_locked = TRUE; 126 | } 127 | } 128 | 129 | /***************************************************************************** 130 | * Set LNA gain 131 | ****************************************************************************/ 132 | void SDRCapture::set_gain(unsigned gain_index) 133 | { 134 | if(gain_index >= num_gains){ 135 | gain_index = num_gains - 1; 136 | } 137 | 138 | int r = rtlsdr_set_tuner_gain(dev, gain_table[gain_index]); 139 | if (r < 0) qDebug() << "Fail rtlsdr_set_tuner_gain"; 140 | } 141 | 142 | /***************************************************************************** 143 | * Enable offset tuning for E4000 144 | ****************************************************************************/ 145 | void SDRCapture::set_offset_tuning(bool on) 146 | { 147 | int r; 148 | if(on){ 149 | r = rtlsdr_set_offset_tuning(dev, 1); 150 | } 151 | else{ 152 | r = rtlsdr_set_offset_tuning(dev, 0); 153 | } 154 | if (r < 0) qDebug() << "WARNING: Failed to use offset tuning.\n"; 155 | } 156 | 157 | // End of sdrcapture.cpp 158 | -------------------------------------------------------------------------------- /sdrcapture.h: -------------------------------------------------------------------------------- 1 | /* 2 | ViewRF - RTL-SDR Spectrum Analyzer for the BeagleBone 3 | Copyright (C) 2013 Stephen Ong 4 | 5 | This program is free software: you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation, either version 3 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License 16 | along with this program. If not, see . 17 | 18 | */ 19 | 20 | #ifndef SDRCAPTURE_H 21 | #define SDRCAPTURE_H 22 | 23 | #include 24 | #include "rtl-sdr.h" 25 | 26 | //#define USE_KISSFFT 27 | #define USE_AVFFT //AVFFT is a touch faster 28 | 29 | #define HAMMING_WINDOW 30 | //#define BLACKMANNUTALL_WINDOW 31 | 32 | #define DEFAULT_CENTER_FREQUENCY 952000000 // In Hz 33 | #define DEFAULT_SAMPLE_RATE 2400000 // 2.4 MS/s gives good result 34 | 35 | //---------------------------- 36 | //BLOCK_LENGTH is divided into overlapping FFT_LENGTH blocks 37 | //number of edge-to-edge blocks n = BLOCK_LENGTH/FFT_LENGTH 38 | //number of 50% overlapping blocks is n + (n-1) 39 | 40 | #define FFT_LENGTH_2N (10) //2^10 = 1024 41 | #define FFT_LENGTH (1< 4 | 5 | This program is free software: you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation, either version 3 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License 16 | along with this program. If not, see . 17 | 18 | */ 19 | 20 | #include "spectrumplot.h" 21 | 22 | #include 23 | 24 | SpectrumPlot::SpectrumPlot(QWidget *parent) : 25 | QwtPlot(parent) 26 | { 27 | d_directPainter = new QwtPlotDirectPainter(); 28 | 29 | setAutoReplot( false ); 30 | setCanvas( new QwtPlotCanvas() ); 31 | 32 | plotLayout()->setAlignCanvasToScales( true ); 33 | 34 | setTitle("Spectrum Analyzer - Stephen Ong"); 35 | setAxisTitle( QwtPlot::xBottom, "Frequency (MHz)" ); 36 | setAxisTitle( QwtPlot::yLeft, "Amplitude (dB)" ); 37 | setAxisScale( QwtPlot::xBottom, 0, RESULT_LENGTH ); 38 | setAxisScale( QwtPlot::yLeft, -90, -10); 39 | 40 | QwtPlotGrid *grid = new QwtPlotGrid(); 41 | grid->setPen( Qt::gray, 0.0, Qt::DotLine ); 42 | grid->enableX( true ); 43 | grid->enableXMin( true ); 44 | grid->enableY( true ); 45 | grid->enableYMin( false ); 46 | grid->attach( this ); 47 | 48 | 49 | d_curve = new QwtPlotCurve(); 50 | d_curve->setStyle( QwtPlotCurve::Lines ); 51 | d_curve->setPen(Qt::darkGray); 52 | //d_curve->setRenderHint( QwtPlotItem::RenderAntialiased, true ); 53 | d_curve->setPaintAttribute( QwtPlotCurve::ClipPolygons, false ); 54 | d_curve->attach( this ); 55 | 56 | for(int i=0; isetSamples(d_x, data, RESULT_LENGTH); 78 | replot(); 79 | 80 | } 81 | 82 | void SpectrumPlot::SetXRange(double xStart, double xStop) 83 | { 84 | setAxisScale( QwtPlot::xBottom, xStart, xStop ); 85 | int num_points = RESULT_LENGTH; 86 | for(int i=0; i 4 | 5 | This program is free software: you can redistribute it and/or modify 6 | it under the terms of the GNU General Public License as published by 7 | the Free Software Foundation, either version 3 of the License, or 8 | (at your option) any later version. 9 | 10 | This program is distributed in the hope that it will be useful, 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | GNU General Public License for more details. 14 | 15 | You should have received a copy of the GNU General Public License 16 | along with this program. If not, see . 17 | 18 | */ 19 | 20 | #ifndef SPECTRUMPLOT_H 21 | #define SPECTRUMPLOT_H 22 | 23 | #include 24 | 25 | #include 26 | #include 27 | #include 28 | #include 29 | #include 30 | #include 31 | #include 32 | #include 33 | #include 34 | #include 35 | 36 | #include "sdrcapture.h" 37 | 38 | class SpectrumPlot : public QwtPlot 39 | { 40 | Q_OBJECT 41 | public: 42 | explicit SpectrumPlot(QWidget *parent = 0); 43 | void SetData(double data[]); 44 | void SetXRange(double xStart, double xStop); 45 | signals: 46 | 47 | public slots: 48 | 49 | private: 50 | QwtPlotDirectPainter *d_directPainter; 51 | QwtPlotCurve *d_curve; 52 | double d_x[RESULT_LENGTH]; 53 | }; 54 | 55 | #endif // SPECTRUMPLOT_H 56 | --------------------------------------------------------------------------------