• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.5
• /
• pp.413-425
• /
• 1990

In this study, we propose a separated type concentrator to accommodate 2B+D ISDN basic access traffic. This system's blocking probabilities are analyzed in terms of each class of bit rate, number of output channels, number of subscriber lines, and offered traffic. The result shows that the proposed method can significantly increase the maximum number of subscriber lines connecting to the system via a T1 crrier, compared with that of the "CCITT proposed" multiplexing scheme.ng scheme.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.55-58
• /
• 2003

3차원 메쉬 영상의 압축 알고리듬들은 예측 부호화 및 엔트로피(entropy) 부호화를 기본 기법으로 이용하므로, 압축된 비트열(bitstream)의 네트워크 전송에서 전송 오류에 매우 민감한 단점을 지닌다. 따라서 본 논문에서는 전송 오류에 강인하고 점진적 부호기를 기본으로 하는 3차원 메쉬 영상의 오류은닉 알고리듬을 제안한다. 전송 오류에 강인한 알고리듬을 개발하기 위해, 3차원 원본 메쉬 영상을 여러 파티션(partition)으로 분할하고, 각각의 파티션을 독립적으로 점진 부호화한다. 복호기에서는 오류가 발생하지 않은 주변 표면 정보를 이용하는 오류 은닉 알고리듬을 오류에 의해 손상 받은 파티션 표면에 적용하여 손상된 파티션의 시각적 손상 정도를 감쇄시킨다. 전산 모의 실험을 통해, 제안하는 알고리듬의 오류에 대한 강인성 및 오류 발생시 손상된 파티션 표면이 제안하는 오류 은닉 알고리듬을 통해 화질이 개선됨을 확인하였다.

• Annual Conference of KIPS
• /
• 2023.11a
• /
• pp.491-492
• /
• 2023

클릭률(CTR) 예측은 많은 실제 응용 프로그램에서 가장 기본적인 작업 중 하나가 되었으며 이 분야에서 많은 고급 모델이 나았다. 그러나 가장 고전적인 CF(Collaborative Filtering) 모델에서 딥러닝 모델로 발전하는 과정에서 특징 교차의 기본 단위가 요소(비트 단위)가 아닌 특징(벡터 단위)이라는 사실을 기억하는 모델은 거의 없다. 이 논문에서는 Masknet 모델에 벡터 단위 교차를 적용하는 클릭률 예측 모델은 제안한다.Movielens 에 대해 예측 결과는 89.24%로 나타나고 원본 모델보다 효과가 더 좋다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.8-15
• /
• 2009

Side-channel attacks including the differential power analysis attack are often more powerful than classical cryptanalysis and have to be seriously considered by cryptographic algorithm's implementers. Various countermeasures have been proposed against such attacks. In this paper, we deal with the masking method, which is known to be a very effective countermeasure against the differential power analysis attack and propose new gate-level conversion methods between Boolean and arithmetic masks. The new methods require only 6n-5 XOR and 2n-2 AND gates with 3n-2 gate delay for converting n-bit masks. The basic idea of the proposed methods is that the carry and the sum bits in the ripple adder are manipulated in a way that the adversary cannot detect the relation between these bits and the original raw data. Since the proposed methods use only bitwise operations, they are especially useful for DPA-securely implementing cryptographic algorithms in hardware which use both Boolean and arithmetic operations. For example, we applied them to securely implement the block encryption algorithm SEED in hardware and present its detailed implementation result.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.4
• /
• pp.81-93
• /
• 2000

In a methodological approach to improve the processing performance of modulo exponentiation which is the primary arithmetic in RSA crypto algorithm, we present a new RSA hardware architecture based on high-radix modulo multiplication and CRT(Chinese Remainder Theorem). By implementing the modulo multiplier using radix-16 arithmetic, we reduced the number of PE(Processing Element)s by quarter comparing to the binary arithmetic scheme. This leads to having the number of clock cycles and the delay of pipelining flip-flops be reduced by quarter respectively. Because the receiver knows p and q, factors of N, it is possible to apply the CRT to the decryption process. To use CRT, we made two s/2-bit multipliers operating in parallel at decryption, which accomplished 4 times faster performance than when not using the CRT. In encryption phase, the two s/2-bit multipliers can be connected to make a s-bit linear multiplier for the s-bit arithmetic operation. We limited the encryption exponent size up to 17-bit to maintain high speed, We implemented a linear array modulo multiplier by projecting horizontally the DG of Montgomery algorithm. The H/W proposed here performs encryption with 15Mbps bit-rate and decryption with 1.22Mbps, when estimated with reference to Samsung 0.5um CMOS Standard Cell Library, which is the fastest among the publications at present.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.1063-1075
• /
• 2000

This paper proposes an adaptive error concealment technique for compressed video. Since redundancy is extracted out during compression process, compressed video is vulnerable to errors which occur during transmission of video over error prone networks such as wireless channels and Internet. Error concealment is a process of reconstructing video out of damaged video bit stream. We proved that scalable encoding is very useful for error concealment. Analysis of experiments shows that some part of image is better concealed by using base layer information and other part of image is better concealed by using previous frame information. We developed a technique which enables to decide which methodology is more effective, adaptively, based on motion vectors and regional spatial activity. We used H.263v2 for scalable encoding, but, our approach could be applied to all DCT based video codec.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.467-474
• /
• 2007

MB-OFDM (Multiband-orthogonal frequency division multiplexing) UWB (ultra wide band) system uses DCM (dual carrier modulation) scheme to achieve high-data rate transmission. The basic idea of DCM is that to transmit the 4 bits more reliably two 16-QAM (quadrature amplitude modulation) symbols are used and the two 16-QAM sysmbols are allocated to each subcarrier of OFDM with maximum-distance. In the case of using the DCM, if one 16-QAM symbol is broken by deep fadding channel, a receiver can detect the transmitted signal by using another 16-QAM symbol. In the conventional ML(maximum likelihood) decision scheme, since the receiver does not use the CSI (channel state information), loss in diversity can not be reduced. In this paper, we propose improved soft-decision scheme with CSI for higher performance of MB-OFDM UWB systemn.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2798-2805
• /
• 1997

The paper studies the Quality of Service(QoS) concept in Broadband Integrated Services Digital Network (B-ISDN). Guaranteeing the QoS requirements indistributed multimedia systems and networks is fundamentally an end-to-end issus, that is, from application to application. An important issue in the QoS translation between the application-level QoS and network-level QoS is that the translation depends not only on the translation between system resources and network resources, but also on the translation between thelayered protocol and the access procedures. In this paepr, we propose a methodology for translating the AAL(ATM Adaptation Layer) QoS parameters into the ATM layer QoS parameters in end-systems. The QoS parameters in the ATM layer and AAL are defined, and we concentrate on the translation from the AAL to the ATM layer, because the AAL must be designed to be service dependent and specific. As an example, we concentrate on the constant bit rate(CBR) guaranteed real-time service using AAL1 protocol.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1141-1144
• /
• 2005

일반 컴퓨터에서 중앙처리장치와 메모리 사이의 병목 현상인 "Von Neumann Bottleneck"을 보이는데 본 논문에서는 이러한 문제점을 해소하고 검색위주의 응용분야에서 우수한 성능을 보이는 확장 가능한 범용 Associative Processor(AP) 구조를 제안하였다. 본 연구에서는 Associative computing을 효율적으로 수행할 수 있는 명령어 세트를 제안하였으며 다양하고 대용량 응용분야에도 적용할 수 있도록 구조를 확장 가능하게 설계함으로써 유연한 구조를 갖는다. 12 가지의 명령어가 정의되었으며 프로그램이 효율적으로 수행될 수 있도록 명령어 셋을 구성하고 연속된 명령어를 하나의 명령어로 구현함으로써 처리시간을 단축하였다. 제안된 프로세서는 bit-serial, word-parallel로 동작하며 대용량 병렬 SIMD 구조를 갖는 32 비트 범용 병렬 프로세서로 동작한다. 포괄적인 검증을 위하여 명령어 단위의 검증 뿐 아니라 최대/최소 검색, 이상/이하 검색, 병렬 덧셈 등의 기본적인 병렬 알고리즘을 검증하였으며 알고리즘은 처리 데이터의 개수와는 무관한 상수의 복잡도 O(k)를 갖으며 데이터의 비트 수만큼의 이터레이션을 갖는다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.9-17
• /
• 2012

Because best-effort Internet provides no guarantees on packet delay and loss, transient network congestion may cause negative effects on H.264/SVC streaming. Thus, the congestion control is required to adjust bit rate by dropping enhancement layers of H.264/SVC streams. This paper differentiates the video streams according to different levels of importance and proposes weighted-based congestion control algorithms to use the rate-distortion characteristics of streams. To maximize the weighted sum of PSNR values of all streams on a bandwidth-constrained node, this paper proposes WNS(Weighted Near-Sighted) and WFS(Weighted Far-Sighted) algorithms to control the number of enhancement layers of streams. Through simulation, this paper shows that weighted-based congestion control algorithm can efficiently adapt streams to network conditions and analyzes the characteristics of congestion control algorithms.