SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "L773:0278 081X OR L773:1531 5878 "

Search: L773:0278 081X OR L773:1531 5878

  • Result 1-32 of 32
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Blad, Anton, et al. (author)
  • Integer Linear Programming-Based Bit-Level Optimization for High-Speed FIR Decimation Filter Architectures
  • 2010
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : Springer Science and Business Media LLC. - 0278-081X .- 1531-5878. ; 29:1, s. 81-101
  • Journal article (peer-reviewed)abstract
    • Analog-to-digital converters based on sigma-delta modulation have shown promising performance, with steadily increasing bandwidth. However, associated with the increasing bandwidth is an increasing modulator sampling rate, which becomes costly to decimate in the digital domain. Several architectures exist for the digital decimation filter, and among the more common and efficient are polyphase decomposed finite-length impulse response (FIR) filter structures. In this paper, we consider such filters implemented with partial product generation for the multiplications, and carry-save adders to merge the partial products. The focus is on the efficient pipelined reduction of the partial products, which is done using a bit-level optimization algorithm for the tree design. However, the method is not limited only to filter design, but may also be used in other applications where high-speed reduction of partial products is required. The presentation of the reduction method is carried out through a comparison between the main architectural choices for FIR filters: the direct-form and transposed direct-form structures. For the direct-form structure, usage of symmetry adders for linear-phase filters is investigated, and a new scheme utilizing partial symmetry adders is introduced. The optimization results are complemented with energy dissipation and cell area estimations for a 90 nm CMOS process.
  •  
2.
  •  
3.
  • Eghbali, Amir, et al. (author)
  • A Class of Multimode Transmultiplexers Based on the Farrow Structure
  • 2012
  • In: Circuits, systems, and signal processing. - : Springer Verlag (Germany). - 0278-081X .- 1531-5878. ; 31:3, s. 961-985
  • Journal article (peer-reviewed)abstract
    • This paper introduces multimode transmultiplexers (TMUXs) in which the Farrow structure realizes the polyphase components of general lowpass interpolation/decimation filters. As various lowpass filters are obtained by one set of common Farrow subfilters, only one offline filter design enables us to cover different integer sampling rate conversion (SRC) ratios. A model of general rational SRC is also constructed where the same fixed subfilters perform rational SRC. These two SRC schemes are then used to construct multimode TMUXs. Efficient implementation structures are introduced and different filter design techniques such as minimax and least-squares (LS) are discussed. By means of simulation results, it is shown that the performance of the transmultiplexer (TMUX) depends on the ripples of the filters. With the error vector magnitude (EVM) as the performance metric, the LS method has a superiority over the minimax approach.
  •  
4.
  • Eghbali, Amir, et al. (author)
  • Flexible Frequency-Band Reallocation : Complex Versus Real
  • 2009
  • In: Circuits, systems, and signal processing. - : Springer Science and Business Media LLC. - 0278-081X .- 1531-5878. ; 28:3, s. 409-431
  • Journal article (peer-reviewed)abstract
    • This paper discusses a new approach for implementing flexible frequency-band reallocation (FFBR) networks for bentpipe satellite payloads which are based on variable oversampled complex-modulated filter banks (FBs). We consider two alternatives to process real signals using real input/output and complex input/output FFBR networks (or simply real and complex FFBR networks, respectively). It is shown that the real case has a lower overall number of processing units, i.e., adders and multipliers, compared to its complex counterpart. In addition, the real system eliminates the need for two Hilbert transformers, further reducing the arithmetic complexity. An analysis of the computational workload shows that the real case has a smaller rate of increase in the arithmetic complexity with respect to the prototype filter order and number of FB channels. This makes the real case suitable for systems with a large number of users. Furthermore, in the complex case, a high efficiency in FBR comes at the expense of high-order Hilbert transformers; thus, trade-offs are necessary. Finally, the performance of the two alternatives based on the error vector magnitude (EVM) for a 16-quadrature amplitude modulation (QAM) signal is presented.
  •  
5.
  • Emadi, Mohammad, et al. (author)
  • A Performance Guarantee for Orthogonal Matching Pursuit Using Mutual Coherence
  • 2018
  • In: Circuits, systems, and signal processing. - : Springer. - 0278-081X .- 1531-5878. ; 37:4, s. 1562-1574
  • Journal article (peer-reviewed)abstract
    • In this paper, we present a new performance guarantee for the orthogonal matching pursuit (OMP) algorithm. We use mutual coherence as a metric for determining the suitability of an arbitrary overcomplete dictionary for exact recovery. Specifically, a lower bound for the probability of correctly identifying the support of a sparse signal with additive white Gaussian noise and an upper bound for the mean square error is derived. Compared to the previous work, the new bound takes into account the signal parameters such as dynamic range, noise variance, and sparsity. Numerical simulations show significant improvements over previous work and a much closer correlation to empirical results of OMP.
  •  
6.
  • Gustafsson, Oscar, 1973-, et al. (author)
  • Simplified Design of Constant Coefficient Multipliers
  • 2006
  • In: Circuits, systems, and signal processing. - : Springer Science and Business Media LLC. - 0278-081X .- 1531-5878. ; 25:2, s. 225-251
  • Journal article (peer-reviewed)abstract
    • In many digital signal processing algorithms, e.g., linear transforms and digital filters, the multiplier coefficients are constant. Hence, it is possible to implement the multiplier using shifts, adders, and subtracters. In this work two approaches to realize constant coefficient multiplication with few adders and subtracters are presented. The first yields optimal results, i.e., a minimum number of adders and subtracters, but requires an exhaustive search. Compared with previous optimal approaches, redundancies in the exhaustive search cause the search time to be drastically decreased. The second is a heuristic approach based on signed-digit representation and subexpression sharing. The results for the heuristic are worse in only approximately 1% of all coefficients up to 19 bits. However, the optimal approach results in several different optimal realizations, from which it is possible to pick the best one based on other criteria. Relations between the number of adders, possible coefficients, and number of cascaded adders are presented, as well as exact equations for the number of required full and half adder cells. The results show that the number of adders and subtracters decreases on average 25% for 19-bit coefficients compared with the canonic signed-digit representation.
  •  
7.
  • Gustafsson, Oscar, 1973-, et al. (author)
  • Single Filter Frequency Masking High-Speed Recursive Digital Filters
  • 2003
  • In: Circuits, systems, and signal processing. - : Springer Science and Business Media LLC. - 0278-081X .- 1531-5878. ; 22:2, s. 219-238
  • Journal article (peer-reviewed)abstract
    • For recursive filter the maximal sample frequency is bounded by the recursive loops in the filter. [In this paper, it is understood that recursive filters are infinite-length impulse response (IIR) filters.] In this work, a filter structure based on the use of the frequency masking approach is presented that increases the maximal sample frequency for narrowband and wideband filters by introducing more delay elements in the recursive loops. By using identical subfilters (except for the periods), the subfilters can be mapped using folding to a single pipeline/interleaved arithmetic structure yielding an area-efficient implementation. The filters are potentially suitable for low-power implementation by using power supply voltage scaling techniques. In this work, the design of the filters is discussed and estimations of the ripples are derived. Two examples show the viability of the proposed method.
  •  
8.
  • Johansson, Håkan, 1969-, et al. (author)
  • Two-channel FIR filter banks utilizing the FRM approach
  • 2003
  • In: Circuits, systems, and signal processing. - 0278-081X .- 1531-5878. ; 22:2, s. 157-192
  • Journal article (peer-reviewed)abstract
    • The frequency-response masking (FRM) approach has been introduced as a means of generating narrow transition band linear-phase finite impulse response (FIR) filters with a low arithmetic complexity. This paper proposes an approach for synthesizing two-channel maximally decimated FIR filter banks utilizing the FRM technique. For this purpose, a new class of FRM filters is introduced. Filters belonging to this class are used for synthesizing nonlinear-phase analysis and synthesis filters for two types of two-channel filter banks. For the first type, there exist no phase distortion and aliasing errors, but this type suffers from a small amplitude distortion as for the well-known quadrature mirror filter (QMF) banks. Compared to conventional QMF filter banks, the proposed banks lower significantly the overall arithmetic complexity at the expense of a somewhat increased overall filter bank delay in applications demanding narrow transition bands. For the second type, there are also small aliasing errors, allowing one to reduce the arithmetic complexity even further. Efficient structures are introduced for implementing the proposed filter banks, and algorithms are described for maximizing the stopband attenuations of the analysis and synthesis filters in the minimax sense subject to the given allowable amplitude and/or aliasing errors. Examples are included illustrating the benefits provided by the proposed filter banks.
  •  
9.
  • Johansson, Håkan, 1969- (author)
  • Two classes of frequency-response masking linear-phase FIR filters for interpolation and decimation
  • 2006
  • In: Circuits, systems, and signal processing. - : Springer Science and Business Media LLC. - 0278-081X .- 1531-5878. ; 25:2, s. 175-200
  • Journal article (peer-reviewed)abstract
    • This paper introduces two classes of frequency-response masking (FRM) linear-phase finite (length) impulse response (FIR) filters for interpolation and decimation by arbitrary integer factors M. As they are based on the FRM approach, the proposed filters are low-complexity (efficient) sharp-transition linear-phase FIR interpolation and decimation filters. Compared to previously existing FRM linear-phase FIR filter classes for interpolation and decimation, the new ones offer lower complexity and more freedom in selecting the locations of the passband and stopband edges. Furthermore, the proposed classes of FRM filters can, as special cases, realize efficient Mth-band FRM linear-phase FIR interpolation and decimation filters for all values of M. Previously, only half-band (M = 2) FRM linear-phase FIR filters have appeared in the literature. The paper includes design techniques suitable forthe new filters and design examples illustrating their efficiency. © Birkhauser Boston 2006.
  •  
10.
  • Larsson, Erik G., et al. (author)
  • The Cramer-Rao Bound for Continuous-Time Autoregressive Parameter Estimation with Irregular Sampling
  • 2002
  • In: Circuits, systems, and signal processing. - : Springer Science and Business Media LLC. - 0278-081X .- 1531-5878. ; 21:6, s. 581-601
  • Journal article (peer-reviewed)abstract
    • We consider the problem of estimating the parameters in a continuous-time autoregressive model given measurements taken at arbitrary time instants. This problem is of importance in applications ranging from time-series analysis to automatic control. We derive the Cramer-Rao bound (CRB) for this estimation problem by using a technique based on the Slepian-Bang's formula and residue calculus. Furthermore, we investigate by means of numerical experiments how different sampling schemes can affect the achievable estimation accuracy. We demonstrate that the achievable estimation accuracy is relatively insensitive to the choice of sampling strategy, even though it is generally not identical for different sampling schemes. This observation is also in line with recent results on parameter estimation for polynomial-phase signals. Finally, we discuss the asymptotic properties ofthe CRB.
  •  
11.
  • Larsson, Erik K., et al. (author)
  • An overview of important practical aspects of continuous-time ARMA system identification
  • 2006
  • In: Circuits, systems, and signal processing. - : Springer Science and Business Media LLC. - 0278-081X .- 1531-5878. ; 25:1, s. 17-46
  • Journal article (peer-reviewed)abstract
    • The problem of estimating the parameters in continuous-time autoregressive moving average (ARMA) processes from discrete-time data is considered. Both direct and indirect methods are studied, and similarities and differences are discussed. A general discussion of the inherent difficulties of the problem is given together with a comprehensive study on how the choice of the sampling interval influences the estimation result. A special focus is given to how the Cramer-Rao lower bound depends on the sampling interval.
  •  
12.
  • Ljung, Lennart, 1946- (author)
  • Prediction Error Estimation Methods
  • 2002
  • In: Circuits, systems, and signal processing. - : Birkhäuser Verlag. - 0278-081X .- 1531-5878. ; 21:1, s. 11-21
  • Journal article (peer-reviewed)abstract
    • This contribution describes a common family of estimation methods for system identification, viz, prediction-error methods. The basic ideas behind these methods are described. An overview of typical model structures to which they can be applied is also given, as well as the most fundamental asymptotic properties of the resulting estimates.
  •  
13.
  • Ljung, Lennart, 1946- (author)
  • Recursive Identification Algorithms
  • 2002
  • In: Circuits, systems, and signal processing. - : Birkhäuser Verlag. - 0278-081X .- 1531-5878. ; 21:1, s. 57-68
  • Journal article (peer-reviewed)abstract
    • Mechanisms for adapting models, filters, decisions, regulators, and so on to changing properties of a system or a signal are of fundamental importance in many modern signal processing and control algorithms. This contribution describes a basic foundation for developing and analyzing such algorithms. Special attention is paid to the rationale behind the different algorithms, thus distinguishing between "optimal" algorithms and "ad hoc" algorithms. We also outline the basic approaches to performance analysis of adaptive algorithms.
  •  
14.
  • Mateo-Sotos, J., et al. (author)
  • A Machine Learning-Based Method to Identify Bipolar Disorder Patients
  • 2022
  • In: Circuits, systems, and signal processing. - : Springer Nature. - 0278-081X .- 1531-5878. ; 41:4, s. 2244-2265
  • Journal article (peer-reviewed)abstract
    • Bipolar disorder is a serious psychiatric disorder characterized by periodic episodes of manic and depressive symptomatology. Due to the high percentage of people suffering from severe bipolar and depressive disorders, the modelling, characterisation, classification and diagnostic analysis of these mental disorders are of vital importance in medical research. Electroencephalogram (EEG) records offer important information to enhance clinical diagnosis and are widely used in hospitals. For this reason, EEG records and patient data from the Virgen de la Luz Hospital were used in this work. In this paper, an extreme gradient boosting (XGB) machine learning (ML) method involving an EEG signal is proposed. Four supervised ML algorithms including a k-nearest neighbours (KNN), decision tree (DT), Gaussian Naïve Bayes (GNB) and support vector machine (SVM) were compared with the proposed XGB method. The performance of these methods was tested implementing a standard 10-fold cross-validation process. The results indicate that the XGB has the best prediction accuracy (94%), high precision (> 0.94) and high recall (> 0.94). The KNN, SVM, and DT approaches also present moderate prediction accuracy (> 87), moderate recall (> 0.87) and moderate precision (> 0.87). The GNB algorithm shows relatively low classification performance. Based on these results for classification performance and prediction accuracy, the XGB is a solid candidate for a correct classification of patients with bipolar disorder. These findings suggest that XGB system trained with clinical data may serve as a new tool to assist in the diagnosis of patients with bipolar disorder. 
  •  
15.
  • Rosenbaum, Linnea, 1976-, et al. (author)
  • On low-delay frequency-response masking FIR filters
  • 2007
  • In: Circuits, systems, and signal processing. - : Springer Science and Business Media LLC. - 0278-081X .- 1531-5878. ; 26:1
  • Journal article (peer-reviewed)abstract
    • This paper offers two main contributions to the theory of low-delay frequency-response masking (FRM) finite impulse response (FIR) filters. First, a thorough investigation of the low-delay FRM FIR filters and their subfilters or three different structures, referred to as narrow-, wide-, and middle-band filter structures, is given. The investigation includes discussions on delay distribution over the subfilters as well as estimation of the optimal periodicity of the periodic model filter. Second, systematic design procedures are given, with explicit formulas for distribution of the ripples and the delay to the subfilters. For each of the three structures, two design procedures are given that include joint optimization of the subfilters. The first proposal uses partly linear-phase FIR subfilters and partly low-delay FIR subfilters. Thus, it has a lower arithmetic complexity compared to the second proposal, which has exclusively low-delay FIR subfilters. The second proposal is instead more flexible and can handle a broader range of specifications. The design procedures result in low-delay FIR filters with a lower arithmetic complexity compared to previous results, for specifications with low delay and narrow transition band. © Birkhauser Boston 2007.
  •  
16.
  • Rosenbaum, Linnea, et al. (author)
  • Two Classes of Cosine-Modulated IIR/IIR and IIR/FIR NPR Filter Banks
  • 2010
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : Springer Science and Business Media LLC. - 0278-081X .- 1531-5878. ; 29:1, s. 103-133
  • Journal article (peer-reviewed)abstract
    • This paper introduces two classes of cosine-modulated causal and stable filter banks (FBs) with near perfect reconstruction (NPR) and low implementation complexity. Both classes have the same infinite-length impulse response (IIR) analysis FB but different synthesis FBs utilizing IIR and finite-length impulse response (FIR) filters, respectively. The two classes are preferable for different types of specifications. The IIR/FIR FBs are preferred if small phase errors relative to the magnitude error are desired, and vice versa. The paper provides systematic design procedures so that PR can be approximated as closely as desired. It is demonstrated through several examples that the proposed FB classes, depending on the specification, can have a lower implementation complexity compared to existing FIR and IIR cosine-modulated FBs (CMFBs). The price to pay for the reduced complexity is generally an increased delay. Furthermore, two additional attractive features of the proposed FBs are that they are asymmetric in the sense that one of the analysis and synthesis banks has a lower computational complexity compared to the other, which can be beneficial in some applications, and that the number of distinct coefficients is small, which facilitates the design of FBs with large numbers of channels.
  •  
17.
  • Stoica, P., et al. (author)
  • Study of Capon method for array signal processing
  • 1995
  • In: Circuits, systems, and signal processing. - 0278-081X .- 1531-5878. ; 14:6, s. 749-770
  • Journal article (peer-reviewed)abstract
    • The mean-square error (MSE) of Capon estimate of the directions-of-arrival (DOA) is established in the narrowband array processing case. An improved Capon-like DOA estimator is proposed and its MSE is studied as well. Performance comparisons between the standard and improved Capon DOA estimates, and between these two estimates and the linear prediction DOA estimate, are performed. It is concluded that the improved Capon-like method introduced in this paper provides more accurate DOA estimates in most cases.
  •  
18.
  •  
19.
  • Wang, Yinan, et al. (author)
  • Analysis, Design, and Order Estimation of Least-Squares FIR Equalizers for Bandwidth Extension of ADCs
  • 2019
  • In: Circuits, systems, and signal processing. - : SPRINGER BIRKHAUSER. - 0278-081X .- 1531-5878. ; 38:5, s. 2165-2186
  • Journal article (peer-reviewed)abstract
    • In modern mixed-signal systems, it is important to build the conversion components with a flat frequency response over their full Nyquist frequency band. However, with increasing circuit speed, it is becoming more difficult to achieve this, due to limitations of the analog front-end circuits. This paper considers finite-length impulse-response (FIR) filters, designed in the least-squares sense, for the bandwidth extension of analog-to-digital converters, which is one of the most important applications in frequency response equalization. The main contributions of this paper are as follows: Firstly, based on extensive simulations, filter order-estimation expressions of the least-squares designed equalizers are derived. It appears to be the first time that order-estimation expressions are presented for any least-squares designed FIR filter. These expressions accurately estimate the order required for given specifications on the targeted extended bandwidth systems. Secondly, based on the derived order-estimation expressions, systematic design procedures are presented, which contribute to reducing the design time. Finally, a relation between the dynamic-range degradation and the system parameters is also derived and verified in the paper.
  •  
20.
  • Wang, Yinan, et al. (author)
  • Unified Filter Order Estimate for Minimax-Designed Linear-Phase FIR Wideband and Lowpass Digital Differentiators
  • 2023
  • In: Circuits, systems, and signal processing. - : SPRINGER BIRKHAUSER. - 0278-081X .- 1531-5878. ; 42:11, s. 6966-6987
  • Journal article (peer-reviewed)abstract
    • Digital differentiators enable the computation of the derivative of a continuous-time signal at discrete time instances, and they are used in many signal processing applications. This paper derives a unified filter order estimate for digital differentiators that are realized with linear-phase finite-length impulse response filters and designed in the minimax sense. The estimate is useful at the high-level system design when assessing the implementation complexity and it enables fewer designs when finding the minimal filter order required to satisfy a prescribed tolerable approximation error. The proposed unified estimate covers both wideband and lowpass differentiators of integer degrees up to ten. Furthermore, degree-individual filter order estimates are derived which improve and extend previous results. The performance of both the unified and degree-individual order estimates is evaluated through simulation examples and compared with previous estimates.
  •  
21.
  • Yu, Jun, 1962-, et al. (author)
  • Local spectral analysis using wavelet packets
  • 2001
  • In: Circuits, systems, and signal processing. - : Birkhäuser Verlag. - 0278-081X .- 1531-5878. ; 20:5, s. 497-528
  • Journal article (peer-reviewed)abstract
    • Wavelet packets are a useful extension of wavelets, which are of wide potential use in a statistical context. In this paper, an approach to the local spectral analysis of a stationary time series based on wavelet packet decomposition is developed. This involves extensions to the wavelet context of standard time series ideas such as the periodogram and spectrum. Some asymptotic properties of the new estimate are provided. The technique is illustrated by simulated signals and its application to physiological data, and its potential use in studies of time-dependent spectral analysis is discussed.
  •  
22.
  • Cedervall, M, et al. (author)
  • Mode-type algorithm for estimating damped, undamped, or explosive modes
  • 1997
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : BIRKHAUSER BOSTON INC. - 0278-081X. ; 16:3, s. 349-362
  • Journal article (other academic/artistic)abstract
    • We propose a new algorithm for estimating the parameters of damped, undamped, or explosive sinusoidal signals. The algorithm resembles the MODE algorithm, which is commonly used for direction of arrival estimation in the array signal processing held. It i
  •  
23.
  • Cedervall, M, et al. (author)
  • System identification from noisy measurements by using instrumental variables and subspace fitting
  • 1996
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : BIRKHAUSER BOSTON INC. - 0278-081X. ; 15:2, s. 275-290
  • Journal article (other academic/artistic)abstract
    • This paper considers the estimation of the parameters of a linear discrete-time system from noise-perturbed input and output measurements. The conditions imposed on the system are fairly general. In particular, the input and output noises are allowed to b
  •  
24.
  • Gershman, AB, et al. (author)
  • Direction finding using data-supported optimization
  • 2001
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : BIRKHAUSER BOSTON INC. - 0278-081X. ; 20:5, s. 541-549
  • Journal article (peer-reviewed)abstract
    • A novel data-supported optimization technique for maximum likelihood (ML) direction-of-arrival estimation is proposed. The essence of our approach is to optimize the likelihood function at certain data-supported points obtained by a resampled root-MUSIC p
  •  
25.
  • Jakobsson, A, et al. (author)
  • Combining Capon and APES for estimation of spectral lines
  • 2000
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : BIRKHAUSER BOSTON INC. - 0278-081X. ; 19:2, s. 159-169
  • Journal article (peer-reviewed)abstract
    • We propose combining the Capon and the APES spectral estimators for estimation of both the amplitude and the frequency of spectral lines. The so-obtained estimator does not suffer from Capon's biased amplitude estimates nor from APES' biased frequency est
  •  
26.
  •  
27.
  • Li, HB, et al. (author)
  • Capon estimation of covariance sequences
  • 1998
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : BIRKHAUSER BOSTON INC. - 0278-081X. ; 17:1, s. 29-49
  • Journal article (other academic/artistic)abstract
    • Estimating the covariance sequence of a wide-sense stationary process is of fundamental importance in digital signal processing (DSP). A new method, which makes use of Fourier inversion of the Capon spectral estimates and is referred to as the Capon metho
  •  
28.
  • STOICA, P, et al. (author)
  • DECENTRALIZED ARRAY-PROCESSING USING THE MODE ALGORITHM
  • 1995
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - 0278-081X. ; 14:1, s. 17-38
  • Journal article (other academic/artistic)abstract
    • Centralized methods for source location using sensor arrays have computational and communication burdens that increase significantly with the number of sensors in the array. Therefore, these methods may not be usable in the applications involving very lar
  •  
29.
  • Stoica, P, et al. (author)
  • Nonparametric spectral analysis of gapped data via an adaptive filtering approach
  • 2001
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : BIRKHAUSER BOSTON INC. - 0278-081X. ; 20:5, s. 485-496
  • Journal article (peer-reviewed)abstract
    • We present an algorithm for nonparametric complex spectral analysis of gapped data via an adaptive finite impulse response (FIR) filtering approach, referred to as the gapped-data amplitude and phase estimation (GAPES) algorithm. The incomplete data seque
  •  
30.
  • Stoica, P, et al. (author)
  • On nonparametric spectral estimation
  • 1999
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : BIRKHAUSER BOSTON INC. - 0278-081X. ; 18:2, s. 169-181
  • Journal article (other academic/artistic)abstract
    • In this paper the Cramer-Rao bound (CRB) for a general nonparametric spectral estimation problem is derived under a local smoothness condition (more exactly, the spectrum is assumed to be well approximated by a piecewise constant function). Furthermore, i
  •  
31.
  • STOICA, P, et al. (author)
  • ON THE CONCENTRATED STOCHASTIC LIKELIHOOD FUNCTION IN ARRAY SIGNAL-PROCESSING
  • 1995
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - : BIRKHAUSER BOSTON INC. - 0278-081X. ; 14:5, s. 669-674
  • Journal article (other academic/artistic)abstract
    • The stochastic likelihood function [(STO)LF] associated with the narrowband signal processing problem can be concentrated with respect to the signal covariance matrix elements and the noise power. Although this is a known fact, no clear-cut derivation of
  •  
32.
  • STOICA, P, et al. (author)
  • STUDY OF CAPON METHOD FOR ARRAY SIGNAL-PROCESSING
  • 1995
  • In: CIRCUITS SYSTEMS AND SIGNAL PROCESSING. - 0278-081X. ; 14:6, s. 749-770
  • Journal article (other academic/artistic)abstract
    • The mean-square error (MSE) of Capon estimate of the directions-of-arrival (DOA) is established in the narrowband array processing case. An improved Capon-like DOA estimator is proposed and its MSE is studied as well. Performance comparisons between the s
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-32 of 32

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 Close

Copy and save the link in order to return to this view