Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 313 for “"Concatenation"”.

  1. The Loria-Ely-Turner Concatenation

    No abstract prepared.

    texas-state Repository record for The Loria-Ely-Turner Concatenation (opens in a new tab)

  2. Concatenation of punctured convolutional codes.

    The cascading or concatenation of error control codes is a well-established technique in digital communications. This type of code can yield excellent bit error rate performance. Concatenated codes that contain short memory convolutional codes are applicable to many communication links. The …

    arizona-thes Repository record for Concatenation of punctured convolutional codes. (opens in a new tab)

  3. The Forbidden Pattern Approach to Concatenation Hierarchies

    … the minimal number of alternations between concatenation on one hand, and intersection, union, complement on the other hand. This question was first raised in 1971 (Brzozowski/Cohen) and besides the extended star-heights problem usually refered to as one of the most difficult open questions …

    wurz-thes Repository record for The Forbidden Pattern Approach to Concatenation Hierarchies (opens in a new tab)

  4. Speech synthesis by concatenation of Digital waveform fragments

    A method to rule-synthesize speech by concatenation of digital waveform fragments at a subphonemic level is presented. No special hardware is needed to implement this software synthesizer other than a D/A converter and an ordinary audio system. Computer software for an on-line analysis-by-synthesis …

    ubc Repository record for Speech synthesis by concatenation of Digital waveform fragments (opens in a new tab) Download PDF for Speech synthesis by concatenation of Digital waveform fragments (opens in a new tab)

  5. Serial concatenation of simple codes and differential modulations

    … on the use of a single high complexity code, a concatenation of two or more simple codes can be used. Serially concatenated encoding structures are very popular means to achieving close to capacity performance. Good performance of concatenated codes with practically viable decoding times is …

    ubc Repository record for Serial concatenation of simple codes and differential modulations (opens in a new tab) Download PDF for Serial concatenation of simple codes and differential modulations (opens in a new tab)

  6. Forbidden-Patterns and Word Extensions for Concatenation Hierarchies

    … letters by using only Boolean operations and concatenation. The complexity of these languages can be measured with the so-called dot-depth. This measure leads to concatenation hierarchies like the dot-depth hierarchy (DDH) and the closely related Straubing-Thérien hierarchy (STH). The question …

    wurz-thes Repository record for Forbidden-Patterns and Word Extensions for Concatenation Hierarchies (opens in a new tab)

  7. Concatenation of Space-Time Block Codes with ConvolutionalCodes

    … performance of space-time block coded systems concatenation by convolutional codes is introduced. The improvement in the diversity order by the introduction of convolutional codes into the space-time block coded system is discussed. A general analytic expression for the error performance of a …

    vt Repository record for Concatenation of Space-Time Block Codes with ConvolutionalCodes (opens in a new tab)

  8. A study of the concatenation of induction motors

    Thesis (B.S.)--Michigan State College of Agriculture and Applied Science, 1930

    msu Repository record for A study of the concatenation of induction motors (opens in a new tab)

  9. A Comparison of the Product Topology on Two Trees with the Tree Topology on the Concatenation of Two Trees

    … S: [T] × [S]. The second is constructed by the concatenation of two game trees, T and S: [T ∗ S]. The goal of our study is to determine what conditions we must require of the trees T and S so that these two topologies are homeomorphic.

    unlv Repository record for A Comparison of the Product Topology on Two Trees with the Tree Topology on the Concatenation of Two Trees (opens in a new tab) Download PDF for A Comparison of the Product Topology on Two Trees with the Tree Topology on the Concatenation of Two Trees (opens in a new tab)

  10. Adversarial and Non-Adversarial Approaches for Imbalanced Data Classification

    … the mentioned problems: First, we propose Cross-Concatenation, the first projection-based method to address imbalanced data classification problem. Cross-Concatenation is the first projection method which can balance the size of both minority and majority classes. We prove that, …

    houston Repository record for Adversarial and Non-Adversarial Approaches for Imbalanced Data Classification (opens in a new tab)

  11. State Complexity of Tree Automata

    … on regular unranked tree languages. The concatenation of trees can be defined either as a sequential or a parallel operation. Furthermore, there are two essentially different ways to iterate sequential concatenation. We establish tight state complexity bounds for concatenation-like …

    queens Repository record for State Complexity of Tree Automata (opens in a new tab)

  12. Alternative scales for extensive measurement: Combining operations and conventionalism

    … of a quantity. Rectangular and collinear concatenation, for example, cannot both be used as a way of combining lengths. However, rectangular concatenation could be used to measure some other extensive quantity since it fulfills the necessary conditions for adequate numerical assignment. …

    rice Repository record for Alternative scales for extensive measurement: Combining operations and conventionalism (opens in a new tab)

  13. Iterative chase decoding of algebraic geometric codes

    … the construction of the product codes, both bit concatenation and symbol concatenation are used. All the product codes are represented in binary form. The Chase decoder with an inner hard-decision decoder using parallel Berlekamp-Massey algorithm is used as the soft-input soft-output decoder of …

    nus Repository record for Iterative chase decoding of algebraic geometric codes (opens in a new tab) Download file for Iterative chase decoding of algebraic geometric codes (opens in a new tab)

  14. Toward a theory of diffuse energy transport in large irregular structures

    "We develop a ""concatenation ansatz"" of energy flow in large, complex structures to predict the response of a nominally diffusive system. The concatenation ansatz is inspired by statistical energy analysis (SEA) which is, in turn, based on an analogy to diffusive heat transfer. Where in heat …

    uiuc Repository record for Toward a theory of diffuse energy transport in large irregular structures (opens in a new tab)

  15. Feasibility of Using the Least Square Deconvolution Approach to Resolve Three-Person STR DNA Mixture Samples

    … to the LSD-3 method were investigated; locus concatenation, reference profile incorporation, and manual analysis of allele peak area data guided by LSD-3 mathematical results. It was found that while locus concatenation did not increase the ability of LSD-3 to correctly resolve three-person …

    ut-knoxville Repository record for Feasibility of Using the Least Square Deconvolution Approach to Resolve Three-Person STR DNA Mixture Samples (opens in a new tab)

  16. Edge embedding with line graph enhancement

    … often resort to indirect methods like node concatenation for vector representation of edges, aiding in tasks like link sign prediction. In this paper, we introduce LineDi2vec, an innovative approach that enhances node2vec’s embedding method using a line graph. The proposed LineDi2vec not …

    uoit Repository record for Edge embedding with line graph enhancement (opens in a new tab)

  17. Explaining work organisation: a realist approach

    … organisational contexts to form a distinctive concatenation, thus giving rise to a concrete work configuration. At the empirical level the initial research problem is contextualised through the undertaking of two casestudies. Two distinctive work configurations are reported and compared, and …

    greece Repository record for Explaining work organisation: a realist approach (opens in a new tab)

  18. Model checking for time division multiple access systems

    … concepts of periodic cyclic timed automata and concatenation. A system obtained by the concatenation of a number of components is bisimilar to the one obtained by their parallel composition. Replacing the parallel composition of components by their concatenation yields a reduction of the cost of …

    freiburg-diss Repository record for Model checking for time division multiple access systems (opens in a new tab)

  19. Channel matched iterative decoding for magnetic recording systems.

    … recording. The first scheme is a two-level concatenation of channel-matched turbo equalization (TE) and outer RS, replacing current inner parity correction codes. Conventional TE is matched to the channel via the incorporation of the error pattern correction code (EPCC), which works …

    umn Repository record for Channel matched iterative decoding for magnetic recording systems. (opens in a new tab)

  20. Rate adaptive coding and its application to spread spectrum communications

    … limited. The second scheme is based on the concatenation of punctured MDS codes, and convolutional codes. This concatenation benefits from the advantages of both block and convolutional codes. The throughput and codeword error probability in a Rayleigh fading environment with a limited …

    uvic Repository record for Rate adaptive coding and its application to spread spectrum communications (opens in a new tab)

Page 1 of 16