1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516
|
/******************************************************************************\
* Technische Universitaet Darmstadt, Institut fuer Nachrichtentechnik
* Copyright (c) 2001
*
* Author(s):
* Volker Fischer
*
* Description:
*
*
******************************************************************************
*
* This program is free software; you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free Software
* Foundation; either version 2 of the License, or (at your option) any later
* version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License along with
* this program; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
\******************************************************************************/
#if !defined(VECTOR_H__3B0BA660_CA6LIUBEFIB2B_23E7A0D31912__INCLUDED_)
#define VECTOR_H__3B0BA660_CA6LIUBEFIB2B_23E7A0D31912__INCLUDED_
//#include "drmtx/common/GlobalDefinitions.h"
#include "appdefs.h"
using namespace std; /* Because of the library: "complex" */
#include <string>
#include <stdio.h>
#include <math.h>
#include <vector>
/******************************************************************************\
* CVector base class *
\******************************************************************************/
template<class TData> class CVector
: public vector<TData>
{
public:
CVector() : iBitArrayCounter(0), iVectorSize(0) {pData = this->begin();}
CVector(const int iNeSi) {Init(iNeSi);}
CVector(const int iNeSi, const TData tInVa) {Init(iNeSi, tInVa);}
virtual ~CVector() {}
/* Copy constructor: The order of the initialization list must not be
changed. First, the base class must be initialized, then the pData
pointer must be set to the new data source. The bit access is, by
default, reset */
CVector(const CVector<TData>& vecI) :
vector<TData>(static_cast<const vector<TData>&>(vecI)),
iBitArrayCounter(0), iVectorSize(vecI.Size()) {pData = this->begin();}
virtual void Init(const int iNewSize);
/* Use this init to give all elements a defined value */
virtual void Init(const int iNewSize, const TData tIniVal);
void Reset(const TData tResetVal);
void Enlarge(const int iAddedSize);
void Add(const TData& tI) {Enlarge(1); pData[iVectorSize - 1] = tI;}
inline int Size() const {return iVectorSize;}
/* This operator allows for a l-value assignment of this object:
CVector[x] = y is possible */
inline TData& operator[](const int iPos) {
#ifdef _DEBUG_
if ((iPos < 0) || (iPos > iVectorSize - 1))
{
DebugError("Writing vector out of bounds", "Vector size",
iVectorSize, "New parameter", iPos);
}
#endif
return pData[iPos];}
inline TData operator[](const int iPos) const {
#ifdef _DEBUG_
if ((iPos < 0) || (iPos > iVectorSize - 1))
{
DebugError("Reading vector out of bounds", "Vector size",
iVectorSize, "New parameter", iPos);
}
#endif
return pData[iPos];}
inline CVector<TData>& operator=(const CVector<TData>& vecI) {
#ifdef _DEBUG_
/* Vectors which shall be copied MUST have same size! (If this is
satisfied, the parameter "iVectorSize" must not be adjusted as
a side effect) */
if (vecI.Size() != iVectorSize)
{
DebugError("Vector operator=() different size", "Vector size",
iVectorSize, "New parameter", vecI.Size());
}
#endif
vector<TData>::operator=(vecI);
/* Reset my data pointer in case, the operator=() of the base class
did change the actual memory */
pData = this->begin();
return *this;
}
/* Bit operation functions */
void Enqueue(uint32_t iInformation, const int iNumOfBits);
uint32_t Separate(const int iNumOfBits);
void ResetBitAccess() {iBitArrayCounter = 0;}
protected:
typename vector<TData>::iterator pData;
int iBitArrayCounter;
int iVectorSize;
};
/* Implementation *************************************************************/
template<class TData> void CVector<TData>::Init(const int iNewSize)
{
iVectorSize = iNewSize;
/* Clear old buffer and reserve memory for new buffer, get iterator
for pointer operations */
this->clear();
this->resize(iNewSize);
pData = this->begin();
}
template<class TData> void CVector<TData>::Init(const int iNewSize,
const TData tIniVal)
{
/* Call actual init routine */
Init(iNewSize);
/* Set values */
Reset(tIniVal);
}
template<class TData> void CVector<TData>::Enlarge(const int iAddedSize)
{
iVectorSize += iAddedSize;
this->resize(iVectorSize);
/* We have to reset the pointer since it could be that the vector size was
zero before enlarging the vector */
pData = this->begin();
}
template<class TData> void CVector<TData>::Reset(const TData tResetVal)
{
/* Set all values to reset value */
for (int i = 0; i < iVectorSize; i++)
pData[i] = tResetVal;
}
template<class TData> void CVector<TData>::Enqueue(uint32_t iInformation,
const int iNumOfBits)
{
/* Enqueue bits in bit array */
for (int i = 0; i < iNumOfBits; i++)
{
/* We want to put the bits on the array with the MSB first */
operator[](iBitArrayCounter + iNumOfBits - i - 1) = _BINARY(iInformation & 1);
/* Shift one bit to mask next bit at LSB-position */
iInformation >>= 1;
}
iBitArrayCounter += iNumOfBits;
}
template<class TData> uint32_t CVector<TData>::Separate(const int iNumOfBits)
{
uint32_t iInformation;
/* Check, if current position plus new bit-size is smaller than the maximum
length of the bit vector. Error code: return a "0" */
if (iBitArrayCounter + iNumOfBits > iVectorSize)
return 0;
/* Separate out bits from bit-array */
iInformation = 0;
for (int i = 0; i < iNumOfBits; i++)
{
/* MSB comes first, therefore shift left */
iInformation <<= 1;
iInformation |= pData[iBitArrayCounter + i] & 1;
}
iBitArrayCounter += iNumOfBits;
return iInformation;
}
/******************************************************************************\
* CShiftRegister class *
\******************************************************************************/
template<class TData> class CShiftRegister : public CVector<TData>
{
public:
CShiftRegister() : CVector<TData>() {}
CShiftRegister(const int iNeSi) : CVector<TData>(iNeSi) {}
CShiftRegister(const int iNeSi, const TData tInVa) :
CVector<TData>(iNeSi, tInVa) {}
/* Add one value at the beginning, shift the others to the right */
void AddBegin(const TData tNewD);
/* Add one value at the end, shift the others to the left */
void AddEnd(const TData tNewD);
/* Add a vector at the end, shift others to the left */
void AddEnd(const CVector<TData>& vectNewD, const int iLen);
};
/* Implementation *************************************************************/
template<class TData> void CShiftRegister<TData>::AddBegin(const TData tNewD)
{
/* Shift old values */
for (int i = this->iVectorSize - 1; i > 0; i--)
this->pData[i] = this->pData[i - 1];
/* Add new value */
this->pData[0] = tNewD;
}
template<class TData> void CShiftRegister<TData>::AddEnd(const TData tNewD)
{
/* Shift old values */
for (int i = 0; i < this->iVectorSize - 1; i++)
this->pData[i] = this->pData[i + 1];
/* Add new value */
this->pData[this->iVectorSize - 1] = tNewD;
}
template<class TData> void CShiftRegister<TData>::AddEnd(const CVector<TData>& vectNewD,
const int iLen)
{
int i, iBlockEnd, iMovLen;
iBlockEnd = this->iVectorSize - iLen;
iMovLen = iLen;
/* Shift old values */
for (i = 0; i < iBlockEnd; i++)
this->pData[i] = this->pData[iMovLen++];
/* Add new block of data */
for (i = 0; i < iLen; i++)
this->pData[iBlockEnd++] = vectNewD[i];
}
/******************************************************************************\
* CFIFO class (first in, first out) *
\******************************************************************************/
template<class TData> class CFIFO : public CVector<TData>
{
public:
CFIFO() : CVector<TData>(), iCurIdx(0) {}
CFIFO(const int iNeSi) : CVector<TData>(iNeSi), iCurIdx(0) {}
CFIFO(const int iNeSi, const TData tInVa) :
CVector<TData>(iNeSi, tInVa), iCurIdx(0) {}
void Add(const TData tNewD);
inline TData Get() {return this->pData[iCurIdx];}
virtual void Init(const int iNewSize);
virtual void Init(const int iNewSize, const TData tIniVal);
protected:
int iCurIdx;
};
template<class TData> void CFIFO<TData>::Init(const int iNewSize)
{
iCurIdx = 0;
CVector<TData>::Init(iNewSize);
}
template<class TData> void CFIFO<TData>::Init(const int iNewSize,
const TData tIniVal)
{
iCurIdx = 0;
CVector<TData>::Init(iNewSize, tIniVal);
}
template<class TData> void CFIFO<TData>::Add(const TData tNewD)
{
this->pData[iCurIdx] = tNewD;
/* Increment index */
iCurIdx++;
if (iCurIdx >= this->iVectorSize)
iCurIdx = 0;
}
/******************************************************************************\
* CMovingAv class (moving average) *
\******************************************************************************/
template<class TData> class CMovingAv : public CVector<TData>
{
public:
CMovingAv() : CVector<TData>(), iCurIdx(0) {}
CMovingAv(const int iNeSi) : CVector<TData>(iNeSi), iCurIdx(0) {}
CMovingAv(const int iNeSi, const TData tInVa) :
CVector<TData>(iNeSi, tInVa), iCurIdx(0) {}
void Add(const TData tNewD);
inline TData GetAverage() {return tCurAvResult;}
virtual void Init(const int iNewSize);
void InitVec(const int iNewSize, const int iNewVecSize);
protected:
int iCurIdx;
TData tCurAvResult;
};
template<class TData> void CMovingAv<TData>::InitVec(const int iNewSize,
const int iNewVecSize)
{
iCurIdx = 0;
CVector<TData>::Init(iNewSize);
/* Init each vector in vector */
for (int i = 0; i < iNewSize; i++)
this->pData[i].Init(iNewVecSize, 0);
/* Init current average result */
tCurAvResult.Init(iNewVecSize, 0);
}
template<class TData> void CMovingAv<TData>::Init(const int iNewSize)
{
iCurIdx = 0;
tCurAvResult = TData(0); /* Only for scalars! */
CVector<TData>::Init(iNewSize);
}
template<class TData> void CMovingAv<TData>::Add(const TData tNewD)
{
/*
Optimized calculation of the moving average. We only add a new value and
subtract the old value from the result. We only need one addition and a
history buffer
*/
/* Subtract oldest value */
tCurAvResult -= this->pData[iCurIdx];
/* Add new value and write in memory */
tCurAvResult += tNewD;
this->pData[iCurIdx] = tNewD;
/* Increase position pointer and test if wrap */
iCurIdx++;
if (iCurIdx >= this->iVectorSize)
iCurIdx = 0;
}
/******************************************************************************\
* CVectorEx class (Extended vector with additional information) *
\******************************************************************************/
class CExtendedVecData
{
public:
/* Symbol ID of the current block. This number only identyfies the
position in a frame, NOT in a super-frame */
int iSymbolID;
/* This flag indicates that the symbol ID has changed */
_BOOLEAN bSymbolIDHasChanged;
/* The channel estimation needs information about timing corrections,
because it is using information from the symbol memory */
int iCurTimeCorr;
};
template<class TData> class CVectorEx : public CVector<TData>
{
public:
CVectorEx() {}
virtual ~CVectorEx() {}
CExtendedVecData& GetExData() {return ExtendedData;}
void SetExData(CExtendedVecData& NewExData)
{ExtendedData = NewExData;}
protected:
CExtendedVecData ExtendedData;
};
/******************************************************************************\
* CMatrix base class *
\******************************************************************************/
template<class TData> class CMatrix
{
public:
CMatrix() : ppData(NULL), iRow(0), iCol(0) {}
CMatrix(const int iNewR, const int iNewC) {Init(iNewR, iNewC);}
CMatrix(const int iNewR, const int iNewC, const TData tInVa)
{Init(iNewR, iNewC, tInVa);}
CMatrix(const CMatrix& m): ppData(NULL) {
Init(m.iRow,m.iCol);
for (int i=0; i<m.NumRows(); i++)
ppData[i] = m[i];
}
virtual ~CMatrix();
void Init(const int iNewRow, const int iNewColumn);
/* Use this init to give all elements a defined value */
void Init(const int iNewRow, const int iNewColumn, const TData tIniVal);
void Reset(const TData tResetVal);
inline CVector<TData>& operator[](const int iPos) const {
#ifdef _DEBUG_
if ((iPos < 0) || (iPos > iRow - 1))
{
DebugError("Matrix: Writing vector out of bounds", "Row size",
iRow, "New parameter", iPos);
}
#endif
return ppData[iPos];}
inline CMatrix& operator=(const CMatrix& m) {
this->Init(m.NumRows(), m.NumColumns());
for (int i=0; i<m.NumRows(); i++)
this->ppData[i] = m[i];
return *this;
}
#ifdef _DEBUG_
inline CVector<TData> operator[](const int iPos) const {
if ((iPos < 0) || (iPos > iRow - 1))
{
DebugError("Matrix: Reading vector out of bounds", "Row size",
iRow, "New parameter", iPos);
}
return ppData[iPos];}
#endif
inline int NumRows(void) const { return iRow;}
inline int NumColumns(void) const { return iCol;}
protected:
CVector<TData>* ppData;
int iRow;
int iCol;
};
/* Implementation *************************************************************/
template<class TData> void CMatrix<TData>::Init(const int iNewRow,
const int iNewColumn)
{
iRow = iNewRow;
iCol = iNewColumn;
if (iRow > 0)
{
/* Delete resources from previous init */
if (ppData != NULL)
delete[] ppData;
/* Allocate new memory for history buffer */
ppData = new CVector<TData>[iRow];
for (int i = 0; i < iRow; i++)
ppData[i].Init(iNewColumn);
}
}
template<class TData> void CMatrix<TData>::Init(const int iNewRow,
const int iNewColumn,
const TData tIniVal)
{
/* Call actual init routine */
Init(iNewRow, iNewColumn);
/* Set values */
Reset(tIniVal);
}
template<class TData> void CMatrix<TData>::Reset(const TData tResetVal)
{
/* Set all values to reset value */
for (int i = 0; i < iRow; i++)
for (int j = 0; j < ppData[i].Size(); j++)
ppData[i][j] = tResetVal;
}
template<class TData> CMatrix<TData>::~CMatrix()
{
/* Delete buffer */
if (ppData != NULL)
delete[] ppData;
}
#endif // !defined(VECTOR_H__3B0BA660_CA6LIUBEFIB2B_23E7A0D31912__INCLUDED_)
|