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

Improved Lattice Reduction-Aided MIMO Successive Interference Cancellation Under Imperfect Channel Estimation

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2012年第6期60卷 3346-3351页

作者： Park, Jaehyun Chun, Joohwan ETRI Broadcasting & Telecommun Convergence Res Lab Taejon 305701 South Korea Korea Adv Inst Sci & Technol Div Elect Engn Sch Elect Engn & Comp Sci Taejon 305701 South Korea

Lattice reduction (LR) and successive interference cancellation (SIC) are two well-known techniques that can be used to improve detection performance over linear detectors for multiple-input multiple-output (MIMO) systems. However, the LR technique and the SIC technique usually need perfect knowledge on the channel at the receiver, and the use of these techniques with an erroneous channel matrix even worsens the detection performance compared to linear detectors. In this correspondence, we shall show how to modify these techniques to make them robust under imperfect channel estimation. Information needed for the proposed algorithm is moderate;the variance of channel estimation error is the only requirement. Furthermore, our algorithm is not sensitive to the error in the variance of channel estimation error.

关键词： Channel estimation error lattice reduction lll algorithm SIC

来源：评论

学校读者我要写书评

暂无评论

Generalisations of NTRU cryptosystem

引用

SECURITY AND COMMUNICATION NETWORKS 2016年第18期9卷 6315-6334页

作者： Singh, Sonika Padhye, Sahadeo Motilal Nehru Natl Inst Technol Dept Math Allahabad 211004 Uttar Pradesh India

Since the proposal of NTRU cryptosystem, many variants were proposed by the researcher using different-different algebraic structure. In this article, we try to explore the existing variants of NTRU cryptosystem with ... 详细信息

关键词： lattices shortest vector problem closest vector problem lll algorithm NTRU

来源：评论

学校读者我要写书评

暂无评论

algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第7期68卷 4491-4517页

作者： Stern, Sebastian Ling, Cong Fischer, Robert F. H. Ulm Univ Inst Commun Engn D-89081 Ulm Germany Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England

Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are considered. However, in communications, complex-valued processing is usually of interest. Besides, by the use of dual-polarized transmission as well as by the combination of two time slots or frequencies, four-dimensional (quaternion-valued) approaches become more and more important. Hence, to account for this fact, well-known lattice algorithms and related concepts are generalized in this work. To this end, a brief review of complex arithmetic, including the sets of Gaussian and Eisenstein integers, and an introduction to quaternion-valued numbers, including the sets of Lipschitz and Hurwitz integers, are given. On that basis, generalized variants of two important algorithms are derived: first, of the polynomial-time lll algorithm, resulting in a reduced basis of a lattice by performing a special variant of the Euclidean algorithm defined for matrices, and second, of an algorithm to calculate the successive minima-the norms of the shortest independent vectors of a lattice-and its related lattice points. Generalized bounds for the quality of the particular results are established and the asymptotic complexities of the algorithms are assessed. These findings are extensively compared to conventional real-valued processing. It is shown that the generalized approaches outperform their real-valued counterparts in complexity and/or quality aspects. Moreover, the application of the generalized algorithms to MIMO communications is studied, particularly in the field of lattice-reduction-aided and integer-forcing equalization.

关键词： Lattices MIMO communication Computational complexity Time-frequency analysis Quaternions Quantization (signal) Numerical simulation Lattices lattice reduction lll algorithm successive minima Gaussian integers Eisenstein integers quaternions Lipschitz integers Hurwitz integers MIMO lattice-reduction-aided equalization integer-forcing equalization

来源：评论

学校读者我要写书评

暂无评论

Computation of primary decomposition with the zeros of an ideal

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1998年第4期E81A卷 690-700页

作者： Kitamoto, T Univ Tsukuba Math Inst Fac Tsukuba Ibaraki 3058571 Japan

In this paper, se give a new approach to the computation of primary decomposition and associated prime components of a zero-dimensional polynomial ideal (f(1),f(2),...,f(n)), where f(t) are multivariate polynomials on Z (the ring of integer). Over the past several years, a considerable number of studies have been made on the computation of primary decomposition of a zero-dimensional polynomial ideal. Many algorithms to compute primary decomposition are proposed. Most of the algorithms recently proposed are based on Groebner basis. However, the computation of Groebner basis can be very expensive to perform. Some computations are even impossible because of the physical limitation of memory in a computer. On the other hand, recent advance in numerical methods such as homotopy method made access to the zeros of a polynomial system relatively ease Hence, instead of Groebner basis, we use the zeros of a given ideal to compute primary decomposition and associated prime components. More specifically, given a zero-dimensional ideal, we use lll reduction algorithm by Lenstra et al, to determine the integer coefficients of irreducible polynomials in the ideal. It is shown that primary decomposition and associated prime components of the ideal can be computed, provided the zeros of the ideal are computed with enough accuracy. A numerical experiment is given to show effectiveness of our algorithm.

关键词： primary decomposition lll algorithm zero dimensional ideal

来源：评论

学校读者我要写书评

暂无评论

Lie Invariants in Two and Three Variables

引用

Algebra Colloquium 2014年第1期21卷 95-116页

作者： Murray R. Bremner Jiaxiong Hu Department of Mathematics and Statistics University of Saskatchewan Saskatoon Canada Department of Mathematics Simon Fraser University Burnaby British Columbia Canada.

We use computer algebra to determine the Lie invariants of degree ≤ 12 in the free Lie algebra on two generators corresponding to the natural representation of the simple 3-dimensional Lie algebra sl2（C）. We then consider the free Lie algebra on three generators, and compute the Lie invariants of degree ≤ 7 corresponding to the adjoint representation of sl2（C）, and the Lie invariants of degree ≤ 9 corresponding to the natural representation of sl3（C）. We represent the action of sl2（C） and sl3（C） on Lie polynomials by computing the coefficient matrix with respect to the basis of Hall words.

关键词： free Lie algebras invariant Lie polynomials representation theory Hermitenormal form lll algorithm

来源：评论

学校读者我要写书评

暂无评论

Precoder Design for Communication-Efficient Distributed MIMO Receivers With Controlled Peak-Average Power Ratio

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2021年第7期69卷 4704-4716页

作者： Vaishampayan, Vinay A. CUNY Dept Engn & Environm Sci Coll Staten Isl New York NY 10314 USA

We consider the problem of communicating over a relay-assisted multiple-input multiple-output (MIMO) channel with additive noise, in which physically separated relays forward quantized information to a central decoder where the transmitted message is to be decoded. We assume that channel state information is available in the transmitter and show that the design of a rational-forcing precoder-a precoder which is matched to the quantizers used in the relays-is beneficial for reducing the symbol error probability. It turns out that for such rationalforcing precoder based systems, there is natural tradeoff between the peak to average power ratio in the transmitter and the rate of communication between the relays and the central decoder. The precoder design problem is formulated mathematically, and several algorithms are developed for realizing this tradeoff. Optimality of the decoder communication rate is shown based on a result in distributed function computation. Numerical and simulation results show that a useful tradeoff can be obtained between the excess decoder communication rate and the peakaverage power ratio in the transmitter.

关键词： MIMO communication peak to average power ratio precoder distributed function computation lattices lattice basis reduction lll algorithm closest lattice point decision feedback equalization successive interference cancellation communication complexity

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of cryptosystern due to Yoo, Hong, Lee, Lim, Yi and Sung

引用

ELECTRONICS LETTERS 2001年第18期37卷 1118-1119页

作者： Blackburn, SR Garefalakis, T Univ London Royal Holloway & Bedford New Coll Dept Math Egham TW20 0EX Surrey England

The authors show that a public key cryptosystem due to Yoo. Hong, Lee, Lim, Yi and Sung is insecure. as it is susceptible to an attack based on the lll algorithm.

关键词： lll algorithm public key cryptosystem cryptanalysis security YHLLYS cryptosystem public key cryptography

来源：评论

学校读者我要写书评

暂无评论

A Diagonal Lattice Reduction algorithm for MIMO Detection

引用

IEEE SIGNAL PROCESSING LETTERS 2012年第5期19卷 311-314页

作者： Zhang, Wen Qiao, Sanzheng Wei, Yimin Fudan Univ Sch Math Sci Shanghai 200433 Peoples R China McMaster Univ Dept Comp & Software Hamilton ON L8S 4K1 Canada Fudan Univ Shanghai Key Lab Contemporary Appl Math Shanghai 200433 Peoples R China

Recently, an efficient lattice reduction method, called the effective lll (Elll) algorithm, was presented for the detection of multiinput multioutput (MIMO) systems. In this letter, a novel lattice reduction criterion, called diagonal reduction, is proposed. The diagonal reduction is weaker than the Elll reduction, however, like the Elll reduction, it has identical performance with the lll reduction when applied for the sphere decoding and successive interference cancelation (SIC) decoding. It improves the efficiency of the Elll algorithm by significantly reducing the size-reduction operations. Furthermore, we present a greedy column traverse strategy, which reduces the column swap operations in addition to the size-reduction operations.

关键词： Effective lll algorithm lattice reduction lll algorithm MIMO systems

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of RSA with two decryption exponents

引用

INFORMATION PROCESSING LETTERS 2010年第5期110卷 178-181页

作者： Sarkar, Santanu Maitra, Subhamoy Indian Stat Inst Appl Stat Unit Kolkata 700108 India

In this paper, we consider RSA with N = pq, where p, q are of same bit size, i.e., q < p < 2q. We study the weaknesses of RSA when multiple encryption and decryption exponents are considered with same RSA modulus N. A decade back, Howgrave-Grahann and Seifert (CQRE 1999) studied this problem in detail and presented the bounds on the decryption exponents for which RSA is weak. For the case of two decryption exponents, the bound was N-0.357. We have exploited a different lattice based technique to show that RSA is weak beyond this bound. Our analysis provides improved results and it shows that for two exponents, RSA is weak when the RSA decryption exponents are less than N-0.416. Moreover, we get further improvement in the bound when some of the most significant bits (MSBs) of the decryption exponents are same (but unknown). (C) 2009 Elsevier B.V. All rights reserved.

关键词： Cryptography RSA Cryptanalysis Factorization Lattice lll algorithm

来源：评论

学校读者我要写书评

暂无评论

Revisiting the Orthogonal Lattice algorithm in Solving General Approximate Common Divisor Problem

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2022年第3期E105A卷 195-202页

作者： Yu, Xiaoling Wang, Yuntao Xu, Chungen Takagi, Tsuyoshi Taiyuan Univ Technol Coll Data Sci Taiyuan Peoples R China Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Ishikawa 9231292 Japan Nanjing Univ Sci & Technol Sch Sci Nanjing Peoples R China Univ Tokyo Dept Math Informat Tokyo 1138656 Japan

Due to the property of supporting arbitrary operation over the encrypted data, fully homomorphic encryption (FHE) has drawn considerable attention since it appeared. Some FHE schemes have been constructed based on the general approximate common divisor (GACD) problem, which is widely believed intractable. Therefore, studying the GACD problem's hardness can provide proper security parameters for these FHE schemes and their variants. This paper aims to study an orthogonal lattice algorithm introduced by Ding and Tao (Ding-Tao algorithm) to solve the GACD problem. We revisit the condition that Ding-Tao algorithm works and obtain a new bound of the GACD samples' number based on geometric series assumption. Simultaneously, we also give an analysis of the bound given in the previous work. To further verify the theoretical results, we conduct experiments on Ding-Tao algorithm under our bound. We show a comparison with the experimental results under the previous bound, which indicates the success probability under our bound is higher than that of the previous bound with the growth of the bound.

关键词： general approximme common divisor problem orthogonal lattice algorithm lll algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：