检索结果-内蒙古大学图书馆

A Novel JFG Detection-Decoding Approach of a Vertical Shuffle Scheduling for Iterative MIMO Receivers with NB-LDPC Codes

学校读者我要写书评

暂无评论

SIGNAL PROCESSING 2022年 190卷 108287-108287页

作者： Haroun, Ali Al-Ghouwayel, Ali Chamas Hijazi, Hussein Jego, Christophe [a]Computer and Communications Engineering Department International University of Beirut BIU Beirut Lebanon [b]Computer and Communications Engineering department Lebanese International University LIU Bekaa Lebanon [c]BU SYSTEMS EXPLEO GROUP Toulouse France [d]Embedded Systems Division Ecole FRançaise d’Electronique et d’Informatique EFREI Paris France [e]Bordeaux INP CNRS IMS UMR 5218 Université de BordeauxTalence France

MIMO systems exploit multi-path propagation in a rich broadcast environment to improve throughput and performance of digital communication systems. The correspondent demappers require additional computational complexity. In this paper, a new detection-decoding approach based on vertical shuffle scheduling is proposed. Space exploration for the maximum likelihood detection is reduced to a dynamic region that surrounds the received symbol. Thus, a dynamic approach is proposed to detect the closest point of the channel observation without calculating all the candidate symbols in a constellation. In addition, a novel method based on EXIT chart study is proposed to find the sufficient number of neighboring points to search around a local minimum and then compute by recursion their Euclidean distances. Compared to the conventional Maximum Likelihood detector, the proposed algorithm allows a reduction in the computational complexity, in terms of number of multiplication, reaching 98 %. The simulation results show that the proposed algorithm outperforms the state-of-the-art algorithms like MMSE, sphere decoding, DBTC and DaVinci codes. Keywords: MIMO systems, Iterative Belief Propagation, Joint factor Graph, Vertical Shuffle Schedule, Dynamic Closest Point, EXIT Chart.

关键词： MIMO systems Iterative belief propagation Joint factor graph Vertical shuffle schedule Dynamic closest point EXIT Chart

Channel Estimation for Stacked Intelligent Metasurfaces in Rician Fading Channels

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Papazafeiropoulos, Anastasios Kourtessis, Pandelis Kaklamani, Dimitra I. Venieris, Iakovos S. Communications and Intelligent Systems Research Group University of Hertfordshire HatfieldAL10 9AB United Kingdom Microwave and Fiber Optics Laboratory Greece Intelligent Communications and Broadband Networks Laboratory School of Electrical and Computer Engineering National Technical University of Athens Zografou Athens15780 Greece

The recent combination of the rising architectures, known as stacked intelligent metasurface (SIM) and holographic multiple-input multiple-output (HMIMO), drives toward breakthroughs for next-generation wireless communication systems. Given the fact that the number of elements per surface of the SIM is much larger than the base station (BS) antennas, the acquisition of the channel state information (CSI) in SIM-aided multi-user systems is challenging, especially when a line-of-sight (LoS) component is present. Thus, in this letter, we address the channel procedure under conditions of Rician fading by proposing a protocol in terms of a minimum mean square error (MMSE) estimator for wave-based design in a single phase. Moreover, we derive the normalized mean square error (NMSE) of the suggested estimator, and provide the optimal phase shifts minimising the NMSE. Numerical results illustrate the performance of the new channel estimation protocol. © 2025, CC BY.

关键词： Mean square error

deepNIR: Datasets for generating synthetic NIR images and improved fruit detection system using deep learning techniques

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Sa, Inkyu Lim, JongYoon Ahn, Ho Seok MacDonald, Bruce CSIRO Data61 Robotics and Autonomous Systems Group Robot Perception Team Switzerland CARES Department of Electrical Computer and Software Engineering University of Auckland New Zealand

This paper presents datasets utilised for synthetic near-infrared (NIR) image generation and bounding-box level fruit detection systems. A high-quality dataset is one of the essential building blocks that can lead to success in model generalisation and the deployment of data-driven deep neural networks. In particular, synthetic data generation tasks often require more training samples than other supervised approaches. Therefore, in this paper, we share the NIR+RGB datasets that are re-processed from two public datasets (i.e., nirscene and SEN12MS), expanded our previous study, deepFruits, and our novel NIR+RGB sweet pepper(capsicum) dataset. We oversampled from the original nirscene dataset at 10, 100, 200, and 400 ratios that yielded a total of 127 k pairs of images. From the SEN12MS satellite multispectral dataset, we selected Summer (45 k) and All seasons (180 k) subsets and applied a simple yet important conversion;digital number (DN) to pixel value conversion followed by image standardisation. Our sweet pepper dataset consists of 1615 pairs of NIR+RGB images that were collected from commercial farms. We quantitatively and qualitatively demonstrate that these NIR+RGB datasets are sufficient to be used for synthetic NIR image generation. We achieved Frechet Inception Distance (FID) of 11.36, 26.53, and 40.15 for nirscene1, SEN12MS, and sweet pepper datasets respectively. In addition, we release manual annotations of 11 fruit bounding boxes that can be exported as various formats using cloud service. Four newly added fruits [blueberry, cherry, kiwi, and wheat] compound 11 novel bounding box datasets on top of our previous work presented in the deepFruits project [apple, avocado, capsicum, mango, orange, rockmelon, strawberry]. The total number of bounding box instances of the dataset is 162 k and it is ready to use from cloud service. For the evaluation of the dataset, Yolov5 single stage detector is exploited and reported impressive mean-average-precision, mAP[0.

关键词： Generative adversarial networks

Bayesian Learning for the Robust Verification of Autonomous Robots

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhao, Xingyu Gerasimou, Simos Calinescu, Radu Imrie, Calum Robu, Valentin Flynn, David Warwick Manufacturing Group University of Warwick Coventry United Kingdom Department of Computer Science University of York York United Kingdom Department of Computer Science and Assuring Autonomy International Programme University of York York United Kingdom Intelligent and Autonomous Systems Group Centrum Wiskunde & Informatica Amsterdam Netherlands Electrical Engineering Department Eindhoven University of Technology Eindhoven Netherlands James Watt School of Engineering University of Glasgow Glasgow United Kingdom

Autonomous robots used in infrastructure inspection, space exploration and other critical missions operate in highly dynamic environments. As such, they must continually verify their ability to complete the tasks associated with these missions safely and effectively. Here we present a Bayesian learning framework that enables this runtime verification of autonomous robots. The framework uses prior knowledge and observations of the verified robot to learn expected ranges for the occurrence rates of regular and singular (e.g., catastrophic failure) events. Interval continuous-time Markov models defined using these ranges are then analysed to obtain expected intervals of variation for system properties such as mission duration and success probability. We apply the framework to an autonomous robotic mission for underwater infrastructure inspection and repair. The formal proofs and experiments presented in the paper show that our framework produces results that reflect the uncertainty intrinsic to many real-world systems, enabling the robust verification of their quantitative properties under parametric uncertainty. © 2023, CC BY.

关键词： Robots

Chirped DFT-s-OFDM: A new single-carrier waveform with enhanced LMMSE noise suppression

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Yujie Guan, Yong Liang González, David G. Yanikomeroglu, Halim The Continental-NTU Corporate Laboratory Nanyang Technological University 637553 Singapore The Wireless Communications Technologies Group Continental AG Frankfurt am Main65936 Germany Lab Department of Systems and Computer Engineering Carleton University OttawaONK1S5B6 Canada

In this correspondence, a new single-carrier waveform, called chirped discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-s-OFDM), is proposed for the sixth generation of communications. By chirping DFT-s-OFDM in the time domain, the proposed waveform maintains the low peak-to-average-power ratio (PAPR) of DFT-s-OFDM. Thanks to full-band transmission and symbols retransmission enabled by chirping and discrete Fourier transform (DFT) precoding, the proposed waveform can enhance noise suppression of linear minimum mean square error equalization. Its bit error rate (BER) upper bound and diversity order are derived using pairwise error probability. Simulation results confirm that the proposed waveform outperforms the state-of-the-art waveforms in terms of BER, output signal-to-noise-ratio, and PAPR. Copyright © 2024, The Authors. All rights reserved.

关键词： Mean square error

Efficient Computing of Disaster-Disjoint Paths: Greedy and Beyond

学校读者我要写书评

暂无评论

Efficient Computing of Disaster-Disjoint Paths: Greedy and B...

IEEE Conference on computer Communications Workshops, INFOCOM Wksps

作者： Balázs Vass Erika Bérczi-Kovács Péter Gyimesi János Tapolcai Department of Telecommunication and Media Informatics Faculty of Electrical Engineering and Informatics (VIK) Budapest University of Technology and Economics (BME) and HUN-REN-BME Information Systems Research Group and MTA-BME Future Internet Research Group Faculty of Mathematics and Computer Science Babeş-Bolyai University Cluj Napoca Romania ELTE Eötvös Loránd University Budapest Hungary HUN-REN-ELTE Egerváry Research Group on Combinatorial Optimization

ISBN: (数字)9798350384475

ISBN: (纸本)9798350384482

In a network topology $G$ , we say a set of st-paths are disaster-disjoint if no disaster strikes more than one path. In this poster, we explore the basic capabilities and limitations of greedy and more advanced algorithms for computing maximal collections of such paths in planar networks. An algorithm is greedy if it generates consecutive paths $P_{1}, P_{2},\ldots$ according to a simple rule. In the simplest setting, the only rule is that $P_{i+1}$ is the closest clockwise disaster-disjoint from $P_{i}$ . We find that the simplest greedy may fail even when 1) $G$ is planar, 2) each disaster region is connected, and 3) each node failure (apart from s and $t$ ) is considered possible. Adding a simple rule explained in [1] yields a correct polynomial-time algorithm for the above problem. Finally, we digest a recent related near-linear runtime algorithm of [2] solving a more general problem and discuss the underlying relations among the foundations of these algorithms.

关键词： Greedy algorithms Visualization Runtime Network topology Disasters Conferences

Evaluation of the Montenegrin Academic Digital Innovation Hub 27

学校读者我要写书评

暂无评论

Evaluation of the Montenegrin Academic Digital Innovation Hu...

27th International Conference on Information Technology, IT 2023

作者： Lakovic, Luka Kara, Peter A. Ognjanovic, Ivana Bokor, Laszlo Sendelj, Ramo Reich, Christoph Roganovic, Milovan Zoulias, Emmanouil Erakovic, Jevto Radusinovic, Tanja Rakocevic, Nada Simon, Aniko University of Donja Gorica Faculty for Information Systems and Technologies Podgorica81000 Montenegro Budapest University of Technology and Economics Faculty of Electrical Engineering and Informatics Department of Networked Systems and Services Budapest1111 Hungary Faculty of Science Engineering and Computing Kingston University Wireless Multimedia and Networking Research Group Department of Computer Science School of Computer Science and Mathematics LondonKT1 2EE United Kingdom University of Donja Gorica Humanistic Studies Podgorica81000 Montenegro Furtwangen University Institute of Data Science Cloud Computing and It Security Furtwangen78120 Germany Clinical Centre of Montenegro Clinic for Neurology Podgorica81000 Montenegro National and Kapodistrian University of Athens Faculty of Nursing School of Health Sciences Goudi 11527 Greece Chamber of Economy of Montenegro Podgorica81000 Montenegro Sigma Technology Budapest1093 Hungary

ISBN: (纸本)9798350397512

In the era of global digitalization, digital innovation hubs have become essential, as they function as transforming forces. In this paper, we provide an analysis of the Montenegrin Academic Digital Innovation Hub by applying multi-criteria qualitative evaluation over several criteria: process flow of fully digitized operations of the Hub (with aspects of the innovation life-cycle, ethics, and security), resource management, strategic goals, and feasibility. The paper also proposes a model of comprehensive resource management via the perspective of smart specialization priorities of Montenegro. © 2023 IEEE.

关键词： Life cycle

ADVERSARIAL DECISIONS ON COMPLEX DYNAMICAL systems USING GAME THEORY

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cullen, Andrew C. Alpcan, Tansu Kalloniatis, Alexander C. School of Computer and Information Systems University of Melbourne Melbourne Australia Department of Electrical and Electronic Engineering University of Melbourne Melbourne Australia Defence Science and Technology Group Canberra Australia

We apply computational Game Theory to a unification of physics-based models that represent decision-making across a number of agents within both cooperative and competitive processes. Here the competitors try to both positively influence their own returns, while negatively affecting those of their competitors. Modelling these interactions with the so-called Boyd-Kuramoto-Lanchester (BKL) complex dynamical system model yields results that can be applied to business, gaming and security contexts. This paper studies a class of decision problems on the BKL model, where a large set of coupled, switching dynamical systems are analysed using game-theoretic methods. Due to their size, the computational cost of solving these BKL games becomes the dominant factor in the solution process. To resolve this, we introduce a novel Nash Dominant solver, which is both numerically efficient and exact. The performance of this new solution technique is compared to traditional exact solvers, which traverse the entire game tree, as well as to approximate solvers such as Myopic and Monte Carlo Tree Search (MCTS). These techniques are assessed, and used to gain insights into both nonlinear dynamical systems and strategic decision making in adversarial environments. © 2022, CC BY-NC-SA.

关键词： Decision making

A general variable neighborhood search for simulation-based energy-aware flow shop scheduling

学校读者我要写书评

暂无评论

A general variable neighborhood search for simulation-based ...

2020 Summer computer Simulation Conference, SCSC 2020, Held at the 2020 Summer Simulation Multi-Conference, SummerSim 2020

作者： Heinzl, Bernhard Kastner, Wolfgang Institute of Computer Engineering Automation Systems Group TU Wien Treitlstraße 1-3 ViennaA-1040 Austria

ISBN: (纸本)9781713819462

Simulation-based optimization methods can support decision-making in industrial Production Planning and Control (PPC) to include energy considerations as part of a multi-objective scheduling problem. In this paper, we investigate a General Variable Neighborhood Search (GVNS) metaheuristic for simulation-based energy-aware production scheduling, including optimization of setup times for thermal processes. The fitness evaluation is based on a hybrid discrete/continuous simulation model that provides assessment of energy costs including time-dependent energy pricing together with other production goals, like storage costs, while also considering dynamic interdependencies between production machinery and building facilities. We demonstrate the method on a case study of flow shop scheduling in an industrial bakery in different scenarios. Comparisons show a potential gain of 6% when considering energy costs as an optimization target within PPC. ©2020 Society for Modeling & Simulation International (SCS)

关键词： Decision making