• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.42-49
• /
• 2016

This paper proposes a low-complexity generator which finds the first two minimum values using bit-serial scheme. A low-complexity generator is an important part for low-area LDPC decoders based on the min-sum decoding algorithm because the hardware complexity of generators utilizes a significant portion of LDPC decoders. To reduce hardware complexity, bit-serial LDPC decoders has been studied. The generator of the existing bit-serial LDPC decoders can find only the first minimum value, and thus it leads to a BER performance degradation. The proposed generator using bit-serial scheme finds the first two minimum values. Hence, it can improve the BER performance. In addition, the area-time complexity of the proposed generator is lower than those of the existing generators finding the first two minima.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.4
• /
• pp.876-884
• /
• 2014

A hardware design of LDPC decoder which is based on the improved normalized min-sum(INMS) decoding algorithm is described in this paper. The designed LDPC decoder supports 19 block lengths(576~2304) and 6 code rates(1/2, 2/3A, 2/3B, 3/4A, 3/4B, 5/6) of IEEE 802.16e mobile WiMAX standard and 3 block lengths(648, 1296, 1944) and 4 code rates(1/2, 2/3, 3/4, 5/6) of IEEE 802.11n WLAN standard. The decoding function unit(DFU) which is a main arithmetic block is implemented using sign-magnitude(SM) arithmetic and INMS decoding algorithm to optimize hardware complexity and decoding performance. The LDPC decoder synthesized using a 0.18-${\mu}m$ CMOS cell library with 100 MHz clock has 284,409 gates and RAM of 62,976 bits, and it is verified by FPGA implementation. The estimated performance depending on code rate and block length is about 82~218 Mbps at 100 MHz@1.8V.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.129-141
• /
• 2005

Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since to answer range sum queries, the direct access to a huge amount of data incurs prohibitive computation cost, materialization techniques based on existing index structures are recently suggested. A simple but effective solution is to apply the materialization technique to the MVR-tree known as the most efficient structure for window queries with spatio-temporal conditions. However, the MVR-tree has a difficulty in maintaining pre-aggregated results inside its internal nodes due to cyclic paths between nodes. Aggregate structures based on other index structures such as the HR-tree and the 3DR-tree do not provide satisfactory query performance. In this paper, we propose a new indexing technique called the Adaptive Partitioned Aggregate R-Tree (APART) and query processing algorithms to efficiently process range sum queries in many situations. Experimental results show that the performance of the APART is typically above 2 times better than existing aggregate structures in a wide range of scenarios.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.383-387
• /
• 2015

Bowel and rectal diseases are on the increase by irregular life and westernized eating habits of modern people, especially rectal cancer, which accounts for 50% of the entire colon cancer. For the initial rectal cancer, because there is no portion projecting on the surface, if not see inside the tissue with ultrasound, you make an errors that misdiagnosis as rectal abscess. However there is a need for more accurate diagnosis, because it is sometimes difficult to distinguish abscess from rectal cancer depending on staging, in spite of the ultrasonic diagnosis. Therefore, this study was performed quantitative analysis by using a computer algorithm for rectal cancer and abscess image. Each of 20 cases about normal, abscess and cancer by setting analysis region ($50{\times}50$ pixels) applies to GLCM algorithm and Autocorrelation, Max probability, Sum average, Sum variance in each image were analyzed by comparing the 4 single parameter. Consequently, The high lesion detection efficiency was presented 100% by the 3 parameter of Autocorrelation, Max probability, Sum variance and the parameter of Sum average presents 95% in cancer, more than 90% in abscess. Those parameters are valuable in distinction standard about normal, cancer and abscess in rectum. It is sufficient availability as a computer assisted diagnosis system depended on clinical using.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2616-2635
• /
• 2013

In this paper, we propose an iterative transceiver design in a multi-relay multi-user multiple-input multiple-output (MIMO) system. The design criterion is to minimize sum mean squared error (SMSE) under relay sum power constraint (RSPC) where only local channel state information (CSI)s are available at relays. Local CSI at a relay is defined as the CSI of the channel between BS and the relay in the $1^{st}$ hop link, and the CSI of the channel between the relay and all users in the $2^{nd}$ hop link. Exploiting BS transmitter structure which is concatenated with block diagonalization (BD) precoder, each relay's precoder can be determined using local CSI at the relay. The proposed scheme is based on sequential iteration of two stages; stage 1 determines BS transmitter and relay precoders jointly with SMSE duality, and stage 2 determines user receivers. We verify that the proposed scheme outperforms simple amplify-and-forward (SAF), minimum mean squared error (MMSE) relay, and an existing good scheme of [13] in terms of both SMSE and sum-rate performances.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.449-458
• /
• 2010

In this paper, we present a distributed resource allocation algorithm for multi-cell uplink systems that increases the weighted sum of the average data rates over the entire network under the average transmit power constraint of each mobile station. For the distributed operation, we arrange each base station (BS) to allocate the resource such that its own utility gets maximized in a noncooperative way. We define the utility such that it incorporates both the weighted sum of the average rates in each cell and the induced interference to other cells, which helps to instigate implicit cooperation among the cells. Since the data rates of different cells are coupled through inter-cell interferences, the resource allocation taken by each BS evolves over iterations. We establish that the resource allocation converges to a unique fixed point under reasonable assumptions. We demonstrate through computer simulations that the proposed algorithm can improve the weighted sum of the average rates substantially without requiring any coordination among the base stations.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.1
• /
• pp.67-74
• /
• 2000

In this paper, a $54{\times}54$-bit multiplier based on a improved conditional sum adder is proposed. To reduce the multiplication time, high compression-rate compressors without Booth's Encoding, and a 108-bit conditional sum adder with separated carry generation block, are developed. Furthermore, a design technique based on pass-transistor logic is utilized for optimize the multiplication time and the power consumption by about 5% compared to that of conventional one. With $0.65{\mu}m$, single-poly, triple-metal CMOS process, its chip size is $6.60{\times}6.69\;mm^2$ and the multiplication time is 135.ns at a 3.3V power supply.

• Korean Journal of Optics and Photonics
• /
• v.13 no.5
• /
• pp.421-424
• /
• 2002

By using SOA (Semiconductor Optical Amplifier) based devices, an all-optical half adder has been successfully demonstrated at 10 Gb/s. All-optical XOR and AND gates are utilized to realize SUM and CARRY. Since SUM and CARRY have been simultaneously realized to form the all-optical half adder, complex calculation and signal processing can be achieved.

• Journal for History of Mathematics
• /
• v.17 no.1
• /
• pp.15-32
• /
• 2004

In this article we survey the sequences and the series in Mooksajipsanbup(默思集算法) which is the seventeenth century mathematics book of Chosun dynasty. First, we classify them into three categories: arithmetics, geometric, and general sequences (series). And then we explore the old methods to find the values of terms and the sum of terms.

• Journal of the military operations research society of Korea
• /
• v.23 no.2
• /
• pp.103-119
• /
• 1997

This paper considers the shortest path problem combined with Min-Min-Sum objective for solving the problem of the military logistics. This paper develops a polynomial-time algorithm for the optimal solution. To analyze the real combat situation, the ability time and distance time of communication line are considered. The complexities of algorithm between previous study and the algorithm developed in this paper is presented. Finally we provide a simple example of application with randomly generated problem.