Beruflich Dokumente
Kultur Dokumente
This appendix provides lists with some definitions, integrals, trigonometric relations
and the like. It is not exhaustive, presenting only that information used throughout
the book and a few more just for complementation purposes. The reader can find
extensive tables available in the literature. We recommend the works by Abramowitz
and Stegun [1], Bronshtein, Semendyayev, Musiol and Muehlig [2], Gradshteyn and
Ryzhik [3], Polyanin and Manzhirov [4] and Zwillinger [7]. We also recommend
the book by Poularikas [5], though its major application is in the signal processing
area. Nevertheless, it complements the tables of the other recommended books. In
terms of online resources, the Digital Library of Mathematical Functions (DLMF)
is intended to be a reference data for special functions and their applications [6]. It
is also intended to be an update of [1].
(1)n x 2n+1
x3 x5 x7
sin x = x + + = (A.1)
3! 5! 7! n=0
(2n + 1)!
(1)n x 2n
x2 x4 x6
cos x = 1 + + = (A.2)
2! 4! 6! n=0
(2n)!
1
sin2 = (1 cos 2 ) (A.3)
2
1
cos2 = (1 + cos 2 ) (A.4)
2
1
sin cos = (1 cos 4 )
2 2
(A.5)
8
1
cos cos = [cos( ) + cos( + )] (A.6)
2
1
sin sin = [cos( ) cos( + )] (A.7)
2
1
sin cos = [sin( + ) + sin( )] (A.8)
2
sin( ) = sin cos cos sin (A.9)
cos( ) = cos cos sin sin (A.10)
tan tan
tan( ) = (A.11)
1 tan tan
sin 2 = 2 sin cos (A.12)
cos 2 = cos sin
2 2
(A.13)
1
sin = (ei ei ) (A.14)
2i
1
cos = (ei + ei ). (A.15)
2
Error function:
x
2
et dt.
2
erf(x) = (A.16)
0
Properties:
The Taylor series expansion of the error function, which provides a good approx-
imation of erf(x) for 60 terms in the summation and for x up to 4, is given by
2 (1)n x 2n+1
erf(x) = . (A.23)
n=0 n!(2n + 1)
A Mathematical Tables and Algorithms 843
/2
1 2x 2
erfc(x) = exp d. (A.24)
0 2 sin2
A.3 Derivatives
d dw dv du
(uvw) = uv + uw + vw (A.25)
dx d x d x d x
d u% & 1 du dv
= 2 v u (A.26)
dx v v dx dx
d du dv
(u v ) = vu v1 + (ln u)u v (A.27)
dx dx dx
d du dv
(u v ) = vu v1 + (ln u)u v (A.28)
dx dx dx
d 1 du
(loga u) = (loga e) (A.29)
dx u dx
dn n dnu n dv d n1 u n dnv
(uv) = v + + + u (A.30)
dxn 0 dxn 1 d x d x n1 n dxn
x
d
f (t)dt = f (x) (A.31)
dx c
g(x) g(x)
d h(x, t)
h(x, t)dt = g (x)h(x, g(x)) f (x)h(x, f (x)) + dt
d x f (x) f (x) x
(A.32)
f (x) f (x)
lim = lim . (A.33)
xa g(x) xa g (x)
[1 erf(x)] exp x 2 xd x
0
' ( (A.44)
1
= 1 , Re > Re 2 , Re > 0
2 + 2
2
e x cos d = 2 I0 (x) (A.45)
0
b2 4ac
(ax 2 +bx+c)
e e 4adx = (A.46)
a
(+1)/2 (/2)
(1 + x /)
2
dx = . (A.47)
(( + 1)/2))
2
1 n
b
f (x)d x = (b a) (1)m+1 2n f a + m(b a)2n (A.48)
a n=1 m=1
1
[ln(1/x)] p d x = p! (A.49)
0
846 A Mathematical Tables and Algorithms
1
x x d x = n n = 1.29128599706266 . . . (A.50)
0 n=1
1
xxdx = (1)n n n = 0.78340510712 . . . . (A.51)
0 n=1
The transformations given below are particularly useful in the context of Chap. 5
to transform two-dimensional signal constellations according to the linear mapping
rule: the original coordinates are mapped into the new coordinates according to
[x y]T A [x y]T , where [x y] is a row vector and A is given below, depending
on the desired mapping:
2. Reflection against the horizontal axis. A horizontal reflection is a map that trans-
forms a matrix into its horizontal mirror image:
1 0
A= . (A.69)
0 1
4. Horizontal shear mapping. A horizontal shear mapping keeps the vertical coordi-
nate and shifts the horizontal coordinate by a distance m times the distance from
the horizontal axis:
1 m
A= . (A.71)
0 1
0 0
A= . (A.73)
0 1
bin(x) := A 0
log(x + 1)
n ceil
log(2)
B
n1 0
for y (n 1) .. 0 (A.74)
A A + 2y
Bny1 1 if A x
A A 2 y otherwise
T
B
Counter(b) :=
Bb1,2b 1 0
for x 0..2b 1
A 0
for y b 1 .. 0
(A.75)
A A + 2
y
Bby1,x 1 i f A x
A A 2 y otherwise
B
A Mathematical Tables and Algorithms 849
The routine (A.77) below generates all Walsh-Hadamard sequences of length n. The
result is presented as an n n matrix H(n).
H (n) := X 1
for i 0.. log(n) 1
log(2) (A.77)
X augment(stack(X, X ), stack(X, X ))
X
The routine (A.78) below finds the input-output weight enumerating matrix (IOWEM)
of a block code. The limitation of the parameters (n, k) is governed by the lim-
itations of Mathcad when working with matrices. The input to this routine is the
values of n and k, the matrix m with all message words and the matrix C with all
850 A Mathematical Tables and Algorithms
codewords. This routine becomes attractive for long codes with a large number of
codewords.
B := for i 0..2k 1
k1
wm i m i, j
j=0
n1
wc
i Ci, j
j=0
(A.78)
Countk,n 0
for x 0..2k 1
for i 0..k
for j 0..n
Counti, j Counti, j + [(wm x = i) (wc x = j)]
Count
The routine (A.79) below can be used to compute the Euler function value of the
argument t. It has a Mathcad built-in greatest common divisor (gcd) function that
can be implemented by the GCD(a, b) function also given by (A.80).
(t) := 1 if t = 1
otherwise
x 0
(A.79)
for i 1..t 1
x x + 1 if GCD(i, t) = 1
x
GCD(a, b) := while b = 0
r b
b mod(a, b) (A.80)
ar
r
A Mathematical Tables and Algorithms 851
References
1. Abramowitz, M. and Stegun, I. (Ed.). Handbook of Mathematical Functions with Formulas,
Graphs, and Mathematical Tables. National Bureau of Standards Applied Mathematics Series,
U.S. Government Printing Office, Washington, D.C, 1972.
2. Bronshtein, I. N., Semendyayev, K. A., Musiol, G. and Muehlig, H. Handbook of Mathematics,
5th Ed. Springer-Verlag: Berlin-Heidelberg, 2007.
3. Gradshteyn, I. S. and Ryzhik, I. M. Table of Integrals, Series, and Products. 7th Ed. Academic
Press/Elsevier: USA/UK, 2007.
4. Polyanin, A. D. and Manzhirov, A. V. Handbook of Mathematics for Engineers and Scientists.
Boca Raton, Fl, USA: Chapman & Hall/CRC, 2007.
5. Poularikas, A. D. The Handbook of Formulas and Tables for Signal Processing. USA. CRC
Press LLC, 1999.
6. NIST: National Institute of Standards and Technology. NIST Digital Library of Mathematical
Functions. Available at: http://dlmf.nist.gov/(last access on July 2009).
7. Zwillinger, D. Standard Mathematical Tables and Formulae. 31st Ed. London New York:
Chapman & Hall/CRC Press, 2003.
Abbreviations
A/D analog-to-digital
AC alternate current
ACPR adjacent channel power ratio
AFC automatic frequency control
AGC automatic gain control
AM amplitude modulation
AMI alternate mark inversion
AoA angle-of-arrival
APK amplitude-phase keying
AR autoregressive
ARQ automatic repeat request
ASK amplitude shift keying
AWGN additive white Gaussian noise
BCH Bose-Chaudhuri-Hocquenghem
BCM block-coded modulation
BER bit error rate
BFSK binary frequency-shift keying
BIBO bounded-input, bounded-output
BICM bit-interleaved coded modulation
BICM-ID BICM with iterative decoding
BMA Berlekamp-Masseys algorithm
BPF band-pass filter
BPL broadband over power-line
BPSK binary phase-shift keying
BRGC binary reflected Gray code
BS base-station
BSC binary symmetric channel
BTC block turbo code
CAP carrierless amplitude-phase
CD compact disc
CDF cumulative distribution function
CDM code-division multiplexing
853
854 Abbreviations
861
862 Index