Multiple-input multiple-output (MIMO) systems are playing an increasing and interesting role in the recent wireless communication. The complexity and the performance of the systems are driving the different studies and researches. Lattices Reduction techniques bring more resources to investigate the complexity and performances of such systems. In this paper, we look to modify a fixed complexity...

あらまし 厳しい周波数選択性環境下では大きな符号間干渉(ISI)が発生するため,シングルキャリア(SC)伝送の 平均ビット誤り率(BER)特性は著しく劣化してしまう.筆者らはこれまで,Tomlinson-Harashima precoding(THP)を用 いることで周波数領域等化(FDE)で抑圧しきれない ISI を抑圧し,特に 16QAM や 64QAM などの高レベル多値変調 を用いたときの BER 特性を改善できるジョイント THP/送信(または受信)FDE を提案してきた.しかしこれまでの 提案では,高速フーリエ変換(FFT)ブロックの末端で品質の悪いシンボルが発生するため,ダミーシンボルが不可欠 であった.このようなダミーシンボルを用いる方法は,伝送品質改善には有効であるものの,伝送レートを劣化さ せてしまう.本稿では,ダミーシンボルを挿入する代わりに LLL-アルゴリズ...

Malocclusions, such as an open bite and high canines, are often encountered in orthodontic practice. Teeth without occlusal stimuli are known as hypofunctional teeth, and numerous atrophic changes have been reported in the periodontal tissue, including reductions in blood vessels in the periodontal ligament (PDL), heavy root resorption, and reduced bone mineral density (BMD) in the alveolar bon...

PURPOSE To characterize the effects of low-level laser (LLL) on third-degree burn wounds which were infected with Staphylococcus aureus (S. aureus) in diabetic rats. METHODS Thirty streptozotocin-induced diabetic rats were divided into two groups: the control and the LLL groups. Third-degree burns were induced using a heated metal rod, and then, were contaminated with S. aureus. The wounds in...

INTRODUCTION There have been inconsistent reports of dilation of the third ventricle (lll-V) in bipolar disorder. Within the lateral walls of lll-V are hypothalamic nuclei which mediate the neuroendocrine, sleep, appetite and autonomic disturbances which characterise a depressive episode. METHODS The lll-V width, immediately anterior to the mamillary bodies, was measured in 74 bipolar I or II...

We consider the lattice-reduction-aided detection scheme for 2×2 channels recently proposed by Yao and Wornell [11]. Using an equivalent real-valued substitute MIMO channel model their lattice reduction algorithm can be replaced by the well-known LLL algorithm, which enables the application to MIMO systems with arbitrary numbers of dimensions. We show how lattice reduction can also be favourabl...

In this paper, we propose approximate lattice algorithms for solving the shortest vector problem (SVP) and the closest vector problem (CVP) on an n-dimensional Euclidean integral lattice L. Our algorithms run in polynomial time of the dimension and determinant of lattices and improve on the LLL algorithm when the determinant of a lattice is less than 2 2/4. More precisely, our approximate SVP a...

For the fully homomorphic encryption schemes in [SV10, GH11], this paper presents attacks to solve equivalent secret key and directly recover plaintext from ciphertext for lattice dimensions n=2048 by using lattice reduction algorithm. According to the average-case behavior of LLL in [NS06], their schemes are also not secure for n=8192.

This paper describes a parallel Jacobi method for lattice basis reduction and a GPU implementation using CUDA. Our experiments have shown that the parallel implementation is more than fifty times as fast as the serial counterpart, which is twice as fast as the well-known LLL lattice reduction algorithm.

Lenstra-Lenstra-Lovasz (LLL) Algorithm is an approximation algorithm of the shortest vector problem, which runs in polynomial time and finds an approximation within an exponential factor of the correct answer. It is a practical method with enough accuracy in solving integer linear programming, factorizing polynomials over integers and breaking cryptosystems. In this paper, we introduce its back...