The carbon-silicon bond-how the humans came to love their electronic devices

28 Haziran 2010 tarihinde İstanbul Şehir Üniversitesi tarafından İstanbul Grand Hyatt Oteli'nde gerçekleştirilen seminerdir.The last half-century has seen the emergence of a new,nonsentient silicon-based lifeform that now shares the planet with the carbon-based lifeform that has dominated the planet for the past several thousand years. Starting from small seeds planted by Shannon and Bardeen in1948, this new lifeform has taken its measure of control of the planet in an astonishingly short time. This emergence has been well-noticed, but not fully appreciated. Our goal is to herald the accomplishments of mathematics, engineering, and computer science that have led to this nearly instantaneous re-invention of the planet, to describe a few of the main results of informatics, and to pay tribute to the great men and women who led this (r)evolution

Algebraic codes on lines, planes, and curves

Algebraic geometry is often employed to encode and decode signals transmitted in communication systems. This book describes the fundamental principles of algebraic coding theory from the perspective of an engineer, discussing a number of applications in communications and signal processing. The principal concept is that of using algebraic curves over finite fields to construct error-correcting codes. The most recent developments are presented including the theory of codes on curves, without the use of detailed mathematics, substituting the intense theory of algebraic geometry with Fourier transform where possible. The author describes the codes and corresponding decoding algorithms in a manner that allows the reader to evaluate these codes against practical applications, or to help with the design of encoders and decoders. This book is relevant to practicing communication engineers and those involved in the design of new communication systems, as well as graduate students and researchers in electrical engineering

150 A Universal Reed-Solomon Decoder

Two architecturesfor universal Reed-Solomon decoders are given. These decoders, called time-domain decoders, work directly on the raw data word as received without the usual syndrome calculation or power-sum-symmetric functions Up to the limitations of the working registers, the decoders can decode any Reed-Solomon codeword or BCH codeword in the presence of both errors and erasures. Provision is also made for decoding extended codes and shortened codes

Fast algorithms for signal processing / Richard E. Blahut.

Includes bibliographical references and index.Book fair 2012.xiii, 453 p. :"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"-

On the asymptotic consistency of minimum divergence and least-squares principles

Euclidean distance is a discrepancy measure between two realvalued functions. Divergence is a discrepancy measure between two positive functions. Corresponding to these two well-known discrepancy measures, there are two inference principles; namely, the least-squares principle for choosing a real-valued function subject to linear constraints, and the minimum-divergence principle for choosing a positive function subject to linear constraints. To make the connection between these two principles more transparent, this correspondence provides an observation and a constructive proof that the minimum-divergence principle reduces to the least-squares principle asymptotically as the positivity requirements are de-emphasized. Hence, these two principles are asymptotically consistent. © 2007 IEEE

Schulz-Snyder Phase Retrieval Algorithm as an Alternating Minimization Algorithm

We derive the Schulz-Snyder phase retrieval algorithm as an alternating minimization method, and discuss its advantages and drawbacks. An annealing-type Schulz-Snyder algorithm is proposed to avoid convergence to nonglobal solutions. Numerical experiments which suggest the effectiveness of the proposed method are presented