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

10th IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)

作者： Bose, Arindam Arriaga-Trejo, Israel A. Orozco-Lugo, Aldo G. Soltanalian, Mojtaba Univ Illinois Chicago IL 60607 USA Autonomous Univ Zacatecas CONACYT Zacatecas Mexico Natl Polytech Inst CINVESTAV Mexico City DF Mexico

ISBN: (纸本)9781538647523

Unimodular sequences with good correlation properties have attracted significant research interest due to their applications in several areas such as radar sensing and communications. In this paper, we address the problem of designing unimodular sequence sets with good correlation and complementary correlation properties using generalized cyclic algorithms for the minimization of weighted integrated sidelobe level (WISL) based metrics. The set of sequences are obtained by considering their complete second-order characterization, which has been proven to be beneficial for identification and sensing systems employing widely linear signal processing. Several numerical examples have been presented to illustrate the performance of the proposed algorithms.

关键词： Auto-correlation cyclic algorithms integrated sidelobe level unimodular sequences waveform design

来源：评论

学校读者我要写书评

暂无评论

New algorithms for Designing Unimodular Sequences With Good Correlation Properties

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2009年第4期57卷 1415-1425页

作者： Stoica, Petre He, Hao Li, Jian Uppsala Univ Dept Informat Technol Uppsala Sweden Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA

Unimodular (i.e., constant modulus) sequences with good autocorrelation properties are useful in several areas, including communications and radar. The integrated sidelobe level (ISL) of the correlation function is often used to express the goodness of the correlation properties of a given sequence. In this paper, we present several cyclic algorithms for the local minimization of ISL-related metrics. These cyclic algorithms can be initialized with a good existing sequence such as a Golomb sequence, a Frank sequence, or even a (pseudo)random sequence. To illustrate the performance of the proposed algorithms, we present a number of examples, Including the design of sequences that have virtually zero autocorrelation sidelobes In a specified lag interval and of long sequences that could hardly be handled by means of other algorithms previously suggested in the literature.

关键词： Autocorrelation cyclic algorithms integrated sidelobe level merit factor unimodular sequences waveform design

来源：评论

学校读者我要写书评

暂无评论

Frequency domain sequence design algorithm minimising weighted integrated sidelobe level

引用

IET RADAR SONAR AND NAVIGATION 2019年第3期13卷 464-472页

作者： Biskin, Osman Tayfun Akay, Olcay Dokuz Eylul Univ Dept Elect & Elect Engn Tinaztepe Campus TR-35160 Buca Izmir Turkey

Unimodular sequences with low-autocorrelation sidelobes are employed in various applications of radar and communication systems. Suppressing some predetermined autocorrelation sidelobes of a designed sequence can be accomplished by performing minimisation of the metric of weighted integrated sidelobe level (WISL). In this study, the authors propose a new algorithm to design unimodular sequences utilising the majorisation minimisation (MM) method for directly minimising WISL in the frequency domain. The proposed algorithm allows the design of long sequences in a computationally efficient manner. As the first step of the algorithm, a function majorising the frequency domain representation of the WISL metric is introduced. Then, a closed-form solution for the minimisation of WISL is derived followed by its realisation as an iterative algorithm. They also provide an acceleration scheme to allow efficient implementation of the designed algorithm. Numerical experiments show that the proposed algorithm not only outperforms existing cyclic algorithms with respect to computation time and suppression of desired autocorrelation sidelobes but also converges in less number of iterations than its time domain MM-based counterparts.

关键词： frequency-domain analysis sequences correlation methods minimisation iterative methods computational complexity low-autocorrelation sidelobes predetermined autocorrelation sidelobes majorisation minimisation method frequency domain representation WISL metric iterative algorithm cyclic algorithms time domain MM-based counterparts frequency domain sequence design algorithm closed-form solution acceleration scheme

来源：评论

学校读者我要写书评

暂无评论

Iterative cyclic subspace tracking for blind adaptive multiuser detection in multirate CDMA systems

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2003年第6期52卷 1463-1475页

作者： Buzzi, S Lops, M Pauciullo, A Univ Cassino DAEIMI Cassino Italy Univ Naples DIET Naples Italy

In this paper, the problem of subspace-based blind adaptive multiuser detection in multirate direct-sequence code-division multiple-access (DS-CDMA) systems adopting short (periodic) spreading codes is considered. The solution that we propose is based on the well-known formulation of the linear minimum mean-squared error and decorrelating detectors in terms of signal subspace parameters. Since in a multirate scenario the correlation properties of the observable (and, hence, the signal subspace parameters) are periodically time-varying, classical subspace tracking algorithms, which assume that the subspace to be tracked is time-invariant or slowly time-varying, are shown to be not useful in this situation. A new recursive cyclic subspace tracking algorithm is thus developed. This procedure, which is based on a generalization of the PASTd algorithm, is able to capture the periodical variations of the signal subspace, and thus enables subspace-based blind adaptive multiuser detection in multirate CDMA systems. The proposed algorithm has a smaller computational complexity than the recently developed cyclic recursive-least-squares procedure, and, as numerical results confirm, is capable of providing very satisfactory performance.

关键词： blind adaptive multiuser detection cyclic algorithms direct-sequence code-division multiple-access (DS-CDMA) systems multirate CDMA subspace tracking

来源：评论

学校读者我要写书评

暂无评论

LOW COMPLEXITY CONSTANT MODULUS BASED cyclic BLIND ADAPTIVE MULTIUSER DETECTION

引用

SAIEE AFRICA RESEARCH JOURNAL 2006年第2期97卷 112-119页

作者： Whitehead, J. B. Takawira, F. Eskom Resources & Strategy CR&D Private Bag 40175 ZA-2022 Cleveland South Africa Univ KwaZulu Natal Sch Elect Elect & Comp Engn ZA-4041 Durban South Africa

Periodically time varying (PTV) filters can offer significant performance gains over conventional filtering methods in DS-CDMA communications systems that are either multirate or corrupted by narrow band interference. This paper develops a new blind adaptive PTV linear multiuser detector based on the frequency shift (FRESH) architecture. The blind adaptive algorithm is based on the linearly constrained constant modulus algorithm (LCCMA), but is modified for the FRESH architecture. The resulting stochastic gradient algorithm has significantly less computational complexity than the recently proposed recursive and cyclic subspace tracking algorithms, and can offer comparable performance. The robustness of the FRESH-LCCMA algorithm is ensured through a proof of convergence which is carried out in the paper.

关键词： Blind adaptive multiuser detection constant modulus algorithm cyclic algorithms DS-CDMA frequency shift filtering multi-rate CDM

来源：评论

学校读者我要写书评

暂无评论

Common fixed points of strict pseudocontractions by iterative algorithms

引用

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 2011年第2期382卷 631-644页

作者： Colao, Vittorio Marino, Giuseppe Univ Calabria Dipartimento Matemat I-87036 Arcavacata Di Rende CS Italy

In this paper, we present iteration schemes to weakly and strongly approximate common fixed points of a finite family of a class of strict pseudocontractions. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Common fixed points cyclic algorithms Krasnoselskii-Mann iteration Strict pseudocontractions q-Uniformly smooth Banach spaces Convergence

来源：评论

学校读者我要写书评

暂无评论

Low complexity constant modulus based cyclic blind adaptive multiuser detection

Low complexity constant modulus based cyclic blind adaptive ...

引用

7th Africon Conference in Africa

作者： Whitehead, J Takawira, F Univ KwaZulu Natal Sch Elect Elect & Comp Engn ZA-4041 Durban South Africa

ISBN: (纸本)0780386051

关键词： blind adaptive multiuser detection constant modulus algorithm cyclic algorithms DS-CDMA frequency shift filtering multi-rate CDMA

来源：评论

学校读者我要写书评

暂无评论

On the design of linear sparse arrays with beampattern shift invariant properties

引用

SIGNAL PROCESSING 2022年 199卷

作者： Lin, Ronghao Wang, Gang Li, Jian Univ Sci & Technol China Dept Elect Engn & Informat Sci Hefei Peoples R China Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA

We investigate the design of linear sparse arrays and multiple-input multiple-output (MIMO) linear sparse arrays with beampattern shift invariant property (BSIP) and determine the necessary and sufficient conditions needed to achieve BSIP. Moreover, we show how to theoretically calculate the precise peak sidelobe level (PSL) values of their array beampatterns. We also establish the relationship between the number of antennas and the beampattern of a linear sparse array with BSIP. Furthermore, built on our theoretical analysis, we devise computationally efficient cyclic algorithms to design linear sparse arrays with BSIP and their MIMO counterparts by minimizing the PSL values of their beampatterns. In addition, we introduce a design method to avoid angle ambiguities even when the pointing direction of the linear array beampattern is the extreme case of 90 & DEG;or-90 & DEG;. Numerical examples are provided to support our theoretical analysis and demonstrate that our proposed algorithms can be used to obtain linear sparse arrays with 3-dB main beam widths narrower while simultaneously PSL values lower than those of the existing arrays. (C) 2022 Elsevier B.V. All rights reserved.

关键词： Array design BSIP cyclic algorithms Linear sparse arrays MIMO Linear sparse arrays PSL Minimization

来源：评论

学校读者我要写书评

暂无评论

Some new iterative algorithms for generalized mixed equilibrium problems with strict pseudo-contractions and monotone mappings

引用

Taiwanese Journal of Mathematics 2009年第5期13卷 1537-1582页

作者： Peng, Jian-Wen Yao, Jen-Chih College of Mathematics and Computer Science Chongqing Normal University Chongqing 400047 China Department of Applied Mathematics National Sun Yat-sen University Kaohsiung 804 Taiwan

In this paper, we propose some parallel and cyclic algorithms based on the extragradient method (nonextragradient method) for finding a common element of the set of solutions of a generalized mixed equilibrium problem, the set of fixed points of a finite family of strict pseudo-contractions and the set of the variational inequality for a monotone, Lipschitz continuous mapping (an inverse strongly monotone mapping). We obtain some weak and strong convergence theorems for the sequences generated by these processes in Hilbert spaces. The results in this paper generalize, improve and unify some well-known results in the literature.

关键词： cyclic algorithms Extragradient method Generalized mixed equilibrium problem Monotone mapping Parallel algorithms Strict pseudo-contraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：