• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.277-280
• /
• 2002

This paper analyze the characteristics of three multipliers in finite fields GF(2m) from the point of view of processing time and area complexity. First, we analyze structure of three multipliers; 1) LSB-first systolic array, 2) LFSR structure, and 3) CA structure. To make performance analysis, each multiplier was modeled in VHDL and was synthesized for FPGA implementation. The simulation results show that LFSR structure is best from the point of view of area complexity, and LSB systolic array is best from the point of view of processing time per clock.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1899-1902
• /
• 2003

Recently several methods have been developed for the virtual space construction. Generally, most of the methods are geometric-based rendering technic, but they are difficult to construct real-time rendering because of large data. In this paper, we present a three dimension image-based rendering method that enable a constant speed of real-time rendering regardless of object complexity in virtual space. The Proposed method shows good performance for the virtual space construction with high complexity.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.307-312
• /
• 2003

In this paper, a special incidence structure is designed based on (v, k+1, 1)-configuration, a subset of symmetric balanced incomplete block design, where ν = k$^2$+ k + 1. The time complexity required for desinging this incidence structure is O(equation omitted).

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.385-388
• /
• 2002

This paper proposes a new GSC (Generalized Sidelobe Canceller) structure, called HLMS-GSC. Compared to Griffiths and Jim's GSC structure, the number of complex multiplication required is reduced to one half. The simulation results show that the minimum mean square errors and performance of nulling jammers by using HLMS-GSC are almost the same compared to Griffiths and Jim's GSC, although the complexity is reduced significantly. As a result, the proposed adaptive beamformer is good for real time implementation, since it has low complexity compared to previous GSC structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11A
• /
• pp.1244-1252
• /
• 2004

In this paper, we derive some properties of linear detectors (zero forcing or minimum mean square error) at spatial multiplexing systems with alamouti's space-time block code. Based on the derived properies, this paper proposes low-complexity receivers. Implementing MMSE detector adaptively, the number of weight vectors to be calculated and updated is greatly reduced with the derived properties compared to the conventional methods. In the case of recursive least square algorithm, with the proposed approach computational complexity is reduced to less than the half. We also identify that sorted QR decomposition detector, which reduces the complexity of V-Blast detector, has the same properties for unitary matrix Q and upper triangular matrix R. A complexity reduction of about 50%, for sorted QR decomposition detector, can be achieved by using those properties without the loss of performance.

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

Recently, a rate-2, $2{\times}2$ space-time code with simple ML decoding has been designed. Though the simple ML decoding algorithm does reduce the ML decoding complexity, there is still need for improvement. In this paper, we propose an efficient decoding algorithm for the rate-2, $2{\times}2$ space-time code using interference cancellation techniques with performance virtually identical to that of ML decoding. Also, the decoding complexity of the proposed algorithm is significantly reduced compared to the conventional simple ML decoding, especially for large modulation orders.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.852-861
• /
• 2009

We propose a complexity reduced Lattice Reduction(LR) scheme for MIMO detection under time varying fading environments. It is found that for successive MIMO transmission instances, the integer matrix P after LR decomposition remains the same or only a few elements of the matrix P are slightly changed. Based on this feature, we perform LR reduction by setting the initial values for P matrix for the decomposition to be the one obtained in the previous instance not starting from the identity matrix. Simulation results reveal that the proposed scheme drastically reduces overall complexity of LR reduction compared to the conventional scheme for various system parameters under time varying channels. We also show that the proposed scheme can be applied to Seysen LR as well as LLL(Lenstra, Lenstra, and Lavasaz)-LR.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.52-60
• /
• 2008

A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.739-747
• /
• 2013

This paper investigates the multifarious nature of the long-term evolution (LTE) scheme and that of the modified LTE scheme for symbol timing synchronization (STS). This investigation allows us to propose a new replica correlation-based STS scheme to overcome the inherent weaknesses of the other two schemes. The proposed STS signal combines a gold sequence and a half sine wave in the time domain, whereas conventional STS signals specify either binary sequences or complex sequences in the time domain or in the frequency domain. In the proposed scheme, a sufficient correlation property is realized by the gold sequence, and robustness against the frequency offset (FO) is achieved through the sine wave. Compared to the existing LTE-related schemes, the proposed scheme can better achieve immunity to FO and reduction in detector complexity, as well as a low peak-to-average power ratio and a low detection error rate. Performance evaluations through analysis and simulation are provided in the paper to demonstrate these attributes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2446-2462
• /
• 2016

In this paper, a frequency domain Expectation-Maximization (EM)-based channel estimation algorithm for Space Time Block Coded-Orthogonal Frequency Division Multiplexing (STBC-OFDM) systems is investigated to support higher data rate applications in wireless communications. The computational complexity of the frequency domain EM-based channel estimation is increased when higher order constellations are used because of the ascending size of the search set space. Thus, a search set reduction algorithm is proposed to decrease the complexity without sacrificing the system performance. The performance results of the proposed algorithm is obtained in terms of Bit Error Rate (BER) and Mean Square Error (MSE) for 16QAM and 64QAM modulation schemes.