• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5080-5097
• /
• 2017

Channel characteristics-based secret key generation is an effective physical-layer security method. The issues of how to remove the effect of random noise and to balance the key generation rate (KGR) and the bit mismatch rate (BMR) are needed to be addressed. In this paper, to reduce the effect of random noise and extract more secret bits, a new quantization scheme with high key generation rate and low bit mismatch rate is proposed. In our proposed scheme, we try to use all measurements and correct the differences caused by noise at the boundary regions instead of simply dropping them. We evaluate and discuss the improvements of our proposed scheme. The results show that our proposed scheme achieves lower bit mismatch rate as well as remaining high key generation rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.461-474
• /
• 2009

The cognitive radio (CR) technique is a useful tool for improving spectrum utilization by detecting and using the vacant spectrum bands in which cooperative spectrum sensing is a key element, while avoiding interfering with the primary user. In this paper, we propose a novel cluster-based cooperative spectrum sensing scheme in cognitive radio with two solutions for the purpose of improving in sensing performance. First, for the cluster header, we use the double adaptive energy thresholds and a multi-bit quantization with different quantization interval for improving the cluster performance. Second, in the common receiver, the weighed HALF-voting rule will be applied to achieve a better combination of all cluster decisions into a global decision.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1219-1222
• /
• 2006

3GPP에서는 단대단 QoS 보장을 위해 정책 기반 망 관리(PBNM:Policy-based Network Management) 방식을 적용할 것을 권고하고 있다. 본 논문에서는 3GPP에서 제시하는 핵심망 구조에 정책 기반 망 관리 기법 중 DiffServ를 적용해서 현재 DSCP(Differentiated Service Code Point)는 8bit 구성되어 있으나 그 중 6bit만 사용되고 있고, 사용하지 않는 이 2bit를 사용하여 DF(Default Forwarding), EF(Expedited Forwarding), AF(Assured Forwarding)의 DSCP에 Service Class Code Point를 부여해서 DiffServ를 서비스하는 망에서 동일한 Diffserv 정책을 설정해서 효율적인 QoS 기법을 제안하고자 한다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.30-39
• /
• 1994

A 1-chip high quality binarizing VLSI image processor (which has 8 bit ADC. 6 bit flash ADC, 15K standard cell, and 1K word ROM) based on 10 MIPS 16 bit DSP is implemented for FAX. This image processor(IP) performs image pre-processing. image quality improvement in copying and sending mode, and mixed image processing based on the fuzzy theory. And smoothing in sub-scan direction is applied for normal receiving mode data so the received data is enhanced like fine mode data. Each algorithm is processed with the same type of image processing window and 2-D image processing is implemented with a 1-D line buffer. The fabricated chip is applied to a FAX machine and image quality improvement is verified.

• Journal of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.879-897
• /
• 2013

Shannon entropy is one of the widely used randomness measures especially for cryptographic applications. However, the conventional entropy tests are less sensitive to the inter-bit dependency in random samples. In this paper, we propose new online randomness test schemes for true random number generators (TRNGs) based on the mutual information between consecutive ${\kappa}$-bit output blocks for testing of inter-bit dependency in random samples. By estimating the block entropies of distinct lengths at the same time, it is possible to measure the mutual information, which is closely related to the amount of the statistical dependency between two consecutive data blocks. In addition, we propose a new estimation method for entropies, which accumulates intermediate values of the number of frequencies. The proposed method can estimate entropy with less samples than Maurer-Coron type entropy test can. By numerical simulations, it is shown that the new proposed scheme can be used as a reliable online entropy estimator for TRNGs used by cryptographic modules.

• Speech Sciences
• /
• v.11 no.2
• /
• pp.259-269
• /
• 2004

In this paper, we propose a new excitation enhancement technique to improve the speech quality of low bit-rate code-excited linear prediction (CELP) coders. The proposed technique is based on a harmonic model and it is employed only in the decoding process of speech coders without any additional bits. We develop the procedure of harmonic model parameter estimation and harmonic generation, and apply this technique to a current state-of-the-art low bit rate speech coder, ITU-T G.729 Annex D. Also, its performance is measured by using the ITU-T P.862 PESQ score and compared to those of the phase dispersion filter and the long-term postfilter applied to the decoded excitation. It is shown that the proposed excitation enhancement technique can improve the quality of decoded speech and provide better quality for male speech than other techniques.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.6
• /
• pp.29-32
• /
• 1983

The paper reports the development of a main memory system with ECC capability based on IEEE 796 bus for a 16 bit microcomputer the development of which was one of the last year's National proj tracts. The top-down approach of the design and the bottom-up approach of the testing resulted in a memory board which demonstrates a better performance and a less expensive cost than those available in the U.S. market.

• ETRI Journal
• /
• v.26 no.1
• /
• pp.48-52
• /
• 2004

In this letter, we consider a new packet scheduling algorithm for an orthogonal frequency division multiplexing access/frequency division duplex (OFDMA/FDD)-based system, e.g., mobile broadband wireless access or high-speed portable internet systems, in which the radio resources of both time and frequency slots are dynamically shared by all users under a proper scheduling policy. Our design objective is to increase the number of non-realtime service (e.g., WWW) users that can be supported in the system, especially when the minimum bit rate requirement is imposed on them. The simulation results show that our proposed algorithm can provide a significant improvement in the average outage probability performance for the NRT service, i.e., significantly increasing the number of NRT users without much compromising of the cell throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1133-1143
• /
• 2005

In this paper, we propose an enhanced two-step search scheme for rapid and reliable signal acquisition in UWB systems under multipath channels. The proposed TSS-LS (Two-Step Search scheme with the Linear search based Second step) achieves rapid acquisition performance comparable to the conventional TSS-BS (Two-Step Search scheme with the Bit reversal search based Second step) already proposed by the authors, based on the single-dwell search with two-step thresholds and search windows. However, unlike the TSS-BS which employs the bit reversal search in the second step, the proposed TSS-LS utilizes the linear search in the second step to improve the reliability of signal acquisition. Simulation results with multipath channel models by IEEE 802.15.3a show that the two-step search schemes for the UWB signal acquisition can achieve sig nificant reduction of the required mean acquisition time as compared to general search schemes. In addition, we observe that the proposed TSS-LS achieves quite good bit error rate performance for large signal-to-noise ratios, which is favorably comparable to the case of ideal perfect timing.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1321-1327
• /
• 2019

This paper describes an efficient hardware implementation of modular square root (MSQR) computation over GF(p), which is the operation needed to map plaintext messages to points on elliptic curves for elliptic curve (EC)-ElGamal public-key encryption. Our method supports five sizes of elliptic curves over GF(p) defined by the National Institute of Standards and Technology (NIST) standard. For the Koblitz curves and the pseudorandom curves with 192-bit, 256-bit, 384-bit and 521-bit, the Euler's Criterion based on the characteristic of the modulo values was applied. For the elliptic curves with 224-bit, the Tonelli-Shanks algorithm was simplified and applied to compute MSQR. The proposed method was implemented using the finite field arithmetic circuit with 32-bit datapath and memory block of elliptic curve cryptography (ECC) processor, and its hardware operation was verified by implementing it on the Virtex-5 field programmable gate array (FPGA) device. When the implemented circuit operates with a 50 MHz clock, the computation of MSQR takes about 18 ms for 224-bit pseudorandom curves and about 4 ms for 256-bit Koblitz curves.