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

62nd IEEE Vehicular Technology Conference

作者： Hung, M Chen, X Zhou, SD Wang, J Tsing Hua Univ Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)0780391527

In orthogonal frequency-division multiplex access (OFDMA) uplink, it is admitted that the carrier-frequency offsets (CFOs) between multi-transmitter and receiver introduce intercarrier interference (ICI) and cause severe performance loss. In this paper, with reference to a detailed analysis of the ICI caused by CFOs, we propose a novel low-complexity iterative ICI cancellation algorithm, which is based on the perfect estimation of each user's CFO. Moreover, the convergence behaviors of the iterations are studied with three theorems, and the user-interleaving patterns suitable for this algorithm are presented. In accordance with the simulation results, we come to the conclusion that the low-complexity iterative algorithm can effectively suppress and cancel the ICI due to CFOs.

关键词： orthogonal frequency-division multiplex access (OFDMA) inter-carrier interference (ICI) carrier-frequency offset (CFO) iterative algorithm uplink

来源：评论

学校读者我要写书评

暂无评论

Explicit iterative algorithms for Continuous Coupled Lyapunov Matrix Equations 36

Explicit Iterative Algorithms for Continuous Coupled Lyapuno...

引用

第36届中国控制会议

作者： Wan-Qi Wu Hui-Jie Sun Hang-Qing Lin Ying Zhang Harbin Institute of Technology Shenzhen Graduate School

ISBN: (纸本)9781538629185

Two explicit iterative algorithms are developed in this paper for solving continuous coupled Lyapunov matrix equations. By introducing a tunable parameter, the considered matrix equations are transformed into the Kalman-Yakubovich matrix equations. Further, based on the obtained equations, an explicit iterative algorithm is constructed to solve the coupled Lyapunov matrix equations. In addition, by using the latest estimation an improved iterative algorithm is proposed. Some convergence results are obtained for the presented improved iterative algorithm. It is shown that the convergence performance of the proposed algorithms can be significantly improved if the tunable parameter can be properly chosen. Finally, a numerical example is given to show the merit of the presented algorithms.

关键词： iterative algorithm Coupled Lyapunov Matrix Equation Markovian Jump Linear Systems

来源：评论

学校读者我要写书评

暂无评论

iterative Crosstalk Cancellation algorithm for Upstream Transmission

Iterative Crosstalk Cancellation Algorithm for Upstream Tran...

引用

International Conference on Wireless Communications and Signal Processing

作者： Shen Wei Li You-ming Wang Xiao-li Ningbo Univ Inst Commun Technol Ningbo 315211 Zhejiang Peoples R China

ISBN: (纸本)9781424448562

Crosstalk is the major limiting issue in VDSL2 system. Based on matrix splitting and iterative theory, a general form of iterative crosstalk cancellation algorithm is first proposed for VDSL2 upstream transmission. From using diagonal dominant and column wise diagonal dominant of crosstalk channel matrix property, two special iterative algorithms are then derived. Computer simulation results based on measured data verify that the iterative crosstalk cancellation algorithms can improve the performance and approach zero-forcing algorithm by successive iterations.

关键词： VDSL2 crosstalk cancellation iterative algorithm matrix splitting

来源：评论

学校读者我要写书评

暂无评论

A Unified Convergence Analysis for Some iterative algorithms with Applications to Fractional Calculus

引用

International Journal of Applied and Computational Mathematics 2017年第2期3卷 323-332页

作者： Anastassiou, George A. Argyros, Ioannis K. Department of Mathematical Sciences University of Memphis Memphis 38152 TN United States Department of Mathematical Sciences Cameron University Lawton 73505 Ok United States

We present a local as well as a semilocal convergence analysis for some iterative algorithms in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting. In the application part of the study, we present applications to fractional calculus by using some choices of the operators involving the left and right Caputo derivative, where the operators satisfy the convergence conditions. © 2016, Springer India Pvt. Ltd.

关键词： Banach space Fractional calculus Fractional derivatives iterative algorithm Semilocal-local convergence

来源：评论

学校读者我要写书评

暂无评论

Scalability Evaluation of iterative algorithms Used for Supercomputer Simulation of Physical processes

Scalability Evaluation of Iterative Algorithms Used for Supe...

引用

Global Smart Industry Conference (GloSIC)

作者： Ezhova, Nadezhda A. Sokolinsky, Leonid B. South Ural State Univ Chelyabinsk Russia

ISBN: (纸本)9781538673867

The paper is devoted to the development of a methodology for evaluating the scalability of compute-intensive iterative algorithms used in simulating complex physical processes on supercomputer systems. The proposed methodology is based on the BSF (Bulk Synchronous Farm) parallel computation model, which makes it possible to predict the upper scalability bound of an iterative algorithm in early phases of its design. The BSF model assumes the representation of the algorithm in the form of operations on lists using high-order functions. Two classes of representations are considered: BSF-M (Map BSF) and BSF-MR (Map-Reduce BSF). The proposed methodology is described by the example of the solution of the system of linear equations by the Jacobi method. For the Jacobi method, two iterative algorithms are constructed: Jacobi-M based on the BSF-M representation and Jacobi-MR based on the BSF-MR representation. Analytical estimations of the speedup, parallel efficiency and upper scalability bound are constructed for these algorithms using the BSF cost metrics on multiprocessor computing systems with distributed memory. An information about the implementation of these algorithms in C++ language using the BSF program skeleton and MPI parallel programming library are given. The results of large-scale computational experiments, performed on a cluster computing system, are demonstrated. Based on the experimental results, an analysis of the adequacy of estimations, obtained analytically by using the cost metrics of the BSF model, is made.

关键词： iterative algorithm parallel computation model BSF scalability estimation speedup parallel efficiency Jacobi method cluster computing systems

来源：评论

学校读者我要写书评

暂无评论

iterative CHANNEL ESTIMATION AND DATA DETECTION algorithm FOR OTFS MODULATION 47

ITERATIVE CHANNEL ESTIMATION AND DATA DETECTION ALGORITHM FO...

引用

47th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Ouchikh, Rabah Aissa-El-Bey, Abdeldjalil Chonavel, Thierry Djeddou, Mustapha Ecole Mil Polytech Lab Telecommun Bordj El Bahri Algeria IMT Atlantique Lab STICC UMR CNRS 6285 F-29238 Brest France

ISBN: (纸本)9781665405409

In this paper, we design an iterative channel estimation and data detection algorithm in delay-Doppler domain for orthogonal time frequency space (OTFS) system by taking advantage of the sparse nature of the channel in this domain. The proposed algorithm iterates between message-passing-aided data detection and data-aided channel estimation. This sparse channel estimation is reformulated as a specific marginalization of maximum a posteriori (MAP) problem. To deal with the intractability of this problem, we provide a Bayesian approach based on the variational mean-field approximation via the variational Bayesian expectation maximization (VB-EM) algorithm. Finally, we compare the complexity and performance in term of Bit Error Rate (BER) and Normalized Mean Square Error (NMSE) of the proposed solution to a reference solution in the literature (SP-I).

关键词： OTFS channel estimation iterative algorithm Bayesian approach

来源：评论

学校读者我要写书评

暂无评论

Generating Functional Analysis of iterative algorithms for Compressed Sensing

Generating Functional Analysis of Iterative Algorithms for C...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Mimura, Kazushi Hiroshima City Univ Dept Informat Sci Hiroshima 7313194 Japan

ISBN: (纸本)9781457705953

It has been shown that approximate message passing algorithm is effective in reconstruction problems for compressed sensing. To evaluate dynamics of such an algorithm, the state evolution (SE) has been proposed. If an algorithm can cancel the correlation between the present messages and their past values, SE can accurately tract its dynamics via a simple one-dimensional map. In this paper, we focus on dynamics of algorithms which cannot cancel the correlation and evaluate it by the generating functional analysis (GFA), which allows us to study the dynamics by an exact way in the large system limit.

关键词： algorithm design and analysis Approximation algorithms Compressed sensing Correlation GFA Heuristic algorithms iterative methods Random variables SE approximate message passing algorithm compressed sensing correlation theory functional analysis generating functional analysis iterative algorithm iterative methods one-dimensional map signal reconstruction state evolution

来源：评论

学校读者我要写书评

暂无评论

Reviews of Recent Progress on Low-Complexity Linear Detection Via iterative algorithms for Massive MIMO Systems

Reviews of Recent Progress on Low-Complexity Linear Detectio...

引用

IEEE/CIC International Conference on Communication in China (ICCC)

作者： Zhang, Zhenyu Wu, Juan Ma, Xinli Dong, Yuanyuan Wang, Yingmin Chen, Shanzhi Dai, Xiaoming Univ Sci & Technol Beijing Inst Adv Network Technol & New Serv Beijing 100191 Peoples R China Univ Sci & Technol Beijing Beijing Engn & Technol Res Ctr Convergence Networ Beijing 100191 Peoples R China China Acad Telecommun Technol Beijing 100191 Peoples R China

ISBN: (纸本)9781509021369

Massive multiple-input multiple-output (MMIMO) can significantly enhance the spectrum efficiency of cellular networks by deploying hundreds of active elements at the base stations and is envisaged to become the key technology in 5th generation (5G) cellular networks. However, the large number of antennas required brings about tremendous challenges for practical implementation, especially for separation of the multiplexed data. iterative approaches, such as Jacobi, Richardson, Gauss-Seidel (GS), successive overrelaxation (SOR), and symmetric successive overrelaxation (SSOR) have received great attention recently due to their low-complexity and high performance for signal detection. In this work, we provide a comprehensive review of recent progress in iterative based signal detection for massive MIMO systems. The system model of an iterative method based minimum mean square error (MMSE) signal detection is provided. The convergence behavior and complexity of the iterative approach based detectors are analyzed. Numerical results show that the iterative algorithm-based detectors can achieve a performance close to the classical MMSE detector with significantly less computational complexity.

关键词： Massive multiple-input multiple-output (MIMO) minimum mean square error (MMSE) iterative algorithm convergence bit error rate (BER)

来源：评论

学校读者我要写书评

暂无评论

Two Novel iterative algorithms for Interference Alignment with Symbol Extensions in the MIMO Interference Channel

Two Novel Iterative Algorithms for Interference Alignment wi...

引用

4th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Wang, Chao Deng, Ke Li, Yubo Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China

ISBN: (纸本)9781467358293;9781467358309

Interference alignment(IA) with symbol extensions in the K-user multiple-input multiple-output (MIMO) interference channel(IC) is considered in this paper. Symbol extensions produce the channels of special structure. Most of existing approaches are limited in cases where the channels have some special structure, because they align the interference without preserving the dimensionality of the desired signal. For that reason, two novel iterative algorithms for IA with symbol extensions are proposed. The first algorithm designs transceivers for IA based on minimizing the maximum per-user mean square error(MSE) while preserving the dimensionality of the desired signal. Utilizing channel reciprocity, the second algorithm is proposed which is the constrained optimization problem. It maximizes each receiver's SINR while preserving the dimensionality of the desired signal. The simulation results show that the proposed algorithms not only achieve good performance in terms of BER performance but also achieve good performance on maximizing sum rate of the system.

关键词： IA Interference alignment symbol extensions MIMO interference channel iterative algorithm mean square error

来源：评论

学校读者我要写书评

暂无评论

iterative algorithms for solving the split feasibility problem in Hilbert spaces

引用

JOURNAL OF FIXED POINT THEORY AND APPLICATIONS 2018年第1期20卷 11-11页

作者： Zhao, Jing Zong, Haili Civil Aviat Univ China Tianjin Key Lab Adv Signal Proc Tianjin 300300 Peoples R China Civil Aviat Univ China Coll Sci Tianjin 300300 Peoples R China

In this paper, we introduce two iterative algorithms for the split feasibility problem in real Hilbert spaces by reformulating it as a fixed point equation. Under suitable conditions, weak and strong convergence theorems are established. As a consequence, we obtain weak and strong convergence iterative sequences for the split equality problem introduced by Moudafi. The efficiency of the proposed algorithms is illustrated by numerical experiments. Our results improve and extend the corresponding results announced by many others.

关键词： Split feasibility problem iterative algorithm weak convergence strong convergence hilbert space

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：