Sequence Detection for High-Density Storage Channels


Book Description

Magnetic data storage can be viewed as a data communication system. This is not a sUlprising view, considering that data storage is essentially the transfer of data between different times. The past decade has indeed seen rapidly growing interest in applying improved coding and detection techniques to magnetic data storage, a traditional approach to enhance performance of communication channels. Since its inception in the 1930's, the magnetic recording industry has achieved impressive progress in data capacity. This has been made possible mainly by innovations and advances in heads and media design. However, as the demand for higher storage capacity continues in the modem information era, a need arises to explore other possibilities to help meet the ever-growing demand. Advanced coding and detection are one such possibility, providing an efficient, cost-effective means to increase data capacity. In fact, with the advent of modem Ie technology which has enabled real-time implementation of increasingly complex signal processing algorithms, advanced coding and detection are rapidly becoming a major issue in the development of improved data storage products. While there have been remarkable advances in recent years in the areas of both coding and detection for data storage, this book focuses only on data detection, or the processing of readback waveforms to reproduce stored data, in conjunction with the traditional modulation coding method called run length-limited or (d,k) coding.




Conference Record


Book Description







Computational Geometry


Book Description

From the reviews: "This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry. ... ... The book is well organized and lucidly written; a timely contribution by two founders of the field. It clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics. It also points the way to the solution of the more challenging problems in dimensions higher than two." #Mathematical Reviews#1 "... This remarkable book is a comprehensive and systematic study on research results obtained especially in the last ten years. The very clear presentation concentrates on basic ideas, fundamental combinatorial structures, and crucial algorithmic techniques. The plenty of results is clever organized following these guidelines and within the framework of some detailed case studies. A large number of figures and examples also aid the understanding of the material. Therefore, it can be highly recommended as an early graduate text but it should prove also to be essential to researchers and professionals in applied fields of computer-aided design, computer graphics, and robotics." #Biometrical Journal#2




Real-Time Collision Detection


Book Description

Written by an expert in the game industry, Christer Ericson's new book is a comprehensive guide to the components of efficient real-time collision detection systems. The book provides the tools and know-how needed to implement industrial-strength collision detection for the highly detailed dynamic environments of applications such as 3D games, virt




Planning Algorithms


Book Description

Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace applications, drug design, and protein folding. Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this is the only book on this topic that tightly integrates a vast body of literature from several fields into a coherent source for teaching and reference in a wide variety of applications. Difficult mathematical material is explained through hundreds of examples and illustrations.




Modern B-Tree Techniques


Book Description

Invented about 40 years ago and called ubiquitous less than 10 years later, B-tree indexes have been used in a wide variety of computing systems from handheld devices to mainframes and server farms. Over the years, many techniques have been added to the basic design in order to improve efficiency or to add functionality. Examples include separation of updates to structure or contents, utility operations such as non-logged yet transactional index creation, and robust query processing such as graceful degradation during index-to-index navigation. Modern B-Tree Techniques reviews the basics of B-trees and of B-tree indexes in databases, transactional techniques and query processing techniques related to B-trees, B-tree utilities essential for database operations, and many optimizations and improvements. It is intended both as a tutorial and as a reference, enabling researchers to compare index innovations with advanced B-tree techniques and enabling professionals to select features, functions, and tradeoffs most appropriate for their data management challenges.




Geometric Data Structures for Computer Graphics


Book Description

This book focuses on algorithms and geometric data structures that have proven to be versatile, efficient and fundamental. It endows practitioners in the computer graphics field with a working knowledge of a wide range of geometric data structures from computational geometry.




Scientific and Technical Aerospace Reports


Book Description

Lists citations with abstracts for aerospace related reports obtained from world wide sources and announces documents that have recently been entered into the NASA Scientific and Technical Information Database.




Computational Complexity


Book Description

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.