• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2554-2580
• /
• 2018

Lenstra-Lenstra-$Lov{\acute{a}}sz$ (LLL) is an effective receiving algorithm for Multiple-Input-Multiple-Output (MIMO) systems, which is believed can achieve full diversity in MIMO detection of fading channels. However, the LLL algorithm features polynomial complexity and shows poor performance in terms of convergence. The reduction of algorithmic complexity and the acceleration of convergence are key problems in optimizing the LLL algorithm. In this paper, a variant of the LLL algorithm, the Hybrid-Fix-and-Round LLL algorithm, which combines both fix and round measurements in the size reduction procedure, is proposed. By utilizing fix operation, the algorithmic procedure is altered and the size reduction procedure is skipped by the hybrid algorithm with significantly higher probability. As a consequence, the simulation results reveal that the Hybrid-Fix-and-Round-LLL algorithm carries a faster rate of convergence compared to the original LLL algorithm, and its algorithmic complexity is at most one order lower than original LLL algorithm in real field. Comparing to other families of LLL algorithm, Hybrid-Fix-and-Round-LLL algorithm can make a better compromise in performance and algorithmic complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.915-921
• /
• 2009

Lenstra-Lenstra-Lovasz (LLL) algorithm, which is one of the lattice reduction (LR) techniques, has been extensively used to obtain better bases of the channel matrix. In this paper, we jointly apply Seysen's lattice reduction Algorithm (SA), instead of LLL, with the conventional linear precoding algorithms. Since SA obtains more orthogonal lattice bases compared to those obtained by LLL, lattice reduction aided (LRA) precoding based on SA algorithm outperforms the LRA precoding with LLL. Simulation results demonstrate that a gain of 0.5dB at target BER of $10^{-5}$ is achieved when SA is used instead of LLL or the LR stage.

• Journal of Oral Medicine and Pain
• /
• v.17 no.2
• /
• pp.129-149
• /
• 1992

In order to verify the acceleration effect of low level laser (LLL) on oral mucosal wound healing process at cell biological level, the author studied growth pattern and ultrastructure in human gingival fibroblasts flashed by GaAlAs LLL-830 nm, 15mW for 10 minutes/flash one to three times at interval of 3-4 days through the evaluation of cell growth rate, protein conent/cell, DNA content/cell and ultrastructural changes for 14 days. The results were as follows : 1. The growth rate in gingival fibloblasts treated by LLL showed 4 orderly stages-decreasing stage after LLL treatment, acute increasing stage 3 days after LLL treatment, restring stage and recovering stage. 2. The effect of multiple flashes on LLL at interval of 3 days more or less was not proportional to times of flash on acceleration of growth in gingival fibroblasts. 3. The total protein content per gingival fibroblast was not significantly changed by LLL treatment in comparison with control group. But some kinds of protein which might be cell growth promoting factors were decreased immediately after LLL treatment, thereafter were acutely increased in cellular protein profile. 4. In ultrastructural changes of gingival fibroblasts treated by LLL, more prominent rough endoplasmic reticulum, mitochondrial hyperplasia/hypertrophy and increased extracellular fibrillar matrix were observed in comparison with control group under same experimental period.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1047-1065
• /
• 2022

For two dimensional lattices, a Gaussian basis achieves all two successive minima. For dimension larger than two, constructing a pairwise Gaussian basis is useful to compute short vectors of the lattice. For three dimensional lattices, Semaev showed that one can convert a pairwise Gaussian basis to a basis achieving all three successive minima by one simple reduction. A pairwise Gaussian basis can be obtained from a given basis by executing Gauss algorithm for each pair of basis vectors repeatedly until it returns a pairwise Gaussian basis. In this article, we prove a necessary and sufficient condition for a pairwise Gaussian basis to achieve the first k successive minima for three dimensional lattices for each k ∈ {1, 2, 3} by modifying Semaev's condition. Our condition directly checks whether a pairwise Gaussian basis contains the first k shortest independent vectors for three dimensional lattices. LLL is the most basic lattice basis reduction algorithm and we study how to use LLL to compute a pairwise Gaussian basis. For δ ≥ 0.9, we prove that LLL(δ) with an additional simple reduction turns any basis for a three dimensional lattice into a pairwise SV-reduced basis. By using this, we convert an LLL reduced basis to a pairwise Gaussian basis in a few simple reductions. Our result suggests that the LLL algorithm is quite effective to compute a basis with all three successive minima for three dimensional lattices.

• Korean Architects
• /
• s.628
• /
• pp.40-47
• /
• 2021

• Journal of Oral Medicine and Pain
• /
• v.20 no.1
• /
• pp.53-65
• /
• 1995

The growth and synthetic activities of fibroblasts are regulated by cytokines and growth factors derived from activated inflammatory cells. Stimulatory effect of low level laser (LLL) radiation on wound healing seems to be in part due to direct stimulatory action on cell proliferation and synthetic activities of fibroblasts. Also indirect stimulatory effect on the fibroblast function through inflammatory or immune cells is another possible mechanism of biostimulatory action of LLL. This study was performed to determine the growth rate of human gingival fibroblasts obtained biopsy and culture, fibroblast cell line, and immune cell line by using $[^3H]-$ thymidine incorporation test. And gene expression pattern was also analyzed by using the DNA probe such as Hsp70, IL-1$\beta$, MIP-1$\alpha$ and actin cDNA. Proliferation rate of gingival fibroblast was increased by LLL irradiation, but no more effect was added by LPS or IL-1$\beta$ pretreatment Enhanced Hsp70 gene expression was found from gingival fibroblasts and fibroblast cell line COS by LLL irradiation., which was not more increased by LPS or IL-1$\beta$ pretreatment. LLL-irradiated promyelcytic cell line HL-60 and macrophage cell line RAW264.7 showed significant stimulatory effect of proliferation rate when compared with respective control. However there were no changes in growth rate of other immune cell tested in this study, such as B cell line WR19n.l and 230, helper T cell line Jurkat and Hut78, cytolytic T cell line CTLL-r8. By LLL-irradiation Hsp70 gene expression was increased in RAW246.7 and HL-60, not in CTLL-R8. And IL-1$\beta$ and MIP-1$\alpha$ gene expression were induced only from LLL-irradiated RAW264.7. These results led us to presume that LLL radiation may affect to the immune cells, especially to macrophage, through which it might promote wound healing process.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.2
• /
• pp.107-121
• /
• 2016

We analyze the complexity of the LLL algorithm, invented by Lenstra, Lenstra, and $Lov{\acute{a}}sz$ as a a well-known lattice reduction (LR) algorithm which is previously known as having the complexity of $O(N^4{\log}B)$ multiplications (or, $O(N^5({\log}B)^2)$ bit operations) for a lattice basis matrix $H({\in}{\mathbb{R}}^{M{\times}N})$ where B is the maximum value among the squared norm of columns of H. This implies that the complexity of the lattice reduction algorithm depends only on the matrix size and the lattice basis norm. However, the matrix structures (i.e., the correlation among the columns) of a given lattice matrix, which is usually measured by its condition number or determinant, can affect the computational complexity of the LR algorithm. In this paper, to see how the matrix structures can affect the LLL algorithm's complexity, we derive a more tight upper bound on the complexity of LLL algorithm in terms of the condition number and determinant of a given lattice matrix. We also analyze the complexities of the LLL updating/downdating schemes using the proposed upper bound.

• Physical Therapy Rehabilitation Science
• /
• v.9 no.4
• /
• pp.244-251
• /
• 2020

Objective: Physical therapy techniques are required for patients with temporomandibular joint disorder (TMD), but the effects of treatment have not been compared. Therefore, effects of transcutaneous electrical nerve stimulation (TENS) and low level laser (LLL), which are most commonly used interventions, were compared. Design: Randomized controlled trial. Methods: Thirty-six participants with pain in the temporomandibular joint were enrolled, and 12 participants were randomly assigned to either the TENS group, LLL group, or placebo group. Each intervention was performed for a total of 6 sessions for 2 weeks. For the evaluation of the participants, the mouth opening (MO), pressure pain threshold (PPT), and stress were measured at three time periods: baseline, post-test, and follow-up at 2 weeks. Results: Significant interaction between groups according to each evaluation point was found only in PPT-masseter (p<0.05). The evaluation time point at which a significant difference appeared was at the post-test and follow-up at 2 weeks time periods. As a result of the post-test, the LLL group showed a significant improvement compared to the TENS group (p<0.05), and at 2 weeks follow-up, the TENS group showed a significant improvement compared to the placebo group (p<0.05). Conclusions: In this study, an experiment was conducted to compare the treatment effects when TENS, LLL, and placebo were given to patients with TMD. In addition, by quantitatively presenting the effect size of each treatment, this study suggests clinical use of TENS and LLL treatment for TMD.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.377-380
• /
• 2012

격자 감소 (lattice reduction) 알고리즘은 주어진 기저 벡터를 직교에 가까운 기저 벡터로 바꾸어 준다. 그중 대표적인 알고리즘으로 LLL (Lenstra, Lenstra & Lovasz) 알고리즘이 있다. 격자 감소 알고리즘을 이용하여 다중 안테나 입출력 (MIMO) 통신시스템의 선형 수신기(linear detector)의 성능을 향상 시킬 수 있다. 스피어 복호 알고리즘 (sphere decoding algorithm)은 MIMO 통신 시스템에서 사용되는 복호기중 최대 우도 복호기 (Maximum Likelihood Detector)와 비슷한 BER(bit error rate)성능을 가지고 복잡도를 줄일 수 있어서 많이 연구되어 왔다. 이때 스피어의 반지름의 설정이나 트리 검색 구조 방식 등은 복잡도에 큰 영향을 미친다. 본 논문에서는 LLL 알고리즘에 기반하여 스피어의 반지름 설정 및 트리 검색 노드 수를 제한하는 방식으로 스피어 복호 알고리즘의 복잡도를 기존 알고리즘에 비해 크게 낮추면서도 비트 오류률 (BER) 성능 열화를 최소한으로 한 알고리즘을 제안하고 전산 실험을 통해 검증한다.

• Archives of Pharmacal Research
• /
• v.11 no.2
• /
• pp.87-92
• /
• 1988

A number of substituted furodiketochroman derivatives ($lll_{a-f}$) have been synthesized by fusion of aromatic aldehydes with 5-hydroxybergapten and 5-hydroxyisopimpinellin. On the other hand, when the reaction was carried out in a solvent, the corresponding bis-furoccumarin derivatives ($lV_{c-n}$) were obtained. The anticoagulant effect of compounds $lll_{a,b,d}$ and $lv_{b,c,f,g,i,k}$ was tested. They failed to demonstrate any significant effect. The effect of the tested compounds on the arterial blood pressure was studied. Compounds $lV_c$, $lll_d$, $lll_b$, $lV_b$, $lV_k$ and $lV_i$ showed lowering effects on the normal systolic blooc pressure of anaesthetized rats in a decreasing manner.