close
1.

電子ブック

EB
Stojmenovic, Ivan Stojmenovic
出版情報: Wiley Online Library - AutoHoldings Books , Hoboken : John Wiley & Sons, Inc., 2005
所蔵情報: loading…
目次情報: 続きを見る
Preface
Contributors
Introduction to Wireless Sensor Networking / Fernando Martincic ; Loren Schwiebert1:
Distributed Signal Processing Algorithms for the Physical Layer of Large-Scale Sensor Networks / An-swol Hu ; Sergio D. Servetto2:
Energy Scavenging and Non-traditional Power Sources for Wireless Sensor Networks / Shad Roundy ; Luc Frechette3:
A virtual infrastructure for wireless sensor networks / Stephan Olariu ; Ashraf Wadaa ; Qingwen Xu ; Ivan Stojmenovic4:
Broadcast authentication and key management for secure sensor networks / Peng Ning ; Donggang Liu5:
Embedded operating systems for wireless micro sensor nodes / Brian Shucker ; Jeff Rose ; Anmol Sheth ; James Carlson ; Shah Bhatti ; Hui Dai ; Jing Deng ; Richard Han6:
Time Synchronization and Calibration in Wireless Sensor Networks / Kay Roemer ; Philipp Blum ; Lennart Meier7:
The Wireless Sensor Network MAC / Edgar H. Callaway8:
Localization in sensor networks / Jonathan Bachrach ; Christopher Taylor9:
Topology construction and maintenance in wireless sensor networks / Jennifer Hou ; Ning Li10:
Energy efficient broadcasting, activity scheduling and area coverage in sensor networks / David Simplot-Ryl ; Jie Wu11:
Geographic and energy aware routing in sensor networks / Hannes Frey12:
Data-centric protocols for wireless sensor networks / 13:
Path exposure, target location, classification and tracking in sensor networks / Kousha Moaveni-Nejad ; XiangYang Li14:
Data gathering and fusion in sensor networks / Wei-Peng Chen15:
Index
Preface
Contributors
Introduction to Wireless Sensor Networking / Fernando Martincic ; Loren Schwiebert1:
2.

電子ブック

EB
Radomir S. Stankovic, Jaakko Astola, Claudio Moraga
出版情報: Wiley Online Library - AutoHoldings Books , Hoboken : John Wiley & Sons, Inc., 2005
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgments
Acronyms
Signals and Their Mathematical Models / 1:
Systems / 1.1:
Signals / 1.2:
Mathematical Models of Signals / 1.3:
References
Fourier Analysis / 2:
Representations of Groups / 2.1:
Complete Reducibility / 2.1.1:
Fourier Transform on Finite Groups / 2.2:
Properties of the Fourier Transform / 2.3:
Matrix Interpretation of the Fourier Transform on Finite Non-Abelian Groups / 2.4:
Complete reducibility
Fast Fourier Transform on Finite Non-Abelian Groups / 2.5:
Matrix Interpretation of the FFT / 3:
Properties of the Fourier transform / 3.1:
Matrix Interpretation of FFT on Finite Non-Abelian Groups
Illustrative Examples / 3.2:
Matrix interpretation of the Fourier transform on finite non-Abelian groups
Complexity of the FFT / 3.3:
Fast Fourier transform on finite non-Abelian groups / 3.3.1:
Complexity of Calculations of the FFT
Remarks on Programming Implememtation of FFT / 3.3.2:
FFT Through Decision Diagrams / 3.4:
Decision Diagrams / 3.4.1:
Matrix interpretation of FFT on finite non-Abelian groups / 3.4.2:
FFT on Finite Non-Abelian Groups Through DDs
MMTDs for the Fourier Spectrum / 3.4.3:
Illustrative examples
Complexity of DDs Calculation Methods / 3.4.4:
Optimization of Decision Diagrams / 4:
Complexity of calculations of the FFT / 4.1:
Reduction Possibilities in Decision Diagrams
Group-Theoretic Interpretation of DD / 4.2:
Remarks on programming implementation of FFT
Fourier Decision Diagrams / 4.3:
FFT through decision diagrams / 4.3.1:
Fourier Decision Trees
Decision diagrams / 4.3.2:
Discussion of Different Decompositions / 4.4:
FFT on finite non-Abelian groups through DDs / 4.4.1:
Algorithm for Optimization of DDs
Representation of Two-Variable Function Generator / 4.5:
MTDDs for the Fourier spectrum
Representation of Adders by Fourier DD / 4.6:
Complexity of DDs calculation methods / 4.7:
Representation of Multipliers by Fourier DD
Complexity of NADD / 4.8:
Fourier DDs with Preprocessing / 4.9:
Matrix-valued Functions / 4.9.1:
Fourier Transform for Matrix-Valued Functions / 4.9.2:
Fourier Decision Trees with Preprocessing / 4.10:
Group-theoretic Interpretation of DD
Fourier Decision Diagrams with Preprocessing / 4.11:
Construction of FNAPDD / 4.12:
Algorithm for Construction of FNAPDD / 4.13:
Fourier decision trees
Algorithm for Representation / 4.13.1:
Fourier decision diagrams / 4.14:
Optimization of FNAPDD
Functional Expressions on Quaternion Groups / 5:
Fourier Expressions on Finite Dyadic Groups / 5.1:
Algorithm for optimization of DDs
Finite Dyadic Groups / 5.1.1:
Representation of adders by Fourier DD / 5.2:
Arithmetic Expressions / 5.3:
Representation of multipliers by Fourier DD / 5.4:
Arithmetic Expressions from Walsh Expansions
Complexity of FNADD / 5.5:
Arithmetic Expressions and Arithmetic-Haar Expressions / 5.5.1:
Arithmetic-Haar Expressions and Kronecker Expressions / 5.5.2:
Matrix-valued functions
Different Polarity Polynomials Expressions / 5.6:
Fourier transform for matrix-valued functions / 5.6.1:
Fixed-Polarity Arithmetic-HaarExpressions / 5.6.2:
Calculation of the Arithmetic-Haar Coefficients / 5.7:
FFT-like Algorithm / 5.7.1:
Calculation of Arithmetic-Haar Coefficients Through Decision Diagrams / 5.7.2:
Gibbs Derivatives on Finite Groups / 6:
Definition and Properties of Gibbs Derivatives on Finite Non-Abelian Groups / 6.1:
Algorithm for representation
Gibbs Anti-Derivative / 6.2:
Partial Gibbs Derivatives / 6.3:
Gibbs Differential Equations / 6.4:
Matrix Interpretation of Gibbs Derivatives / 6.5:
Fast Algorithms for Calculation of Gibbs Derivatives on Finite Groups / 6.6:
Fourier expressions on finite dyadic groups / 6.6.1:
Complexity of Calculation of Gibbs Derivatives
Calculation of Gibbs Derivatives Through DDs / 6.7:
Finite dyadic groups
Calculation of Partial Gibbs Derivatives / 6.7.1:
Fourier Expressions on Q[subscript 2]
Linear Systems on Finite Non-Abelian Groups / 7:
Linear Shift-Invariant Systems on Groups / 7.1:
Linear Shift-Invariant Systems on Finite Non-Abelian Groups / 7.2:
Arithmetic expressions from Walsh expansions
Gibbs Derivatives and Linear Systems / 7.3:
Arithmetic expressions on Q[subscript 2] / 7.3.1:
Discussion
Arithmetic expressions and arithmetic-Haar expressions / 8:
Hilbert Transform on Finite Groups
Some Results of Fourier Analysis on Finite Non-Abelian Groups / 8.1:
Arithmetic-Haar expressions and Kronecker expressions
Hilbert Transform on Finite Non-Abelian Groups / 8.2:
Different Polarity Polynomial Expressions / 8.3:
Hilbert Transform in Finite Fields
Index
Fixed-polarity Fourier expansions in C(Q[subscript 2])
Fixed-polarity arithmetic-Haar expressions
Calculation of the arithmetic-Haar coefficients
FFT-like algorithm
Calculation of arithmetic-Haar coefficients through decision diagrams
Definition and properties of Gibbs derivatives on finite non-Abelian groups
Gibbs anti-derivative
Partial Gibbs derivatives
Gibbs differential equations
Matrix interpretation of Gibbs derivatives
Fast algorithms for calculation of Gibbs derivatives on finite groups
Calculation of Gibbs derivatives through DDs
Calculation of partial Gibbs derivatives
Linear shift-invariant systems on groups
Linear shift-invariant systems on finite non-Abelian groups
Gibbs derivatives and linear systems
Some results of Fourier analysis on finite non-Abelian groups
Hilbert transform on finite non-Abelian groups
Hilbert transform in finite fields
Preface
Acknowledgments
Acronyms
3.

電子ブック

EB
Kaluri Venkata Rangarao, Ranjan K. Mallik, Kaluri V. Rangarao
出版情報: Wiley Online Library - AutoHoldings Books , Chichester : John Wiley & Sons, Inc., 2005
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Preface
Acknowledgements
Processing of Signals / 1:
Organisation of the Book / 1.1:
Classification of Signals / 1.2:
Transformations / 1.3:
Signal Characterisation / 1.4:
Converting Analogue Signals to Digital / 1.5:
Signal Seen by the Computing Engine / 1.6:
It Is Only Numbers / 1.7:
Summary / 1.8:
References
Revisiting the Basics / 2:
Linearity / 2.1:
Linear System Representation / 2.2:
Random Variables / 2.3:
Noise / 2.4:
Propagation of Noise in Linear Systems / 2.5:
Multivariate Functions / 2.6:
Number Systems / 2.7:
Digital Filters / 2.8:
How to Specify a Filter / 3.1:
Moving-Average Filters / 3.2:
Infinite Sequence Generation / 3.3:
Unity-Gain Narrowband Filter / 3.4:
All-Pass Filter / 3.5:
Notch Filter / 3.6:
Other Autoregressive Filters / 3.7:
Adaptive Filters / 3.8:
Demodulating via Adaptive Filters / 3.9:
Phase Shift via Adaptive Filter / 3.10:
Inverse Problems / 3.11:
Kalman Filter / 3.12:
Fourier Transform and Signal Spectrum / 3.13:
Heterodyne Spectrum Analyser / 4.1:
Discrete Fourier Transform / 4.2:
Decimating the Given Sequence / 4.3:
Fast Fourier Transform / 4.4:
Fourier Series Coefficients / 4.5:
Convolution by DFT / 4.6:
DFT in Real Time / 4.7:
Frequency Estimation via DFT / 4.8:
Parametric Spectrum in RF Systems / 4.9:
Realisation of Digital Filters / 4.10:
Evolution / 5.1:
Development Process / 5.2:
Analogue-to-Digital Converters / 5.3:
Second-Order BPF / 5.4:
Pipelining Filters / 5.5:
Real-Time Applications / 5.6:
Frequency Estimator on the DSP5630X / 5.7:
FPGA Implementation of a Kalman Filter / 5.8:
Case Studies / 5.9:
Difference Equation to Program / 6.1:
Estimating Direction of Arrival / 6.2:
Electronic Rotating Elements / 6.3:
Appendix: MATLAB and C Programs / 6.4:
Chapter 1 MATLAB Programs / A.1:
Chapter 2 MATLAB Programs / A.2:
Chapter 3 MATLAB Programs / A.3:
Chapter 4 MATLAB Programs / A.4:
Chapter 5 Programs / A.5:
Chapter 6 MATLAB Programs / A.6:
Library of Subroutines / A.7:
Some Useful Programs / A.8:
Index
Foreword
Preface
Acknowledgements
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼