Sökning: "Concatenated Systems"

Visar resultat 1 - 5 av 25 avhandlingar innehållade orden Concatenated Systems.

  1. 1. Baseband Processing for 5G and Beyond: Algorithms, VLSI Architectures, and Co-design

    Författare :Mojtaba Mahdavi; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; VLSI Implementation; Hardware architectures; ASIC implementation; FPGA implementation; CMOS Technology; Baseband Processing; Massive MIMO; 5G New Radio; Beyond 5G; Co-Design; FFT processor; OFDM modulation; wireless communications; Massive MIMO Detection; Angular domain processing; Zero forcing; Systolic array; Non-linear detector; Channel Sparsity; Channel compression; Linear detector; Channel coding; Spatial coupling; Turbo-like codes; Spatially coupled serially concatenated codes; Threshold analysis; Decoder architecture; BCJR algorithm; MAP algorithm; Coupling memory; Window decoding; Complexity analysis; Performance Evaluation; Throughput; Decoding Latency; Silicon area; Design tradeoffs; Interleaver architecture; Memory requirements; Matrix multiplication; Channel state information CSI ; Cholesky decomposition; Tanner graph; Trellis codes; Convolutional encoder; Code design; Puncturing; Reordering circuit; wireless communication system; digital electronic;

    Sammanfattning : In recent years the number of connected devices and the demand for high data-rates have been significantly increased. This enormous growth is more pronounced by the introduction of the Internet of things (IoT) in which several devices are interconnected to exchange data for various applications like smart homes and smart cities. LÄS MER

  3. 2. Serially concatenated systems : an iterative coding approach with application to continuous phase modulation

    Författare :Pär Moqvist; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; APP algorithm; concatenated codes; iterative decoding; MAP detector; continuous phase modulation; serial concatenation;

    Sammanfattning : .... LÄS MER

  4. 3. On Motion Control of Linear Incremental Hydraulic Actuators

    Författare :Martin Hochwallner; Petter Krus; Kalevi Huhtala; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Linear Incremental Hydraulic Actuator; novel actuator; linear hydraulic actuator; tracking problem; hydraulic servo system; digital fluid power;

    Sammanfattning : Linear Incremental Hydraulic Actuators combine one or more short-stroke cylinders, and two or more engaging/disengaging mechanisms into one actuator with long, medium, or even unlimited stroke length. The motion of each single short-stroke actuator concatenated by the engaging/disengaging mechanisms forms the motion of the linear incremental hydraulic actuator. LÄS MER

  5. 4. New Code Design and Analysis Tools for Serially Concatenated Systems

    Författare :ANDERS NILSSON; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : In-line bit interleaving has over the last decade been used in a number of papers, and has proven to be very effective. Although it has several advantages over conventional bit interleaving, the use of conventional bit interleaving is still far more common. LÄS MER

  7. 5. On the Construction and Analysis of Iteratively Decodable Codes

    Författare :Dmitri Truhachev; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Computer science; minimum distance; cycles; asymptotic performance; turbo codes; iterative decoding; low-density parity-check codes; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll;

    Sammanfattning : Iterative decoding methods allow efficient decoding of long codes that are composed of smaller component codes. As a result reliable communication can be achieved with low decoding complexity even for rates close to Shannon capacity. This makes iteratively decodable codes a very attractive object of study in modern coding theory. LÄS MER