This page has only limited features, please log in for full access.
Precise localization and tracking of moving non-collaborative persons and objects using a network of ultra-wideband (UWB) radar nodes has been shown to represent a practical and effective approach. In UWB radar sensor networks (RSNs), existence of strong clutter, weak target echoes, and closely spaced targets are obstacles to achieving a satisfactory tracking performance. Using a track-before-detect (TBD) approach, the waveform obtained by each node during a time period are jointly processed. Both spatial information and temporal relationship between measurements are exploited in generating all possible candidate trajectories and only the best trajectories are selected as the outcome. The effectiveness of the developed TBD technique for UWB RSNs is confirmed by numerical simulations and by two experimental results, both carried out with actual UWB signals. In the first experiment, a human target is tracked by a monostatic radar network with an average localization error of 41.9 cm with no false alarm trajectory in a cluttered outdoor environment. In the second experiment, two targets are detected by multistatic radar network with localization errors of 25.4 cm and 19.7 cm, and detection rate of the two targets is 88.75%, and no false alarm trajectory.
Bo Yan; Andrea Giorgetti; Enrico Paolini. A track-before-detect algorithm for UWB radar sensor networks. Signal Processing 2021, 189, 108257 .
AMA StyleBo Yan, Andrea Giorgetti, Enrico Paolini. A track-before-detect algorithm for UWB radar sensor networks. Signal Processing. 2021; 189 ():108257.
Chicago/Turabian StyleBo Yan; Andrea Giorgetti; Enrico Paolini. 2021. "A track-before-detect algorithm for UWB radar sensor networks." Signal Processing 189, no. : 108257.
Nowadays, high expectations are set for a digitally enabled circular economy (CE), to enhance resource efficiency. Tracing, tracking, and storing information is most important for this. In this paper, the application of Internet of Things (IoT) and Distributed Ledger Technology (Blockchain) are hence discussed by presenting the case of professional Electrical and Electronic Equipment (EEE) in Italy. Within the context of CE, prevention of electronic waste (WEEE) is extremely relevant as it is a fast-growing waste stream, and the products contain environmentally damaging substances as well as valuable and rare materials. The use of a proper combination of IoT and blockchain can help the producers to keep control on products until EEE end-of-life, while promoting CE strategies and supporting decision-making. Based on the outcomes of five interviews conducted in 2019 to companies of the EEE sector, potential improvements in the EEE end-of-use management are discussed. After providing the definition of requirements for both the technical solution and its testing are provided, three solution variations and the related business models are created and presented, as well as considerations on their environmental and economic impacts. The study shows how digital technologies can support the appropriate and circular management of EEE products and WEEE.
Chiara Magrini; Jana Nicolas; Holger Berg; Alberto Bellini; Enrico Paolini; Nazarena Vincenti; Luca Campadello; Alessandra Bonoli. Using Internet of Things and Distributed Ledger Technology for Digital Circular Economy Enablement: The Case of Electronic Equipment. Sustainability 2021, 13, 4982 .
AMA StyleChiara Magrini, Jana Nicolas, Holger Berg, Alberto Bellini, Enrico Paolini, Nazarena Vincenti, Luca Campadello, Alessandra Bonoli. Using Internet of Things and Distributed Ledger Technology for Digital Circular Economy Enablement: The Case of Electronic Equipment. Sustainability. 2021; 13 (9):4982.
Chicago/Turabian StyleChiara Magrini; Jana Nicolas; Holger Berg; Alberto Bellini; Enrico Paolini; Nazarena Vincenti; Luca Campadello; Alessandra Bonoli. 2021. "Using Internet of Things and Distributed Ledger Technology for Digital Circular Economy Enablement: The Case of Electronic Equipment." Sustainability 13, no. 9: 4982.
In this paper, the five fundamental issues of target extension, target maneuvering, closely spaced targets, weak targets, and dense clutter are tackled simultaneously in the framework of a new tracking approach that is capable of effectively detecting multiple closely-spaced maneuvering weak and extended targets in densely cluttered environment. The proposed technique finds its foundation in the track-before-detect (TBD) paradigm, proven to be effective in tracking weak targets in presence of dense clutter. The approach consists of two stages. In the first stage, a 3-dimensional projection based TBD algorithm allows addressing the problem of target extension, weak targets, and dense clutter. Straight line tracklets are obtained at the end of the first stage. In the second stage, tracklets association is performed to obtain the target trajectories. The issue of closely spaced targets and target maneuvering is addressed in this second stage. To illustrate the effectiveness of the proposed approach, synthetic data, real data from a netted radar system, and real data from a high resolution radar are processed both with the proposed algorithm and with several existing algorithms. The obtained results reveal that the proposed method can outperform the competing approaches in various scenarios.
Bo Yan; Enrico Paolini; Na Xu; Zhifeng Sun; Luping Xu. Multiple maneuvering extended targets detection by 3D projection and tracklet association. Signal Processing 2020, 179, 107821 .
AMA StyleBo Yan, Enrico Paolini, Na Xu, Zhifeng Sun, Luping Xu. Multiple maneuvering extended targets detection by 3D projection and tracklet association. Signal Processing. 2020; 179 ():107821.
Chicago/Turabian StyleBo Yan; Enrico Paolini; Na Xu; Zhifeng Sun; Luping Xu. 2020. "Multiple maneuvering extended targets detection by 3D projection and tracklet association." Signal Processing 179, no. : 107821.
In this paper, a dynamic access probability adjustment strategy for coded random accessschemes based on successive interference cancellation (SIC) is proposed. The developed protocolconsists of judiciously tuning the access probability, therefore controlling the number of transmittingusers, in order to resolve medium access control (MAC) layer congestion states in high load conditions.The protocol is comprised of two steps: Estimation of the number of transmitting users during thecurrent MAC frame and adjustment of the access probability to the subsequent MAC frame, based onthe performed estimation. The estimation algorithm exploits a posteriori information, i.e., availableinformation at the end of the SIC process, in particular it relies on both the frame configuration(residual number of collision slots) and the recovered users configuration (vector of recovered users)to effectively reduce mean-square error (MSE). During the access probability adjustment phase, atarget load threshold is employed, tailored to the packet loss rate in the finite frame length case.Simulation results revealed that the developed estimator was able to achieve remarkable performanceowing to the information gathered from the SIC procedure. It also illustrated how the proposeddynamic access probability strategy can resolve congestion states efficiently.
Jingyun Sun; Rongke Liu; Enrico Paolini; Sun; Liu. A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes. Sensors 2019, 19, 4206 .
AMA StyleJingyun Sun, Rongke Liu, Enrico Paolini, Sun, Liu. A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes. Sensors. 2019; 19 (19):4206.
Chicago/Turabian StyleJingyun Sun; Rongke Liu; Enrico Paolini; Sun; Liu. 2019. "A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes." Sensors 19, no. 19: 4206.
In this chapter, low-density parity-check (LDPC) codes, a class of powerful iteratively decodable error correcting codes, are introduced. The chapter first reviews some basic concepts and results in information theory such as Shannon’s channel capacity and channel coding theorem. It then overviews the flash memory channel model. Next, it addresses binary LDPC codes describing both their structure and efficient implementation, and their belief propagation and reduced-complexity decoding algorithms. Non-binary LDPC codes and their belief propagation decoding algorithm are also addressed. Finally simulation results are provided.
E. Paolini. Low-Density Parity-Check (LDPC) Codes. Solid-State-Drives (SSDs) Modeling 2018, 407 -453.
AMA StyleE. Paolini. Low-Density Parity-Check (LDPC) Codes. Solid-State-Drives (SSDs) Modeling. 2018; ():407-453.
Chicago/Turabian StyleE. Paolini. 2018. "Low-Density Parity-Check (LDPC) Codes." Solid-State-Drives (SSDs) Modeling , no. : 407-453.
In this letter, we develop a converse bound on the asymptotic load threshold of coded slotted ALOHA (CSA) schemes with K-multi packet reception capabilities at the receiver. Density evolution is used to track the average probability of packet segment loss and an area matching condition is applied to obtain the converse. For any given CSA rate, the converse normalized to K increases with K, which is in contrast with the results obtained so far for slotted ALOHA schemes based on successive interference cancellation. We show how the derived bound can be approached using spatially-coupled CSA.
Čedomir Stefanović; Enrico Paolini; Gianluigi Liva. Asymptotic Performance of Coded Slotted ALOHA with Multi Packet Reception. 2017, 1 .
AMA StyleČedomir Stefanović, Enrico Paolini, Gianluigi Liva. Asymptotic Performance of Coded Slotted ALOHA with Multi Packet Reception. . 2017; ():1.
Chicago/Turabian StyleČedomir Stefanović; Enrico Paolini; Gianluigi Liva. 2017. "Asymptotic Performance of Coded Slotted ALOHA with Multi Packet Reception." , no. : 1.
In this chapter, low-density parity-check (LDPC) codes, a class of powerful iteratively decodable error correcting codes, are introduced. The chapter first reviews some basic concepts and results in information theory such as Shannon’s channel capacity and channel coding theorem. It then overviews the Flash memory channel model. Finally, it addresses LDPC codes describing both their structure and efficient implementation, and their decoding algorithms. Simulation results are also provided.
E. Paolini. Low-Density Parity-Check (LDPC) Codes. Solid-State-Drives (SSDs) Modeling 2012, 293 -331.
AMA StyleE. Paolini. Low-Density Parity-Check (LDPC) Codes. Solid-State-Drives (SSDs) Modeling. 2012; ():293-331.
Chicago/Turabian StyleE. Paolini. 2012. "Low-Density Parity-Check (LDPC) Codes." Solid-State-Drives (SSDs) Modeling , no. : 293-331.
Michael Lentmaier; Gianluigi Liva; Enrico Paolini; Gerhard Fettweis. From product codes to structured generalized LDPC codes. Proceedings of the 5th International ICST Conference on Communications and Networking in China 2010, 1 .
AMA StyleMichael Lentmaier, Gianluigi Liva, Enrico Paolini, Gerhard Fettweis. From product codes to structured generalized LDPC codes. Proceedings of the 5th International ICST Conference on Communications and Networking in China. 2010; ():1.
Chicago/Turabian StyleMichael Lentmaier; Gianluigi Liva; Enrico Paolini; Gerhard Fettweis. 2010. "From product codes to structured generalized LDPC codes." Proceedings of the 5th International ICST Conference on Communications and Networking in China , no. : 1.
The design of low-density parity-check (LDPC) codes under hybrid iterative / maximum likelihood decoding is addressed for the binary erasure channel (BEC). Specifically, we focus on generalized irregular repeat-accumulate (GeIRA) codes, which offer both efficient encoding and design flexibility. We show that properly designed GeIRA codes tightly approach the performance of an ideal maximum distance separable (MDS) code, even for short block sizes. For example, our (2048,1024) code reaches a codeword error rate of 10-5 at channel erasure probability isin= 0.450, where an ideal (2048,1024) MDS code would reach the same error rate at isin = 0.453.
E. Paolini; G. Liva; B. Matuz; Marco Chiani. Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding. IEEE Communications Letters 2008, 12, 450 -452.
AMA StyleE. Paolini, G. Liva, B. Matuz, Marco Chiani. Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding. IEEE Communications Letters. 2008; 12 (6):450-452.
Chicago/Turabian StyleE. Paolini; G. Liva; B. Matuz; Marco Chiani. 2008. "Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding." IEEE Communications Letters 12, no. 6: 450-452.