We report on research in which we increased the degree of spectral control in concatenative synthesis by controlling the formant frequencies of the synthetic speech, as well as the energies in four spectral bands. In addition, we eliminated “points” of concatenation in favor of “regions” of concatenation, by crossfading between the end and the beginning of two speech segments that are part of a...

In this paper, we propose a novel unit concatenation and synthesis method using ABS/OLA sinusoidal model. Phase succession is used in the unit synthesis assuming that the pitch onset time of the rst frame in a given unit is the frame center. In the unit concatenation, the phase succession and interpolation of the sinusoid amplitudes via several frames around the concatenation point is utilized....

Abstract— The problem of designing codes with close-tocapacity performance on the multiple-input multiple-output (MIMO) quasi-static fading channel (QSFC) is addressed. We consider three different coding schemes – namely, direct transmission of random-like codes, concatenation with linear processing orthogonal space-time block codes (o-STBC) and concatenation with space-time trellis codes (STTC...

In the applications it may occur that our initial pseudorandom binary sequence turns out to be not long enough, thus we have to take the concatenation or merging of it with another pseudorandom binary sequences. Here our goal is study when can we form the concatenation of several pseudorandom binary sequences belonging to a given family? We introduce and study new measures which can be used for...

We study codes with parameters of the ternary Hamming $(n=(3^m-1)/2,3^{n-m},3)$ code, i.e., $1$-perfect codes. The rank code is defined to be dimension its affine span. characterize $n-m+1$, count their number, and prove that all such can obtained from each other by a sequence two-coordinate switchings. enumerate length $13$ concatenation lengths $9$ $4$; we find there are $93241327$ equivalenc...

The run-time verification logic Eagle is equipped with two forms of binary cut operator, sequential composition ( ; ) and concatenation (·). Essentially, a concatenation formula F1 · F2 holds on a trace if that trace can be cut into two non-overlapping traces such that F1 holds on the first and F2 on the second. Sequential composition differs from concatenation in that the two traces must overl...

Under the multispecies coalescent model of molecular evolution, gene trees have independent evolutionary histories within a shared species tree. In comparison, supermatrix concatenation methods assume that gene trees share a single common genealogical history, thereby equating gene coalescence with species divergence. The multispecies coalescent is supported by previous studies which found that...

It has been known that error-correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold (probably ∼ 10–10). Other, un-concatenated codes with their own attractive features—e.g., an accuracy threshold ∼ 10—have also been studied. A method to obtain universal computation is presented here which do...