• Title/Summary/Keyword: coding delay

Search Result 248, Processing Time 0.03 seconds

Cooperative Diversity using Cyclic Delay for OFDM systems (OFDM 시스템을 위한 순환 지연을 사용하는 협력 다이버시티 기법)

  • Lee, Dong-Woo;Jung, Young-Seok;Lee, Jae-Hong
    • Journal of Broadcast Engineering
    • /
    • v.13 no.2
    • /
    • pp.172-178
    • /
    • 2008
  • Orthogonal Frequency Division Multiplexing (OFDM) is one of the most promising technologies for high data rate wireless communications. OFDM has been adopted in wireless standards such as digital audio/video broadcasting. The combination of OFDM and cooperative diversity techniques can provide the diversity gain and/or increased capacity. In this paper, the cooperative coding using cyclic delay diversity (CDD) for multiuser OFDM systems is introduced. To improve the beneficial effects of relays's cooperation, CDD is adopted in cooperative transmission of relays. Simulation results show the bit error rate (BER) for various consideration. The proposed scheme provides improved performance compared to delay.

Fast Decision Method of Geometric Partitioning Mode and Block Partitioning Mode using Hough Transform in VVC (허프 변환을 이용한 VVC의 기하학 분할 모드 및 블록 분할 고속 결정 방법)

  • Lee, Minhun;Park, Juntaek;Bang, Gun;Lim, Woong;Sim, Donggyu;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.25 no.5
    • /
    • pp.698-708
    • /
    • 2020
  • VVC (Versatile Video Coding), which has been developing as a next generation video coding standard. Compared to HEVC (High Efficiency Video Coding), VVC is improved by about 34% in RA (Random Access) configuration and about 30% in LDB (Low-Delay B) configuration by adopting various techniques such as recursive block partitioning structure and GPM (Geometric Partitioning Mode). But the encoding complexity is increased by about 10x and 7x, respectively. In this paper, we propose a fast decision method of GPM mode and block partitioning using directionality of block to reduce encoding complexity of VVC. The proposed method is to apply the Hough transform to the current block to identify the directionality of the block, thereby determining the GPM mode and the specific block partitioning method to be skipped in the rate-distortion cost search process. As a result, compared to VTM8.0, the proposed method reduces about 31.01% and 29.84% encoding complexity for RA and LDB configuration with 2.48% and 2.69% BD-rate loss, respectively.

Application of Network Coding to IEEE 802.16j Mobile Multi-hop Relay Network for Throughput Enhancement

  • Lee, Kyung-Jun;Sung, Won-Jin;Jang, Ju-Wook
    • Journal of Communications and Networks
    • /
    • v.10 no.4
    • /
    • pp.412-421
    • /
    • 2008
  • We observe simultaneous transmission of relay stations (RSs) allowed in current IEEE 802.16j draft standard for multi-hop relay networks may involve severe interference among the RSs, hence leading to throughput degradation. Allowing only 1/3 of the RSs to simultaneously transmit instead of 1/2 RSs as in the current draft standard reduces the interference but results in reduced throughput. To remedy this problem, we devise schemes to incorporate network coding at link-layer level (decode-and-forward) into the simultaneous transmission of RSs. Data movement is rearranged to maximize coding gain. Formula is derived to dictate exact movement of packets traveling between base station (BS) and mobile stations (MSs) via intermediate RSs. The frame structure in the current IEEE 802.16j draft standard does not allow broadcast needed for network coding. We devise a new frame structure which supports the broadcast. A new R-MAP (pointers to the burst data) is introduced to implement the broadcast. Since our new frame structure is used only for BS to RS or RS to RS communication, our schemes retain backward compatibility with legacy MSs based on IEEE 802.16e standard. Simulation based on simple configuration of RSs shows considerable improvement in terms of system throughput and round trip delay. For a 4-hop relay network with 1 BS and 4 RSs with symmetric traffic in uplink (UL) and downlink (DL), throughput is improved by 49% in DL and by 84% in UL traffic compared with IEEE 802.16j draft standard under the assumption that omni-directional antennae are used in BS and RSs.

Fast Decoding Method of Distributed Video Based on Modeling of Parity Bit Requests (패리티 비트 요구량 모델링에 의한 분산 비디오의 고속 복호화 기법)

  • Kim, Man-Jae;Kim, Jin-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.11
    • /
    • pp.2465-2473
    • /
    • 2012
  • Recently, as one of low complexity video encoding methods, DVC (Distributed Video Coding) scheme has been actively studied. Most of DVC schemes exploit feedback channel to achieve better coding performances, however, this causes these schemes to have high decoding delay. In order to overcome these, this paper proposes a new fast DVC decoding method using parity-bit request model, which can be obtained by using bit-error rate, sent by encoder with motion vector, which is transmitted through feedback channel by decoder after generating side information. Through several simulations, it is shown that the proposed method improves greatly the decoding speed, compared to the conventional schemes.

Turbo Coded MIMO System with Adaptive Turbo Space- Time Processing for High-Speed Wireless Communications (고속 무선 통신을 위한 적응형 터보 시공간 처리를 갖는 터보 부호화된 다중 입출력 시스템)

  • 조동균;김상준;박주남;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9C
    • /
    • pp.843-850
    • /
    • 2003
  • Turbo coding and turbo processing have been known as methods close to Shannon limit in the aspect of wireless MIMO communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but turbo coding has not been used for turbo processing because of the inherent decoding process delay. This paper proposes a turbo coded MIMO system with adaptive turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and a enhanced cyclic redundancy check (E-CRC) scheme as an efficient and simple priori stopping criterion. Simulation results show that the Turbo-PAST outperforms conventional system with 1.3dB and the proposed E-CRC scheme effectively reduces the amount of turbo processing iterations from the point of average number of iterations.

A Channel Allocation and Data Delivery Scheme Considering Channel Overlapping in Wireless Tactical Networks (군 전술망의 무선 이동 통신 체계의 통신 범위 중첩을 고려한 채널 할당 기법과 데이터 전달 기법)

  • Shin, Hyun-Sup;Chae, Sung-Yoon;Kang, Kyung-Ran;Cho, Young-Jong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.3
    • /
    • pp.501-508
    • /
    • 2011
  • In this paper, we propose a channel allocation algorithm of MSAP(Mobile Subscriber Access Point) and data delivery scheme exploiting the symbol level network coding. The network is comprised of TS(Tactical Switch) as a backbone node, MSAPs, and TMFTs(Tactical Multi-Function Terminal). The TS performs the channel allocation considering the communication range overlapping between the neighboring MSAPs and applies the symbol level network coding, if necessary, depending on the position of the TMFTs. Assuming the number of available antennas of TMFT and MSAP will be extended to two from one, we propose two schemes: single mode and dual mode. Through the simulation, we show that the proposed delivery scheme provides higher delivery ratio and lower delivery delay compared with the legacy store-and-forward scheme.

Design of Interleaver using the MAP Algorithm Scheme in the Multi-User CDMA Communication System (다중 사용자 CDMA 통신 시스템에서 MAP 알고리즘 기법을 사용한 인터리버 설계)

  • Kim, Dong-Ok;Oh, Chung-Gyun
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2005.08a
    • /
    • pp.417-421
    • /
    • 2005
  • In the recent digital communication systems, the performance of Turbo Code using the error correction coding depends on the interleaver influencing the free distance determination and the recursive decoding algorithms that is executed in the turbo decoder. However, performance depends on the interleaver depth that needs many delays over the reception process. Moreover, turbo code has been known as the robust coding methods with the confidence over the fading channel. International Telecommunication Union(ITU) has recently adopted it as the standardization of the channel coding over the third generation mobile communications(IMT-2000). Therefore, in this paper, we proposed the interleaver that has the better performance than existing block interleaver, and modified turbo decoder that has the parallel concatenated structure using MAP algorithm. In the real-time voice and video service over third generation mobile communications, the performance of the proposed two methods was analyzed and compared with the existing methods by computer simulation in terms of reduced decoding delay using the variable decoding method over AWGN and fading channels for CDMA environments.

  • PDF

A Study on The Method of Real-Time Arrythmia monitoring Using Modified Chain Coding (Modified Chain Coding 을 이용한 실시간 부정맥 모니터링 기법에 관한 연구)

  • Yun, Ji-Young;Lee, Jeong-Whan;Lee, Myoung-Ho
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1996 no.05
    • /
    • pp.31-35
    • /
    • 1996
  • This paper presents a real time algorithm for monitoring of the arrythmia of ECG signal. A real time monitoring, following by detecting a QRS complex, is the most important. Using 2-dimensional time-delay coordinates which are reconstructed by the phase portrait plotting special trajectory, we detect QRS complexes. In this study, arrythmias are detected by matching the past standard template with tile present pattern when changing abruptly In order to matching with each other, we propose modified chain coding algorithm which applies vetor table consisting of eight orthonormal code(=binary code) to the phase portraits. This algorithm using logical function increases the weight if exceeding to the threshold determinded by correlation value and the distance from a straight line(y=x). Evaluating the performance of the proposed algorithm, we use standard MIT/BIH database. The results are fellowing, 1) Improve the speed of matching template than that of cross-correlation ever has been used. 2) Because the proposed algorithm is robust to varing fiducial point, it is possible to monitor the ECG signal with irregular RR interval. 3) In spite of baseline wandering owing to the low frequency noise, monitoring performance is not reduced.

  • PDF

Linear network coding in convergecast of wireless sensor networks: friend or foe?

  • Tang, Zhenzhou;Wang, Hongyu;Hu, Qian;Ruan, Xiukai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3056-3074
    • /
    • 2014
  • Convergecast is probably the most common communication style in wireless sensor networks (WSNs). And linear network coding (LNC) is a promising concept to improve throughput or reliability of convergecast. Most of the existing works have mainly focused on exploiting these benefits without considering its potential adverse effect. In this paper, we argue that LNC may not always benefit convergecast. This viewpoint is discussed within four basic scenarios: LNC-aided and none-LNC convergecast schemes with and without automatic repeat request (ARQ) mechanisms. The most concerned performance metrics, including packet collection rate, energy consumption, energy consumption balance and end-to-end delay, are investigated. Theoretical analyses and simulation results show that the way LNC operates, i.e., conscious overhearing and the prerequisite of successfully decoding, could naturally diminish its advantages in convergecast. And LNC-aided convergecast schemes may even be inferior to none-LNC ones when the wireless link delivery ratio is high enough. The conclusion drawn in this paper casts a new light on how to effectively apply LNC to practical WSNs.

A Study on the Enhancement of Turbo Decoder Reducing Communication Error of a Fire Detection System for Marine Vessels (선박용 화재탐지장치의 통신 에러를 감소시키기 위한 수정된 터보코딩 알고리즘 개발에 관한 연구)

  • 정병홍;최상학;오종환;김경식
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.25 no.2
    • /
    • pp.375-382
    • /
    • 2001
  • In this study, an adapted Turbo Coding Algorithm for reducing communication error of a fire detection system for marine vessels, especially image transmission via power lone. Because it is necessary that this system communicate larger and faster than previous method, this study carried out enhancement a decoding speed by adaptation CRC with Turbo Code Algorithm, improvement of metric method, and reduction of decoding delay by using of Center-to-Top method. And the results are as follows: (1) Confirmed that a Turbo Code is so useful methods for reducing communication error in lots of noise environments. (2)Proposed technology in this study speed increasing method of Turbo Coding Algorithm proves 2 times faster than normal Turbo Code and communication error reducing as well in the board made by VHDL software & chips ALTERA company.

  • PDF