• Title/Summary/Keyword: Interleaving Technique

Search Result 54, Processing Time 0.02 seconds

Timing Driven Placement using Force Directed Method and Optimal Interleaving Technique (포스 디렉티드 방법과 최적 인터리빙 기법을 이용한 타이밍 드리븐 배치)

  • Sung Young-Tae;Hur Sung-Woo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.1_2
    • /
    • pp.92-104
    • /
    • 2006
  • The proposed method for a force directed global placement algorithm exploits and extends techniques from two leading placers, Kraftwerk (& KraftwerkNC) and Mongrel. It combines the strengths of KraftwerkNC, force directed global placer, and Mongrel's ripple move technique which resolves cell overlaps effectively The proposed technique uses the force spreading technique used in Kraftwerk to optimize the ripple movement. While it is resolving the cell overlap and optimizing wire length physical net constraints are considered for timing. The experimental results obtained by the proposed approach shows significant improvement on wire length as well as on timing.

An Efficient CPM Adaptive Decoding Technique over the Burst Error Channel (연집 오류 채널에 효율적인 CPM 적응복호 방식)

  • 정종문;김대중;정호영;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.8
    • /
    • pp.1548-1557
    • /
    • 1994
  • In this paper, the dual mode error correcting adaptive decoding algorithm which is adapted to the continuous phase frequency shift keying(CPFSK) modulation is presented as a technique for overcoming the distortion that reveals from the Rayleigh fading channel. The dual mode adaptive decoder nominally operates as a Viterbi decoder and switches to the burst error correcting mode, whenever the decoder detects an uncorrectable burst error pattern. Under the fading channel environment and when the usable memory quantity is restricted, the dual mode adaptive decoding algorithm shows an advantage in the BER performance over the interleaving technique, and also obtains the merit of not needing the large time delay that the interleaving technique requires. The experimental results from the computer simulation demonstrate the performance of the algorithm and verify the theoretical results.

  • PDF

An Efficient Encryption Technique for Cloud-Computing in Mobile Environments (모바일환경에서 클라우드 컴퓨팅 보안을 위한 효율적인 암호화기술)

  • Hwang, Jae-Young;Choi, Dong-Wook;Chung, Yeon-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.4
    • /
    • pp.298-302
    • /
    • 2011
  • In this paper, we propose an efficient encryption algorithm for ensuring data privacy and security for cloud computing in mobile environments. As part of the evaluation of the proposed algorithm, we have implemented the algorithm in a PC environment and compared with the well-known encryption algorithm of the Data Encryption Standard (DES). The conventional DES algorithm is hard to maintain privacy, due to the fact that its initial and final permutation are known to the network To prevent this critical weakness, a triple DES algorithm has been reported, but it has a disadvantage of long encryption time. In this study, we propose random interleaving algorithm that uses the permutation table for improving privacy further. The proposed algorithm is found to run faster than the triple DES algorithm and also offers improved security in a wireless communication system.

A Novel Channel Estimation Method Using Pilot Channels for Frequency-Interleaved MC-CDMA Systems (주파수 인터리빙된 MC-CDMA 시스템에서 파일럿 채널을 이용한 새로운 채널 추정 기법)

  • Cho Young-bo;Lee Jae-Gu;Oh seong-Mok;Kang Chang-eon;Hong Dae-sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12C
    • /
    • pp.1186-1192
    • /
    • 2005
  • In this paper, we propose a novel channel estimation method based on pilot channel in a frequency interleaved multicarrier code division multiple access (MC-CDMA). Using the chip interleaving (CI) technique in the frequency domain make it possible to achieve higher frequency diversity gain than the system with conventional symbol interleaving. However, in CI-MC-CDMA systems, a pilot channel-based channel estimation (PCCE) cannot be applied because the orthogonality between pilot symbols and the data symbol is not maintained. The proposed method alters the system structure in order to maintain orthogonality between data and pilot channels over two consecutive subcarriers. Therefore, it can obtain accurate channel state information (CSI) in CI-MC-CDMA.

An interleaved single-stage power-factor-correction AC/DC converter (단일단 역률개선 회로를 이용한 인터리빙 (interleaving) 방식 AC/DC 컨버터)

  • Kim Eung-Ho;Kwon Bong-Hwan
    • Proceedings of the KIPE Conference
    • /
    • 2004.07b
    • /
    • pp.547-550
    • /
    • 2004
  • An interleaved single-stage power-factor-correction (PFC) AC/DC converter is presented in this paper. The proposed converter is combined by two single-stage AC/DC converters based on flyback converter Each PFC stage operates in discontinuous conduction mode (DCM). By exploiting the interleaving technique, the input ripple current and output ripple voltage are reduced. The proposed converter complied with EN/1EC61000-3-2 harmonic regulations achieves high efficiency and low cost. The performance of the proposed converter was evaluated on a 180W $(90W\times2,\;24V,\;7.5A)$ experimental prototype.

  • PDF

Design and Performance of Space-Time Trellis Codes for Rapid Rayleigh Fading Channels

  • Zummo, Salam A.;Al-Semari, Saud A.
    • Journal of Communications and Networks
    • /
    • v.5 no.2
    • /
    • pp.174-183
    • /
    • 2003
  • Space-Time (ST) codes are known to provide high transmission rates, diversity and coding gains. In this paper, a tight upper bound on the error probability of ST codes over rapid fading channels is presented. Moreover, ST codes suitable for rapid fading channels are presented. These codes are designed using the QPSK and 16-QAM signal constellations. The proposed codes are based on two different encoding schemes. The first scheme uses a single trellis encoder, whereas the second scheme uses the I-Q encoding technique. Code design is achieved via partitioning the signal space such that the design criteria are maximized. As a solution for the decoding problem of I-Q ST codes, the paper introduces a low-complexity decoding algorithm. Results show that the I-Q ST codes using the proposed decoding algorithm outperform singleencoder ST codes with equal complexity. The proposed codes are tested over fading channels with different interleaving conditions, where it is shown that the new codes are robust under such imperfect interleaving conditions.

Bandwidth-efficient Cooperative Diversity with Rotated Constellations and Its Performance Analysis

  • Lei, Weijia;Xie, Xianzhong;Li, Xiangming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.6
    • /
    • pp.989-1005
    • /
    • 2010
  • Cooperative diversity is a technique with which a virtual multiple antenna array is established among the single antenna users of the wireless network to realize space diversity. Signal space diversity (SSD) is a bandwidth-efficient diversity technique, which uses constellation rotation and interleaving techniques to achieve diversity gain. A new cooperative diversity scheme with rotated constellations (RCCD) is proposed in this paper. In this scheme, data are modulated by using a rotated constellation, and the source and the relays transmit different components of the modulated symbols. Since any one of the components contains full information of the symbols, the destination can obtain multiple signals conveying the same information from different users. In this way, space diversity is achieved. The RCCD scheme inherits the advantage of SSD - being bandwidth-efficient but without the delay problem of SSD brought by interleaving. The symbol error rate of the RCCD scheme is analyzed and simulated. The analysis and simulation results show that the RCCD scheme can achieve full diversity order of two when the inter-user channel is good enough, and, with the same bandwidth efficiency, has a better performance than amplify-and-forward and detect-and-forward methods.

Implementation of an Audio Broadcasting Service over the Internet (인터넷상의 실시간 오디오 방송 서비스 구현)

  • 박준석;고대식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.6
    • /
    • pp.1496-1502
    • /
    • 1998
  • In this paper, a real-time audio broadcasting service system which is robust to loaded traffic on the Internet is developed. For implementing reliable real-time data transfer, the transfer characteristics of TCP/IP and UDP/IP was compared and analyzed. For lost packet recovery, redundant audio data algorithm was used and interleaving technique was applied for scattering consecutive packet loss. Test results showed, when using TCP/IP, pause occurred during playback, and when using UDP/IP, a stable receive rate was noticeable but the quality of the sound was lower than that of uisng TCP/IP. The recovery rate using redundant audio data and interleaving technique is shown in Fig. 9 and the delay is shown in Fig 4.

  • PDF

16-QAM Periodic Complementary Sequence Mates Based on Interleaving Technique and Quadriphase Periodic Complementary Sequence Mates

  • Zeng, Fanxin;Zeng, Xiaoping;Xiao, Lingna;Zhang, Zhenyu;Xuan, Guixin
    • Journal of Communications and Networks
    • /
    • v.15 no.6
    • /
    • pp.581-588
    • /
    • 2013
  • Based on an interleaving technique and quadriphase periodic complementary sequence (CS) mates, this paper presents a method for constructing a family of 16-quadrature amplitude modulation (QAM) periodic CS mates. The resulting mates arise from the conversion of quadriphase periodic CS mates, and the period of the former is twice as long as that of the latter. In addition, based on the existing binary periodic CS mates, a table on the existence of the proposed 16-QAM periodic CS mates is given. Furthermore, the proposed method can also transform a mutually orthogonal (MO) quadriphase CS set into an MO 16-QAM CS set. Finally, three examples are given to demonstrate the validity of the proposed method.

New low-complexity segmentation scheme for the partial transmit sequence technique for reducing the high PAPR value in OFDM systems

  • Jawhar, Yasir Amer;Ramli, Khairun Nidzam;Taher, Montadar Abas;Shah, Nor Shahida Mohd;Audah, Lukman;Ahmed, Mustafa Sami;Abbas, Thamer
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.699-713
    • /
    • 2018
  • Orthogonal frequency division multiplexing (OFDM) has been the overwhelmingly prevalent choice for high-data-rate systems due to its superior advantages compared with other modulation techniques. In contrast, a high peak-to-average-power ratio (PAPR) is considered the fundamental obstacle in OFDM systems since it drives the system to suffer from in-band distortion and out-of-band radiation. The partial transmit sequence (PTS) technique is viewed as one of several strategies that have been suggested to diminish the high PAPR trend. The PTS relies upon dividing an input data sequence into a number of subblocks. Hence, three common types of the subblock segmentation methods have been adopted - interleaving (IL-PTS), adjacent (Ad-PTS), and pseudorandom (PR-PTS). In this study, a new type of subblock division scheme is proposed to improve the PAPR reduction capacity with a low computational complexity. The results indicate that the proposed scheme can enhance the PAPR reduction performance better than the IL-PTS and Ad-PTS schemes. Additionally, the computational complexity of the proposed scheme is lower than that of the PR-PTS and Ad-PTS schemes.