Bio: Chengshan Xiao is an academic researcher. The author has contributed to research in topics: Computer science & Mathematics. The author has an hindex of 1, co-authored 1 publications receiving 7279 citations.
01 Jan 2005
TL;DR: This book aims to provide a chronology of key events and individuals involved in the development of microelectronics technology over the past 50 years and some of the individuals involved have been identified and named.
Abstract: Alhussein Abouzeid Rensselaer Polytechnic Institute Raviraj Adve University of Toronto Dharma Agrawal University of Cincinnati Walid Ahmed Tyco M/A-COM Sonia Aissa University of Quebec, INRSEMT Huseyin Arslan University of South Florida Nallanathan Arumugam National University of Singapore Saewoong Bahk Seoul National University Claus Bauer Dolby Laboratories Brahim Bensaou Hong Kong University of Science and Technology Rick Blum Lehigh University Michael Buehrer Virginia Tech Antonio Capone Politecnico di Milano Javier Gómez Castellanos National University of Mexico Claude Castelluccia INRIA Henry Chan The Hong Kong Polytechnic University Ajit Chaturvedi Indian Institute of Technology Kanpur Jyh-Cheng Chen National Tsing Hua University Yong Huat Chew Institute for Infocomm Research Tricia Chigan Michigan Tech Dong-Ho Cho Korea Advanced Institute of Science and Tech. Jinho Choi University of New South Wales Carlos Cordeiro Philips Research USA Laurie Cuthbert Queen Mary University of London Arek Dadej University of South Australia Sajal Das University of Texas at Arlington Franco Davoli DIST University of Genoa Xiaodai Dong, University of Alberta Hassan El-sallabi Helsinki University of Technology Ozgur Ercetin Sabanci University Elza Erkip Polytechnic University Romano Fantacci University of Florence Frank Fitzek Aalborg University Mario Freire University of Beira Interior Vincent Gaudet University of Alberta Jairo Gutierrez University of Auckland Michael Hadjitheodosiou University of Maryland Zhu Han University of Maryland College Park Christian Hartmann Technische Universitat Munchen Hossam Hassanein Queen's University Soong Boon Hee Nanyang Technological University Paul Ho Simon Fraser University Antonio Iera University "Mediterranea" of Reggio Calabria Markku Juntti University of Oulu Stefan Kaiser DoCoMo Euro-Labs Nei Kato Tohoku University Dongkyun Kim Kyungpook National University Ryuji Kohno Yokohama National University Bhaskar Krishnamachari University of Southern California Giridhar Krishnamurthy Indian Institute of Technology Madras Lutz Lampe University of British Columbia Bjorn Landfeldt The University of Sydney Peter Langendoerfer IHP Microelectronics Technologies Eddie Law Ryerson University in Toronto
TL;DR: This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas and proposes an expectation-maximization-aided generalized approximate message passing algorithm with a Markov random field support structure that captures the inherent clustered sparsity structure of the angular domain channel.
Abstract: This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce system complexity; they operate under the framework of coupled compressed sensing (CCS) which concatenates an outer tree code to an inner compressed sensing code for slot-wise message stitching. We suggest that by exploiting the MIMO channel information in the angular domain, redundancies required by the tree encoder/decoder in CCS can be removed to improve spectral efficiency, thereby an uncoupled transmission protocol is devised. To perform activity detection and channel estimation, we propose an expectation-maximization-aided generalized approximate message passing algorithm with a Markov random field support structure, which captures the inherent clustered sparsity structure of the angular domain channel. Then, message reconstruction in the form of a clustering decoder is performed by recognizing slot-distributed channels of each active user based on similarity. We put forward the slot-balanced $ K $ -means algorithm as the kernel of the clustering decoder, resolving constraints and collisions specific to the application scene. Extensive simulations reveal that the proposed scheme achieves a better error performance at high spectral efficiency compared to the CCS-based URA schemes.
TL;DR: This paper considers FL over a noisy fading multiple access channel via over-the-air computation (AirComp), and proposes two novel FL schemes with statistical channel state information (FL-SCSI-A and FL- SCSI-B) to reduce the efforts required by channel estimations.
Abstract: Federated learning (FL) is a popular distributed learning paradigm, in which a global model at a server learns private data of clients without data shared among clients or the server. In this paper, we consider FL over a noisy fading multiple access channel (MAC) via over-the-air computation (AirComp). Benefiting from waveform-superposition propriety of wireless signals, AirComp is able to achieve fast aggregations in FL and improve spectral efficiency. However, most of the schemes exploiting AirComp require intensive channel estimations as the demands from precoders, which results in considerable communication overheads. For this reason, we propose two novel FL schemes with statistical channel state information (FL-SCSI-A and FL-SCSI-B) to reduce the efforts required by channel estimations. In FL-SCSI-A, precoders adjust phases of transmitted signals with phases of instant channel state information (CSI), and scale transmitted signal powers based on statistical CSI. The precoder design has the following two advantages. First, phases of instant CSI can be easier to estimate than complete instant CSI. Second, since clients only need to estimate phases of their own instant CSI (instead of CSI of all clients), with channel reciprocity, this can be easily achieved by letting the server broadcast pilots to all clients. The server in FL-SCSI-A is also efficient. It only needs to estimate the sum of channel gains of all clients, which can be easily achieved by letting clients transmit pilots simultaneously. To further reduce the communication overhead, FL-SCSI-B is proposed. The precoders in FL-SCSI-B are similar to FL-SCSI-A, while the server does not require any knowledge of instant CSI, which reduces the demands of channel estimations. For both schemes, we prove that the distortion caused by the noisy fading MAC is bounded, and the convergences of the learning processes are guaranteed for strongly smooth losses with heterogeneous data assumptions. Experimental results show that the proposed schemes perform better than benchmark schemes while reducing efforts required by channel estimation.
TL;DR: In this article , the analysis of the excess distortion exponent for joint source-channel coding (JSCC) in semantic-aware MIMO systems is presented, where an unobservable semantic source is introduced.
Abstract: In this paper, the analysis of excess distortion exponent for joint source-channel coding (JSCC) in semantic-aware communication systems is presented. By introducing an unobservable semantic source, we extend the classical results by Csiszar to semantic-aware communication systems. Both upper and lower bounds of the exponent for the discrete memoryless source-channel pair are established. Moreover, an extended achievable bound of the excess distortion exponent for MIMO systems is derived. Further analysis explores how the block fading and numbers of antennas inﬂuence the exponent of semantic-aware MIMO systems. Our results offer some theoretical bounds of error decay performance and can be used to guide future semantic communications with joint source-channel coding scheme
TL;DR: In this article , the transmitter and receiver beamforming (TB and RB) for over-the-air computation (AirComp) in massive multiple-inputs and multiple-outputs (MIMO) systems is investigated.
Abstract: This paper investigates the transmitter and receiver beamforming (TB and RB) for over-the-air computation (AirComp) in massive multiple-inputs and multiple-outputs (MIMO) systems. First, we propose a two-phase hybrid beamforming algorithm to design TB and hybrid RB. In the first phase, we adopt a projected gradient descent with momentum (PGDM) algorithm to search for the optimal fully-digital TB matrices. Compared with the benchmarks on the mean square error (MSE) performances, PGDM can achieve up to 5 dB gain in signal-to-noise ratio (SNR) with less algorithm execution time when fully-digital RB is assumed. In the second phase, we plug the TB matrices obtained in PGDM as well as the optimal baseband RB (BBRB) matrix into the MSE objective, and adopt gradient descent to search for the optimal radio-frequency RB (RFRB) matrix. Compared with the state-of-the-arts, the proposed two-phase algorithm reduces up to 30% of the algorithm execution time and 18% of the MSE. Second, we propose a statistical TB algorithm to reduce the communication overheads, in which TB completely depends on statistical channel state information (CSI) and thus does not rely on the feedback from the base station (BS). We prove that orthonormal matrices are asymptotically optimal for statistical TB when uncorrelated
Rayleigh channels are assumed and the number of receiving antennas approaches to infinity. For correlated channels, experimental results show that the proposed statistical TB can achieve about 5 dB gain in SNR compared with orthonormal matrices in terms of the MSE performance. Third, a large scale system analysis is made in this paper. As the number of the receiving antennas approaches to infinity, asymptotically optimal choices for TB and RB are provided, and upper bounds of MSE are derived in terms of the number of clients and receiving antennas. For hybrid RB, an upper bound of the squared distance between the optimal hybrid RB and the optimal fully-digital RB is also derived.
TL;DR: The proposed model is pessimistic (a lower bound on coverage) whereas the grid model is optimistic, and that both are about equally accurate, and the proposed model may better capture the increasingly opportunistic and dense placement of base stations in future networks.
Abstract: Cellular networks are usually modeled by placing the base stations on a grid, with mobile users either randomly scattered or placed deterministically. These models have been used extensively but suffer from being both highly idealized and not very tractable, so complex system-level simulations are used to evaluate coverage/outage probability and rate. More tractable models have long been desirable. We develop new general models for the multi-cell signal-to-interference-plus-noise ratio (SINR) using stochastic geometry. Under very general assumptions, the resulting expressions for the downlink SINR CCDF (equivalent to the coverage probability) involve quickly computable integrals, and in some practical special cases can be simplified to common integrals (e.g., the Q-function) or even to simple closed-form expressions. We also derive the mean rate, and then the coverage gain (and mean rate loss) from static frequency reuse. We compare our coverage predictions to the grid model and an actual base station deployment, and observe that the proposed model is pessimistic (a lower bound on coverage) whereas the grid model is optimistic, and that both are about equally accurate. In addition to being more tractable, the proposed model may better capture the increasingly opportunistic and dense placement of base stations in future networks.
TL;DR: This paper proposes S-MAC, a medium access control (MAC) protocol designed for wireless sensor networks that enables low-duty-cycle operation in a multihop network and reveals fundamental tradeoffs on energy, latency and throughput.
Abstract: This paper proposes S-MAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect sensor networks to be deployed in an ad hoc fashion, with nodes remaining largely inactive for long time, but becoming suddenly active when something is detected. These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 802.11 in several ways: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important. S-MAC uses a few novel techniques to reduce energy consumption and support self-configuration. It enables low-duty-cycle operation in a multihop network. Nodes form virtual clusters based on common sleep schedules to reduce control overhead and enable traffic-adaptive wake-up. S-MAC uses in-channel signaling to avoid overhearing unnecessary traffic. Finally, S-MAC applies message passing to reduce contention latency for applications that require in-network data processing. The paper presents measurement results of S-MAC performance on a sample sensor node, the UC Berkeley Mote, and reveals fundamental tradeoffs on energy, latency and throughput. Results show that S-MAC obtains significant energy savings compared with an 802.11-like MAC without sleeping.
TL;DR: A comprehensive survey of the state-of-the-art MEC research with a focus on joint radio-and-computational resource management and recent standardization efforts on MEC are introduced.
Abstract: Driven by the visions of Internet of Things and 5G communications, recent years have seen a paradigm shift in mobile computing, from the centralized Mobile Cloud Computing towards Mobile Edge Computing (MEC). The main feature of MEC is to push mobile computing, network control and storage to the network edges (e.g., base stations and access points) so as to enable computation-intensive and latency-critical applications at the resource-limited mobile devices. MEC promises dramatic reduction in latency and mobile energy consumption, tackling the key challenges for materializing 5G vision. The promised gains of MEC have motivated extensive efforts in both academia and industry on developing the technology. A main thrust of MEC research is to seamlessly merge the two disciplines of wireless communications and mobile computing, resulting in a wide-range of new designs ranging from techniques for computation offloading to network architectures. This paper provides a comprehensive survey of the state-of-the-art MEC research with a focus on joint radio-and-computational resource management. We also present a research outlook consisting of a set of promising directions for MEC research, including MEC system deployment, cache-enabled MEC, mobility management for MEC, green MEC, as well as privacy-aware MEC. Advancements in these directions will facilitate the transformation of MEC from theory to practice. Finally, we introduce recent standardization efforts on MEC as well as some typical MEC application scenarios.
••08 Nov 2004
TL;DR: An overview of MIMO wireless technology covering channel models, performance limits, coding, and transceiver design is provided, in principle, to meet the 1 Gb/s data rate requirement with a single-transmit single-receive antenna wireless system.
Abstract: High data rate wireless communications, nearing 1 Gb/s transmission rates, is of interest in emerging wireless local area networks and home audio/visual networks. Designing very high speed wireless links that offer good quality-of-service and range capability in non-line-of-sight (NLOS) environments constitutes a significant research and engineering challenge. Ignoring fading in NLOS environments, we can, in principle, meet the 1 Gb/s data rate requirement with a single-transmit single-receive antenna wireless system if the product of bandwidth (measured in hertz) and spectral efficiency (measured in bits per second per hertz) is equal to 10/sup 9/. A variety of cost, technology and regulatory constraints make such a brute force solution unattractive, if not impossible. The use of multiple antennas at transmitter and receiver, popularly known as multiple-input multiple-output (MIMO) wireless, is an emerging cost-effective technology that offers substantial leverages in making 1 Gb/s wireless links a reality. The paper provides an overview of MIMO wireless technology covering channel models, performance limits, coding, and transceiver design.
27 Aug 2013
TL;DR: The design and implementation of the first in-band full duplex WiFi radios that can simultaneously transmit and receive on the same channel using standard WiFi 802.11ac PHYs are presented and achieves close to the theoretical doubling of throughput in all practical deployment scenarios.
Abstract: This paper presents the design and implementation of the first in-band full duplex WiFi radios that can simultaneously transmit and receive on the same channel using standard WiFi 802.11ac PHYs and achieves close to the theoretical doubling of throughput in all practical deployment scenarios. Our design uses a single antenna for simultaneous TX/RX (i.e., the same resources as a standard half duplex system). We also propose novel analog and digital cancellation techniques that cancel the self interference to the receiver noise floor, and therefore ensure that there is no degradation to the received signal. We prototype our design by building our own analog circuit boards and integrating them with a fully WiFi-PHY compatible software radio implementation. We show experimentally that our design works robustly in noisy indoor environments, and provides close to the expected theoretical doubling of throughput in practice.