Picture of server farm and IT infrastructure

Where technology & law meet: Open Access research on data security & its regulation ...

Strathprints makes available Open Access scholarly outputs exploring both the technical aspects of computer security, but also the regulation of existing or emerging technologies. A research specialism of the Department of Computer & Information Sciences (CIS) is computer security. Researchers explore issues surrounding web intrusion detection techniques, malware characteristics, textual steganography and trusted systems. Digital forensics and cyber crime are also a focus.

Meanwhile, the School of Law and its Centre for Internet Law & Policy undertake studies on Internet governance. An important component of this work is consideration of privacy and data protection questions and the increasing focus on cybercrime and 'cyberterrorism'.

Explore the Open Access research by CIS on computer security or the School of Law's work on law, technology and regulation. Or explore all of Strathclyde's Open Access research...

Non-linear minimum variance estimation for discrete-time multi-channel systems

Grimble, Mike J. and Naz, Shamsher Ali (2009) Non-linear minimum variance estimation for discrete-time multi-channel systems. IEEE Transactions on Signal Processing, 57 (7). pp. 2437-2444. ISSN 1053-587X

[img]
Preview
PDF (IEEE_Transactions_on_signal_processing.pdf)
IEEE_Transactions_on_signal_processing.pdf
Accepted Author Manuscript

Download (1MB) | Preview

Abstract

A nonlinear operator approach to estimation in discrete-time systems is described. It involves inferential estimation of a signal which enters a communications channel involving both nonlinearities and transport delays. The measurements are assumed to be corrupted by a colored noise signal which is correlated with the signal to be estimated. The system model may also include a communications channel involving either static or dynamic nonlinearities. The signal channel is represented in a very general nonlinear operator form. The algorithm is relatively simple to derive and to implement.