Robust adaptive estimation of unknown parameter has been an important issue in recent years for reliable operation in the distributed networks. The conventional adaptive estimation algorithms that rely on mean square error (MSE) criterion exhibit good performance in the presence of Gaussian noise, but their performance drastically decreases under impulsive noise. In this paper, we propose a rob...

This paper proposes an efficient spectrum sensing scheme for OFDM signal transmitted by the primary user with its Cyclic Prefix Correlation Coefficient (CPCC) based on multi-antenna. Inspired by the Maximum-minimum Eigenvalue Detection (MMED) algorithm, a CPCC-based MMED spectrum sensing algorithm is proposed. This algorithm uses inherent property of Cyclic Prefix (CP) resulting in nonzero corr...

Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...

{ In this work, the following k-way graph partitioning (GP) problem is considered: given an undirected weighted graph G(V; E), partition the nodes of G into k parts of almost equal size such that the partition-cost (sum of the weights on edges with nodes in diierent parts) is minimized. Two simple and fast algorithms are proposed, namely, direct algorithm Auction and iterative algorithm GreedyC...

neither damage mechanics model nor elastoplastic constitutive law can solely describe the behavior of concrete satisfactorily. in fact, they both fail to represent proper unloading slopes during cyclic loading. to overcome the disadvantages of pure plastic models and pure damage approaches, the combined effects need to be considered. in this regard, various classes of plastic-damage models have...

In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length lm and ideals of Ml(Fq)[X]/(X m −1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study th...

We study the connections among the mapping class group of the twice punctured torus, the cyclic branched coverings of (1, 1)-knots and the cyclic presentations of groups. We give the necessary and sufficient conditions for the existence and uniqueness of the n-fold stronglycyclic branched coverings of (1, 1)-knots, through the elements of the mapping class group. We prove that every n-fold stro...

We study the connections among the mapping class group of the twice punctured torus, the cyclic branched coverings of (1, 1)-knots and the cyclic presentations of groups. We give the necessary and sufficient conditions for the existence and uniqueness of the n-fold stronglycyclic branched coverings of (1, 1)-knots, through the elements of the mapping class group. We prove that every n-fold stro...

We present an algorithm to obtain a lower bound on the distance of cyclic codes, improving Schaub algorithm. In particular, we can provide new better bounds for the duals of binary primitive narrowsense BCH codes of length 255.