Summing Symbols in Mutual Recurrences
نویسندگان
چکیده
The problem of summing a set of mutual recurrence relations with constant coefficients is investigated. A method is presented for summing an order d system of the form A(n) = ∑d i=1 MiA(n − i) + G(n), where A,G : N → K and M1, . . . ,Md ∈ Mm(K) for some field K and natural number m. The procedure expresses the sum ∑n i=0 A(i) in terms of A(n), . . . , A(n− d), initial conditions and sums of the inhomogeneous term G(n).
منابع مشابه
An Efficient Algorithm for Deriving Summation Identities from Mutual Recurrences
This paper closes an algorithmic problem of summing a set of mutual recurrence relations with constant coefficients. Given an order d system of the form A(n) = ∑d i=1 MiA(n− i)+G(n), where A,G : N→ Km and M1, . . . ,Md ∈Mm(K) for some field K and natural number m, this algorithm computes the sum ∑n i=0 A(i) as a K-linear combination of A(n), . . . , A(n − d), the initial conditions and sums of ...
متن کاملFourier analysis of symbolic data: A brief review
We overview and discuss several methods for the Fourier analysis of symbolic data, such as DNA sequences, emphasizing their mutual connections. We consider the indicator sequence approach, the vector and the symbolic autocorrelation methods, and methods such as the spectral envelope, that for each frequency optimize the symbolic-no-numeric mapping to emphasize any periodic data features. We dis...
متن کاملA Strategy for Selecting Classes of Symbols from Classes of Graphemes in HMM-Based Handwritten Word Recognition
This paper presents a new strategy for selecting classes of symbols from classes of graphemes in HMM-based handwritten word recognition from Brazilian legal amounts. This paper discusses features, graphemes and symbols, as our baseline system is based on a global approach in which the explicit segmentation of words into letters or pseudo-letters is avoided and HMM models are used. For this fram...
متن کاملOptimal embedding of known symbols for OFDM
The problem of placing known symbols optimally for OFDM is considered. The channel is assumed to be quasi-static with a finite impulse response. Under the assumption that neither the transmitter and receiver know the channel, we optimize the training by maximizing a lower bound of the mutual information. It is shown that the lower bound is maximized by placing the known symbols periodically. Op...
متن کاملMutual Information Functions Versus Correlation Functions
This paper studies one application of mutual information to symbolic sequence: the mutual information function M(d). This function is compared with the more frequently used correlation function (d). An exact relation between M(d) and (d) is derived for binary sequences. For sequences with more than two symbols, no such general relation exists; in particular, (d) = 0 may or may not lead to M(d) ...
متن کامل