• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.311-316
• /
• 2006

We propose the optical sensor network using optical CDMA with bipolar receiver and modified Pseudorandom Noise codes which are widely used in the wireless communication network. We numerically analyze the performances in the optical sensor network. In the proposed network, multiple access interferences between two sensors are suppressed by performing synchronization between the optical encoder and the optical decoder and adjusting the delay times of optical delay lines. Numerical simulations confirm that the performance can be acquired by suppressing the beat noise among optical signals as the number of sensors increases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1616-1623
• /
• 1999

This paper describes error resilient coding scheme is added in WLL system and its application for robust low-bit rate still image transmission over power controlled W-CDA system Rayleigh fading channels. The baseline JPEG compressing methods are uses in image coding over wireless channel. The channel uses Reed-Solomon(RS) outer codes concatenated with convolutional inner codes, and truncated type I hybrid ARQ protocol based on the selective repeat strategy and the RS error detection capability. Simulation results are proved for the statistics of the frame-error bursts of the proposed system in comparison with conventional WLL system. it gains the 2 dB of the Eb/No in same BER.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.71-76
• /
• 2023

Recently, a memory management strategy that utilizes read and write references separately is attracting attention. This is due to the emergence of new storage media with asymmetric read/write latencies and different read/write access characteristics of software. Existing research assumes that operating systems can differentiate between read/write references that occur on each memory page, but most memory architectures do not support a way to distinguish them. Unlike previous studies, this paper proposes a software method that reflects the read/write characteristics of page references by utilizing the reference and modified bits of each page. Simulations show that the proposed policy has almost similar effects to existing studies with hardware support.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.423-431
• /
• 2010

In this paper, a modified sum-product algorithm to correct bit errors captured within the trapping sets, which are produced in decoding of low-density parity-check (LDPC) codes, is proposed. Unlike the original sum-product algorithm, the proposed decoding method consists of two stages. Whether the main cause of decoding failure is the trapping sets or not is determined at the first stage. And the bit errors within the trapping sets are corrected at the second stage. In the modified algorithm, the set of failed check nodes and the transition patterns of hard-decision bits are exploited to search variable nodes in the trapping sets. After inverting information of the variable nodes, the sum-product algorithm is carried out to correct the bit errors. As a result of simulation, the proposed algorithm shows continuously improved error performance with increase in the signal-to-noise ratio. It is, therefore, considered that the modified sum-product algorithm significantly reduces or possibly eliminates the error floor in LDPC codes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.3
• /
• pp.513-525
• /
• 2022

The immutability of blockchain is core elements of security of blockchain and guarantee data integrity. However, the characteristic that the data recoreded once in the blockchain cannot be modified has place for abuse by a specific user. In fact improper contents that is inappropriate to be recorded on the blockchain, such as harmful data and user personal data, is exposed on Bitcoin. As a way to manage improper content existing in the blockchain, there is a redactable blockchain using chameleon hash proposed for the first time by Ateniese. The redactable blockchain meet the right to be forgotten of GDPR by allowing data modification and deletion. Recently, Research on personal data management is being conducted in a redactable blockchain. Research by Jia et al. proposed a model that enables users to manage their personal data in the redactable blockchain. However, semi trusted regulators, which are blockchain participation nodes, have powerful authority in the blockchain, such as modification rights and deprivation of transaction rights for all blocks, which may cause side effects. In this paper, to weaken the authority of regulators in Y. Jia et al., we propose a method of authority subject altering and authority sharing, and propose a redactable blockchain-based authority change and access control system model based on applicable scenarios.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.39-50
• /
• 2010

In this paper, we analyze and simulate the performance of a tactics mobile communication system based on ultra wide band (UWB) in multi-user interference (MUI) environments. This system adopts a double binary turbo code for forward error correction (FEC). Wireless channel is modeled a modified Saleh and Valenzuela (SV) model. We employ a space time block coding (STBC) scheme for enhancing system performance. System performance is evaluated in terms of bit error probability. From the simulation results, it is confirmed that the tactics mobile communication system based on UWB, which is encoded with the double binary turbo code, can achieve a remarkable coding gain with reasonable encoding and decoding complexity in multi-user interference environments. It is also known that the bit error probability performance of the tactics mobile communication system based on UWB can be substantially improved by increasing the number of iterations in the decoding process for a fixed cod rate. Besides, we can demonstrate that the double binary turbo coding scheme is very effective for increasing the number of simultaneous users for a given bit error probability requirement.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.20-28
• /
• 2014

This paper proposes a faulty node detection scheme that performs collective monitoring of a distributed networked control systems using interval weighting factor. The algorithm is designed to observe every node's behavior collectively based on the pseudo-random Bose-Chaudhuri-Hocquenghem (BCH) code. Each node sends a single BCH bit simultaneously as a replacement for the cyclic redundancy check (CRC) code. The fault judgement is performed by performing sequential check of observed detected error to guarantee detection accuracy. This scheme can be used for detecting and preventing serious damage caused by node failure. Simulation results show that the fault judgement based on decision pattern gives comprehensive summary of suspected faulty node.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1445-1454
• /
• 2006

To compress a specific part of an image with high quality or to transfer it, JPEG2000 standard offers an ROI(Region-of-Interest) image coding method. What is important in ROI coding is to process relative importance between ROI and background and to process ROI mask. We propose an adaptive ROI coding method supplemented the existing Implicit ROI coding and Modified implicit ROI coding to improve image quality and reduce ROI mask information. The proposed method is an EBCOT-based ROI coding that extracts ROI from the compressed bitstream, and gets the ROI mask information by classifying the codeblocks into 6 patterns. The information includes the pattern type(3bit) and the width(5bit) expressing the boundary between two regions for each codeblock. As a result, the method shows an excellent compression performance in ROI region as well as in the whole region of an image.

• Journal of Broadcast Engineering
• /
• v.22 no.5
• /
• pp.618-631
• /
• 2017

In this paper, we propose a modification of fuzzy logic based DASH adaptation algorithm(FDASH) for seamless media service in time-varying network conditions. The proposed algorithm selects more appropriate bit-rate for the next segment by the modification of the Fuzzy Logic Controller(FLC) and reduces the number of video bit-rate changes by applying Segment Bit-rate Filtering Module(SBFM). Also, we apply the Start Mechanism for clients not to watch the low quality videos in the very beginning stage of streaming service and add the Sleeping Mechanism to avoid any buffer overflow expected. Ultimately, we verified by using NS-3 Network Simulator that the proposed method shows better performance compared to FDASH. According to the experimental results, there is no buffer underflow/overflow within the limited buffer size, which is not guaranteed in FDASH on the other hand. Also, we confirmed that mFDASH has almost the same level of average video quality against FDASH and reduces about 50% of number of video bit-rate changes compared to FDASH in Point-to-Point network and Wi-Fi network.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.269-277
• /
• 2007

Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.