Sökning: "linear block code"

Visar resultat 1 - 5 av 19 avhandlingar innehållade orden linear block code.

  1. 1. Integrated Optimal Code Generation for Digital Signal Processors

    Författare :Andrzej Bednarski; Christoph Kessler; Alain Darte; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Instruction-level parallelism; integrated code generation; dynamic programming; instruction scheduling; instruction selection; clustered VLIW architecture; integer linear programming; architecture description language; Computer science; Datavetenskap;

    Sammanfattning : In this thesis we address the problem of optimal code generation for irregular architectures such as Digital Signal Processors (DSPs).Code generation consists mainly of three interrelated optimization tasks: instruction selection (with resource allocation), instruction scheduling and register allocation. LÄS MER

  2. 2. Joint ML multi user detection of block coded CDMA over the AWGN channel using A*

    Författare :Peter Németh; Chalmers University of Technology; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; CDMA; heuristic function; complexity reduction; priority-first algorithms; A*; code division multiple access; linear block codes;

    Sammanfattning : .... LÄS MER

  3. 3. Integrated Software Pipelining

    Författare :Mattias Eriksson; Christoph Kessler; Sid Ahmed Ali Touati; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Code generation; compilers; instruction scheduling; register allocation; spill code generation; modulo scheduling; integer linear programming; genetic programming.; Computer science; Datavetenskap;

    Sammanfattning : In this thesis we address the problem of integrated software pipelining for clustered VLIW architectures. The phases that are integrated and solved as one combined problem are: cluster assignment, instruction selection, scheduling, register allocation and spilling. LÄS MER

  4. 4. On Tailbiting Codes from Convolutional Codes

    Författare :Per Ståhl; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; computer technology; Systems engineering; Teknik; Technological sciences; encoder inverse; systematic feedback encoder; state complexity; trellis; tailbiting termination method; tailbiting code; channel coding; convolutional code; Data- och systemvetenskap; Informatics; systems theory; Informatik; systemteori;

    Sammanfattning : Tailbiting is a method to terminate convolutional codes into block codes. We call these block codes tailbiting codes. This thesis focuses on the encoding of tailbiting codes. The tailbiting method is carefully investigated. LÄS MER

  5. 5. Voronoi-Based Coding

    Författare :Erik Agrell; Chalmers University of Technology; []
    Nyckelord :Voronoi diagram; linear block code; Gaussian channel; neighbor descent; nearest neighbor search algorithm; computational geometry; asymptotic theory; source coding; lattice; vector quantization; soft-decision decoding; index assignment; channel coding; complexity;

    Sammanfattning : The performance of a digital communication system can generally be improved by increasing the number of variables being jointly coded. In this sense, it is desirable to have, e.g., higher-dimensional quantizers, longer channel codes, and more users in a multiple-access system. LÄS MER