/*
* Copyright (C) 1998 by Southwest Research Institute (SwRI)
*
* All rights reserved under U.S. Copyright Law and International Conventions.
*
* The development of this Software was supported by contracts NAG5-3148,
* NAG5-6855, NAS8-36840, NAG5-2323, and NAG5-7043 issued on behalf of
* the United States Government by its National Aeronautics and Space
* Administration. Southwest Research Institute grants to the Government,
* and others acting on its behalf, a paid-up nonexclusive, irrevocable,
* worldwide license to reproduce, prepare derivative works, and perform
* publicly and display publicly, by or on behalf of the Government.
* Other than those rights granted to the United States Government, no part
* of this Software may be reproduced in any form or by any means, electronic
* or mechanical, including photocopying, without permission in writing from
* Southwest Research Institute. All inquiries should be addressed to:
*
* Director of Contracts
* Southwest Research Institute
* P. O. Drawer 28510
* San Antonio, Texas 78228-0510
*
*
* Use of this Software is governed by the terms of the end user license
* agreement, if any, which accompanies or is included with the Software
* (the "License Agreement"). An end user will be unable to install any
* Software that is accompanied by or includes a License Agreement, unless
* the end user first agrees to the terms of the License Agreement. Except
* as set forth in the applicable License Agreement, any further copying,
* reproduction or distribution of this Software is expressly prohibited.
* Installation assistance, product support and maintenance, if any, of the
* Software is available from SwRI and/or the Third Party Providers, as the
* case may be.
*
* Disclaimer of Warranty
*
* SOFTWARE IS WARRANTED, IF AT ALL, IN ACCORDANCE WITH THESE TERMS OF THE
* LICENSE AGREEMENT. UNLESS OTHERWISE EXPLICITLY STATED, THIS SOFTWARE IS
* PROVIDED "AS IS", IS EXPERIMENTAL, AND IS FOR NON-COMMERCIAL USE ONLY,
* AND ALL EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES,
* INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
* PURPOSE, OR NON-INFRINGEMENT, ARE DISCLAIMED, EXCEPT TO THE EXTENT THAT
* SUCH DISCLAIMERS ARE HELD TO BE LEGALLY INVALID.
*
* Limitation of Liability
*
* SwRI SHALL NOT BE LIABLE FOR ANY DAMAGES SUFFERED AS A RESULT OF USING,
* MODIFYING, CONTRIBUTING, COPYING, DISTRIBUTING, OR DOWNLOADING THIS
* SOFTWARE. IN NO EVENT SHALL SwRI BE LIABLE FOR ANY INDIRECT, PUNITIVE,
* SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGE (INCLUDING LOSS OF BUSINESS,
* REVENUE, PROFITS, USE, DATA OR OTHER ECONOMIC ADVANTAGE) HOWEVER IT ARISES,
* WHETHER FOR BREACH OF IN TORT, EVEN IF SwRI HAS BEEN PREVIOUSLY ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE. YOU HAVE SOLE RESPONSIBILITY FOR ADEQUATE
* PROTECTION AND BACKUP OF DATA AND/OR EQUIPMENT USED IN CONNECTION WITH THE
* SOFTWARE AND WILL NOT MAKE A CLAIM AGAINST SwRI FOR LOST DATA, RE-RUN TIME,
* INACCURATE OUTPUT, WORK DELAYS OR LOST PROFITS RESULTING FROM THE USE OF
* THIS SOFTWARE. YOU AGREE TO HOLD SwRI HARMLESS FROM, AND YOU COVENANT NOT
* TO SUE SwRI FOR, ANY CLAIMS BASED ON USING THE SOFTWARE.
*
* Local Laws: Export Control
*
* You acknowledge and agree this Software is subject to the U.S. Export
* Administration Laws and Regulations. Diversion of such Software contrary
* to U.S. law is prohibited. You agree that none of the Software, nor any
* direct product therefrom, is being or will be acquired for, shipped,
* transferred, or reexported, directly or indirectly, to proscribed or
* embargoed countries or their nationals, nor be used for nuclear activities,
* chemical biological weapons, or missile projects unless authorized by U.S.
* Government. Proscribed countries are set forth in the U.S. Export
* Administration Regulations. Countries subject to U.S embargo are: Cuba,
* Iran, Iraq, Libya, North Korea, Syria, and the Sudan. This list is subject
* to change without further notice from SwRI, and you must comply with the
* list as it exists in fact. You certify that you are not on the U.S.
* Department of Commerce's Denied Persons List or affiliated lists or on the
* U.S. Department of Treasury's Specially Designated Nationals List. You agree
* to comply strictly with all U.S. export laws and assume sole responsibilities
* for obtaining licenses to export or reexport as may be required.
*
* General
*
* These Terms represent the entire understanding relating to the use of the
* Software and prevail over any prior or contemporaneous, conflicting or
* additional, communications. SwRI can revise these Terms at any time
* without notice by updating this posting.
*
* Trademarks
*
* The SwRI logo is a trademark of SwRI in the United States and other countries.
*
*/
#ident "@(#) $Id: trap_int_ang.C 21649 2011-12-05 20:50:45Z carrie $ SwRI"
#include
#include "user_defs.h"
#include "libIDFSMath.h"
/*******************************************************************************
* *
* IDFSMATH_TRAPEZOIDAL_INT_ANGLE SUBROUTINE *
* *
* DESCRIPTION *
* This routine is called to calculate a trapezoidal integration method on *
* data which exists in a band, which means that X[n] is the starting location*
* of the band, X[n+1] is the ending location of the band, and Y[n] is the *
* ampltude of the band. Assume that the Y[n] values are measured at the *
* centers of the bands. There are terms number of bands, so there are terms *
* values of Y and terms+1 values of X. When converted to trapezoids, there *
* are terms-1 trapezoids. Points are measured as X, Y pairs. This routine *
* is called for the angular dimensions (PHI/THETA). *
* *
* INPUT VARIABLES *
* SDDAS_FLOAT *X pointer to the band values (x component) *
* SDDAS_FLOAT *Y pointer to the data values (y component) *
* SDDAS_DOUBLE *X_rad pointer to band values expressed in radians *
* SDDAS_DOUBLE *X_centers pointer to center band values expressed in *
* radians *
* SDDAS_DOUBLE *Sin_Xc pointer to the result of the sin function *
* for the center band values *
* SDDAS_DOUBLE *Cos_Xc pointer to the result of the cos function *
* for the center band values *
* SDDAS_LONG skip number of elements to add to get to next *
* data element *
* SDDAS_LONG terms number of bands or terms to integrate *
* SDDAS_FLOAT start starting value to integrate over in X *
* SDDAS_FLOAT stop ending value to integrate over in X *
* SDDAS_CHAR which_dimen flag indicating which dimension is being *
* integrated over since multiple dimensions *
* make use of this code *
* SDDAS_CHAR norm flag indicating if the result is to be *
* normalized *
* SDDAS_INT power_sx the power of the extra "x" term or the power *
* of the sin term *
* SDDAS_INT power_c the power of the cos term *
* *
* USAGE *
* x = IDFSMath_trapezoidal_int_angle (&X, &Y, &X_rad, &X_centers, &Sin_Xc, *
* &Cos_Xc, skip, terms, start, stop, *
* which_dimen, norm, power_sx, power_c) *
* *
* NECESSARY SUBPROGRAMS *
* IDFSMath_trapezoidal_int_angle_c0_sx0 () calculates a trapezoidal int. *
* when cosine term is 0 and sine term is 0 *
* IDFSMath_trapezoidal_int_angle_c0_sx1 () calculates a trapezoidal int. *
* when cosine term is 0 and sine term is 1 *
* IDFSMath_trapezoidal_int_angle_c02_sx20 () calculates a trapezoidal int. *
* when cosine term is 0 and sine term is 2 OR *
* when cosine term is 2 and sine term is 0 *
* IDFSMath_trapezoidal_int_angle_c0_sx3 () calculates a trapezoidal int. *
* when cosine term is 0 and sine term is 3 *
* IDFSMath_trapezoidal_int_angle_c1_sx0 () calculates a trapezoidal int. *
* when cosine term is 1 and sine term is 0 *
* IDFSMath_trapezoidal_int_angle_c1_sx1 () calculates a trapezoidal int. *
* when cosine term is 1 and sine term is 1 *
* IDFSMath_trapezoidal_int_angle_c1_sx2 () calculates a trapezoidal int. *
* when cosine term is 1 and sine term is 2 *
* *
* EXTERNAL VARIABLES *
* None *
* *
* INTERNAL VARIABLES *
* std::vector width the widths between bin centers *
* std::vector M the slope of each Y between centers *
* std::vector B the intercept of each Y between centers*
* reg SDDAS_LONG i looping / indexing variable *
* reg SDDAS_FLOAT *y1, *y2 pointer to the two data values pertinent to *
* the bin centers being examined *
* SDDAS_DOUBLE sum summation value of integration *
* SDDAS_DOUBLE x1, x2 values of X used to get rid of indexing for *
* speed up issues *
* SDDAS_LONG terms_minus_one number of terms to integrate reduced by one *
* *
* SUBSYSTEM *
* Display Level *
* *
******************************************************************************/
SDDAS_FLOAT IDFSMath_trapezoidal_int_angle (SDDAS_FLOAT *X, SDDAS_FLOAT *Y,
SDDAS_DOUBLE *X_rad, SDDAS_DOUBLE *X_centers, SDDAS_DOUBLE *Sin_Xc,
SDDAS_DOUBLE *Cos_Xc, SDDAS_LONG skip, SDDAS_LONG terms, SDDAS_FLOAT start,
SDDAS_FLOAT stop, SDDAS_CHAR which_dimen, SDDAS_CHAR norm, SDDAS_INT power_sx,
SDDAS_INT power_c)
{
std::vector width, M, B;
register SDDAS_DOUBLE *cur_Xcenter_val, *next_Xcenter_val;
register SDDAS_FLOAT *y1, *y2;
register SDDAS_LONG i;
SDDAS_DOUBLE sum, x1, x2, denom;
SDDAS_LONG terms_minus_one;
static SDDAS_LONG counter = 0;
/***********************************************************************/
/* Allocate one less space for widths, slopes and intercepts. */
/***********************************************************************/
terms_minus_one = terms - 1;
width.resize (terms_minus_one);
M.resize (terms_minus_one);
B.resize (terms_minus_one);
/*****************************************************************************/
/* Find the widths between bin centers, the slope of each Y between centers,*/
/* and determine the intercept for each Y between centers. */
/* slopes M[n] and intercepts B[n] are determined for bin n from Y[n] to */
/* Y[n+1] and from the center of the bin determined by X[n] and X[n+1] to */
/* the center of the bin determined by X[n+1] and X[n+2]. */
/*****************************************************************************/
y1 = Y; /* Y value of first band */
y2 = Y + skip; /* Y value of second band */
cur_Xcenter_val = &X_centers[0];
next_Xcenter_val = &X_centers[1];
for (i = 0; i < terms_minus_one; ++i, ++cur_Xcenter_val, ++next_Xcenter_val,
y1 += skip, y2 += skip)
{
x2 = *next_Xcenter_val;
x1 = *cur_Xcenter_val;
width[i] = x2 - x1;
denom = 1.0 / width[i]; /* Multiplication is faster than division */
/*****************************************************************************/
/* Are both data values valid? */
/*****************************************************************************/
if (*y1 >= VALID_MIN && *y2 >= VALID_MIN)
{
M[i] = (*y2 - *y1) * denom;
B[i] = (x2 * *y1 - x1 * *y2) * denom;
#ifdef INT_PRINT
printf ("\n counter = %ld i = %ld y1 = %g y2 = %g", counter, i, *y1, *y2);
#endif
}
/*****************************************************************************/
/* Set as flags for later usage by code in order to ignore these elements. */
/*****************************************************************************/
else
{
M[i] = OUTSIDE_MIN;
B[i] = OUTSIDE_MIN;
#ifdef INT_PRINT
printf ("\n counter = %ld i = %ld y1 = %g y2 = %g", counter, i, *y1, *y2);
#endif
}
}
sum = 0.0; /* initialize integration amp*/
++counter;
/*****************************************************************************/
/* Data above integrate stop. */
/*****************************************************************************/
if (stop <= X[0])
return ((SDDAS_FLOAT) sum);
/*****************************************************************************/
/* Data below integrate start. */
/*****************************************************************************/
else if (start >= X[terms])
return ((SDDAS_FLOAT) sum);
if (power_c == 0)
{
if (power_sx == 0)
sum = IDFSMath_trapezoidal_int_angle_c0_sx0 (X, Y, X_rad, X_centers, Sin_Xc,
Cos_Xc, &width[0], &M[0], &B[0], skip, terms,
start, stop, which_dimen, norm);
else if (power_sx == 1)
sum = IDFSMath_trapezoidal_int_angle_c0_sx1 (X, Y, X_rad, X_centers, Sin_Xc,
Cos_Xc, &width[0], &M[0], &B[0], skip, terms,
start, stop, which_dimen, norm);
else if (power_sx == 2)
sum = IDFSMath_trapezoidal_int_angle_c02_sx20 (X, Y, X_rad, X_centers, Sin_Xc,
Cos_Xc, &width[0], &M[0], &B[0], skip, terms,
start, stop, which_dimen, norm,
power_sx, power_c);
else if (power_sx == 3)
sum = IDFSMath_trapezoidal_int_angle_c0_sx3 (X, Y, X_rad, X_centers, Sin_Xc,
Cos_Xc, &width[0], &M[0], &B[0], skip, terms,
start, stop, which_dimen, norm);
}
else if (power_c == 1)
{
if (power_sx == 0)
sum = IDFSMath_trapezoidal_int_angle_c1_sx0 (X, Y, X_rad, X_centers, Sin_Xc,
Cos_Xc, &width[0], &M[0], &B[0], skip, terms,
start, stop, which_dimen, norm);
else if (power_sx == 1)
sum = IDFSMath_trapezoidal_int_angle_c1_sx1 (X, Y, X_rad, X_centers, Sin_Xc,
Cos_Xc, &width[0], &M[0], &B[0], skip, terms,
start, stop, which_dimen, norm);
else if (power_sx == 2)
sum = IDFSMath_trapezoidal_int_angle_c1_sx2 (X, Y, X_rad, X_centers, Sin_Xc,
Cos_Xc, &width[0], &M[0], &B[0], skip, terms,
start, stop, which_dimen, norm);
}
else if (power_c == 2 && power_sx == 0)
sum = IDFSMath_trapezoidal_int_angle_c02_sx20 (X, Y, X_rad, X_centers, Sin_Xc,
Cos_Xc, &width[0], &M[0], &B[0], skip, terms,
start, stop, which_dimen, norm,
power_sx, power_c);
return ((SDDAS_FLOAT) sum);
}