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.
In this paper, we investigate dynamical complexity of general planar piecewise isometries. We reveal the relations between the complexity and the admissible finite words generated by a planar piecewise isometry, and present the necessary and sufficient conditions for the complexity to be zero. Furthermore, we give equivalent statements for the complexity to be not less than 1, and also discuss some...
In this work, we propose a novel combined set-membership (SM) reduced-rank interference suppression scheme and consider its application to spread-spectrum multiuser direct sequence ultra-wideband (DS-UWB) systems. In the proposed scheme, the theory of set-membership filtering is applied to the training-based powers of R (PoR) multi-stage Wiener filter (MSWF) reduced-rank process and the reduced-rank...
A digraph is weight-balanced if, at each node, the sum of the weights of the incoming edges (in-degree) equals the sum of the weights of the outgoing edges (out-degree). Weight-balanced digraphs play an important role in a variety of cooperative control problems, including formation control, distributed averaging and optimization. We call a digraph weight-balanceable if it admits an edge weight assignment...
Normalized cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be applied and the problem of minimizing the normalized cut can be approximately solved using eigen-computations. However, it is a challenge to incorporate prior information in this approach. In this paper, we express prior knowledge...
This paper presents a novel approach for computing both the minimum-phase filter and the associated all-pass filter in a computationally efficient way using fast QL-factorization. A desirable property of this approach is that the complexity is independent of the size of the matrix being QL-factorized. Instead, the complexity scales with the required precision of the filters as well as the filter length.
Near-capacity performance of turbo codes is generally achieved with a large number of decoding iterations. Various iteration stopping rules introduced in the literature often induce performance loss. This paper proposes a novel partial decoding iteration scheme using a bit-level convergence test. We first establish decoding optimality of windowed partial iteration for non-converged bits given that...
A new class of cumulant-based methods is presented in order to blindly identify potentially underdetermined mixtures of statistically independent sources. These algorithms perform a joint canonical decomposition (CAND) of several higher order cumulants through a fast CAND of a special 3-way array. From a signal processing viewpoint, the proposed methods are shown (i) to have a better estimation resolution...
Recently, progressive border sampling (PBS) was proposed for sample selection in supervised learning by progressively learning an augmented full border from small labeled datasets. However, this quadratic learning algorithm is inapplicable to large datasets. In this paper, we incorporate the PBS to a state of the art technique called coupling Markov chain Monte Carlo (CMCMC) in an attempt to scale...
In the paper, ldquoImproved Transmission Scheme for Orthogonal Space Time Codesrdquo, a new scheme is proposed that uses an iterative Expectation Maximization (EM) algorithm for decoding and provides full rate and full diversity. For full rate, some of the codeword symbols are not transmitted but rather estimated at the receiver using the expectation maximization (EM) algorithm. In this paper, we...
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.