Institution

# Codex Corporation

About: Codex Corporation is a(n) based out in . It is known for research contribution in the topic(s): Network packet & Signal. The organization has 189 authors who have published 241 publication(s) receiving 32205 citation(s).

##### Papers published on a yearly basis

##### Papers

More filters

••

TL;DR: An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data.

Abstract: An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data. The basic properties of the algorithm are discussed and demonstrated by examples. Quite general distortion measures and long blocklengths are allowed, as exemplified by the design of parameter vector quantizers of ten-dimensional vectors arising in Linear Predictive Coded (LPC) speech compression with a complicated distortion measure arising in LPC analysis that does not depend only on the error vector.

7,865 citations

••

01 Mar 1973TL;DR: This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.

Abstract: The Viterbi algorithm (VA) is a recursive optimal solution to the problem of estimating the state sequence of a discrete-time finite-state Markov process observed in memoryless noise. Many problems in areas such as digital communications can be cast in this form. This paper gives a tutorial exposition of the algorithm and of how it is implemented and analyzed. Applications to date are reviewed. Increasing use of the algorithm in a widening variety of areas is foreseen.

5,685 citations

••

TL;DR: In this article, the authors give an overview of the current state of the art in adaptive equalization and discuss the convergence and steady-state properties of least mean square (LMS) adaptation algorithms.

Abstract: Bandwidth-efficient data transmission over telephone and radio channels is made possible by the use of adaptive equalization to compensate for the time dispersion introduced by the channel Spurred by practical applications, a steady research effort over the last two decades has produced a rich body of literature in adaptive equalization and the related more general fields of reception of digital signals, adaptive filtering, and system identification. This tutorial paper gives an overview of the current state of the art in adaptive equalization. In the first part of the paper, the problem of intersymbol interference (ISI) and the basic concept of transversal equalizers are introduced followed by a simplified description of some practical adaptive equalizer structures and their properties. Related applications of adaptive filters and implementation approaches are discussed. Linear and nonlinear receiver structures, their steady-state performance and sensitivity to timing phase are presented in some depth in the next part. It is shown that a fractionally spaced equalizer can serve as the optimum receive filter for any receiver. Decision-feedback equalization, decision-aided ISI cancellation, and adaptive filtering for maximum-likelihood sequence estimation are presented in a common framework. The next two parts of the paper are devoted to a discussion of the convergence and steady-state properties of least mean-square (LMS) adaptation algorithms, including digital precision considerations, and three classes of rapidly converging adaptive equalization algorithms: namely, orthogonalized LMS, periodic or cyclic, and recursive least squares algorithms. An attempt is made throughout the paper to describe important principles and results in a heuristic manner, without formal proofs, using simple mathematical notation where possible.

1,305 citations

01 Sep 1985

TL;DR: This tutorial paper gives an overview of the current state of the art in adaptive equalization and discusses the convergence and steady-state properties of least mean-square (LMS) adaptation algorithms, including digital precision considerations, and three classes of rapidly converging adaptive equalizer algorithms.

Abstract: Bandwidth-efficient data transmission over telephone and radio channels is made possible by the use of adaptive equalization to compensate for the time dispersion introduced by the channel Spurred by practical applications, a steady research effort over the last two decades has produced a rich body of literature in adaptive equalization and the related more general fields of reception of digital signals, adaptive filtering, and system identification. This tutorial paper gives an overview of the current state of the art in adaptive equalization. In the first part of the paper, the problem of intersymbol interference (ISI) and the basic concept of transversal equalizers are introduced followed by a simplified description of some practical adaptive equalizer structures and their properties. Related applications of adaptive filters and implementation approaches are discussed. Linear and nonlinear receiver structures, their steady-state performance and sensitivity to timing phase are presented in some depth in the next part. It is shown that a fractionally spaced equalizer can serve as the optimum receive filter for any receiver. Decision-feedback equalization, decision-aided ISI cancellation, and adaptive filtering for maximum-likelihood sequence estimation are presented in a common framework. The next two parts of the paper are devoted to a discussion of the convergence and steady-state properties of least mean-square (LMS) adaptation algorithms, including digital precision considerations, and three classes of rapidly converging adaptive equalization algorithms: namely, orthogonalized LMS, periodic or cyclic, and recursive least squares algorithms. An attempt is made throughout the paper to describe important principles and results in a heuristic manner, without formal proofs, using simple mathematical notation where possible.

1,185 citations

••

TL;DR: Simulation work is reported indicating that packet reservation multiple access (PRMA) allows a variety of information sources to share the same wireless access channel and achieves a promising combination of voice quality and bandwidth efficiency.

Abstract: Simulation work is reported indicating that packet reservation multiple access (PRMA) allows a variety of information sources to share the same wireless access channel. Some of the sources, such as speech terminals, are classified as periodic and others, such as signaling, are classified as random. Packets from all sources contend for access to channel time slots. When a periodic information terminal succeeds in gaining access, it reserves subsequent time slots for uncontested transmission. Both computer simulations and a listening test reveal that PRMA achieves a promising combination of voice quality and bandwidth efficiency. >

887 citations

##### Authors

Showing all 189 results

Name | H-index | Papers | Citations |
---|---|---|---|

Reinaldo A. Valenzuela | 56 | 265 | 26074 |

Gregory J. Pottie | 45 | 204 | 16464 |

Miriam Leeser | 29 | 195 | 2998 |

M.G. Hluchyj | 24 | 37 | 6090 |

G. David Forney | 17 | 40 | 1539 |

Kevin B. Theobald | 14 | 33 | 1421 |

Shahid U. H. Qureshi | 13 | 19 | 1496 |

Juin-Hwey Chen | 11 | 30 | 951 |

Jr. G.D. Forney | 10 | 11 | 8528 |

Fuyun Ling | 10 | 18 | 1076 |

Lanny L. Parker | 9 | 12 | 234 |

Arthur J. Barabell | 9 | 19 | 909 |

Ahmad H Atriss | 9 | 15 | 405 |

Pierre A. Humblet | 7 | 10 | 277 |

Vedat M. Eyuboglu | 7 | 8 | 535 |