Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024606
Amal Algedir, H. Refai
Device-To-Device (D2D) communication is expected to be an essential component of the next generation cellular network. Although this promising technology has already demonstrated its ability to increase network throughput. The need for an accurate, fast- computing model of throughput estimation is essential. In this paper, an analytical model for LTE (Long Term Evolution) scheduler- supported D2D communication is presented. The model is based on two-dimensional Continues- Time Markov Chain and is utilized for estimating network throughput. Also, a closed formula is obtained for determining the expected number of D2D users in dedicated and reuse modes. Two scheduled algorithms, Round Robin and Max signal-to-interference-plus-noise ratio, were used for estimating throughput. Analytical model results were closely aligned with simulations and demonstrated that the analytical model is very accurate and time efficient.
设备到设备(D2D)通信预计将成为下一代蜂窝网络的重要组成部分。尽管这项有前途的技术已经证明了它提高网络吞吐量的能力。需要一个准确的，快速计算模型的吞吐量估计是必不可少的。本文提出了一种支持调度程序的LTE (Long Term Evolution) D2D通信的分析模型。该模型基于二维连续时间马尔可夫链，用于网络吞吐量估计。同时，得到了确定专用模式和重用模式下D2D用户预期数量的封闭公式。采用轮循和最大信噪比两种调度算法来估计吞吐量。分析模型结果与仿真结果吻合较好，证明了分析模型的准确性和实时性。
{"title":"Analytical Model for LTE Downlink Scheduler with D2D Communication for Throughput Estimation","authors":"Amal Algedir, H. Refai","doi":"10.1109/GCWkshps45667.2019.9024606","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024606","url":null,"abstract":"Device-To-Device (D2D) communication is expected to be an essential component of the next generation cellular network. Although this promising technology has already demonstrated its ability to increase network throughput. The need for an accurate, fast- computing model of throughput estimation is essential. In this paper, an analytical model for LTE (Long Term Evolution) scheduler- supported D2D communication is presented. The model is based on two-dimensional Continues- Time Markov Chain and is utilized for estimating network throughput. Also, a closed formula is obtained for determining the expected number of D2D users in dedicated and reuse modes. Two scheduled algorithms, Round Robin and Max signal-to-interference-plus-noise ratio, were used for estimating throughput. Analytical model results were closely aligned with simulations and demonstrated that the analytical model is very accurate and time efficient.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122867428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024404
Walter O. Krawec
A semi-quantum key distribution (SQKD) protocol allows two users $A$ and $B$ to establish a shared secret key that is secure against an all-powerful adversary $E$ even when one of the users (e.g., $B$) is semi-quantum or classical in nature while the other is fully-quantum. A mediated SQKD protocol allows two semi-quantum users to establish a key with the help of an adversarial quantum server. We introduce the concept of a multi-mediated SQKD protocol where two (or more) adversarial quantum servers are used. We construct a new protocol in this model and show how it can withstand high levels of quantum noise, though at a cost to efficiency. We perform an information theoretic security analysis and, along the way, prove a general security result applicable to arbitrary MM-SQKD protocols. Finally, a comparison is made to previous (S)QKD protocols.
{"title":"Multi-Mediated Semi-Quantum Key Distribution","authors":"Walter O. Krawec","doi":"10.1109/GCWkshps45667.2019.9024404","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024404","url":null,"abstract":"A semi-quantum key distribution (SQKD) protocol allows two users $A$ and $B$ to establish a shared secret key that is secure against an all-powerful adversary $E$ even when one of the users (e.g., $B$) is semi-quantum or classical in nature while the other is fully-quantum. A mediated SQKD protocol allows two semi-quantum users to establish a key with the help of an adversarial quantum server. We introduce the concept of a multi-mediated SQKD protocol where two (or more) adversarial quantum servers are used. We construct a new protocol in this model and show how it can withstand high levels of quantum noise, though at a cost to efficiency. We perform an information theoretic security analysis and, along the way, prove a general security result applicable to arbitrary MM-SQKD protocols. Finally, a comparison is made to previous (S)QKD protocols.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"61 Suppl 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116602799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024426
Steven Platt, M. Oliver
Distributed consensus mechanisms have been widely researched and made popular with a number of blockchain-based token applications, such as Bitcoin, and Ethereum. Although these general- purpose platforms have matured for scale and security, they are designed for human incentive and continue to require currency reward and contract functions that are not requisite in machine communications. Redes Chain is a new blockchain, built to support fully decentralized self-organization in wireless networks - without a cryptocurrency or contract dependency.
{"title":"Towards Blockchain for Decentralized Self-Organizing Wireless Networks","authors":"Steven Platt, M. Oliver","doi":"10.1109/GCWkshps45667.2019.9024426","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024426","url":null,"abstract":"Distributed consensus mechanisms have been widely researched and made popular with a number of blockchain-based token applications, such as Bitcoin, and Ethereum. Although these general- purpose platforms have matured for scale and security, they are designed for human incentive and continue to require currency reward and contract functions that are not requisite in machine communications. Redes Chain is a new blockchain, built to support fully decentralized self-organization in wireless networks - without a cryptocurrency or contract dependency.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116622810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024529
Dachang Liu, Shaohua Wu, Yinliang Xie
The high-bandwidth feature of Free-Space Optical Communication (FSOC) is advantageous for the construction of future seamless global mobile communication networks. In order to reduce the influence of atmospheric turbulence on laser beams of FSOC system, the propagation and diffusion characteristics of laser beams in atmospheric channel are analyzed. According to the expressions of transmitter beam radius and the radius of curvature of the phase front, the collimated beam radius as a function of various wavelength of laser beam, atmospheric turbulence conditions, transmitter beam radius and spatial coherence properties are simulated. In addition, we provide a theoretical basis for the budget analysis of FSOC links, which can serve as a reference for developers to weigh the constraints of various detail parameters for maximizing the performance of optical communication systems.
{"title":"Analysis of Laser Propagation Characteristics in Atmospheric Channel of FSOC","authors":"Dachang Liu, Shaohua Wu, Yinliang Xie","doi":"10.1109/GCWkshps45667.2019.9024529","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024529","url":null,"abstract":"The high-bandwidth feature of Free-Space Optical Communication (FSOC) is advantageous for the construction of future seamless global mobile communication networks. In order to reduce the influence of atmospheric turbulence on laser beams of FSOC system, the propagation and diffusion characteristics of laser beams in atmospheric channel are analyzed. According to the expressions of transmitter beam radius and the radius of curvature of the phase front, the collimated beam radius as a function of various wavelength of laser beam, atmospheric turbulence conditions, transmitter beam radius and spatial coherence properties are simulated. In addition, we provide a theoretical basis for the budget analysis of FSOC links, which can serve as a reference for developers to weigh the constraints of various detail parameters for maximizing the performance of optical communication systems.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129573199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024628
Carles Diaz-Vilor, A. Pérez-Neira, M. Lagunas
Providing connectivity in massive Machine Type Communications (mMTC) poses interesting challenges. In this paper, we propose and study a time diversity beamformer for reception in grant-free access in order to support massive uplink connectivity within the paradigm of the Internet of Things (IoT). The proposed access technique does not require channel estimation or prior network scheduling and provides benefits in terms of Probability of Collision and/or achievable Rate.The combination of our frame structure proposal with spatial signal processing at the receiver side yields a reduction on the probability of collision between devices, which, ultimately, implies that more users can access to the media.
{"title":"RSBA-Resource Sharing Beamforming Access for 5G-mMTC","authors":"Carles Diaz-Vilor, A. Pérez-Neira, M. Lagunas","doi":"10.1109/GCWkshps45667.2019.9024628","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024628","url":null,"abstract":"Providing connectivity in massive Machine Type Communications (mMTC) poses interesting challenges. In this paper, we propose and study a time diversity beamformer for reception in grant-free access in order to support massive uplink connectivity within the paradigm of the Internet of Things (IoT). The proposed access technique does not require channel estimation or prior network scheduling and provides benefits in terms of Probability of Collision and/or achievable Rate.The combination of our frame structure proposal with spatial signal processing at the receiver side yields a reduction on the probability of collision between devices, which, ultimately, implies that more users can access to the media.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129632090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024639
Qiao Zhu, Xue Wang, Z. Qian
User-centric cloud radio access network (C-RAN), unlike conventional cellular communication, is converging toward cloud and separate all baseband signal processing units from the radio access units. Ultra-dense deployment of remote ratio heads (RRHs) constitutes one of the most promising techniques of explosive data growth while imposes an urgent need of realistic and accurate statistical framework to quantify the network performance. In this paper, we consider modeling the channel fading by a Nakagami distribution, which addresses the signal propagation properties more accurately in the C-RAN with lower antennas. Moreover, we develop an analytical framework for a user-centric clustering mechanism which enables a user can be served by the cooperative cluster of RRHs around it. Specifically, we derive a closed form lower bound on the coverage probability and formulate the area spectral efficiency expression using tools from stochastic geometry. Furthermore, we observe that the cluster size is a tunable parameter to the network performance, which can affect RRH and effective user density in opposite directions, hence, there must be an optimal cluster size which maximizes the area spectral efficiency. Simulation results validate the accuracy of our analytical framework and obtain the optimal cluster size. Our mathematical results pave the way to consider the clustering mechanism with Nakagami fading in user-centric C-RAN.
{"title":"An Analytical Framework for Clustering Mechanism with Nakagami Fading in User-Centric Cloud RAN","authors":"Qiao Zhu, Xue Wang, Z. Qian","doi":"10.1109/GCWkshps45667.2019.9024639","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024639","url":null,"abstract":"User-centric cloud radio access network (C-RAN), unlike conventional cellular communication, is converging toward cloud and separate all baseband signal processing units from the radio access units. Ultra-dense deployment of remote ratio heads (RRHs) constitutes one of the most promising techniques of explosive data growth while imposes an urgent need of realistic and accurate statistical framework to quantify the network performance. In this paper, we consider modeling the channel fading by a Nakagami distribution, which addresses the signal propagation properties more accurately in the C-RAN with lower antennas. Moreover, we develop an analytical framework for a user-centric clustering mechanism which enables a user can be served by the cooperative cluster of RRHs around it. Specifically, we derive a closed form lower bound on the coverage probability and formulate the area spectral efficiency expression using tools from stochastic geometry. Furthermore, we observe that the cluster size is a tunable parameter to the network performance, which can affect RRH and effective user density in opposite directions, hence, there must be an optimal cluster size which maximizes the area spectral efficiency. Simulation results validate the accuracy of our analytical framework and obtain the optimal cluster size. Our mathematical results pave the way to consider the clustering mechanism with Nakagami fading in user-centric C-RAN.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128309224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024623
Lijun Dong, Richard Li
Packets could be dropped completely in the current Internet if there is not enough buffer in the routers due to network congestion or packet error happens during the transmission. This practice causes re-transmissions of the packets under the reliable transmission protocols, which in-turn produces unwanted delay , reduces throughput, and wastes network resources. Recently, a new network service called Qualitative Communication suggests to avoid entire packet dropping, instead breaking the packet into smaller logical units (chunks). The network nodes (e.g. routers) could perform packet scrubbing on the packet with the granularity of chunks, such operation is named as Packet Wash. In this paper, we propose to apply random linear network coding on the chunks of the packet payload to enable the packet wash and packet enrichment in the network. The benefits of utilizing such packetization are discussed in the paper.
{"title":"In-Packet Network Coding for Effective Packet Wash and Packet Enrichment","authors":"Lijun Dong, Richard Li","doi":"10.1109/GCWkshps45667.2019.9024623","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024623","url":null,"abstract":"Packets could be dropped completely in the current Internet if there is not enough buffer in the routers due to network congestion or packet error happens during the transmission. This practice causes re-transmissions of the packets under the reliable transmission protocols, which in-turn produces unwanted delay , reduces throughput, and wastes network resources. Recently, a new network service called Qualitative Communication suggests to avoid entire packet dropping, instead breaking the packet into smaller logical units (chunks). The network nodes (e.g. routers) could perform packet scrubbing on the packet with the granularity of chunks, such operation is named as Packet Wash. In this paper, we propose to apply random linear network coding on the chunks of the packet payload to enable the packet wash and packet enrichment in the network. The benefits of utilizing such packetization are discussed in the paper.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128409692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024598
Hirofumi Suganuma, Shuhei Saito, K. Ogawa, F. Maehara
This paper proposes an inter-mode interference suppression method that employs only even-numbered modes for uniform circular array (UCA)-based orbital angular momentum (OAM) multiplexing. Given that interference from adjacent OAM modes becomes severe when the beam axis is misaligned, the proposed method uses only the even-numbered modes while leaving the odd-numbered modes unused, which effectively prevents the inter-mode interference. Moreover, we verify the effectiveness of the proposed method by applying it to multiple-input and multiple-output (MIMO) with zero-forcing (ZF) alone or ZF with successive interference cancellation because severe inter-mode interference is caused by transmitting multiple streams from multiple UCAs in each mode. The effectiveness of the proposed method compared with the traditional method, which uses all OAM modes, is demonstrated in terms of the system capacity through computer simulations.
{"title":"Inter-Mode Interference Suppression Employing Even-Numbered Modes for UCA-Based OAM Multiplexing","authors":"Hirofumi Suganuma, Shuhei Saito, K. Ogawa, F. Maehara","doi":"10.1109/GCWkshps45667.2019.9024598","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024598","url":null,"abstract":"This paper proposes an inter-mode interference suppression method that employs only even-numbered modes for uniform circular array (UCA)-based orbital angular momentum (OAM) multiplexing. Given that interference from adjacent OAM modes becomes severe when the beam axis is misaligned, the proposed method uses only the even-numbered modes while leaving the odd-numbered modes unused, which effectively prevents the inter-mode interference. Moreover, we verify the effectiveness of the proposed method by applying it to multiple-input and multiple-output (MIMO) with zero-forcing (ZF) alone or ZF with successive interference cancellation because severe inter-mode interference is caused by transmitting multiple streams from multiple UCAs in each mode. The effectiveness of the proposed method compared with the traditional method, which uses all OAM modes, is demonstrated in terms of the system capacity through computer simulations.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"21 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129332824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024326
Delin Guo, Lan Tang, Xinggan Zhang
This paper studies the utilization and transfer of renewable green energy in a multiuser downlink communication network. In the considered multiuser system, the base station (BS) is powered by both harvested energy and grid. When the BS transmits data to one user terminal, other terminals can replenish energy opportunistically from received radio-frequency (RF) signals, which is called simultaneous wireless information and power transfer (SWIPT). Our objective is to maximize the average throughput by multiuser scheduling and energy allocation utilizing causal channel state information while satisfying the requirement for harvested energy and the average power constraint of the grid. With channel dynamics and energy arrival modeled as Markov processes, we characterize the problem as a Markov decision process (MDP). The standard reinforcement learning framework is considered as an effective solution to MDP. If the transition probability of MDP is known, the policy iteration (PI) algorithm is used to solve the problem, otherwise, the R-learning algorithm is adopted. Simulation results show that the proposed algorithm can improve the average throughput of the system and increase the energy harvested by idle user terminals compared with the existing work. And R-learning can achieve performance close to the PI algorithm under the condition that the channel transition probability is unknown.
{"title":"Optimal Energy Allocation and Multiuser Scheduling in SWIPT Systems with Hybrid Power Supply","authors":"Delin Guo, Lan Tang, Xinggan Zhang","doi":"10.1109/GCWkshps45667.2019.9024326","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024326","url":null,"abstract":"This paper studies the utilization and transfer of renewable green energy in a multiuser downlink communication network. In the considered multiuser system, the base station (BS) is powered by both harvested energy and grid. When the BS transmits data to one user terminal, other terminals can replenish energy opportunistically from received radio-frequency (RF) signals, which is called simultaneous wireless information and power transfer (SWIPT). Our objective is to maximize the average throughput by multiuser scheduling and energy allocation utilizing causal channel state information while satisfying the requirement for harvested energy and the average power constraint of the grid. With channel dynamics and energy arrival modeled as Markov processes, we characterize the problem as a Markov decision process (MDP). The standard reinforcement learning framework is considered as an effective solution to MDP. If the transition probability of MDP is known, the policy iteration (PI) algorithm is used to solve the problem, otherwise, the R-learning algorithm is adopted. Simulation results show that the proposed algorithm can improve the average throughput of the system and increase the energy harvested by idle user terminals compared with the existing work. And R-learning can achieve performance close to the PI algorithm under the condition that the channel transition probability is unknown.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114742447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1109/GCWkshps45667.2019.9024578
Zhenyuan Zhang, Z. Tian, Mu Zhou
In this paper, we present a finger-grained gesture recognition system that can be deployed on commodity Multiple Input Multiple Output Frequency Modulated Continuous Wave (MIMO-FMCW) radar platform as software, without any hardware modification. Firstly, we utilize the two-dimension fast Fourier transform algorithm (2D-FFT) to jointly estimate range-Doppler information. Secondly, by combining with binary phase modulation MIMO (BPM-MIMO) technique, a discrete Fourier transformation (DFT) based Multiple Signal Classification (MUSIC) algorithm is proposed to jointly measure range and angle of arrival (AOA) information without prior knowledge about the number of targets. Thirdly, a recurrent 3D convolutional neural network (R3DCNN) is employed to extract spatial-temporal fusion- features existing in range-Doppler and range-AOA map sequences. Next, we implement and evaluate this system utilizing commercial-off-the-shelf FMCW radar platform. The experimental results show that this system is able to achieve a high recognition rate of 93%.
{"title":"SmartFinger: A Finger-Sensing System for Mobile Interaction via MIMO FMCW Radar","authors":"Zhenyuan Zhang, Z. Tian, Mu Zhou","doi":"10.1109/GCWkshps45667.2019.9024578","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024578","url":null,"abstract":"In this paper, we present a finger-grained gesture recognition system that can be deployed on commodity Multiple Input Multiple Output Frequency Modulated Continuous Wave (MIMO-FMCW) radar platform as software, without any hardware modification. Firstly, we utilize the two-dimension fast Fourier transform algorithm (2D-FFT) to jointly estimate range-Doppler information. Secondly, by combining with binary phase modulation MIMO (BPM-MIMO) technique, a discrete Fourier transformation (DFT) based Multiple Signal Classification (MUSIC) algorithm is proposed to jointly measure range and angle of arrival (AOA) information without prior knowledge about the number of targets. Thirdly, a recurrent 3D convolutional neural network (R3DCNN) is employed to extract spatial-temporal fusion- features existing in range-Doppler and range-AOA map sequences. Next, we implement and evaluate this system utilizing commercial-off-the-shelf FMCW radar platform. The experimental results show that this system is able to achieve a high recognition rate of 93%.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124163048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：