Iterative Receiver Design
Exploiting the power of factor graphs, this detailed text provides a general framework for systematically developing iterative algorithms for digital receivers, and highlights connections between important algorithms.
TABLE OF CONTENTS Iterative Receiver Design
Notations
Common Notations A
| | domain of variable X, x |
| x | a vector |
| x | Frobenius norm of x |
| X | a vector random variable or a matrix |
| X H | conjugate transpose of X |
| X T | transpose of X |
| | estimate of x |
| | expectation operator |
| | cardinality of the set |
| | the set of binary numbers {0, 1} |
| | indicator function |
| ? k | discrete Dirac distribution |
| ?(t) | continuous Dirac distribution |
| | equality function |
| | particle representation of distribution p X ( ) with L samples |
| diag{ x} | a diagonal matrix with the elements of x on the diagonal |
| | f (x) = ? g(x), |
| I N | an N N identity matrix |
| ? X ?f (x) | message from edge X to node f , evaluated in x |
| ? f ?X (x) | message from node f to edge X , evaluated in x |
| | a is much smaller than b |
| arg max x f (x) | the value of x that achieves the maximum of f ( ) |
| [ a, b] | the closed interval |
| [ a, b) | the half-open interval |
Common Notations B
| B, b | information word |
| C, c | codeword |
| A, a | coded symbols |
| Y, y | observation |
Copyright Cambridge University Press 2007 under license agreement with Books24x7
