Skip to Main content Skip to Navigation
Journal articles

Fast Algorithms for Brownian Matrices

Abstract : Brownian motion is one of the most common models used to represent nonstationary signals. The covariance matrix of a discrete-time Brownian motion has a very particular structure, and is called a Brownian matrix. This note presents a number of results concerning linear problems appearing in digital signal processing with Brownian matrices. In particular, it is shown that fast algorithms used for Toeplitz matrices are simpler and faster for Brownian matrices. Examples are given to illustrate the different results presented in the note.
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download
Contributor : Bernard Picinbono <>
Submitted on : Friday, May 4, 2018 - 9:36:36 PM
Last modification on : Wednesday, September 16, 2020 - 4:47:36 PM
Long-term archiving on: : Tuesday, September 25, 2018 - 2:25:55 AM


Files produced by the author(s)


  • HAL Id : hal-01786079, version 1


Bernard Picinbono. Fast Algorithms for Brownian Matrices. IEEE transactions on acoustics, speech, and signal processing, Institute of Electrical and Electronics Engineers (IEEE), 1983, pp.512 - 514. ⟨hal-01786079⟩



Record views


Files downloads