SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Martin C.) srt2:(1976-1979)"

Sökning: WFRF:(Martin C.) > (1976-1979)

  • Resultat 1-3 av 3
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  • Kailath, Thomas, et al. (författare)
  • Fast Time-Invariant Implementations of Gaussian Signal Detectors
  • 1978
  • Ingår i: IEEE Transactions on Information Theory. - : IEEE Information Theory Society. - 0018-9448 .- 1557-9654. ; 24:4, s. 469-477
  • Tidskriftsartikel (refereegranskat)abstract
    • A new implementation is presented for the optimum likelihood ratio detector for stationary Gaussian signals in white Gaussian noise that uses only two causal time-invariant filters. This solution also has the advantage that fast algorithms based on the Levinson and Chandrasekhar equations can he used for the determination of these time-invariant filters. By using a notion of "closeness to stationarity,' there is a natural extension of the above results for nonstationary signal processes.
  •  
3.
  • Levy, Bernard C., et al. (författare)
  • Fast Time-Invariant Implementations for Linear Least-Squares Smoothing Filters
  • 1978
  • Ingår i: Proceedings of the 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes. ; , s. 1156-1159
  • Konferensbidrag (refereegranskat)abstract
    • We present a new solution for the fixed interval linear least-squares smoothing of a stationary random signal in additive white noise. By using the generalized Sobolev identity for the Fredholm resolvent of a covariance kernel, the smoothed estimate is expressed entirely in terms of time-invariant causal and anticausal filtering operations. These operations are interpreted from a stochastic point of view as giving some constrained (time-invariant) filtered estimates of the signal. From a computational point of view, the implementation presented here is particularly convenient, not only because time-invariant filters can be used to find the smoothed estimate, but also because a fast algorithm based on Levinson recursions can be used to compute the time-invariant filters themselves.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-3 av 3

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy