Sökning: "finite alphabet"

Visar resultat 1 - 5 av 14 avhandlingar innehållade orden finite alphabet.

  1. 1. Space-Time Algorithms for Mobile Communications

    Författare :Per Pelin; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; antenna array; model order selection; equalization; Bootstrap; space-time propagation; synchronization; RAKE-combiner; real data; data reduction; spatial diversity; finite alphabet;

    Sammanfattning : Algorithms are presented for space-time signal processing in mobile communication systems employing base station antenna arrays. Two main issues are concerned. Reception of data transmitted on the uplink (mobile to base station transmission), and estimation of the parameters of the space-time mobile channel. LÄS MER

  3. 2. Spatial diversity receivers for base station antenna arrays

    Författare :Per Pelin; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; synchronization; data reduction; spatial diversity; antenna array; finite alphabet; multi-user; iterative least squares; RAKE-combiner; reciever; base station;

    Sammanfattning : .... LÄS MER

  4. 3. Interference Rejection in Wireless Communication Systems

    Författare :Anders Ranheim; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; direct-sequence spread spectrum; parameter estimation; multi-user detection; antenna array processing; iterative minimization; interference rejection; finite alphabet; order detection; signal structure; narrow-band interference;

    Sammanfattning : This thesis is concerned with the problem of interference rejection in wireless communication systems. Different solutions are proposed, depending on the type of system under study and the amount of knowledge available about the signal and the propagation environment. LÄS MER

  5. 4. Regular model checking

    Författare :Marcus Nilsson; Bengt Jonsson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : We present regular model checking, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology. States are represented by strings over a finite alphabet and the transition relation by a regular length-preserving relation on strings. LÄS MER

  7. 5. Regular Model Checking

    Författare :Marcus Nilsson; Bengt Jonsson; Parosh Aziz Abdulla; Kim Larsen; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formal methods; model checking; verification; regular sets; Computer science; Datavetenskap;

    Sammanfattning : A major current challenge in the area of program verification is to extend its applicability to infinite-state systems. A system can be infinite-state because it operates on unbounded data structures, such as queues, stacks, integers, etc., or because its description is parameterized by the number of components inside the system. LÄS MER