• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.11
• /
• pp.293-296
• /
• 1996

In this paper, we studied two image characteristics, similarity and smoothness, which give rise to local and global redundancy in image representation. The similarty means that any patterns in the image repeat itself anywhere in the rest of image. The smoothness means that the gray level values within a given block vary gradually rather than abruptly. In this sense, we propose a lossless medical image compression scheme which exploits both types of redundancy. This method segments the image into variable size blocks and encodes them depending on characteristics of the block. The proposed compression schemes works better than other compression schemes such as the huffman, the arithmetic, the Lempel-Ziv and the lossless scheme of JPEG.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.662-668
• /
• 2013

Mobile communication systems have been adopting link adaptive transmission schemes such as adaptive modulation and coding (AMC) and hybrid-ARQ (HARQ). Incremental redundancy (IR) HARQ scheme is known to be highly efficient in terms of throughput and power consumption and can be a good solution for mobile communication systems. In this paper, we propose an IR-HARQ scheme based on dual-diagonal parity-type block LDPC codes in which we define a transmission priority of coded bits and propose the sub-packet construction rule. We present the throughput performance of IR-HARQ with various modulation and coding and multi-antenna modes. Consequently, the proposed scheme provides the improvement of system throughput by elaborate link adaptation with CQI information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2828-2835
• /
• 2015

In this paper, we analyse the effect of redundancy types and non-stop forwarding scheme on network service availability. We use stochastic reward net models as enabling modeling approach for the analytical evaluation. We first design stochastic reward nets for redundancy models with or without non-stop forwarding and then evaluate their availability using Stochastic Petri Net Package.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.426-433
• /
• 2006

In this paper, we propose an incremental redundancy(IR)-hybrid ARQ(HARQ) scheme which uses double binary turbo codes for error correction. We also propose a methodology for basic analysis of the throughput which is a performance index of HARQ. The proposed double binary turbo IR-HARQ scheme provides higher throughput than binary IR-HARQ, which uses binary turbo codes for error correction, at all $E_s/N_0$. An extra coding gain is also attained by using the proposed HARQ scheme over the coding gain achieved by turbo codes only.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.199-201
• /
• 2003

Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 network 형태을 구성하여 통신이 이루어지게 하는 network으로 ad hoc network 환경에 맞는 다양한 라우팅 프로토콜들이 개발되었고 크게는 table­driven, on­demand 방식으로 나눌 수 있는데 on­demand 방식의 AODV 프로토콜은 routing overhead가 적다는 장점이 있는 반면 single path로 data forwarding을 진행하여 중간노드의 이동에 의한 path가 broken되는 경우 local routing을 하거나 새로이 source­initialed route rediscovery을 수행하여 전송 delay 및 control traffic overhead 등을 높이는 결과를 발생 시켰다. 본 논문은 single path로 구성되는 AODV 프로토콜의 route failures시 문제점을 보완한 Associativity Based Redundancy path Routing(ABRR) 및 Alternate Redundancy path Routing(ARR) schemes을 제안한다. 첫째, ABRR은 main path상에 있는 각 노드들은 associativity based stable node 정보를 이용하여 path broken 이전에 local redundancy path을 구성하여 path broken시 local routing없이 route을 복구할 수 있게 하고 둘째, ARR은 source­initialed route discovery에 의해 alternate path을 구성하여 ABRR 그리고 local routing에 의해 main route recovery 실패 시 alternate path을 main path로 전환하여 control traffic overhead 및 전송 delay을 줄이게 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.800-818
• /
• 2013

Supporting video streaming over multi-hop wireless networks is particularly challenging due to the time-varying and error-prone characteristics of the wireless channel. In this paper, we propose a joint optimization scheme for video streaming over multi-hop wireless networks. Our coding scheme, called Joint Source/Network Coding (JSNC), combines source coding and network coding to maximize the video quality under the limited wireless resources and coding constraints. JSNC segments the streaming data into generations at the source node and exploits the intra-session coding on both the source and the intermediate nodes. The size of the generation and the level of redundancy influence the streaming performance significantly and need to be determined carefully. We formulate the problem as an optimization problem with the objective of minimizing the end-to-end distortion by jointly considering the generation size and the coding redundancy. The simulation results demonstrate that, with the appropriate generation size and coding redundancy, the JSNC scheme can achieve an optimal performance for video streaming over multi-hop wireless networks.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.12
• /
• pp.1022-1032
• /
• 2002

A multibit DRAM BIST methodology reducing redundancy programming overhead has been proposed. It is capable of counting and locating faulty bits simultaneously with the test. If DRAM cells are composed of n blocks generally, the proposed BIST can detect the state of no error, the location of faulty bit block if there is one error and the existence of errors in more than two blocks, which are n + 2 states totally, with only n comparators and an 3 state encoder. Based on the proposed BIST methodology, the testing scheme which can detect the number and locations of faulty bits with the errors in two or more blocks, can be easily implemented. Based on performance evaluation, the test and redundancy programming time of 64MEG DRAM with 8 blocks is reduced by 1/750 times with 0.115% circuit overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.9-19
• /
• 2004

WLAN (Wireless Local Area Networks) needs error recovery and flow control schemes to support reliable multicast protocol. Limited wireless bandwidth, as well as queuing losses caused by the asymmetric wired/wireless interactions, demands more effective approaches for reducing packet losses. Moreover, since the wireless channel is a shared broadcast medium, if sender receives feedback information simultaneously from several receivers, the feedback delays data frame transmission of forward direction by introducing channel congestion and burden at the sender. Therefore, it is important to minimize the amount of feedback information from receivers. In this paper, we propose an ARS(Adaptive Redundancy Scheme) that combines FEC(Forward Error Correction) using channel state estimation and ARQ(Automatic Repeat Request) both to reduce the amount of feedback information and the number of retransmissions and to guarantee high data reliability in a WLAN multicast environment. Performance of the proposed scheme is evaluated by means of analysis and simulations in AWGN and Rayleigh fading channels. The results show that the proposed scheme reduces the amount of feedback information and the number of retransmissions and guarantees high data reliability, while keeping throughput efficiency similarly with the conventional FEC and ARQ scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5058-5077
• /
• 2019

Traditional regenerating codes are designed to tolerate node failures with optimal bandwidth overhead. However, there are many types of partial failures inside the node, such as latent sector failures. Recently, proposed regenerating codes can also repair intra-node failures with node-level redundancy but incur significant bandwidth and I/O overhead. In this paper, we construct a new scheme of regenerating codes, called IR-RBT codes, which employs intra-node redundancy to tolerate intra-node failures and serve as the help data for other nodes during the repair operation. We propose 2 algorithms for assigning the intra-node redundancy and RBT-Helpers according to the failure probability of each node, which can flexibly adjust the helping relationship between nodes to address changes in the actual situation. We demonstrate that the IR-RBT codes improve the bandwidth and I/O efficiency during intra-node failure repair over traditional regenerating codes but sacrifice the storage efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.753-758
• /
• 2011

According to the needs for equipment performance, reliability, and performance for impending time to guarantee its viability, various redundancy techniques have been used in many military systems. Typically, one of redundancy schemes to increase the viability of the system is to configure a network between two processes. However, when some failure or loss in a physical network occur, redundancy schemes may not operate well. In this paper, we present a protocol scheme of VMEbus master and slave of a shared memory region, interrupts, and a dedicated task communication. Specifically, we confirm the validity of the presented scheme through the direct implementation of the protocol and some experimental results.