• Korean Journal of Mathematics
• /
• v.16 no.3
• /
• pp.301-307
• /
• 2008

Let $R_n$ be the the first return time to its initial n-word. Then the Ornstein-Weiss first return time theorem implies that log$R_n$ divided by n converges to entropy. We consider the convergence of log$R_n$ for Sturmian sequences which has the lowest complexity. In this case, we normalize the logarithm of the first return time by log n. We show that for any numbers $1{\leq}{\alpha},\;{\beta}{\leq}{\infty}$, there is a Sturmian sequence of which limsup is ${\alpha}$ and liminf is $1/{\beta}$.

• The Journal of Society for e-Business Studies
• /
• v.7 no.2
• /
• pp.157-171
• /
• 2002

We want to find a timestamping method which improves efficient performance and have high-level security to send secured messages in the digital signature and the law of e-commerces. Our paper shows a H-binary tree of time stamp to use a time stamp protocol with high security and performance in the packets of sending messages. We implement and analyze the protocols, show to compare with previous RSA methods. Our proposed protocol has O(log n) time complexity and high-performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.9
• /
• pp.24-30
• /
• 2009

This paper presents a simple resource allocation scheme for throughput enhancement in relay based orthogonal frequency division multiple access (OFDMA) cellular systems. The resource allocation schemes, which are based on the optimization problem, have high computational complexity. That is why a searching process is required on the overall allocable resources. Since these schemes should be performed in real time, we propose a simple resource allocation scheme which has very low computational complexity. Firstly, we formulate the optimization problem and draw observations for throughput maximization. Based on observations, we propose a three step allocation scheme that separates the allocable resources into three (i.e. relay, frequency and time). By doing so, the computational complexity can be reduced. Simulation results show that the proposed scheme has near-optimum performance in spite of its low computational complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.160-168
• /
• 2011

A Frequency domain beamforming technique is widely used in sonar systems with a large number of beams and sensors. In the battlefield environment requiring real-time signal processing, it is needed to optimize the computational complexity of the spectrum computation to implement an efficient and fast frequency domain beamformer. So, in this paper, we proposed the pruned-GSFFT (pruned generalized sliding fast Fourier transform) as a new spectrum computation method. The proposed method help to reduce the computational complexity of the real-time partial spectrum computation by eliminating the redundancy between consecutive input samples and skipping the regardless frequency bands. Also the characteristics of the proposed pruned-GSFFT method and its computational complexity are compared to those of previous FFT algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2C
• /
• pp.105-111
• /
• 2011

In this paper, we propose a novel Alamouti space-time transmission scheme for orthogonal frequency division multiplexing (OFDM) based asynchronous cooperative communication systems with low relay complexity. The conventional scheme requires an additional operation likes time-reversal at the relay nodes besides the simple multiplications at the relay nodes, which result in increasing the complexity of relay nodes. Unlike the conventional scheme, exploiting the simple combination of the symbols at the source node and the simple multiplications at the relay nodes, the proposed scheme achieves the second order diversity gain by obtaining the Alamouti code structure at the destination node. Simulation results show that the proposed scheme achieves the second order diversity gain and has the same bit error rate performance as the conventional scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.115-121
• /
• 2006

The efficiency of the multiplier largely depends on the representation of finite filed elements such as normal basis, polynomial basis, dual basis, and redundant representation, and so on. In particular, the redundant representation is attractive since it can simply implement squaring and modular reduction. In this paper, we propose an efficient bit-parallel multiplier for GF(2m) defined by an irreducible all-one polynomial using a redundant representation. We modify the well-known multiplication method which was proposed by Karatsuba to improve the efficiency of the proposed bit-parallel multiplier. As a result, the proposed multiplier has a lower space complexity compared to the previously known multipliers using all-one polynomials. On the other hand, its time complexity is similar to the previously proposed ones.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.629-640
• /
• 2000

this paper present an efficient line-drawing algorithm that reduces the amount of space required, Because of its efficiency , this line-drawing algorithm is faster than the Bresenham algorithm or the recursive bisection method. this efficiency was achieved through a new data structure; namely , the modified segment tree (MST). Using the modified segment tree and the distribution rule suggested in this paper, we dra lines without generating the recursive calls used in [3] and without creating the binary operation used in [4]. we also show that line accuracy improves in proportion to the display resolution . In practice, we can significantly improve the algorithm's performance with respect to time and space, This improvement offer an increase in speed, specially with lines at or near horizontal, diagonal. or vertical ; that is, this algorithm requires the time complexity of (n) and the space complexity O(2k+1), where n is the number of pixels and k is a level of the modified segment tree.

• Korean Institute of Interior Design Journal
• /
• no.34
• /
• pp.3-9
• /
• 2002

Entering into the 21st century, digital culture and the innovation of media technology have drastically changed our understanding of the concept of space. Increased availability of information made possible by technological advancement has, directly or indirectly, contributed to the development of space design, which, in turn, offers a possibility for a new paradigm in space design. Given these fundamental changes, this study seeks to explore how to understand the expansion of the concept of space. In order to answer this question, this study investigates de-materialization tendency in modern architectural design such as transparency, anti-gravity, complexity and simultaneity of space. It examines the interaction-oriented nature of space among human, information and time. Finally, based on concepts such as new hyper-surface, which transcend the limitations of space and time, it explores new emerging trends in space design.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.3
• /
• pp.3-7
• /
• 2010

As the distance between signal lines in memories of high density ICs like SoCs decreases rapidly, failure occurs more frequently and effective memory test techniques are needed. In this paper, a new SRAM structure is proposed to decrease test complexity and test time for embedded DRAMs. In the presented technique, because memory test can be handled as a single port testing and read-write operation is possible at dual port without high complexity, test time can be much reduced.

• Proceedings of the KIPE Conference
• /
• 2000.07a
• /
• pp.464-467
• /
• 2000

In this paper we introduce the network based multi-motors control system using CAN(Controller Area Network) The traditional multi-motors control system has many problems in the view of reliability and economy because of the amount and complexity of wiring noise and maintenance problems etc, These problems are serious especially when the motor controllers are separated widely CAN is generally applied in car networking in order to reduce the complexity of the related wiring harnesses. These traditional CAN application techniques are modified to achieve the real time communication for the multi-motor control system. And also the position synchronization technique is developed and the proposed methods are verified experimentally.