The cyclostationarity of the OFDM signal induced by the cyclic prefix can be employed in a manner of blind channel identification for adaptive subcarrier modulation level and/or power allocation in an adaptive OFDM system, according to channel conditions, promising the potential for a high-speed power line communications. For that object, the spectral correlation characterization of the OFDM si...

This paper, theoretically, examines concepts, propositions, and establishes the need for and develops an extension to Concept Maps (CMaps) called Cyclic Concept Maps (Cyclic CMaps). The Cyclic CMap is considered to be an appropriate tool for representing knowledge of functional or dynamic relationships between concepts. The Concept Map (CMap), on the other hand, is viewed as an appropriate tool...

Many spatio-temporal phenomena (both natural and human) change in time cycles, e.g., seasonal change of weather and pattern of people’s daily activities, which required a cyclic view of time. However, most GIS systems and cartographic representation adopt Cartesian Coordinate Systems (CCSs), which force time to be perceived as a linear dimension. Therefore, the cyclic change cannot be effective...

Let F2m be a finite field of characteristic 2 and R = F2m [u]/〈u 〉 = F2m + uF2m + . . . + u k−1 F2m (u k = 0) where k ∈ Z satisfies k ≥ 2. For any odd positive integer n, it is known that cyclic codes over R of length 2n are identified with ideals of the ring R[x]/〈x − 1〉. In this paper, an explicit representation for each cyclic code over R of length 2n is provided and a formula to count the n...

Let R be a commutative finite chain ring of invariants (q ,s ), and Γ(R) the Teichmüller’s set of R. In this paper, the trace representation cyclic R -linear codes of length l, is presented, when gcd(l,q ) = 1. Wewill show that the contractions of some cyclic R -linear codes of length ul are γ -constacyclic R -linear codes of length l, where γ ∈ Γ(R)\{0R} and themultiplicative order of γ is u .

Tridiagonal systems play a fundamental role in matrix computation. In particular, in recent years parallel algorithms for the solution of tridiagonal systems have been developed. Among these, the cyclic reduction algorithm is particularly interesting. Here the stability of the cyclic reduction method is studied under the assumption of diagonal dominance. A backward error analysis is made, yield...

Abstract: Let Rk,m be the ring F2m [u1, u2, · · · , uk]/ ⟨ ui , uiuj − ujui ⟩ . In this paper, cyclic codes of arbitrary length n over the ring R2,m are completely characterized in terms of unique generators and a way for determination of these generators is investigated. A F2m -basis for these codes is also derived from this representation. Moreover, it is proven that there exists a one-to-one...

We consider the discrete representations of 3-manifold groups into PU(2, 1) that appear in the Falbel-Koseleff-Rouillier, such that the peripheral subgroups have cyclic unipotent holonomy. We show that two of these representations have conjugate images, even though they represent different 3-manifold groups. This illustrates the fact that a discrete representation π1(M) → PU(2, 1) with cyclic u...

Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing the cyclic swap distance between A and B, i.e., the minimum number of swaps needed to convert A to B, minimized over all rotations of B. We show that, given the compressed representation of A and B, this distance may be c...

finite affine groups are given by groups of translations and di-lations on finite cyclic groups. for cyclic groups of prime orderwe develop a time-scale (wavelet) analysis and show that for alarge class of non-zero window signals/vectors, the generatedfull cyclic wavelet system constitutes a frame whose canonicaldual is a cyclic wavelet frame.