• Title/Summary/Keyword: low complexity high speed

Search Result 117, Processing Time 0.025 seconds

An Adaptive Equalizer for Error Free 40GbE Data Transmission on 40 inch High-Speed Backplane Channel (40인치 고속 백플레인 채널에서 에러없이 40GbE 데이터 전송을 위한 적응 등화기)

  • Yang, Choong-Reol;Kim, Kwang-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5B
    • /
    • pp.809-815
    • /
    • 2010
  • This paper proposes the structures and algorithms for the adaptive equalizer that are required to allow high speed signaling over 40 Gb/s across a backplane channel. The proposed adaptive DFE has a fast convergence and low computational complexity. Simulations with a 40 Gb/s show that our adaptive equalizer can meet the IEEE 802.3ba requirement for backplane strip line up to 40 inches.

Rate Proportional SCFQ Algorithm for High-Speed Packet-Switched Networks

  • Choi, Byung-Hwan;Park, Hong-Shik
    • ETRI Journal
    • /
    • v.22 no.3
    • /
    • pp.1-9
    • /
    • 2000
  • Self-Clocked Fair Queueing (SCFQ) algorithm has been considered as an attractive packet scheduling algorithm because of its implementation simplicity, but it has unbounded delay property in some input traffic conditions. In this paper, we propose a Rate Proportional SCFQ (RP-SCFQ) algorithm which is a rate proportional version of SCFQ. If any fair queueing algorithm can be categorized into the rate proportional class and input is constrained by a leaky bucket, its delay is bounded and the same as that of Weighted Fair Queueing (WFQ) which is known as an optimal fair queueing algorithm. RP-SCFQ calculates the timestamps of packets arriving during the transmission of a packet using the current value of system potential updated at every packet departing instant and uses a starting potential when it updates the system potential. By doing so, RP-SCFQ can have the rate proportional property. RP-SCFQ is appropriate for high-speed packet-switched networks since its implementation complexity is low while it guarantees the bounded delay even in the worst-case input traffic conditions.

  • PDF

Communication Performance Analysis and Characteristics of Frequency Synthesizer in the OFDM/FH Communication System (OFDM/FH 통신시스템에 사용되는 주파수 합성기의 특성과 통신 성능 분석)

  • 이영선;유흥균
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.8
    • /
    • pp.809-815
    • /
    • 2003
  • It is very important to get very high switching speed as well as low phase noise of frequency synthesizer in the OFDM/FH communication system. In this paper we compare the phase noises and switching speeds of the conventional PLL and digital hybrid PLL(DH-PLL) frequency synthesizer, also, we investigate the effect of phase noise on the performance of OFDM/FH communication system. DH-PLL has high switching speed property at the cost of circuit complexity and more power consumption. Unlike the conventional PLL in which the phase noise and switching speed have the trade off relationship in respect of loop filter bandwidth, DH-PLL frequency synthesizer can perform fast switching speed and low phase noise simultaneously. Under the condition of same hopping speed requirement, DH-PLL can achieve faster switching speed and lower SNR penalty compared with conventional PLL in the OFDM/FH communication system.

Low-latency Montgomery AB2 Multiplier Using Redundant Representation Over GF(2m)) (GF(2m) 상의 여분 표현을 이용한 낮은 지연시간의 몽고메리 AB2 곱셈기)

  • Kim, Tai Wan;Kim, Kee-Won
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.1
    • /
    • pp.11-18
    • /
    • 2017
  • Finite field arithmetic has been extensively used in error correcting codes and cryptography. Low-complexity and high-speed designs for finite field arithmetic are needed to meet the demands of wider bandwidth, better security and higher portability for personal communication device. In particular, cryptosystems in GF($2^m$) usually require computing exponentiation, division, and multiplicative inverse, which are very costly operations. These operations can be performed by computing modular AB multiplications or modular $AB^2$ multiplications. To compute these time-consuming operations, using $AB^2$ multiplications is more efficient than AB multiplications. Thus, there are needs for an efficient $AB^2$ multiplier architecture. In this paper, we propose a low latency Montgomery $AB^2$ multiplier using redundant representation over GF($2^m$). The proposed $AB^2$ multiplier has less space and time complexities compared to related multipliers. As compared to the corresponding existing structures, the proposed $AB^2$ multiplier saves at least 18% area, 50% time, and 59% area-time (AT) complexity. Accordingly, it is well suited for VLSI implementation and can be easily applied as a basic component for computing complex operations over finite field, such as exponentiation, division, and multiplicative inverse.

Design of Lightweight Artificial Intelligence System for Multimodal Signal Processing (멀티모달 신호처리를 위한 경량 인공지능 시스템 설계)

  • Kim, Byung-Soo;Lee, Jea-Hack;Hwang, Tae-Ho;Kim, Dong-Sun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.5
    • /
    • pp.1037-1042
    • /
    • 2018
  • The neuromorphic technology has been researched for decades, which learns and processes the information by imitating the human brain. The hardware implementations of neuromorphic systems are configured with highly parallel processing structures and a number of simple computational units. It can achieve high processing speed, low power consumption, and low hardware complexity. Recently, the interests of the neuromorphic technology for low power and small embedded systems have been increasing rapidly. To implement low-complexity hardware, it is necessary to reduce input data dimension without accuracy loss. This paper proposed a low-complexity artificial intelligent engine which consists of parallel neuron engines and a feature extractor. A artificial intelligent engine has a number of neuron engines and its controller to process multimodal sensor data. We verified the performance of the proposed neuron engine including the designed artificial intelligent engines, the feature extractor, and a Micro Controller Unit(MCU).

Removal of Complexity Management in H.263 Codec for A/VDelivery Systems

  • Jalal, Ahmad;Kim, Sang-Wook
    • 한국HCI학회:학술대회논문집
    • /
    • 2006.02a
    • /
    • pp.931-936
    • /
    • 2006
  • This paper presents different issues of the real-time compression algorithms without compromising the video quality in the distributed environment. The theme of this research is to manage the critical processing stages (speed, information lost, redundancy, distortion) having better encoded ratio, without the fluctuation of quantization scale by using IP configuration. In this paper, different techniques such as distortion measure with searching method cover the block phenomenon with motion estimation process while passing technique and floating measurement is configured by discrete cosine transform (DCT) to reduce computational complexity which is implemented in this video codec. While delay of bits in encoded buffer side especially in real-time state is being controlled to produce the video with high quality and maintenance a low buffering delay. Our results show the performance accuracy gain with better achievement in all the above processes in an encouraging mode.

  • PDF

Low Memory Zerotree Coding (저 메모리를 갖는 제로트리 부호화)

  • Shin, Cheol;Kim, Ho-Sik;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8A
    • /
    • pp.814-821
    • /
    • 2002
  • The SPIHT(set partitioning in hierarchical tree) is efficient and well-known in the zerotree coding algorithm. However SPIHT's high memory requirement is a major difficulty for hardware implementation. In this paper we propose low-memory and fast zerotree algorithm. We present following three methods for reduced memory and fst coding speed. First, wavelet transform by lifting has a low memory requirement and reduced complexity than traditional filter bank implementation. The second method is to divide the wavelet coefficients into a block. Finally, we use NLS algorithm proposed by Wheeler and Pearlman in our codec. Performance of NLS is nearly same as SPIHT and reveals low and fixed memory and fast coding speed.

A Study on the design and implementation of serial communication using only one pin (단일 핀을 이용한 직렬 통신 설계 및 구현에 관한 연구)

  • Park, Sang-Bong;Heo, Jeong-Hwa
    • The Journal of the Convergence on Culture Technology
    • /
    • v.1 no.3
    • /
    • pp.83-85
    • /
    • 2015
  • It has been increased that communicate each other things such as consumer electronics, mobile equipments and wearable computer with serial communication protocol. The conventional method of SPI and I2C high speed serial communication is widely used with 2 pin of clock and data pin. It has been more important than the speed of data transfer to simplify the hardware structure because the IoT components is reduced the hardware complexity. In this paper, we describe the protocol and implementation of serial data transfer with only one pin. The proposed protocol is suitable for the mobile products that send and receive the small amount of data with low speed and low power consumption.

A Transmit Power Control based on Fading Channel Prediction for High-speed Mobile Communication Systems (고속 이동 통신 시스템을 위한 페이딩 예측기반 송신 전력 제어)

  • Hwang, In-Kwan;Lee, Sang-Kook;Ryu, In-Bum
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1A
    • /
    • pp.27-33
    • /
    • 2009
  • This paper proposes transmit power control techniques with fading channel prediction scheme based on recurrent neural network for high-speed mobile communication systems. The operation result of recurrent neural network which is derived interpretively solves complexity problems of neural network circuit, and channel gain of multiple transmit antenna is derived with maximum ratio combining(MRC) by using the operation result, and this channel gain control transmit power of each antenna. simulation results show that proposed method has a outstanding performance compared to method that is not to be controlled power based on channel prediction. Most of legacy studies are for robust receive technique of fading signals or channel prediction of fading signals limited low-speed mobility, but in open loop Power control, proposed channel prediction method decrease system complexity with removal of fading effect in transmitter.

Dynamic Response for Critical Velocity Effect Depending on Supporting Stiffness of High-Speed Railway Trackbed (고속철도 노반지지조건에 따른 임계속도효과의 동적응답)

  • Lee, Il-Wha
    • Journal of the Korean Geotechnical Society
    • /
    • v.29 no.1
    • /
    • pp.5-12
    • /
    • 2013
  • The critical velocity effect on railway trackbed means the amplification of vibration energy when the train running-speed and group velocity of ground surface wave are superimposed. It is called a pseudo-resonance phenomenon of time domain. In the past, it was not issued because the train speed was low and the ground group velocity was higher. But since the high-speed train is introduced, critical velocity reported causing a track irregularity. So far, theoretical analysis has been performed because of the complexity of formation process. However it requires reasonable consideration which is similar to actual track and trackbed conditions. In the present paper, finite element analysis to verify the critical velocity effect is performed considering each track structure and trackbed supporting stiffness. As a result, the deformation amplification caused by the critical velocity effect is verified to analyze each supporting stiffness and track system.