The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this study, we conducted a clinical analysis of lymphocyte subtypes in 268 patients with Parkinson’s disease (PD) to assess their clinical impact as a potential marker of advanced PD in Chinese patients. The participants comprised 268 sporadic PD patients and 268 healthy controls. The numbers of natural killer (NK) cells and CD3+, CD3+CD4+, CD3+CD8+, and CD19+ lymphocytes from peripheral blood...
In this paper, we consider a distributed ‘massive MIMO’ system with multiple intermediate relays serving multiple sources jointly via a constrained fronthaul. Each relay employs uniform quantisation and the modulo operation to meet the bandwidth constraint. We derive the loss of the mutual information due to these processes. By adaptively optimising the interval of the lattice quantiser based on the...
In this paper, we consider the uplink of cell-free massive MIMO systems, where a large number of distributed single antenna access points (APs) serve a much smaller number of users simultaneously via limited backhaul. For the first time, we investigate the performance of compute-and-forward (C&F) in such an ultra dense network with a realistic channel model (including fading, pathloss and shadowing)...
Compute-and-forward (C&F) has been proposed as an efficient strategy to reduce the backhaul load for distributed antenna systems. Finding the optimal coefficients in C&F has commonly been treated as a shortest vector problem, which is NP-hard. The point of our work and of Sahraei’s recent work is that the C&F coefficient problem can be much simpler. Due to the special structure of C&F,...
We consider an ultra-dense wireless network with multiple sources and multiple relays which forward quantized signals via some fronthaul network to some destination point. We discuss the loss of information at the relays due to the quantization process, and the trade-off between this loss and the load on the fronthaul network. We consider the application of a modulo operation to reduce the cardinality...
Compute-and-Forward (C&F) has been proved to be an efficient approach for multiuser, multihop wireless networks. It allows intermediate relays to infer and forward linear combinations of the transmitted messages, in order to achieve high computation rate. The coefficient selection for each relay is a shortest vector problem (SVP). The most common solutions for such a problem are exhaustive search...
We present a general algebraic framework to define the design criteria of linear functions for linear physical layer network coding (LPNC) over a new network topology, called the dense cooperative wireless cloud network. This network topology employs massively interacting distributed nodes to assist data transmission, which naturally forms a multi-source, multi-hop and multi-relay network structure...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.