Search

Doctoral education has been shaped by a continuous interaction between the research community and representatives of the governmental authorities. In Sweden, doctorates were organised into structured educational programmes in 1969. In this study, the development of doctoral education in Medical Radiation Physics at Lund University, Sweden, was analysed over approximately 50 years, in terms of quantitative parameters related to throughput rate and scientific production making up the doctoral theses. Theses from two time periods (1970 to 1999 versus 2001 to 2023) were compared in terms of the total number of full papers (either accepted or in manuscript form), number of accepted full papers and number of accepted full papers as first author. For all three categories of included papers, median values were not significantly different between the two time periods while the variances were significantly smaller for the period 2001 to 2023 (level of significance 0.05). The time between admission and thesis defence decreased with time, according to linear correlation analysis, while the number of supervisors increased. Doctoral theses showed a significantly more uniform composition after a major political reform in 1998. Hence, doctoral education can be described as becoming more efficient and predictable. It is suggested that the primary causes include the introduction of individual study plans and secured personal financial support. The increased efficiency can also be problematised regarding, for example, insufficient independence and limited freedom of research. [ABSTRACT FROM AUTHOR]

To perform phosphoproteomics and signal transduction studies, a number of protein kinase activities and levels must be simultaneously analyzed in different cell samples and correlated with phosphoprotein patterns to obtain conclusions with regard to the regulation of kinase networks. We describe here a miniaturized format of the classical phosphocellulose (P81) paper binding assay with which up to 594 kinase reactions can be simultaneously analyzed. Kinase peptide substrates possessing a minimum of three consecutive basic residues were subjected to phosphorylation in 96-well plates and aliquots of the phosphorylation reactions were spotted on arrays printed on P81 papers. Phosphorylation levels were quantified using a storage phosphor system imager. The versatility of the procedure was validated by analyzing casein kinase 2, protein kinase C, and p34cdc2/cyclin B in cell extracts and testing the effect of known inhibitors and activators on kinase activities. This improved, miniaturized version of the classical P81 paper method combines simplicity, high sensitivity, high reproducibility, high reliability, and optimal Z factors and takes into account possible sources of background signals. We discuss the possibility of automation and the advantages over other methods. [Copyright &y& Elsevier]

Benchmarking systems is difficult. Mistakes can compromise guarantees and threaten reproducibility and comparability. We conduct a study to show that benchmarking flaws are widespread in systems security defense papers, even at tier-1 venues. We aim to raise awareness and provide recommendations for safeguarding the scientific process in our community. [ABSTRACT FROM AUTHOR]

This report describes The University of Texas Student Cluster Competition team’s effort to reproduce the results of “MemXCT: memory-centric X-ray CT reconstruction with massive parallelization” (Hidayetoğlu et al., 2019). The article details a new memory-centric approach that reconstructs X-ray computed tomography (XCT) from noisy raw data. In our reproduction experiments, we utilized Microsoft Azure’s CycleCloud tool to provision, orchestrate, and manage our computing cluster in the cloud. In particular, we scheduled and benchmarked reconstruction workloads using Azure’s CPU-based HC44rs and GPU-based NC12s v2 virtual machine (VM) types to evaluate the scalability properties of the reconstruction approach and the performance differences between architectures. The HC44rs VMs contained 44 Intel Xeon Platinum cores, while the NC12s v2 VM was equipped with two NVIDIA P100 GPUs. We used a recent version of Intel’s compiler stack with the MKL library for our CPU code along with CUDA 11.1 on GPUs. Overall, our results confirm the findings of the original article, demonstrating similar acceleration on GPUs and scalability properties on CPUs. Digital artifacts from these experiments are available at: 10.5281/zenodo.5598108 [ABSTRACT FROM AUTHOR]

With the ratification of the IEEE 802.11ad amendment to the 802.11 standard in December 2012, a major step has been taken to bring consumer wireless communication to the millimeter wave band. However, multi-gigabit-per-second throughput and small interference footprint come at the price of adverse signal propagation characteristics, and require a fundamental rethinking of Wi-Fi communication principles. This article describes the design assumptions taken into consideration for the IEEE 802.11ad standard and the novel techniques defined to overcome the challenges of mm-Wave communication. In particular, we study the transition from omnidirectional to highly directional communication and its impact on the design of IEEE 802.11ad. [ABSTRACT FROM PUBLISHER]

Power assignment schemes are man-made methods to enhance the capture effect of radio communications. In a previous study, Wen and Yang investigated the combined capture effect of the fixed power assignment scheme, Rayleigh fading, and near–far effect on the performance of packet radios. The performance analysis was limited to an infinite population environment. This assumption is reasonable for a conventional packet radio system with a vast service area. However, for a cellular mobile system, a finite population model should be used. In this paper, we analyse the combined natural and man-made capture effect on the performance of a cellular system with finite population in each cell. A random power assignment scheme is adopted to produce the man-made capture. The system throughput and delay are carried out by a Markov model. Some numerical calculations are used to demonstrate the degree of performance improvement. Copyright © 2001 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Achieving high throughput is the most important goal of cognitive radio networks. The main process in cognitive radio is spectrum sensing that targets getting vacant channels. There are many sensing methods like matched filter, feature detection, interference temperature and energy detection which is employed in the proposed system; however, energy detection suffers from noise uncertainty. In this paper a study of throughput under noise fluctuation effect is introduced. The work in this paper proposes multi-channel system; the overall multi-channel throughput is studied under noise fluctuation effect. In addition, the proficiency of the network has been examined under different number of channels and sensing time with noise uncertainty. [ABSTRACT FROM AUTHOR]

Abstract: Emergency Department (ED) crowding is a common problem in the United States and around the world. Process reengineering methods can be used to understand factors that contribute to crowding and provide tools to help alleviate crowding by improving service quality and patient flow. In this article, we describe the ED as a service business and then discuss specific methods to improve the ED quality and flow. Methods discussed include demand management, critical pathways, process-mapping, Emergency Severity Index triage, bedside registration, Lean and Six Sigma management methods, statistical forecasting, queuing systems, discrete event simulation modeling and balanced scorecards. The purpose of this review is to serve as a background for emergency physicians and managers interested in applying process reengineering methods to improving ED flow, reducing waiting times, and maximizing patient satisfaction. Finally, we present a position statement on behalf of the American Academy of Emergency Medicine addressing these issues. [Copyright &y& Elsevier]

The article presents abstracts on shipbuilding which include cutter section dredger, lightship weight, and sandwich panels for car deck structure.

Vehicular fog computing (VFC) is an advanced standard that utilizes one or more cooperative end-users or neighboring edge devices for communication, storage, configuration, control, management, and measurement operations. This paper studies the reliability of VFC which is explored as a function of its reliable hardware. The architecture of VFC is a multi-layered architecture, therefore composite modeling technique is adopted for the reliability study. Different models are constructed for each layer using reliability block diagrams, and then the models are integrated to obtain the reliability of the entire VFC network. Further, this paper analyses the performance of VFC and evaluates various measures such as end-to-end delay, throughput and utilization. A queueing network model depicting the message dissemination scheme in the network is proposed to evaluate the performance measures. Numerical results are also obtained to show the efficacy of the proposed models. [ABSTRACT FROM AUTHOR]

In permissioned blockchain networks, the Proof of Authority (PoA) consensus, which uses the election of authorized nodes to validate transactions and blocks, has been widely advocated thanks to its high transaction throughput and fault tolerance. However, PoA suffers from the drawback of centralization dominated by a limited number of authorized nodes and the lack of anonymity due to the round-robin block proposal mechanism. As a result, traditional PoA is vulnerable to a single point of failure that compromises the security of the blockchain network. To address these issues, we propose a novel decentralized reputation management mechanism for permissioned blockchain networks to enhance security, promote liveness, and mitigate centralization while retaining the same throughput as traditional PoA. This paper aims to design an off-chain reputation evaluation and an on-chain reputation-aided consensus. First, we evaluate the nodes' reputation in the context of the blockchain networks and make the reputation globally verifiable through smart contracts. Second, building upon traditional PoA, we propose a reputation-aided PoA (rPoA) consensus to enhance security without sacrificing throughput. In particular, rPoA can incentivize nodes to autonomously form committees based on reputation authority, which prevents block generation from being tracked through the randomness of reputation variation. Moreover, we develop a reputation-aided fork-choice rule for rPoA to promote the network's liveness. Finally, experimental results show that the proposed rPoA achieves higher security performance while retaining transaction throughput compared to traditional PoA. [ABSTRACT FROM AUTHOR]

This paper discusses radio resource management in the telecommunications industry that utilizes opportunistic scheduling approaches and methods. It proposes a new scheduler called IFMR (Improved Fairness of MaxRate) to extend the opportunistic approach with the proposition of a new scheduling solution that enables to significantly maximize the system throughput. Our goal is to ensure better results that maximize system throughput, ensure perfect fairness at three levels and maximize the number of satisfied users who have achieved their desired throughput. Similarly, the performance of the proposed algorithm is evaluated and compared with reference algorithms: round robin, MaxSNR and proportional fair (PF). The focus of this study is to evaluate and analyze the quality of service guaranteed to each network subscriber, considering the heterogeneous data traffic based on simulations. The algorithms presented in this paper are programmed and simulated using the MATLAB simulation software. The study aims to effectively analyze the impact of radio resource management algorithms and schedulers, including the round robin algorithm, MaxSNR and PF, among others, with the main objective of evaluating the performance of the schedulers used by telecommunication and cellphone network operators. The scheduling phase, which precedes resource allocation and assignment, is a critical aspect of the study. The impact of these schedulers on throughput and fairness will also be evaluated and analyzed based on specific criteria. [ABSTRACT FROM AUTHOR]

Mobile Ad Hoc Networks (MANETs) are decentralized networks where mobile nodes communicate through radio waves without fixed infrastructure. However, they are susceptible to security attacks like the black hole attack, where malicious nodes claim optimal routes to intercept packets. This paper focuses on detecting black hole attacks within MANETs using a hybrid routing protocol. Specifically, the Modified-Zone-Based Hierarchical Link State (M-ZHLS) routing protocol is proposed and evaluated against existing protocols using simulations in NS2. The proposed method employs on-demand topology information transmission and utilizes techniques like expanding ring flooding for route discovery. Simulation results demonstrate that M-ZHLS outperforms existing protocols by reducing average delay by 5%, lowering routing overhead by 4%, and increasing delivery ratio by 4.5%. Future work aims to further enhance network performance in real-time environments. [ABSTRACT FROM AUTHOR]

Wireless Mobile Ad Hoc Networks (MANETs) present topologies where nodes act as both hosts and routes, necessitating efficient routing protocols to handle frequent route updates and transmission congestion. This paper proposes a novel routing algorithm, Fuzzy Controller Ad hoc On-demand Distance Vector (FC-AODV), to address these challenges. The FC-AODV algorithm is designed to improve packet delivery ratio, throughput, end-to-end delay, packet loss, remaining energy, and routing overhead compared to the traditional AODVprotocol. Through extensive simulations using NS 2, the proposed algorithm demonstrates superior performance across varying network scenarios. Results indicate an average increase of 12.4% in packet delivery ratio, 10.27% in throughput, and a decrease of 5.37% in end-to-end delay compared to AODV. Additionally, FC-AODV reduces packet loss by 5.57%, increases remaining energy by 6.4%, and decreases routing overhead by 6.37%. Future research directions include applying the FC-AODV concept to satellite networks, exploring the integration of shortest path algorithms, and evaluating FC-AODV in real-time network environments. [ABSTRACT FROM AUTHOR]

An increase in the use of smart and portable devices like smartphones, laptops, and tablets has led to a rise in the number of network interfaces and thus the number of possible channels for communication. However, the current approach over the Internet only employs a single path for a communication session. As an innovative and promising method for real-time transmission based on GRE-in-UDP encapsulation, which provides an IPv4 or IPv6 tunneling mechanism, this paper presents multipath throughput testing for the MPT network layer multipath communication library. We investigated the effectiveness of MPT's channel capacity aggregation while dealing with wired channels and examined scenarios in symmetric and asymmetric paths. Our network throughput measurements showed that MPT can efficiently aggregate the capacities of both symmetric and asymmetric paths. In this paper, we established a network topology that included a server, which we used for generating various quality of service (QoS) metrics. We measured how latency, transmission speed, packet loss rate, jitter, and the setting of the path weights influence throughput aggregation capability of the MPT communication library. [ABSTRACT FROM AUTHOR]

Due to the great demand of throughput and reliability for multimedia applications in Fifth Generation (5G) networks, many broadcasting systems adopt the Millimeter Wave (mmWave) technology to address the lack of the spectrum resources. As one of 5G-PPP projects, Internet of Radio Light (IoRL) project adopts 40GHz mmWave band to support a high-speed and stable Ultra-High-Definition (UHD) television broadcasting service in the indoor environment. Because of the high frequency property, mmWave bands usually suffers from the high path loss and the penetration loss. Thus, in order to overcome these issues, directional antennas are employed to provide additional power gain while increasing transmission distance. However, the mmWave with directional antennas brings additional problems, such as limited transmission angle and more multipath effects. Therefore, in this paper, for better understanding of impact factors on the signal quality and transmission coverage of the directional 40GHz mmWave band in the indoor environment, a measurement campaign is introduced in detail and the channel characteristics are measured and analysed in varying cases. The mainly concerned characteristics are path loss, shadow fading, average Power Delay Profile (PDP), Root-Mean-Square (RMS) delay spread, arrival rate and coherence bandwidth. All Measured characteristic values are summarised in three tables at the end of this paper. Besides of these, as a reference of channel analysis and a metric of signal quality and effective coverage, Error Vector Magnitude (EVM) of received signal in each case is measured and discussed. Moreover, a simulation is performed based on a statistical channel model to validate the measured results. [ABSTRACT FROM AUTHOR]

Increased use of ultra-wideband (UWB) in biomedical applications based on wireless body area networks (WBAN) opens a variety of options in the field of biomedical research. WBAN may aid in the continuous health monitoring of patients while they go about their everyday lives. Many studies and researchers were conducted several experimentations in the same field for the performance improvement. This study covered the hybridization of UWB technology, as well as on-body, off-body, and human-body ultra-wideband communication (HB-UWB). In this paper, the parameters considered are throughput, energy consumption, energy efficiency, energy used, network survival and delay. An improved model for design and assessment of power-saving UWB-WBAN was developed in this paper. A novel protocol model was introduced in this paper, namely low-power traffic-aware emergency based narrowband protocol (LTE-NBP) to overcome the major drawbacks of emergency, critical data transmission, reliability and the power issues in UWB-WBAN. It's the emergency-based low-power traffic-aware narrowband protocol. It is based on the dual-band physical layer technology. The suggested protocol considered an aware traffic model and an emergency medium access control (MAC) protocol. The proposed model's performance was evaluated and compared with the related algorithms on different performance parameters. The improved model is found to be efficient in throughput, energy efficiency, energy consumption, and delay. [ABSTRACT FROM AUTHOR]

Assembly processes play a big role in the current business context as global supply chains depend on many subcomponents to produce a single finished product. Previous studies have shown contrasting results regarding the effect that supply variability (the variability of feeding stations) has on the performance of assembly systems, as opposed to the variability of the station matching and assembling the components. This paper aims to close this gap by studying the behaviour of simple assembly systems with differing degrees of variability allocation among the stations through an experimental simulation study. Results suggest that a reduction in feeding station variability results in higher throughput, even in systems where the variability of one of the feeding stations increases while the other decreases. Furthermore, in scenarios with high total variance, the highest throughput is reached by transferring both variance and work from one of the feeding stations to any other station, whereas in low variance systems symmetrical work transfer to the feeding stations results in the highest throughput, as previously shown. Finally, reducing feeding station variability decreased the time spent in the assembly station (waiting time for component matching plus time for the assembly operation) only in experiments with high total variance. [ABSTRACT FROM AUTHOR]

Today's unique assembly challenges are comprised of complex printed circuit board (PCB) panelization, involving identical PCBs with a goal of increased production capability, due to a reduced footprint of the production floor. Identical PCBs that are within the same panel, with uniform spacing in an array or carrier, need to be dispensed at the same time. All these high-mix challenges have gone mainstream and affect real productivity and throughput. Existing manual dual-head dispensing systems do not consider the rotational correction for the second head, which leads to yield loss. To eliminate the yield loss on the second head, there is a mini XY drive system incorporated that provides fast and accurate dispensing to double the process capabilities over the same work area. Dynamic dual-head (DDH) dispensing uses a unique mini XY drive system on the left head, mounted on a separate Z-axis, to dynamically control the position of the head for accurately aligning to a second part, while synchronously dispensing both parts. The machine vision system performs the substrate alignment for each identical PCB that is individually placed in a carrier, which provides greater potential for variation in offset and skew. During synchronous dispensing for the second part with the DDH all the kinematic adjustment is performed with calculated values, from the skew angle and scaling factor. This technique guarantees increased productivity whilst maintaining yields through unsurpassed accuracy. DDH also provides the same level of adjustment and rotational correction for all step and repeated PCBs, flex circuits, and panel designs. If a product contains an odd number of units, then either of the heads can be programmed for dispensing while the others cannot. This paper examines proven methods to determine the dot/line positional accuracy along with the mass flow rate for both heads during synchronous dispensing. This paper will also address the challenges faced, and how the rotational correction can achieve up to 23 higher throughput than existing single/dual head dispensing systems. [ABSTRACT FROM AUTHOR]

Cognitive Radio (CR) is developed to provide effective spectrum usage. CR is much significant in improving the efficiency of the global internet in applications. The evolutionary measurement technology is utilised to improve the evaluation of channel-state information. The outcome attained very few spectrums sensing in CR for complex mobility. A good optimisation method is needed to improve the accurate channel state prediction in successful channel access. Thus, this paper aims to implement a novel power and channel allocation mechanism with the help of a new Modified Levy Flight-based Artificial Ecosystem Optimisation (MLF-AEO) Optimisation Strategy. This paper achieves the optimal power control and channel allocation mechanism intending to solve the multiple objective functions based on the constraints like Interference among users, Outage Probability, and throughput. The superiority of the proposed algorithm is thoroughly verified by various simulation results. [ABSTRACT FROM AUTHOR]

To exploit richer spectrum resources for even better service quality, millimeter wave (mmWave) communication has been considered for high-speed railway (HSR) communication systems. In this paper, we focus on scheduling as many flows as possible while satisfying their QoS requirements. Due to interference, eavesdropping, or other problems, some flows may not be directly transmitted from the track-side BS. In this paper, we propose an UAV-assisted scheduling scheme which utilizes a UAV to serve as relay for such flows. The proposed scheme also utilize two mmWave bands, one for the BS links and the other for the UAV links. The proposed algorithm aims to maximize the number of flows with their QoS requirements satisfied. Simulations demonstrate that the proposed scheme achieves a superior performance on the number of completed flows and the system throughput over two baseline schemes. [ABSTRACT FROM AUTHOR]

In the recent strategic queueing literature, there is a large number of papers that study the join-or-balk dilemma in queueing systems with server's on-off periods, modeling vacations and failures. These studies consider the customers as discrete units and adopt the assumption that reneging is not permitted. In the present paper, we depart from this framework and study the effect of the reneging option in such systems. We consider the fluid on-off model of the basic queue with vacations/failures and study reneging vs. no-reneging when customers are strategic. We derive the equilibrium customer strategies and the corresponding performance measures of the system, and we use them to study the equilibrium throughput and social welfare. The main finding is that the existence of the reneging option is very beneficial for overloaded systems, i.e., for such systems balking alone is not sufficient to achieve good outcomes. On the contrary, for underloaded systems the reneging option is not particularly valuable. [ABSTRACT FROM AUTHOR]

Software-defined networking (SDN) is a new way of designing and managing networks. The central SDN controller serves as the network's brain in the control plane. This paper compares the performance of OpenDayLight (ODL) and Ryu SDN controllers by installing the most stable version of the controllers on a realistic test environment, Mininet, on which several other SDN controllers are built. The sFlow and snort tools have been used to compare the performance of the two controllers for a variety of different workloads. Tests were carried out by launching Distributed Denial of Service (DDoS) attacks on the host, stopping them, and then examining the outcomes. Experimental results show that the ODL controller is more effective than the Ryu controller in dealing with DDoS attacks on the SDN network. DDoS attacks are detected using Mininet analysis and the tools Snort and sFlow. The results also show that both controllers perform better in terms of flow setup latency and load shedding performance compared to the Ryu controller. The ODL controller exceeds the Ryu controller in levels of jitter, and its computational complexity outperforms the Ryu controller in terms of processing power. Based on these test findings, it can be concluded that both controllers perform equally well in terms of jitter and ODL is more reliable than Ryu. [ABSTRACT FROM AUTHOR]

Distributed replicated databases play a crucial role in modern computer systems enabling scalable, fault-tolerant, and high-performance data management. However, achieving these qualities requires resolving a number of tradeoffs between various properties during system design and operation. This paper reviews trade-offs in distributed replicated databases and provides a survey of recent research papers studying distributed data storage. The paper first discusses a compromise between consistency and latency that appears in distributed replicated data storages and directly follows from CAP and PACELC theorems. Consistency refers to the guarantee that all clients in a distributed system observe the same data at the same time. To ensure strong consistency, distributed systems typically employ coordination mechanisms and synchronization protocols that involve communication and agreement among distributed replicas. These mechanisms introduce additional overhead and latency and can dramatically increase the time taken to complete operations when replicas are globally distributed across the Internet. In addition, we study tradeoffs between other system properties including availability, durability, cost, energy consumption, read and write latency, etc. In this paper we also provide a comprehensive review and classification of recent research works in distributed replicated databases. Reviewed papers showcase several major areas of research, ranging from performance evaluation and comparison of various NoSQL databases to suggest new strategies for data replication and putting forward new consistency models. In particular, we observed a shift towards exploring hybrid consistency models of causal consistency and eventual consistency with causal ordering due to their ability to strike a balance between operations ordering guarantees and high performance. Researchers have also proposed various consistency control algorithms and consensus quorum protocols to coordinate distributed replicas. Insights from this review can empower practitioners to make informed decisions in designing and managing distributed data storage systems as well as help identify existing gaps in the body of knowledge and suggest further research directions. [ABSTRACT FROM AUTHOR]

Motivated by applications in data center networks, in this paper, we study the problem of scheduling in an input queued switch. While throughput maximizing algorithms in a switch are well-understood, delay analysis was developed only recently. It was recently shown that the well-known MaxWeight algorithm achieves optimal scaling of mean queue lengths in steady state in the heavy-traffic regime, and is within a factor less than 2 of a universal lower bound. However, MaxWeight is not used in practice because of its high time complexity. In this paper, we study several low complexity algorithms and show that their heavy-traffic performance is identical to that of MaxWeight. We first present a negative result that picking a random schedule does not have optimal heavy-traffic scaling of queue lengths even under uniform traffic. We then show that if one picks the best among two matchings or modifies a random matching even a little, using the so-called flip operation, it leads to MaxWeight like heavy-traffic performance under uniform traffic. We then focus on the case of non-uniform traffic and show that a large class of low time complexity algorithms have the same heavy-traffic performance as MaxWeight, as long as it is ensured that a MaxWeight matching is picked often enough. We also briefly discuss the performance of these algorithms in the large scale heavy-traffic regime when the size of the switch increases simultaneously with the load. Finally, we perform empirical study on a new algorithm to compare its performance with some existing algorithms. [ABSTRACT FROM AUTHOR]

Massive MIMO (Multiple Input Multiple Output) systems impose significant processing burdens along with strict latency requirements. The combination of large-scale antenna arrays and wide bandwidth requirements for next-generation wireless systems creates an exponential increase in frontend to backend data. Balancing the processing latency and reliability is critical for baseband processing tasks such as QAM detection. While linear detection algorithms have low computational complexity, their use in Massive MIMO scenario has heavy degradation in error performance. Nonlinear detection methods such as Maximum Likelihood and Sphere Decoding have good error performance, but they suffer from high, variable, and uncontrollable computational complexity. For such cases, the K-best QAM detection algorithm can provide required control over the system performance while maintaining near-ML error performance. In this paper, hard-output, as well as soft-output K-best QAM detection, is implemented in a CPU by utilizing the multiple cores combined with vector processing. Similarly, hard-output detection in a GPU is implemented by leveraging the SIMD (Single Instruction, Multiple Data) architecture and Warp-based execution model. The processing time per bit and the energy consumption per bit are compared for CPU and GPU implementations for QAM constellation density and MIMO array size. The GPU implementation shows up to 5× processing latency per bit improvement and up to 120× energy consumption per bit improvement over the CPU implementation for typical QAM constellations such as 4, 16, and 64 QAM. GPU implementation also shows up to 125× improvement over CPU implementation in energy consumption per bit for larger MIMO configurations such as 24 × 24 and 32 × 32. Finally, the soft-output detector is combined with a LDPC (Low-Density Parity Check) decoder to obtain the FER (Frame Error Rate) performance for CPU implementation. The FER is then combined with frame processing latency to form a Goodput metric to demonstrate the latency and reliability tradeoff. [ABSTRACT FROM AUTHOR]

The reconfigurable intelligent surfaces (RIS) represent a transformative technology in wireless communication, offering a novel approach to managing and enhancing radio signal propagation. By dynamically adjusting their electromagnetic properties, RIS can significantly improve the performance and efficiency of 5G and beyond communication systems. In this paper, we study a cognitive RIS-aided non-orthogonal multiple access (NOMA) network that serves multiple users and improves spectrum efficiency. Our analysis assumes a secondary network operates under multi-primary user constraints and interference from the primary source. We derive approximation closed-form formulas for outage probability (OP), and system throughput. To obtain further insights, an asymptotic expression for OP is computed by taking into account two power configurations at the source. Additionally, numerical results show the effects of important factors on performance, confirming the accuracy of the theoretical derivation. According to the simulation results, performance by the system under consideration might be improved considerably by combining a RIS and NOMA, particularly when compared to an orthogonal multiple access scheme. [ABSTRACT FROM AUTHOR]

This paper introduces the hardware implementation of Digital Pseudo-Random Number Generators (DPRNG) based on chaotic systems. First, high-performance pipeline hardware architectures, respectively, for the 3D Lorenz, 3D Chua, 3D Rossler, and 3D Chen chaotic systems are designed to increase the operating frequency. The study also includes an examination of the hardware architectures with 32-bit fixed-point and 32-bit single floating-point data precision. Second, hardware architectures of DPRNG based on a single chaotic system and the congruential generator are put forward. Third, a robust DPRNG, that mixes the 3D Lorenz, 3D Chua, 3D Rossler, and 3D Chen chaotic systems is proposed where all designed chaotic systems operate in parallel. This architecture increases pseudo-random numbers space up to 2480. The FPGA implementation of the proposed pipeline hardware architecture of the complex DPRNG can achieve a maximal operating frequency of 192.446 MHz with a high throughput of 73,899.264 Mbps. The NIST 800-22 test suite result indicates that the DPRNG produces high-quality pseudo-random bits. Consequently, the proposed DPRNG is deemed suitable for use in high-speed applications. [ABSTRACT FROM AUTHOR]