• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.1-7
• /
• 2006

Quadrature amplitude modulation-spread spectrum (QAM-SS) and code division multiplexing (CDM) are multi-level modulation schemes with high performance but they cause a large peak-average power ratio (PAPR). Therefore, this paper proposes a novel modulation scheme for high-rate transmission which follows a sequence of CDM-mapping-CDM not only to correct the above-mentioned problem but also offer a high flexibility in obtaining arbitrary multilevel modulation with very low implementation complexity and high performance.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.5
• /
• pp.1-9
• /
• 1996

In this paper, we propose an efficient computational algorithm that can reduce significantly the computational complexity of the ML optimum multiuser detector known as the most excellent detector in synchronous code division multiple access channels. The proposed detector uses the sequential detection algorithm based on the alternating maximization appraoch to obtain the ML estimates. As initial estimates for this sequential algorithm, we can use the estimated values obtained by the conventional single-user detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback muliuser detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback multiuser detector. We have performed computer simulations in order to see the convergence behaviors and the detection performance of the propsoed algorithm in terms of initial algorithms and the number of users, and then to compare the computational complexity with that of the ML optimum multiuser detector. From the results, we have seen that the proposed alternating maximization detector has nearly equal detction performance with that of the ML optimum multiuser detctor in only a few iteration.

• ETRI Journal
• /
• v.39 no.3
• /
• pp.319-325
• /
• 2017

The decoding process of a quasi-cyclic low-density parity check code requires a unique type of rotator. These rotators, called multi-size cyclic-shifters (MSCSs), rotate input data with various sizes, where the size is the amount of data to be rotated. This paper proposes a low-complexity MSCS structure for the case when the sizes have a nontrivial common divisor. By combining the strong points of two previous structures, the proposed structure achieves the smallest area. The experimental results show that the area reduction was more than 14.7% when the proposed structure was applied to IEEE 802.16e as an example.

• Journal of information and communication convergence engineering
• /
• v.4 no.2
• /
• pp.75-78
• /
• 2006

This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. Stacking received symbols from different symbol duration and applying QR decomposition result in the special format of upper triangular matrix R so that the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.117-121
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

• Journal of information and communication convergence engineering
• /
• v.3 no.2
• /
• pp.72-75
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.39-47
• /
• 2021

Lempel-Ziv coding is one of the most famous source coding schemes. The output of this source coding is usually a non-uniform code, which requires additional source coding, such as arithmetic coding, to reduce a redundancy. However, this additional source code increases complexity and decoding latency. Thus, this paper proposes the optimal maximum a-posteriori (MAP) receiver for non-uniform source non-orthogonal multiple access (NOMA) with symmetric superposition coding (SSC). First, we derive an analytical expression of the bit-error rate (BER) for non-uniform source NOMA with SSC. Then, Monte Carlo simulations demonstrate that the BER of the optimal MAP receiver for the non-uniform source improves slightly, compared to that of the conventional receiver for the uniform source. Moreover, we also show that the BER of an approximate analytical expression is in a good agreement with the BER of Monte Carlo simulation. As a result, the proposed optimal MAP receiver for non-uniform source could be a promising scheme for NOMA with SSC, to reduce complexity and decoding latency due to additional source coding.

• International journal of advanced smart convergence
• /
• v.13 no.1
• /
• pp.12-22
• /
• 2024

Software applications have a huge and inseparable impact on our lives. The complexity of the applications increases rapidly to support high performance and multifunction. Accordingly, the cost model for applications is increasingly important. Line of Code (LOC) and Man-Month (M/M) as the cost model measure the quantitative sides of the applications. Unlike them, Function Point (FP) measures the functionalities of the application. FP is efficient for estimating qualitative characteristics, but it is restricted to measuring the cost of an application using the wireless data broadcast which can support any number of clients. In this paper, we propose, a Function Point model for Information services using wireles data Broadcast (FPIB) to measure the development cost of an application that serves using the wireless data broadcast environment. FPIB adopts critical parameters of the wireless broadcast environment and the complexity of them to measure effectively the cost developing the application. Through the evaluation comparing the proposed FPIB with FP, we reveal the effectiveness of the proposed FPIB.

• Journal of Engineering Education Research
• /
• v.19 no.2
• /
• pp.60-69
• /
• 2016

This paper deals with the selection method of effective engineering design problem based on LEGO Mindstorm NXT for basic design education. By YouTube case study of various LEGO-based engineering designs for olympic sports, performance criteria have been developed including programming complexity, structural complexity, sensor/actuator complexity and variety of game operation. Programming complexity includes range of programming code length and possible program variety. Structural complexity includes variety of structural elements such as length, shape, weight, and volume to overcome design restrictions. Sensor/actuator complexity includes variety of sensor used and number of possible actuator assemblies. Variety of game operation includes game complexity and required creativity to make LEGO robots. Based on these performance criteria, four representative sports were selected as the candidates for effective engineering design problem. Finally, feasibility and attributes of each candidate were verified by real implementation examples.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.12 no.4
• /
• pp.418-425
• /
• 2012

In this paper, efficient implementation of error correction code (ECC) processing circuits based on single error correction and double error detection (SEC-DED) code with check bit pre-computation is proposed for memories. During the write operation of memory, check bit pre-computation eliminates the overall bits computation required to detect a double error, thereby reducing the complexity of the ECC processing circuits. In order to implement the ECC processing circuits using the check bit pre-computation more efficiently, the proper SEC-DED codes are proposed. The H-matrix of the proposed SEC-DED code is the same as that of the odd-weight-column code during the write operation and is designed by replacing 0's with 1's at the last row of the H-matrix of the odd-weight-column code during the read operation. When compared with a conventional implementation utilizing the odd-weight- column code, the implementation based on the proposed SEC-DED code with check bit pre-computation achieves reductions in the number of gates, latency, and power consumption of the ECC processing circuits by up to 9.3%, 18.4%, and 14.1% for 64 data bits in a word.