• Journal of Broadcast Engineering
• /
• v.17 no.5
• /
• pp.781-788
• /
• 2012

In HEVC, the fast search method is used for reducing the complexity of the motion prediction procedure. It is consisted of the sub-sampled SAD which reduce the complexity of Sum of Absolute Differences(SAD) calculation and the simplified bi-prediction method which reduce the iterations of the uni-prediction for the bi-prediction. The computational complexity is largely decreased by the fast search method but the coding gain is also decreased. In this paper, the simplified bi-prediction is extended to compensate the performance loss and the prediction cost based complexity reduction methods are also proposed to reduce the complexity burden by the extended bi-prediction method. A prediction cost based complexity reduction method is consisted of early termination method for the extended bi-prediction and the bi-prediction skipping method. Compare with HM 6.0 references S/W, the average 0.42% of BD-bitrate is decreased by both the extended bi-prediction method and the prediction cost based complexity reduction methods with negligible increasement of the complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2908-2924
• /
• 2019

Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.40-48
• /
• 2015

This paper presents a processor that performs QR decomposition (QRD) as well as Lattice Reduction (LR) for multiple-input multiple-output (MIMO) systems. By sharing the operations commonly required in QRD and LR, the hardware complexity of the proposed processor is reduced significantly. In addition, the proposed processor is designed based on a multi-cycle architecture so as to reduce the hardware complexity. The proposed processor is implemented with 139k logic gates in a $0.18-{\mu}m$ CMOS process, and its latency is $5{\mu}s$ for $8{\times}8$ MIMO preprocessing both QRD and LR where the operating frequency is 117MHz.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2201-2216
• /
• 2015

Peak to average power ratio (PAPR) is one of the main imperfections in the broadband communication systems with multiple carriers. In this paper, a new crest factor reduction (CFR) scheme based on interleaved phase sequence called Dummy Sequence Insertion Enhanced Partial Transmit Sequence (DSI-EPTS) is proposed which effectively reduces the PAPR while at the same time keeps the total complexity low. Moreover, the prototype of the proposed scheme in field programmable gate array (FPGA) is demonstrated. In DSI-EPTS scheme, a new matrix of phase sequence is defined which leads to a significant reduction in hardware complexity due to its less searching operation to extract the optimum phase sequence. The obtained results show comparable performance with slight difference due to the FPGA constraints. The results show 5 dB reduction in PAPR by applying the DSI-EPTS scheme with low complexity and low power consumption.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.3
• /
• pp.41-52
• /
• 2020

This paper investigates the stress-reducing preventive maintenance model through numerical experiments. The preventive maintenance model is used to analyze the relationship between related conditions and variables to gain insight into the efficient operation of the system when performing preventive maintenance in real-world situations. Various preventive maintenance models have been developed over the past decades and their complexity has increased in recent years. Increasing complexity is essential to reflect reality, but recent models can only be interpreted through numerical experiments. The stress-reducing preventive maintenance is a newly introduced preventive maintenance concept and can only be interpreted numerically due to its complexity, and has received little attention because the concept is unfamiliar. Therefore, for information purposes, this paper investigates the characteristics of the stress-reducing preventive maintenance and the relationship between parameters and variables through numerical experiments. In particular, this paper is focusing on the economic feasibility of stress-reducing preventive maintenance by observing changes in the optimal preventive maintenance period in response to changes in environmental stress and the improvement factor. As a result, when either the environmental stress or the improve effect of stress-reducing preventive maintenance is low, it is not necessary to carry out the stress-reducing preventive maintenance at excessive cost. In addition, it was found that the age reduction model is more economical than the failure rate reduction model.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.1
• /
• pp.10-17
• /
• 1993

This paper analyzes succinct graph descriptions and its complexity of connectivity problems on context free graph languages under various restrictions. It defines SNLC(Simple Context Free Node Label Controlled) grammar and presents reduction method that solves graph problems without expanding the hierarchical description. It exemplifies the method by giving efficient solutions to connectivity problems on graphs and presents parallel algorithm for reduction and analyzes the complexity. Its results will help application of desing for NETWORK. CAD. VLSI and other engineering problems.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.155-158
• /
• 1998

IMBE(Improved Multi-Band Excitation) vocoders exhibit good performance at low data rates. The major drawback to IMBE coders is their large computational requirements. In this paper, thus, we propose a new pitch search method that preserves the quality of the IMBE vocoder with reduced complexity. The basic idea is to reduce computation complexity of the pitch searching by using the SAMDF. Applying the proposed method to the IMBE vocoder, we can get approximately 52.02% searching time reduction in the pitch search. There is no difference in voice quality between conventional IMBE and proposed IMBE.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.141-145
• /
• 1995

Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their large computational requirements. In this paper, we propose a new codebook search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the searching range of the random codebook by using a searching technique of the regular pulse excitation. Applying the proposed method to the CELP vocoder, we can get approximately 48% complexity reduction in the codebook search.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.10
• /
• pp.1172-1180
• /
• 2007

OFDM system has very good high spectral efficiency and the robustness to the frequency-selective fading. Because of the high PAPR, OFDM signals can be distorted in nonlinear HPA(High Power Amplifier). So, to overcome the nonlinear distortion, it is very important to reduce the IMD value. With respect to the BER performance, IMD reduction method is better than the PAPR reduction method. However, IMD reduction method has much more system complexity because of the additional FFT processor in transmitter. In this paper, we study the OFDM communication system based on the IMD reduction method using SPW method. A new IMD reduction method is proposed to reduce the computational complexity. SPW method is to divide the input OFDM data into several sub-blocks and to multiply phase weighting values with each sub-blocks for the reduction of PAPR or IMD. Unlike the conventional method, the system size and computational complexity can be reduced.

• ETRI Journal
• /
• v.27 no.5
• /
• pp.639-642
• /
• 2005

This paper proposes two kinds of complexity-reduced algorithms for a low density parity check (LDPC) decoder. First, sequential decoding using a partial group is proposed. It has the same hardware complexity and requires a fewer number of iterations with little performance loss. The amount of performance loss can be determined by the designer, based on a tradeoff with the desired reduction in complexity. Second, an early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Once the edges are detected, no further iteration is required; thus early detection reduces the computational complexity.