Kooperativer Bibliotheksverbund

UID:

Format: X, 143 S. : graph. Darst.

ISBN: 0-387-97673-6 , 3-540-97673-6

Series Statement: Signal processing and digital filtering

Language: English

Subjects: Engineering , Mathematics

Keywords: Digitale Signalverarbeitung ; Fehlerkorrekturcode ; Fehlererkennungscode ; Algebraische Methode ; Algebraische Codierung ; Signalverarbeitung ; Algebraische Methode ; Digitaltechnik ; Codierungstheorie

Author information: Blahut, Richard E. 1937-

UID:

Format: xxxvii, 935 Seiten : , Illustrationen, Diagramme.

ISBN: 978-1-108-42756-2

Note: Includes bibliographical references

Language: English

Subjects: Engineering , Physics

Keywords: Datenübertragung ; Lichtwellenleiter ; Optische Nachrichtentechnik

Author information: Blahut, Richard E., 1937-

UID:

Format: 1 online resource (xvi, 537 pages) : , digital, PDF file(s).

ISBN: 1-107-15728-5 , 1-280-74958-X , 9786610749584 , 0-511-26482-8 , 0-511-26323-6 , 0-511-26554-9 , 0-511-31729-8 , 0-511-54341-7 , 0-511-26404-6

Content: This book was first published in 2004. In many applications, images, such as ultrasonic or X-ray signals, are recorded and then analyzed with digital or optical processors in order to extract information. Such processing requires the development of algorithms of great precision and sophistication. This book presents a unified treatment of the mathematical methods that underpin the various algorithms used in remote image formation. The author begins with a review of transform and filter theory. He then discusses two- and three-dimensional Fourier transform theory, the ambiguity function, image construction and reconstruction, tomography, baseband surveillance systems, and passive systems (where the signal source might be an earthquake or a galaxy). Information-theoretic methods in image formation are also covered, as are phase errors and phase noise. Throughout the book, practical applications illustrate theoretical concepts, and there are many homework problems. The book is aimed at graduate students of electrical engineering and computer science, and practitioners in industry.

Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; Acknowledgements; 1 Introduction; 2 Signals in one dimension; 3 Signals in two dimensions; 4 Optical imaging systems; 5 Antenna systems; 6 The ambiguity function; 7 Radar imaging systems; 8 Diffraction imaging systems; 9 Construction and reconstruction of images; 10 Tomography; 11 Likelihood and information methods; 12 Radar search systems; 13 Passive and baseband surveillance systems; 14 Data combination and tracking; 15 Phase noise and phase distortion; References; Index , English

Additional Edition: ISBN 1-107-40452-5

Additional Edition: ISBN 0-521-55373-3

Language: English

URL: Volltext

URL: Inhaltstext

URL: https://doi.org/10.1017/CBO9780511543418

UID:

Format: 1 online resource (xxxvii, 935 pages) : , digital, PDF file(s).

ISBN: 1-108-64011-7 , 1-108-63028-6 , 1-108-55174-2

Content: This pioneering, course-tested text is the first to combine communications theory with the physics of optical communications. Comprehensive and rigorous, it brings together an in-depth treatment of the physical characteristics of the guided lightwave channel with the study of modern methods of algorithmic-based communication in time and space. The many different levels at which a lightwave communication signal can be described are integrated to provide a unified explanation of how a commonplace bit stream is transformed into a physical lightwave, how that lightwave travels through an optical fiber, and how it is then transformed back into the bit stream. Background fundamentals such as linear systems and electromagnetics are explained in relation to modern topics such as channel models, encoding, modulation and interference, and end-of-chapter problems are provided throughout. This is an essential text for students taking courses on optical communications, as well as researchers and professionals working in the area.

Note: Title from publisher's bibliographic system (viewed on 26 Mar 2019).

Additional Edition: ISBN 1-108-42756-1

Language: English

URL: lizenzpflichtig

URL: https://doi.org/10.1017/9781108551748

UID:

Format: 448 S. : , graph. Darst.

ISBN: 0-201-10155-6

Uniform Title: Fast algorithms for digital signal processing

Note: In kyrill. Schr., russ.

Language: Russian

Subjects: Computer Science

Keywords: Digitale Signalverarbeitung ; Algorithmus

Author information: Blahut, Richard E. 1937-

UID:

Format: 1 online resource (xvii, 587 pages) : , digital, PDF file(s).

ISBN: 1-139-69865-6 , 1-139-86165-4 , 1-139-01367-X

Content: Today's pervasive computing and communications networks have created an intense need for secure and reliable cryptographic systems. Bringing together a fascinating mixture of topics in engineering, mathematics, computer science, and informatics, this book presents the timeless mathematical theory underpinning cryptosystems both old and new. Major branches of classical and modern cryptography are discussed in detail, from basic block and stream cyphers through to systems based on elliptic and hyperelliptic curves, accompanied by concise summaries of the necessary mathematical background. Practical aspects such as implementation, authentication and protocol-sharing are also covered, as are the possible pitfalls surrounding various cryptographic methods. Written specifically with engineers in mind, and providing a solid grounding in the relevant algorithms, protocols and techniques, this insightful introduction to the foundations of modern cryptography is ideal for graduate students and researchers in engineering and computer science, and practitioners involved in the design of security systems for communications networks.

Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Machine generated contents note: 1.Introduction -- 1.1.Classical cryptography -- 1.2.Notions of cryptographic secrecy -- 1.3.Block ciphers -- 1.4.Stream ciphers -- 1.5.Public-key cryptography -- 1.6.Iterated and cascade ciphers -- 1.7.Cryptanalysis -- 1.8.Implementation attacks -- 1.9.Complexity theory -- 1.10.Authentication and identification -- 1.11.Ownership protection -- 1.12.Covert communications -- 1.13.History of information protection -- 2.The integers -- 2.1.Basic number theory -- 2.2.The euclidean algorithm -- 2.3.Prime fields -- 2.4.Quadratic residues -- 2.5.Quadratic reciprocity -- 2.6.The Jacobi symbol -- 2.7.Primality testing -- 2.8.The Fermat algorithm -- 2.9.The Solovay--Strassen algorithm -- 2.10.The Miller--Rabin algorithm -- 2.11.Factoring of integers -- 2.12.The Pollard algorithm for factoring -- 2.13.Square roots in a prime field -- 3.Cryptography based on the integer ring -- 3.1.Biprime cryptography -- 3.2.Implementing biprime cryptography -- , Contents note continued: 13.8.Representations of binary fields -- 13.9.Multiplication and squaring in a binary field -- 13.10.Complementary bases -- 13.11.Division in a finite field -- 14.Cryptographic protocols for security and identification -- 14.1.Protocols for cryptographic security -- 14.2.Identification protocols -- 14.3.Zero-knowledge protocols -- 14.4.Methods of secure identification -- 14.5.Signature protocols -- 14.6.Protocols for secret sharing -- 15.More public-key cryptography -- 15.1.Introduction to lattices -- 15.2.Elementary problems in lattice theory -- 15.3.Reduction of a lattice basis -- 15.4.Lattice-based cryptography -- 15.5.Attacks on lattice cryptosystems -- 15.6.Introduction to codes -- 15.7.Subspace projection -- 15.8.Code-based cryptography. , Contents note continued: 11.16.Some examples of the jacobian group -- 12.Cryptography based on bilinear pairings -- 12.1.Bilinear pairings -- 12.2.Pairing-based cryptography -- 12.3.Pairing-based key exchange -- 12.4.Identity-based encryption -- 12.5.Pairing-based signatures -- 12.6.Attacks on the bilinear Diffie--Hellman protocol -- 12.7.Torsion points and embedding degree -- 12.8.The torsion structure theorem -- 12.9.The structure of a pairing -- 12.10.Attacks using bilinear pairings -- 12.11.The Tate pairing -- 12.12.The Miller algorithm -- 12.13.The Weil pairing -- 12.14.Pairing-friendly curves -- 12.15.Barreto--Naehrig elliptic curves -- 12.16.More pairing-friendly curves -- 13.Implementation -- 13.1.Pairing enhancements -- 13.2.Accelerated pairings -- 13.3.Doubling and tripling -- 13.4.Point representations -- 13.5.Algorithms for elliptic-curve arithmetic -- 13.6.Modular addition in an integer ring -- 13.7.Modular multiplication in an integer ring -- , Contents note continued: 10.11.Point counting in an extension field -- 10.12.Morphisms of elliptic curves over the rationals -- 10.13.Morphisms of elliptic curves over finite fields -- 10.14.Point counting in a ground field -- 10.15.The method of xedni calculus -- 10.16.Elliptic curves and the complex field -- 10.17.Curves constructed using complex multiplication -- 11.Cryptography based on hyperelliptic curves -- 11.1.Hyperelliptic curves -- 11.2.Coordinate rings and function fields -- 11.3.Poles and zeros -- 11.4.Divisors -- 11.5.Principal divisors -- 11.6.Principal divisors on elliptic curves -- 11.7.Jacobians as quotient groups -- 11.8.The group of a hyperelliptic curve -- 11.9.Semireduced divisors and jacobians -- 11.10.The Mumford transform -- 11.11.The Cantor reduction algorithm -- 11.12.Reduced divisors and jacobians -- 11.13.The Cantor--Koblitz algorithm -- 11.14.Hyperelliptic-curve cryptography -- 11.15.Order of the hyperelliptic jacobians -- , Contents note continued: 8.8.Practical hash functions -- 9.Groups, rings, and fields -- 9.1.Groups -- 9.2.Rings -- 9.3.Fields -- 9.4.Prime fields -- 9.5.Binary fields and ternary fields -- 9.6.Univariate polynomials -- 9.7.Extension fields -- 9.8.The multiplication cycle in a finite field -- 9.9.Cyclotomic polynomials -- 9.10.Vector spaces -- 9.11.Linear algebra -- 9.12.The Fourier transform -- 9.13.Existence of finite fields -- 9.14.Bivariate polynomials -- 9.15.Modular reduction and quotient groups -- 9.16.Factoring of univariate polynomials -- 10.Cryptography based on elliptic curves -- 10.1.Elliptic curves -- 10.2.Elliptic curves over finite fields -- 10.3.The operation of point addition -- 10.4.The order of an elliptic curve -- 10.5.The group of an elliptic curve -- 10.6.Supersingular elliptic curves -- 10.7.Elliptic curves over binary fields -- 10.8.Computation of point multiples -- 10.9.Elliptic curve cryptography -- 10.10.The projective plane -- , Contents note continued: 6.Block ciphers -- 6.1.Block substitution -- 6.2.The Feistel network -- 6.3.The Data Encryption Standard -- 6.4.Using the Data Encryption Standard -- 6.5.Double and triple DES encryption -- 6.6.The Advanced Encryption Standard -- 6.7.Differential cryptanalysis -- 6.8.Linear cryptanalysis -- 7.Stream ciphers -- 7.1.State-dependent encryption -- 7.2.Additive stream ciphers -- 7.3.Linear shift-register sequences -- 7.4.The linear-complexity attack -- 7.5.Analysis of linear complexity -- 7.6.Keystreams from nonlinear feedback -- 7.7.Keystreams from nonlinear combining -- 7.8.Keystreams from nonlinear functions -- 7.9.The correlation attack -- 7.10.Pseudorandom sequences -- 7.11.Nonlinear sets of sequences -- 8.Authentication and ownership protection -- 8.1.Authentication -- 8.2.Identification -- 8.3.Authentication signatures -- 8.4.Hash functions -- 8.5.The birthday attack -- 8.6.Iterated hash constructions -- 8.7.Formal hash functions -- , Contents note continued: 3.3.Protocol attacks on biprime cryptography -- 3.4.Direct attacks on biprime encryption -- 3.5.Factoring biprimes -- 3.6.The quadratic sieve -- 3.7.The number-field sieve -- 3.8.The Rabin cryptosystem -- 3.9.The rise and fall of knapsack cryptosystems -- 4.Cryptography based on the discrete logarithm -- 4.1.Diffie--Hellman key exchange -- 4.2.Discrete logarithms -- 4.3.The Elgamal cryptosystem -- 4.4.Trapdoor one-way functions -- 4.5.The Massey--Omura cryptosystem -- 4.6.The Pohlig--Hellman algorithm -- 4.7.The Shanks algorithm -- 4.8.The Pollard algorithm for discrete logarithms -- 4.9.The method of index calculus -- 4.10.Complexity of the discrete-log problem -- 5.Information-theoretic methods in cryptography -- 5.1.Probability space -- 5.2.Entropy -- 5.3.Perfect secrecy -- 5.4.The Shannon--McMillan theorem -- 5.5.Unicity distance -- 5.6.Entropy of natural language -- 5.7.Entropy expansion -- 5.8.Data compaction -- 5.9.The wiretap channel -- , English

Additional Edition: ISBN 1-107-01427-1

Language: English

Keywords: Lehrbuch

URL: Volltext

URL: Volltext

URL: https://doi.org/10.1017/CBO9781139013673

UID:

Format: 1 online resource (xiv, 497 pages) : , digital, PDF file(s).

Edition: 1st ed.

ISBN: 1-107-20948-X , 1-282-65282-6 , 9786612652820 , 0-511-81140-3 , 0-511-68782-6 , 0-511-69007-X , 0-511-69267-6 , 0-511-69155-6 , 0-511-69081-9 , 0-511-68933-0

Content: "At the heart of any modern communication system is the modem, connecting the data source to the communication channel. This first course in the mathematical theory of modem design introduces the theory of digital modulation and coding that underpins the design of digital telecommunications systems. A detailed treatment of core subjects is provided, including baseband and passband modulation and demodulation, equalization, and sequence estimation. The modulation waveforms for communication channels and digital recording channels are treated in a common setting and with unified terminology. A variety of more advanced topics is also covered, such as trellis codes, turbo codes, the Viterbi algorithm, block codes, maximum likelihood and maximum posterior probability, iterative demodulation, and jamming. Numerous end-of-chapter exercises are also included to test the reader's understanding throughout. This insightful book is ideal for senior undergraduate students studying digital communications and is also a useful reference for practicing engineers"--Provided by publisher.

Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Baseband Modulation -- Baseband Demodulation -- Sequences at Baseband -- Passband Modulation -- Passband Demodulation -- Principles of Optimal Demodulation -- Synchronization -- Codes for Digital Modulation -- Codes for Data Transmission -- Performance of Practical Demodulators -- Secure Communications. , English

Additional Edition: ISBN 0-521-78014-4

Language: English

URL: Volltext

URL: Inhaltstext

URL: https://doi.org/10.1017/CBO9780511811401

UID:

Format: XII, 482 S. , graph. Darst.

Edition: 1. publ.

ISBN: 0521553741 , 9780521553742 , 9780521556590

Note: Includes bibliographical references and index

Language: English

Subjects: Engineering , Mathematics

Keywords: Datenübertragung ; Fehlerbehandlung ; Algebra ; Signalverarbeitung ; Datenübertragung ; Fehlererkennungscode

URL: Publisher description

URL: Table of contents

Author information: Blahut, Richard E. 1937-

UID:

Format: 1 online resource (xix, 543 pages) : , digital, PDF file(s).

ISBN: 1-107-17406-6 , 1-281-25436-3 , 9786611254360 , 0-511-38761-X , 0-511-38660-5 , 0-511-38477-7 , 0-511-38294-4 , 0-511-54340-9 , 0-511-38860-8

Content: The past few years have witnessed significant developments in algebraic coding theory. This book provides an advanced treatment of the subject from an engineering perspective, covering the basic principles and their application in communications and signal processing. Emphasis is on codes defined on the line, on the plane, and on curves, with the core ideas presented using commutative algebra and computational algebraic geometry made accessible using the Fourier transform. Starting with codes defined on a line, a background framework is established upon which the later chapters concerning codes on planes, and on curves, are developed. The decoding algorithms are developed using the standard engineering approach applied to those of Reed-Solomon codes, enabling them to be evaluated against practical applications. Integrating recent developments in the field into the classical treatment of algebraic coding, this is an invaluable resource for graduate students and researchers in telecommunications and applied mathematics.

Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Sequences and the one-dimensional Fourier transform -- The Fourier transform and cyclic codes -- The many decoding algorithms for Reed-Solomon codes -- Within or beyond the packing radius -- Arrays and the two-dimensional Fourier transform -- The Fourier transform and bicyclic codes -- Arrays and the algebra of bivariate polynomials -- Computation of minimal bases -- Curves, surfaces, and vector spaces -- Codes on curves and surfaces -- Other representations of codes on curves -- The many decoding algorithms for codes on curves. , English

Additional Edition: ISBN 0-521-77194-3

Language: English

URL: https://doi.org/10.1017/CBO9780511543401

UID:

Format: 1 online resource (xiii, 453 pages) : , digital, PDF file(s).

ISBN: 1-107-20392-9 , 1-282-72337-5 , 9786612723377 , 0-511-77561-X , 0-511-77637-3 , 0-511-77379-X , 0-511-77272-6 , 0-511-76092-2 , 0-511-77485-0

Content: Efficient signal processing algorithms are important for embedded and power-limited applications since, by reducing the number of computations, power consumption can be reduced significantly. Similarly, efficient algorithms are also critical to very large scale applications such as video processing and four-dimensional medical imaging. This self-contained guide, the only one of its kind, enables engineers to find the optimum fast algorithm for a specific application. It presents a broad range of computationally-efficient algorithms, describes their structure and implementation, and compares their relative strengths for given problems. All the necessary background mathematics is included and theorems are rigorously proved, so all the information needed to learn and apply the techniques is provided in one convenient guide. With this practical reference, researchers and practitioners in electrical engineering, applied mathematics, and computer science can reduce power dissipation for low-end applications of signal processing, and extend the reach of high-end applications.

Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , 1. Introduction -- 2. Introduction to abstract algebra -- 3. Fast algorithms for the discrete Fourier transform -- 4. Fast algorithms based on doubling strategies -- 5. Fast algorithms for short convolutions -- 6. Architecture of filters and transforms -- 7. Fast algorithms for solving Toeplitz systems -- 8. Fast algorithms for trellis search -- 9. Numbers and fields -- 10. Computation in finite fields and rings -- 11. Fast algorithms and multidimensional convolutions -- 12. Fast algorithms and multidimensional transforms; Appendices: A.A collection of cyclic convolution algorithms; B.A collection of Winograd small FFT algorithms. , English

Additional Edition: ISBN 0-511-77118-5

Additional Edition: ISBN 0-521-19049-5

Language: English

URL: https://doi.org/10.1017/CBO9780511760921