Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper presents an improved method of two-dimensional (2D) direction finding for coherent signals based on two L-shape arrays. A new type of three-dimensional (3D) direction angles has been defined in this method. The proposed method decorrelates the coherent incident signals and reconstructs the signal subspace using the cross-correlation matrix. Then the shift invariance property of the array...
Structurally random matrices (SRM) are first proposed in as fast and highly efficient measurement operators for large scale compressed sensing applications. Motivated by the bridge between compressed sensing and the Johnson-Lindenstrauss lemma, this paper introduces a related application of SRMs regarding to realizing a fast and highly efficient embedding. In particular, it shows that a SRM is also...
The problem of affine rank minimization seeks to find the minimum rank matrix that satisfies a set of linear equality constraints. Generally, since affine rank minimization is NP-hard, a popular heuristic method is to minimize the nuclear norm that is a sum of singular values of the matrix variable. A recent intriguing paper shows that if the linear transform that defines the set of equality constraints...
This paper presents a novel framework of fast and efficient compressive sampling based on the new concept of structurally random matrices. The proposed framework provides four important features, (i) It is universal with a variety of sparse signals, (ii) The number of measurements required for exact reconstruction is nearly optimal, (iii) It has very low complexity and fast computation based on block...
It has been well established that critically sampled boundary pre-/postfiltering operators can improve the coding efficiency and mitigate blocking artifacts in traditional discrete cosine transform-based block coders at low bit rates. In these systems, both the prefilter and the postfilter are square matrices. This paper proposes to use undersampled boundary pre- and postfiltering modules, where the...
In this paper, we present a new view of the vertical Bell Labs layered space-time (V-BLAST) system by interpreting the detection process on the dual lattice, and propose two O(N3)-complexity ordering algorithms. One algorithm updates the dual basis by using the backward Greville formula; the other is to apply the sorted Gram-Schmidt orthogonalization to the dual basis. We demonstrate the connection...
In this paper, two parameterization methods are proposed for M-channel, first-order unimodular filter banks. For such a system with Mcmillan degree of rho, the proposed parameterizations can Q reduce the number of free parameters by rho2, compared with existing methods. At the same time, the resulting structures are still complete and minimal in the Mcmillan sense. Besides, perfect reconstruction,...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.