Algebraic Shift Register Sequences
- Authors:
- Mark Goresky, Institute for Advanced Study, Princeton, New Jersey
- Andrew Klapper, University of Kentucky
- Date Published: February 2012
- availability: In stock
- format: Hardback
- isbn: 9781107014992
Hardback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
Pseudo-random sequences are essential ingredients of every modern digital communication system including cellular telephones, GPS, secure internet transactions and satellite imagery. Each application requires pseudo-random sequences with specific statistical properties. This book describes the design, mathematical analysis and implementation of pseudo-random sequences, particularly those generated by shift registers and related architectures such as feedback-with-carry shift registers. The earlier chapters may be used as a textbook in an advanced undergraduate mathematics course or a graduate electrical engineering course; the more advanced chapters provide a reference work for researchers in the field. Background material from algebra, beginning with elementary group theory, is provided in an appendix.
Read more- Self-contained chapters make the book accessible to a wide range of students
- Complete proofs are provided and exercises are included in chapters covering basic material
- Provides a unified approach to a wide range of pseudo-random sequences
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: February 2012
- format: Hardback
- isbn: 9781107014992
- length: 514 pages
- dimensions: 258 x 178 x 31 mm
- weight: 1.11kg
- contains: 35 b/w illus. 35 tables 90 exercises
- availability: In stock
Table of Contents
1. Introduction
Part I. Algebraically Defined Sequences:
2. Sequences
3. Linear feedback shift registers and linear recurrences
4. Feedback with carry shift registers and multiply with carry sequences
5. Algebraic feedback shift registers
6. d-FCSRs
7. Galois mode, linear registers, and related circuits
Part II. Pseudo-Random and Pseudo-Noise Sequences:
8. Measures of pseudo-randomness
9. Shift and add sequences
10. M-sequences
11. Related sequences and their correlations
12. Maximal period function field sequences
13. Maximal period FCSR sequences
14. Maximal period d-FCSR sequences
Part III. Register Synthesis and Security Measures:
15. Register synthesis and LFSR synthesis
16. FCSR synthesis
17. AFSR synthesis
18. Average and asymptotic behavior of security measures
Part IV. Algebraic Background: A. Abstract algebra
B. Fields
C. Finite local rings and Galois rings
D. Algebraic realizations of sequences
Bibliography
Index.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×