• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.73-76
• /
• 2000

In the basic continuous ARQ schemes (Go-Back-N or Selective Repeat ARQ), each block is continuously transmitted without interruptions. Only when the transmitter receives NAK from the receiver side, the transmitter stops sending current data block and retransmit the erroneous block (Naked block). When channel error rate increases and become sufficiently high, there exists a point at which each block of message is transmitted, on average, more than once. Under such conditions, it will be more efficient to send continuously two or more copies(generally $\ell$ copies) of each block from the first transmission over noisy channel. A request for repeat will be made again only when none of $\ell$ duplicates are received correctly. By this way, the proposed scheme yields a better throughput efficiency and holds nearly constant throughput as compared to others continuous A.R.Q schemes under wide error rate variations (0 < P < 0.3).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9A
• /
• pp.867-873
• /
• 2008

Cyclic delay diversity (CDD) is considered as a simple approach to exploit the frequency diversity in OFDM system. In this paper, we apply CDD to the conventional STBC/SFBC/STFBC-OFDM transmit diversity schemes for Rayleigh fading channels. We compare the performances of STBC/SFBC/STFBC with and without CDD schemes. Simulation results show that the combination of block coding with CDD works well when using the ITU-R M. 1225 channel for both Pedestrian A (Ped A) channel with the mobility of 3 km/h, and Vehicular A (Veh A) channel with the mobility of 120km/h. For a BER of $10^{-3}$, compared to the conventional block coding schemes, a gain of 2dB, 4dB, and 5dB is obtained under the Ped A channel environment by STBC-OFDM, SFBC-OFDM and STFBC-OFDM with CDD, respectively Under the Veh A channel. gains by the combined schemes are 6dB, 2dB, and 4dB, respectivcly.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.3
• /
• pp.21-28
• /
• 2016

Compressed sensing is a signal processing technique for efficiently acquiring and reconstructing in an under-sampled (i.e., under Nyquist rate) representation. Specially, a block compressed sensing with Smoothed Projected Landweber (BCS-SPL) framework is one of the most widely used schemes. Currently, a variety of BCS-SPL schemes have been actively studied. However, when restoring, block sizes have effects on the reconstructed visual qualities, and in this paper, both a basic scheme of BCS-SPL and several modified schemes of BCS-SPL with structured measurement matrix are analyzed for the effects of the block sizes on the performances of reconstructed image qualities. Through several experiments, it is shown that a basic scheme of BCS-SPL provides superior performance in block size 4.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.1-8
• /
• 2008

This paper introduces three efficient frame selection schemes to reduce the computation complexity for the multi-reference and variable block size Motion Estimation (ME). The proposed RSP (Reference Selection Pass) scheme can minimize the overhead of frame selection. The MFS (Modified Frame Selection) scheme can reduce the number of search points about 18% compared with existing schemes considering the motion of image during the reference frame selection process. In addition, the TPRFS (Two Pass Reference frame Selection) scheme can minimize the frame selection operation for the variable block size ME in H.264/AVC using the character of selected reference frame according to the block size. The simulation results show the proposed schemes can save up to 50% of the ME computation without degradation of image Qualify. Because the proposed schemes can be separated from the block matching process, they can be used with any existing single reference fast search algorithms.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.635-642
• /
• 1998

When an integrated communication system is congested, we may reserve some spaces for non-realtime traffic by discarding a part of realtime traffic. That is sensible because realtime traffic is insensitive to a few losses. Several discarding schemes have been developed including Separate Queue (SQ). Under such schemes, the block loss distribution, i.e., the distribution of the number of losses within a given block which consists of successive data of a type, is important. We derive the block loss distribution of the SQ scheme and modifies the SQ scheme with a threshold.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.157-160
• /
• 2003

Recently, several steganographic algorithms for two-color binary images have been proposed. In this paper, we propose a steganographic algorithm which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m$\times$n blocks. and embeds a r-bit(r=[log$_2$(mn+1]-1) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes' such as the substantial substitution schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2645-2652
• /
• 1996

In this paper wepropose a sub-block retransmission scheme for ARQ and hybrid ARQ schemes. When the cannel is quiet the sub-block retransmission scheme behaves like a conventional ARQ or hybrid ARQ scheme. As the channel is becoming noisy, the data block is dvided into small sub-blocks for transmission. Each sub-block is encoded for error control by an apprpriate shortened code and the code length of the shortened code is being adaptive to the corresponding channel BER. the reeived block is checked for errors sub-block by sub-block. The propsoed sub-block retransmission scheme provides improved throughput over conventional schemes by retransmitting only the naked sub-blocks in the occurrence of errors. An example of transferring ATM cells is considered for simulation.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.56-62
• /
• 2011

In this paper, we propose a block-based selective orthogonal frequency division multiplexing (OFDM) decode-and-forward relaying scheme for 4G mobile communication systems. In the scheme, an OFDM symbol is divided into blocks and one relay is selected for each block. Theoretical outage performance and error performance are analyzed and evaluated. A unified outage expression is given for our scheme and the other two schemes and the lower bound of the bit error rate of the three schemes is also obtained. The effect of the coherence bandwidth on the proposed scheme is also investigated. Monte Carlo simulations are carried out to validate our analysis. The scheme can obtain a good tradeoff between complexity and performance and can be used in future 4G mobile communication systems.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.6
• /
• pp.1261-1269
• /
• 2017

Feistel Networks are one of the most well-known schemes to design block ciphers. Generalized Feistel Networks are used to construct only block ciphers but also hash functions. Many generic attacks on Feistel schemes have been studied. Among these attacks, recently proposed meet-in-the-middle attacks are one of the most effective attacks. In this paper, we analyze the security of meet-in-the-middle attacks on generalized Feistel Networks.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.673-677
• /
• 2010

Recently, NAND flash memory has been widely used in embedded systems, personal computers, and server systems because of its attractive features, such as non-volatility, fast access speed, shock resistance, and low power consumption. Due to its hardware characteristics, specifically its 'erase-before-write' feature, Flash Translation Layer is required for using flash memory like hard disk drive. Many FTL schemes have been proposed, but conventional FTL schemes have problems such as block thrashing and block associativity problem. The KAST scheme tried to solve these problems by limiting the number of associations between data block and log block to K. But it has also block thrashing problem in random access I/O pattern. In this paper, we proposed a new FTL scheme, UDA-LBAST. Like KAST, the proposed scheme also limits the log block association, but does not limit data block association. So we could minimize the cost of merge operations, and reduce merge costs by using a new block reclaim scheme, log block garbage collection.