• Title/Summary/Keyword: minimum bit rate

Search Result 149, Processing Time 0.021 seconds

1 Bit/Pixel Modulation Codes for Multi-Level Holographic Data Storage System (멀티레벨 홀로그래픽 데이터 저장장치를 위한 1비트/픽셀 변조부호)

  • Jeong, Seongkwon;Lee, Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1667-1671
    • /
    • 2015
  • Multi-level holographic data storage is a candidate for the next generation data storage system, since it can store more than one bit per pixel. It is possible to increase the number of codewords if the number of levels is increased, and the code with an appropriate selection of codewords can also increase the minimum distance. In this paper, we propose three multi-level modulation codes of the code rate 1 bit/pixel and compare the performance according to the minimum distance. The result shows that the code with small number of levels is better than that of large number of levels because it is hard to detect threshold value.

Approximate Minimum BER Power Allocation of MIMO Spatial Multiplexing Relay Systems (다중 안테나 공간 다중화 릴레이 시스템을 위한 근사 최소 비트 오율 전력 할당 방법)

  • Hwang, Kyu-Ho;Choi, Soo-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.337-344
    • /
    • 2011
  • In this paper, a multiple-input and multiple-output (MIMO) spatial multiplexing (SM) relay system is studied in a bit error rate (BER) sense, where every node is deployed with multiple antennas. In order to efficiently use the limited power resource, it is essential to optimally allocate the power to nodes and antennas. In this context, the power allocation (PA) algorithm based on minimum BER (MBER) for a MIMO SM relay system is proposed, which is derived by direct minimization of the average BER, and divided into inter-node and inter-antenna PA algorithm. The proposed scheme outperforms the conventional equal power allocation (EPA) algorithm without extra power consumption.

Performance of Equalizer Schemes in Power Line Communication Systems for Automatic Metering Reading (자동 원격검침을 위한 전력선 통신 시스템에서의 등화 기법 연구)

  • Kim, Yo-cheol;Bae, Jung-Nam;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.29-34
    • /
    • 2011
  • In this paper, we propose and analyze the equalizer schemes, zero-forcing (ZF) and minimum mean square error (MMSE) in power line communication (PLC) system for automatic meter reading (AMR). For efficient implementation of AMR system with PLC, effects of impulsive noise and multipath channel should be mitigated. To overcome these effects, the above equalizer schemes are employed. System performance is evaluated in term of bit error rate. From simulation results, it is confirmed that the equalizer can significantly improve bit error rate (BER) performance in PLC system, and MMSE equalizer provides better performance than ZF scheme. The results of this paper can be applied to AMR system as well as various smart grid services using PLC.

A Study of Wavelet Image Coder for Minimizing Memory Usage (메모리 사용을 최소화하는 웨이블릿 영상 부호화기에 관한 연구)

  • 박성욱;박종욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3C
    • /
    • pp.286-295
    • /
    • 2003
  • In this paper, the wavelet image coder, that can encode the image to various bit rate with minimum memory usage, is proposed. The proposed coder is used the 2D significant coefficient array(SCA) that has bit level informal on of the wavelet coefficients to reduce the memory requirement in coding process. The 2D SCA is two dimensional data structure that has bit level information of the wavelet coefficients. The proposed algorithm performs the coding of the significance coefficients and coding of bit level information of wavelet coefficients at a time by using the 2D SCA. Experimental results show a better or similar performance of the proposed method when compared with conventional embedded wavelet coding algorithm. Especially, the proposed algorithm performs stably without image distortion at various b it rates with minimum memory usage by using the 2D SCA.

Analysis of a binary feedback switch algorithm for the ABR service in ATM networks (ATM망에서 ABR 서비스를 위한 이진 피드백 스위치 알고리즘의 성능 해석)

  • 김동호;안유제;안윤영;박홍식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.1
    • /
    • pp.162-172
    • /
    • 1997
  • In this paper, we investigated the performance of a binary feedback switch algorithm for the ABR(Available Bit Rate) service in ATM networks. A binary feedback switch is also called EFCI(Explicit Forward Congestion Indication) switch and can be classificed into input cell processing(IP) scheme according to processing methods for the EFCI bit in data-cell header. We proposed two implementation methods for the binary feedback switch according to EFCI-bit processing schemes, and analyzed the ACR(Allowed Cell Rate) of source and the queue length of switch for each scheme in steady state. In addition, we derived the upper and lower bounds for maximum and minimum queue lengths, respectively, and investigated the impact of ABR parameters on the queue length.

  • PDF

Analysis of a relative rate switch algorithm for the ABR service in ATM networks (ATM망에서 ABR서비스를 위한 Relative Rate 스위치 알고리즘의 성능 해석)

  • 김동호;조유제
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.5
    • /
    • pp.1384-1396
    • /
    • 1998
  • This paper ivestigates the performance of a relative rate (RR) switch algorithm for the rate-based available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. A RR switch may notify the network congestion status to the source by suing the congestion indication (CI) bit or no increase (NI)bit in the backward RM (BRM) cells. A RR switch can be differently implemented according to the congestion detectio and notification methods. In this paper, we propose three implementation schemes for the RR switch with different congestion detection and notification methods, and analyze the allowed cell rate (ACR) of a source and the queue length of a switch in steady state. In addition, we derive the upper and lower bounds for the maximum and minimum queue lengths for each scheme respectively, and evaluate the effects of the ABR parameter values on the queue length. Furthermore, we suggest the range of the rage increase factor (RIF) and rate decrease factor (RDF) parameter values which can prevent buffer overflow and underflow at a switch.

  • PDF

Fractional Multi-bit Differential Detection Technique for Continuous Phase Modulation

  • Lee, Kee-Hoon;Seo, Jong-Soo
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.635-640
    • /
    • 2004
  • A new low-complexity differential detection technique, fractional multi-bit differential detection (FMDD), is proposed in order to improve the performance of continuous phase modulation (CPM) signals such as Gaussian minimum shift keying (GMSK) and Gaussian frequency shift keying (GFSK). In comparison to conventional one-bit differential detected (1DD) GFSK, the FMDD-employed GFSK provides a signal-to-noise ratio advantage of up to 1.8 dB in an AWGN channel. Thus, the bit-error rate performance of the proposed FMDD is brought close to that of an ideal coherent detection while avoiding the implementation complexity associated with the carrier recovery. In the adjacent channel interference environment, FMDD achieves an even larger SNR advantage compared to 1DD.

  • PDF

Link Adaptation for Full Duplex Systems

  • Kim, Sangchoon
    • International journal of advanced smart convergence
    • /
    • v.7 no.4
    • /
    • pp.92-100
    • /
    • 2018
  • This paper presents a link adaptation scheme for adaptive full duplex (AFD) systems. The signal modulation levels and communication link patterns are adaptively selected according to the changing channel conditions. The link pattern selection process consists of two successive steps such as a transmit-receive antenna pair selection based on maximum sum rate or minimum maximum symbol error rate, and an adaptive modulation based on maximum minimum norm. In AFD systems, the antennas of both nodes are jointly determined with modulation levels depending on the channel conditions. An adaptive algorithm with relatively low complexity is also proposed to select the link parameters. Simulation results show that the proposed AFD system offers significant bit error rate (BER) performance improvement compared with conventional full duplex systems with perfect or imperfect self-interference cancellation under the same fixed sum rate.

Smoothing Algorithm Considering Server Bandwidth and Network Traffic in IoT Environments (IoT 환경에서 서버 대역폭과 네트워크 트래픽을 고려한 스무딩 알고리즘)

  • Lee, MyounJae
    • Journal of Internet of Things and Convergence
    • /
    • v.8 no.1
    • /
    • pp.53-58
    • /
    • 2022
  • Smoothing is a transmission plan that converts video data stored at a variable bit rate into a constant bit rate. In the study of [6-7], when a data rate increase is required, the frame with the smallest increase is set as the start frame of the next transmission rate section, when a data tate decrease is required. the frame with the largest decrease is set as the start frame of the next transmission rate section, And the smoothing algorithm was proposed and performance was evaluated in an environment where network traffic is not considered. In this paper, the smoothing algorithm of [6-7] evaluates the adaptive CBA algorithm and performance with minimum frame rate, average frame rate, and frame rate variation from 512KB to 32MB with E.T 90 video data in an environment that considers network traffic. As a result of comparison, the smoothing algorithm of [6-7] showed superiority in the comparison of the minimum refresh rate.

An Antenna Shuffling Scheme for DSTTD System Based on Post-processing Signal to Noise Ratio (수신 신호 대 잡음비에 기반한 안테나 셔플링을 적용 DSTTD 시스템)

  • Jung Sunghun;Shim Seijoon;Lee Chungyong;Youn Dae Hee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.1
    • /
    • pp.75-80
    • /
    • 2005
  • A new antenna shuffling scheme for double space time transmit diversity is proposed. The proposed method obtains the shuffling pattern directly from the estimated channel by maximizing minimum post-processing signal to noise ratio(SNR), while the conventional method minimizes channel correlation. Since the minimum post-processing SNR is directly related with error performance, the proposed method shows better bit error rate performance than the conventional method. Monte Carlo simulations showed that the proposed scheme has more 3 dB SNR gain than the conventional scheme for 10/sup -3/ bit error rate in spatially correlated fadingcaused by a single cluster model.