检索结果-内蒙古大学图书馆

IEEE International Conference on Communications (ICC)

作者： Kecheng Zhang Weijie Yuan Shuangyang Li Fan Liu Feifei Gao Pingzhi Fan Yunlong Cai Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China Department of Electrical Electronic and Computer Engineering University of Western Australia Perth WA Australia Department of Automation Tsinghua University Beijing China Information Coding Transmission Key Lab of Sichuan Province CSNMT Int. Coop. Res. Centre (MoST) Southwest Jiaotong University Chengdu Sichuan China College of Information Science and Electronic Engineering Zhejiang University Hangzhou China

The recently proposed orthogonal time frequency space (OTFS) modulation multiplexes data symbols in the delay-Doppler (DD) domain. Since the range and velocity, which can be derived from the delay and Doppler shifts, are the parameters of interest for radar sensing, it is natural to consider implementing DD signal processing for radar sensing. In this paper, we investigate the potential connections between the OTFS and DD domain radar signal processing. Our analysis shows that the range-Doppler matrix computing process in radar sensing is exactly the demodulation of OTFS with a rectangular pulse shaping filter. Furthermore, we propose a two-dimensional (2D) correlation-based algorithm to estimate the fractional delay and Doppler parameters for radar sensing. Simulation results show that the proposed algorithm can efficiently obtain the delay and Doppler shifts associated with multiple targets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Beam Management in Ultra-dense mmWave Network via Federated Reinforcement Learning: An Intelligent and Secure Approach

arXiv

引用

arXiv 2022年

作者： Xue, Qing Liu, Yi-Jing Sun, Yao Wang, Jian Yan, Li Feng, Gang Ma, Shaodan Chongqing400065 China Chengdu611731 China State Key Laboratory of Internet of Things for Smart City University of Macau China James Watt School of Engineering University of Glasgow United Kingdom Key Lab of Information Coding & Transmission Southwest Jiaotong University Chengdu610031 China State Key Laboratory of Internet of Things for Smart City The Department of Electrical and Computer Engineering University of Macau China

Deploying ultra-dense networks that operate on millimeter wave (mmWave) band is a promising way to address the tremendous growth on mobile data traffic. However, one key challenge of ultra-dense mmWave network (UDmmN) is beam management due to the high propagation delay, limited beam coverage as well as numerous beams and users. In this paper, a novel systematic beam control scheme is presented to tackle the beam management problem which is difficult due to the non-convex objective function. We employ double deep Q-network (DDQN) under a federated learning (FL) framework to address the above optimization problem, and thereby fulfilling adaptive and intelligent beam management in UDmmN. In the proposed beam management scheme based on FL (BMFL), the non-raw-data aggregation can theoretically protect user privacy while reducing handoff cost. Moreover, we propose to adopt a data cleaning technique in the local model training for BMFL, with the aim to further strengthen the privacy protection of users while improving the learning convergence speed. Simulation results demonstrate the performance gain of our proposed scheme. © 2022, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

PMDS Array Codes With Small Sub-packetization Level and Small Repair Bandwidth

PMDS Array Codes With Small Sub-packetization Level and Smal...

引用

IEEE International Symposium on information Theory

作者： Jie Li Xiaohu Tang Hanxu Hou Yunghsiang S. Han Bo Bai Gong Zhang 2012 Labs Huawei Technologies Co. Ltd. Theory Lab Central Research Institute Hong Kong SAR China Information Coding &amp Transmission Key Lab of Sichuan Province CSNMT Int. Coop. Res. Centre (MoST) Southwest Jiaotong University Chengdu China Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China Shenzhen China

ISBN: (数字)9781665421591

ISBN: (纸本)9781665421607

Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the storage nodes are divided into multiple groups with each forming an MDS code of a smaller code length. They allow repairing a failed node by contacting only a few helper nodes and can correct all erasure patterns which are information-theoretically correctable. However, the repair of a failed node of PMDS codes still requires a large amount of communication if the group size is large. Recently, PMDS array codes with each local code being an MSR code were introduced to further reduce the repair bandwidth, but codes over small finite fields only exist for two global parities, and require large rebuilding access and unavoidably a large sub-packetization level. In this paper, we propose two constructions of PMDS array codes with two and three global parities, respectively. Both have a small sub-packetization level, small repair bandwidth, and much smaller finite fields than existing ones.

关键词： Codes Bandwidth Maintenance engineering Galois fields

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Ke Li Zhaoyan Lyu Heng Liu Pingzhi Fan Provincial Key Lab of Information Coding & Transmission Southwest Jiaotong University Chengdu China University College London London United Kingdom

ISBN: (数字)9781728194844

ISBN: (纸本)9781728194851

With the explosion of the video content industry, the demand for large file downloads is increasing rapidly. Different from text-based contents, video contents require lossless transmission with an ordered constraint to ensure the best utility. Meanwhile, providing low latency and stable downloads under high mobility scenarios, such as vehicle users in a highway, is one of the major challenges in wireless communications. In this work, a caching strategy is adopted to address the problem of downloading large order-sensitive contents, supporting user mobility. Particularly, a multi-layer caching framework is proposed based on a simple yet efficient adaptive chunk-based caching (ACBC) algorithm. The multi-layer caching framework increases the flexibility in deploying file chunks and shortens the distance between user and content with affordable memory cost, while ACBC algorithm introduces a feedback mechanism to provide stable and high-efficiency chunk deployment scheme. The cooperation of the two ensures reliable downloads for high-mobility users with minimal access delay and caching space requirements. Simulation results indicate that our solution achieves a very small content access delay with a low cache space occupation compared with other mobility-based caching algorithms (such as MAP and RICH).

关键词： Road transportation Wireless communication Vehicular and wireless technologies Simulation Propagation losses Delays Reliability

来源：评论

学校读者我要写书评

暂无评论

A New Design of CR-NOMA and Its Application to AoI Reduction

arXiv

引用

arXiv 2023年

作者： Ding, Zhiguo Dobre, Octavia A. Fan, Pingzhi Poor, H. Vincent Department of Electrical Engineering and Computer Science Khalifa University Abu Dhabi United Arab Emirates Department of Electrical and Electronic Engineering University of Manchester Manchester United Kingdom The Faculty of Engineering and Applied Science Memorial University St. John’sNLA1B 3X5 Canada The Institute of Information Coding & Transmission Key Lab of Sichuan Province Southwest Jiaotong University Chengdu China The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

The aim of this letter is to develop a new design of cognitive radio inspired non-orthogonal multiple access (CR-NOMA), which ensures that multiple new users can be supported without causing disruption to the legacy network. Analytical results are developed to characterize the statistical properties of the number of supported new users. The developed CR-NOMA scheme is compatible to various communication networks, because it can be implemented as a simple add-on. An example of using CR-NOMA as an add-on in time-division multiple access networks for age of information (AoI) reduction is illustrated, where analytical results are developed to demonstrate the superior performance gain of using CR-NOMA. Copyright © 2023, The Authors. All rights reserved.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

Angle-Delay-Doppler Domain NOMA over Massive MIMO-OTFS Networks

Angle-Delay-Doppler Domain NOMA over Massive MIMO-OTFS Netwo...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Weidong Shao Shun Zhang Caijun Zhong Xianfu Lei Pingzhi Fan State Key Laboratory of Integrated Service Networks Xidian University Xi'an China College of Information Science and Electronic Engineering Zhejiang University Zhejiang China Provincial Key Lab of Information Coding & Transmission Southwest Jiaotong University Chengdu China

ISBN: (数字)9781728173276

ISBN: (纸本)9781728173283

In this paper, we propose an uplink angle-delay-Doppler domain non-orthogonal multiple access (NOMA) scheme over massive multiple-input multiple-output orthogonal time frequency space (MIMO-OTFS) networks, which is inspired to address the situation that user connectivity is dramatically restricted if users have overlapped angle signature with limited delay-Doppler domain resources. To be specific, with aid of NOMA along the uplink transmission, we propose to schedule multiple users with the overlapped angle signature to employ the same delay-Doppler domain resources. Correspondingly, a user clustering algorithm and optimal transmission strategy with respect to power allocation for the proposed scheme are then designed. Afterwards, we propose a path following-based iteration algorithm to solve the original nonconvex optimization problem and finally obtain a suboptimal solution. Simulation results are provided to demonstrate the validity of the proposed scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Constructions of cross Z-complementary pairs with new lengths

arXiv

引用

arXiv 2020年

作者： Adhikary, Avik Ranjan Zhou, Zhengchun Yang, Yang Fan, Pingzhi The School of Mathematics Southwest Jiaotong University Chengdu611756 China The State Key Laboratory of Cryptology Beijing100878 China The Provincial Key Lab of Information Coding and Transmission Southwest Jiaotong University Chengdu611756 China

Spatial modulation (SM) is a new paradigm of multiple-input multiple-output (MIMO) systems, in which only one antenna at the transmitter is activated during each symbol period. Recently, it is observed that SM training sequences derived from corss Z-complementary pairs (CZCPs) lead to optimal channel estimation performance over frequency-selective channels. CZCPs are special form of sequence pairs which have zero aperiodic autocorrelation zones and cross-correlation zone at certain time-shifts. Recent paper by Liu et al. discussed only perfect CZCPs. In this paper, we focus on non-perfect CZCPs. We introduce the term cross Z-complementary ratio and re-categorise the CZCPs, both perfect and non-perfect, based on that. We propose a systematic construction of CZCPs based on generalized Boolean functions (GBFs). We further extend the lengths of the CZCPs by using the insertion method. The proposed CZCPs are all of new lengths of the form 2α10β26γ + 2 (α ≥ 1), 10β + 2, 26γ + 2 and 10β26γ + 2. Finally we propose a construction of optimal binary CZCPs having parameters (12, 5) and (24, 11) from binary Barker sequences. These CZCPs are also extended to (12N, 5N)- CZCPs and (24N, 11N)- CZCPs, where N is the length of a binary Golay complementary pair (GCP). During the proof, we also found a new structural property of binary CZCPs and concluded all binary GCPs are also CZCPs. Finally, we give some numerical simulations to confirm that depending on the number of multi-paths, the proposed CZCPs can be used to design SM training matrix which attains the minimum mean square error. Copyright © 2020, The Authors. All rights reserved.

关键词： Modulation

来源：评论

学校读者我要写书评

暂无评论

Analysis for Rank Distribution of BATS Codes under Time-Variant Channels

Analysis for Rank Distribution of BATS Codes under Time-Vari...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Lin Tang Heng Liu Liu Yang Zheng Ma Ming Xiao State Key Laboratory of Rail Transit Engineering Informatization(FSDI) Xian Shanxi P.R.China Key Lab of Information Coding & Transmission Institude of Mobile Communication Southwest Jiaotong University Chengdu Sichuan P.R.China KTH Royal Institute of Technology Stockholm Sweden

ISBN: (数字)9781728152073

ISBN: (纸本)9781728140537

A batched sparse (BATS) code provides a novel two-stage coding structure for the multi-hop network, in which the outer code performed at the source node generates a potentially unlimited number of batches and the inner code at the intermediate network nodes applies network coding on packets belonging to the same batch. Previous works have studied the performance of BATS codes in the erasure channels, in which the packet loss rate ε is always assumed to be a constant on each link. However, in some application scenarios such as the Industrial Internet of Things (IIoTs) where there are a number of mobile nodes in the networks, the channel conditions could be time-variant due to the mobility of nodes, resulting the packet loss rate ε varying over time as well. Therefore this paper studies the rank distribution which is one of the most significant performance metric of BATS codes under time-variant channels by assuming the packet loss between links modeled as a random variable instead of a constant value. Closed-form expressions of rank distribution are obtained with the packet loss rate ε following two typical types of distributions. Both numerical and simulation results are provided to verify our analysis.

关键词： Packet loss Network coding Random variables Encoding Probability density function Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

On the Detection of Multiple-Access Spatial Modulations

引用

Chinese Journal of Electronics 2017年第1期26卷 172-178页

作者： ZHOU Enzhi HAO Li Key Lab of Information Coding and Transmission Southwest Jiaotong University

The detection problem for the Multipleaccess Spatial modulations(M-SM) is investigated in this paper, where multiple transmitters adopting spatial modulation communicate to the receiver at the same *** optimal Maximum-likelihood(ML) detection suffers from the high computational complexity, while Sphere decoding(SD) can not reduce the complexity effectively because of the multiple active antennas in M-SM. In order to avoid the high complexity, a Space-alternating generalized expectation-maximization(SAGE) algorithm aided List-pro jection(S-LP) detector is proposed and applied to M-SM systems. The received signal vector is firstly projected onto the subspaces spanned by the columns of channel matrices corresponding to the possible active antennas. Then some combinations of antenna indices with the largest pro jections are selected as candidate index sets,based on which, a modified SAGE algorithm is applied to update the candidate symbols. Both analysis and simulation results show that the proposed S-LP detector achieves a near-optimum performance with a significantly reduced complexity compared with ML and SD detection.

关键词： Multiple-input multiple-output(MIMO) Spatial modulation(SM) Multi-user detection

来源：评论

学校读者我要写书评

暂无评论

Clustering Based Resource Management Scheme for Latency and Sum Rate Optimization in V2X Networks

Clustering Based Resource Management Scheme for Latency and ...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Fakhar Abbas Gang Liu Zahid Khan Kan Zheng Pingzhi Fan Key Lab of Information Coding and Transmission Southwest Jiaotong University Chengdu China Key Lab of Universal Wireless Communications Beijing University of Posts and Telecommunications (BUPT) Beijing China

In this paper, a clustering based resource management scheme for latency and sum rate optimization in V2X networks is proposed to identify distinguished demands for different kinds of vehicular links, namely cellular-vehicle-to-vehicle (C-V2V) links and cellular-vehicle-to-infrastructure (C-V2I) links, and to improve the performance of cellular user in terms of sum rate, latency and throughput for C-V2I links while guaranteeing reliability for every C-V2V connection. To address the fast channel changes due to high mobility, we present a clustering based resource management model to achieve band sharing and efficient power management that depends on large scale fading. Besides, we have also considered the resource management problem of cellular V2X and VANETs users to reduce data transmission impacts. Firstly, the total average sum rate of each C-V2I links is used as an optimization goal to increase the throughput and to reduce latency of the entire C-V2I link. Secondly, cluster based optimum algorithms are proposed which give the optimum resource management. Simulation results reveal that the proposed scheme outperforms the existing scheme.

关键词： Vehicle-to-everything Resource management Fading channels Interference Reliability Vehicular ad hoc networks Measurement

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：