• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1295-1297
• /
• 1996

CCITT G.721, G.723 standard ADPCM algorithm is implemented by using TI's fixed point DSP start kit (DSK). ADPCM can be implemented on a various rates, such as 16K, 24K, 32K and 40K. The ADPCM is sample based compression technique and its complexity is not so high as the other speech compression techniques such as CELP, VSELP and GSM, etc. ADPCM is widely applicable to most of the low cost speech compression application and they are tapeless answering machine, simultaneous voice and fax modem, digital phone, etc. TMS320C50 DSP is a low cost fixed point DSP chip and C50 DSK system has an AIC (analog interface chip) which operates as a single chip A/D and D/A converter with 14 bit resolution, C50 DSP chip with on-chip memory of 10K and RS232C interface module. ADPCM C code is compiled by TI C50 C-compiler and implemented on the DSK on-chip memory. Speech signal input is converted into 14 bit linear PCM data and encoded into ADPCM data and the data is sent to PC through RS232C. The ADPCM data on PC is received by the DSK through RS232C and then decoded to generate the 14 bit linear PCM data and converted into the speech signal. The DSK system has audio in/out jack and we can input and out the speech signal.

• Journal of Satellite, Information and Communications
• /
• v.6 no.2
• /
• pp.117-124
• /
• 2011

In this paper, we present more effective throughput enhancement technique to improve the data rate and reliability by using the multiple antenna technique. The conventional spatial diversity scheme is limited in according with the interference from each antenna channel status, and the orthogonality of spreading codes and subcarriers are destroyed due to the frequency selectivity. Proposed system is considered MC-CDMA system with 4 transmit antennas and 1 receive antenna. Proposed system based on SVD with the MS-RLS MMSE subcarrier combining method in order to achieve better performance with low computational complexity. Via computer simulation, we confirm that the proposed system is able to improve the BER performance by suppressing the interference of other antenna signals.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.486-489
• /
• 2010

This paper describes a layered LDPC decoder which supports block length of 1,944 bits and code rate 1/2 for IEEE 802.11n WLAN standard. To reduce the hardware complexity, the min-sum algorithm and layered architecture is adopted. A novel memory reduction technique suitable for min-sum algorithm reduces memory size by 75% compared with conventional method. The designed processor has 200,400 gates and 19,400 bits memory, and it is verified by FPGA implementation. The estimated throughput is about 200 Mbps at 120 MHz clock by using Xilinx Virtex-4 FPGA device.

• Korean Journal of Remote Sensing
• /
• v.23 no.1
• /
• pp.7-14
• /
• 2007

Atmospheric correction is one of critical procedures to extract quantitative information related to biophysical variables from hyperspectral imagery. Most atmospheric correction algorithms developed for hyperspectral data have been based upon atmospheric radiative transfer (RT) codes, such as MODTRAN. Because of the difficulty in acquisition of atmospheric data at the time of image capture, the complexity of RT model, and large volume of hyperspectral data, atmospheric correction can be very difficult and time-consuming processing. In this study, we attempted to develop an efficient method for the atmospheric correction of EO-1 Hyperion data. This method uses the pre-calculated look-up-table (LUT) for fast and simple processing. The pre-calculated LUT was generated by successive running of MODTRAN model with several input parameters related to solar and sensor geometry, radiometric specification of sensor, and atmospheric condition. Atmospheric water vapour contents image was generated directly from a few absorption bands of Hyperion data themselves and used one of input parameters. This new atmospheric correction method was tested on the Hyperion data acquired on June 3, 2001 over Seoul area. Reflectance spectra of several known targets corresponded with the typical pattern of spectral reflectance on the atmospherically corrected Hyperion image, although further improvement to reduce sensor noise is necessary.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.135-142
• /
• 2002

In this paper, we proposed the new structure of the Rake Finger using Walsh Switch, the shared accumulator and the pipeline FWHT algorithm for reducing the signal processing complexity resulting from the increase of the number of data correlators. The number of computational operation in the proposed data correlators is 160 additions when the number of walsh code channels is 4. As a result, it is reduced about 3.2 times other than the number of computational operation of the conventional ones. Also, the result shows that the data processing time of the proposed Rake Finger architecture is 90,496〔ns〕 and the conventional ones is 110,696〔ns〕. It is 18.3% faster than the data processing time of the conventional Rake Finger architecture.

• Nuclear Engineering and Technology
• /
• v.53 no.6
• /
• pp.1979-1990
• /
• 2021

Evacuation Time Estimate (ETE) can provide decision-makers with a likelihood to implement evacuation of a population with radiation exposure risk by a nuclear power plant. Thus, the ETE is essential for developing an emergency response preparedness. However, studies on ETE have not been conducted adequately in Korea to date. In this study, different cohorts were selected based on assumptions. Existing local data were collected to construct a multi-model network by TSIS-CORSIM code. Furthermore, several links were aggregated to make simple calculations, and post-processing was conducted for dealing with the stochastic property of TSIS-CORSIM. The average speed of each cohort was calculated by the link aggregation and post-processing, and the evacuation time was estimated. As a result, the average cohort-based evacuation time was estimated as 2.4-6.8 h, and the average clearance time from ten simulations in 26 km was calculated as 27.3 h. Through this study, uncertainty factors to ETE results, such as classifying cohorts, degree of model complexity, traffic volume outside of the network, were identified. Various studies related to these factors will be needed to improve ETE's methodology and obtain the reliability of ETE results.

• ETRI Journal
• /
• v.43 no.4
• /
• pp.640-649
• /
• 2021

In this paper, an additional degree of freedom in phased multi-input multi-output (phased-MIMO) radar with any arbitrary desired covariance matrix is proposed using space-time codes. By using the proposed method, any desired transmit covariance matrix in MIMO radar (phased-MIMO radars) can be realized by employing fully correlated base waveforms such as phased-array radars and simply extending them to different time slots with predesigned phases and amplitudes. In the proposed method, the transmit covariance matrix depends on the base waveform and space-time codes. For simplicity, a base waveform can be selected arbitrarily (ie, all base waveforms can be fully correlated, similar to phased-array radars). Therefore, any desired covariance matrix can be achieved by using a very simple phased-array structure and space-time code in the transmitter. The main advantage of the proposed scheme is that it does not require diverse uncorrelated waveforms. This considerably reduces transmitter hardware and software complexity and cost. One the receiver side, multiple signals can be analyzed jointly in the time and space domains to improve the signal-to-interference-plus-noise ratio.

• Korea Trade Review
• /
• v.44 no.2
• /
• pp.143-157
• /
• 2019

The purpose of this study is to review domestic and foreign origin labeling system in order to implement origin labeling system in the perspective of protecting the interests of consumers, and to suggest governmental improvements by analyzing problems embedded in current labeling system. The results analysis show complexity of related legal system, lack of expertise at the stage of labeling, and inefficiency of crackdown authority. The improvement could be suggested in two ways: supporting plans for the ones who have duty of labeling and improvement plans in origin management system. As supporting plans, we suggest the need for an automatic origin determination system, appropriate education on origin stakeholders, and introduction of origin certification system. For improvement plans, there are unification of country of origin labeling related laws, utilization of FTA product specific rules, and QR code, expert confirmation system. Since the origin labeling issue has become important, proactive and quick responses must follow with thorough examination the effect of the origin labeling on consumer welfare.

• The Journal of the Convergence on Culture Technology
• /
• v.7 no.3
• /
• pp.565-570
• /
• 2021

A soft-decision decoding scheme of a channel code for correcting an error occurring in a receiver of a digital communication systems is proposed. A method for efficiently decoding by use of the linear and arithmetic structure of linear block codes is presented. In this way, the probability of decoding errors has been reduced. In addition, it is possible to reduce the complexity of decoding as well. Sufficient conditions for achieving optimal decoding has been derived. As a result, the sufficient conditions enable efficient search for candidate codewords. With the proposed decoding scheme, we can effectively perform the decoding while lowering the block error probability.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.197-204
• /
• 2022

Sorting is an important data structure in many applications in the real world. Several sorting algorithms are currently in use for searching and other operations. Sorting algorithms rearrange the elements of an array or list based on the elements' comparison operators. The comparison operator is used in the accurate data structure to establish the new order of elements. This report analyzes and compares the time complexity and running time theoretically and experimentally of insertion, merge, and heap sort algorithms. Java language is used by the NetBeans tool to implement the code of the algorithms. The results show that when dealing with sorted elements, insertion sort has a faster running time than merge and heap algorithms. When it comes to dealing with a large number of elements, it is better to use the merge sort. For the number of comparisons for each algorithm, the insertion sort has the highest number of comparisons.