Sökning: "MAP algorithm"

Visar resultat 1 - 5 av 123 avhandlingar innehållade orden MAP algorithm.

  1. 1. Helping robots help us : Using prior information for localization, navigation, and human-robot interaction

    Författare :Malcolm Mielle; Martin Magnusson; Achim Lilienthal; Erik Schaffernicht; Marjorie Skubic; Örebro universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph-based SLAM; prior map; sketch map; emergency map; map matching; graph matching; segmentation; search and rescue;

    Sammanfattning : Maps are often used to provide information and guide people. Emergency maps or floor plans are often displayed on walls and sketch maps can easily be drawn to give directions. However, robots typically assume that no knowledge of the environment is available before exploration even though making use of prior maps could enhance robotic mapping. LÄS MER

  3. 2. 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

  4. 3. 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

  5. 4. Efficient Map Matching and Discovery of Frequent and Dominant Movement Patterns in GPS Trajectory Data

    Författare :Can Yang; Yifang Ban; Gyözö Gidofalvi; Xiaoliang Ma; Mirco Nanni; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; map matching; contiguous sequential pattern mining; contiguous sequential pattern comparison; movement pattern detection; Kartmatchning; sammanhängande sekventiellt mönster utvinning; sammanhängande sekventiellt mönster jämförelse; rörelsemönster detektering; Geoinformatics; Geoinformatik;

    Sammanfattning : The wide deployment of Global Positioning System (GPS) sensors for movement data collection has enabled a wide range of applications in transportation and urban planning. Frequent and dominant movement patterns embedded in GPS trajectory data provide valuable knowledge including the spatial and temporal distribution of frequent routes selected by the tracked objects and the regular movement behavior in certain regions. LÄS MER

  7. 5. Towards the Limits of Nonlinearity Compensation for Fiber-Optic Channels

    Författare :Naga Vishnukanth Irukulapati; Chalmers tekniska högskola; []
    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; Viterbi algorithm; fiber-optic channel; stochastic digital backpropagation; performance limits; factor graphs; near-MAP detector; Digital backpropagation; nonlinear compensation; mutual information;

    Sammanfattning : The performance of long-haul coherent optical systems is fundamentally limited by fiber nonlinearity and its interplay with chromatic dispersion and noise. Due to nonlinearity, the signal propagating through the fiber interacts with itself and with the noise generated from the inline amplifiers. LÄS MER