• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

The construction of Huffman codes is a submodular (”convex”) optimization problem (1999)

by D Stott Parker, Prasad Ram
Venue:SIAM J. Comput
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

ON INSTANTANEOUS CODES

by Stephan Foldes A, Navin M. Singhi B, Stephan Foldes, Navin M. Singhi , 2004
"... R u t c o r ..."
Abstract - Add to MetaCart
R u t c o r

Finite Length Sequences in On-Line System Identification

by unknown authors
"... Abstract — This paper presents a scheme for the rapid measurement of weighting sequences of in-operation linear systems. Finite duration sequences are used as test signals to the system under test, whose response to the sequence is processed by an appropriate digital filter. The test sequences are h ..."
Abstract - Add to MetaCart
Abstract — This paper presents a scheme for the rapid measurement of weighting sequences of in-operation linear systems. Finite duration sequences are used as test signals to the system under test, whose response to the sequence is processed by an appropriate digital filter. The test sequences are here required to have high energy ratio and low sidelobes in their autocorrelation function. It is shown that in the absence of noise an inverse filter is optimum while in very heavy noise matched filter is the best.
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University