نتایج جستجو برای: orthogonal design

تعداد نتایج: 1001985  

1999
Xiao-Ping Zhang

Recent wavelet research has primarily focused on real-valued wavelet bases. However, complex wavelet bases ooer a number of potential advantageous properties. For example, it has been recently suggested 1], 2] that the complex Daubechies wavelet can be made symmetric. However, these papers always imply that if the complex basis has a symmetry property then it must exhibit linear phase as well. ...

Journal: :CoRR 2016
Ted Hurley

Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than 0. It is shown that unitary matrices in general are derived from orthogonal sets of idempotents reducing the design problem to a construction problem of unitary matrices from such sets. The qu...

Journal: :IEEE Trans. Signal Processing 1999
Xiao-Ping Zhang Mita D. Desai Ying-Ning Peng

Recent wavelet research has primarily focused on real-valued wavelet bases. However, complex wavelet bases offer a number of potential advantageous properties. For example, it has been recently suggested that the complex Daubechies wavelet can be made symmetric. However, these papers always imply that if the complex basis has a symmetry property, then it must exhibit linear phase as well. In th...

Journal: :IJWMIP 2008
Turghunjan Abdukirim Türüki Muhammad Hussain Koichi Niijima Shigeru Takano

The dyadic lifting schemes, which generalize Sweldens lifting schemes, have been proposed for custom-design of dyadic and bi-orthogonal wavelets and their duals. Starting with dyadic wavelets and exploiting the control provided in the form of free parameters, one can custom-design dyadic as well as bi-orthogonal wavelets adapted to a particular application. To validate the usefulness of the sch...

Journal: :Int. Arab J. Inf. Technol. 2010
Abbas Hasan Kattoush

Finite Radon Transform mapper has the ability to increase orthogonality of sub-carriers, it is non sensitive to channel parameters variations, and has a small constellation energy compared with conventional Fast Fourier Transform based orthogonal frequency division multiplexing. It is also able to work as a good interleaver which significantly reduces the bit error rate. Due to its good orthogo...

ژورنال: پژوهش های ریاضی 2019

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

ژورنال: پژوهش های ریاضی 2020

The standard kernel density estimator suffers from a boundary bias issue for probability density function of distributions on the positive real line. The Gamma kernel estimators and orthogonal series estimators are two alternatives which are free of boundary bias. In this paper, a simulation study is conducted to compare small-sample performance of the Gamma kernel estimators and the orthog...

Journal: :journal of mathematical modeling 0
saeed ketabchi elham samadi hossein aminikhah

this work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $ax = b$ and $xc = d$ with orthogonal constraint. by optimal correction approach, a general representation of the orthogonal solution is obtained. this method is tested on two examples to show that the optimal correction is e ective and highly accurate.

2017
Tian-fang Zhang Guobin Wu Aloke Dey

Nested orthogonal arrays have been used in the design of an experimental setup consisting of two experiments, the expensive one of higher accuracy being nested in a larger and relatively less expensive one of lower accuracy. In this paper, we provide new methods of construction of two types of nested orthogonal arrays. MSC: 62K15

Journal: :CoRR 2010
Andri Mirzal

Abstract: This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing ideas from the work of Lin [2]. The experimental results confirm the theoretical guarantees of the convergences.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید