• Title/Summary/Keyword: 통신지연

Search Result 3,204, Processing Time 0.03 seconds

ASIC Design of Lifting Processor for Motion JPEG2000 (Motion JPEG2000을 위한 리프팅 프로세서의 ASIC 설계)

  • Seo Young-Ho;Kim Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5C
    • /
    • pp.344-354
    • /
    • 2005
  • In this paper, we proposed a new lifting architecture for JPEG2000 and implemented to ASIC. We proposed a new cell to execute unit calculation of lifting using the property of lifting which is the repetitious arithmetic with same structure, and then recomposed the whole lifting by expanding it. After the operational sequence of lifting arithmetic was analyzed in detail and the causality was imposed for implementation to hardware, the unit cell was optimized. A new lifting kernel was organized by expanding simply the unit cell, and a lifting processor was implemented for Motion JPEG2000 using it. The implemented lifting kernel can accommodate the tile size of $1024{\times}1024$, and support both lossy compression using the (9,7) filter and lossless compression using (5,3) filter. Also, it has the same output rate as input rate, and can continuously output the wavelet coefficients of 4 types(LL, LH, HL, HH) at the same time. The implemented lifting processor completed a course of ASIC using $0.35{\mu}m$ CMOS library of SAMSUNG. It occupied about 90,000 gates, and stably operated in about 150MHz though difference from the used macro cell for the multiplier. Finally, the improved operated in about 150MHz though difference from the used macro cell for the multiplier. Finally, the performance can be identified in comparison with the previous researches and commercial IPs.

A WATM MAC Protocol for the Efficient Transmission of Voice Traffic in the Multimedia Environment (멀티미디어 환경에서 효율적인 음성 전송을 위한 WATM MAC 프로토콜)

  • 민구봉;최덕규;김종권
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.96-103
    • /
    • 2000
  • The voice traffic is one of the most important real-time objects in WATM(Wireless Asynchronous Transfer Mode) networks. In this paper, we propose a new MAC(Medium Access'Control) protocol for the efficienttransmission of voice traffic over WATM networks in the multimedia environment and compare the performanceto existing similar protocols. The new protocol separates the reservation slot period for voice and that for data toguarantee some level of QoS(Quality of Service) in voice traffic. This is denoted by a slot assignment functiondepending on the frame size. According to the characteristics of voice traffic which is repeatedly in silent states,the protocol allocates voice reservation request slots dynamically with respect to the number of silent(off state)voice sources and also sends the first block of talkspurt restarted after silent period with a reservation requestslot to reduce the access delay.The simulation results show that the proposed protocol has better performance than Slotted Aloha in bandwidthefficiency, and can serve a certain level of QoS by the given slot assignment function even when the number ofvoice terminals varies dynamically. This means we can observe that the new MAC protocol is much better thanthe NC-PRMA(None Collision-Packet Reservation Multiple Access) protocol.

  • PDF

Multi-hop Routing Protocol based on Neighbor Conditions in Multichannel Ad-hoc Cognitive Radio Networks (인지 무선 애드혹 네트워크에서의 주변 상황을 고려한 협력적 멀티홉 라우팅 방법)

  • Park, Goon-Woo;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.369-379
    • /
    • 2011
  • During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.

On the Generation of Design Products for Defence Systems Acquisition Programs based on the Systems Engineering Methodology (국방획득사업에서 SE 기반 설계 산출물 생성에 관한 연구)

  • Kim, Jae-Chul;Lee, Jae-Chon;Cho, Joon-Yong;Lee, Jae-Cheul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11B
    • /
    • pp.1710-1714
    • /
    • 2010
  • The budget for the acquisition and R&D for the national defence systems has come out of tax payers' pockets. On the other hand, the weapon systems become more complex and thus the underlying costs tend to increase continuously. As such, the need for efficiently managing the budget has drastically increased. In accordance with this necessity, the Defence Acquisition Program Administration (DAPA) of Korea has issued the instruction No.65 dictating that systems engineering (SE) must be applied when weapon systems are acquired or developed in Korea. Specifically, a list of the products that should be generated from the acquisition programs is provided. The problem is that the unexperienced companies in the defence systems industry cannot easily know how to approach the new regulation. The purpose of this study is to devise a possible remedy to solve the problem. To do so, we first review the list of the products that are required by DAPA. Then, an appropriate systems engineering processes is studied for each product. Then, a necessary link between each product and SE process activity is identified and summarized. The result obtained may be useful as a stepping stone to develop more efficient method for the list of the products.

Design and Implementation of Network Adaptive Streaming through Needed Bandwidth Estimation (요구대역 측정을 통한 네트워크 적응형 스트리밍 설계 및 구현)

  • Son, Seung-Chul;Lee, Hyung-Ok;Kwag, Yong-Wan;Yang, Hyun-Jong;Nam, Ji-Seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3B
    • /
    • pp.380-389
    • /
    • 2010
  • Since the internet is intend to be the best effort service, the system that stream a large amount of high quality medias need a techniques to overcome the network status for implementation. In this paper, we design and implement a method that estimate quickly whether network permits the needed bandwidth of media and a method that control QoS through that. Presented system uses Relative One-Way Delay(ROWD) trend in the case of the former, and leverages temporal encoding among Scalable Video Coding(SVC) that is apt to apply real time comparatively in the case of the latter. The streaming server classifies the medias by real time to several rates and begins transmission from top-level and is reported ROWD trend periodically from the client. In case of the server reported only 'Increase Trend', the sever decides that the current media exceeds the available bandwidth and downgrades the next media level. The system uses probe packet of difference quantity of the target level and the present level for upgrading the media level. In case of the server reported only 'No Increase Trend' by the ROWD trend response of the probe packet from client, the media level is upgraded. The experiment result in a fiber to the home(FTTH) environment shows progress that proposed system adapts faster in change of available bandwidth and shows that quality of service also improves.

Implementation of Internet Terminal using G.729.1 Wideband Speech Codec for Next Generation Network (차세대 통신망을 위한 G.729.1 광대역 음성 코덱을 활용한 인터넷 단말 구현)

  • So, Woon-Seob;Kim, Dae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.10B
    • /
    • pp.939-945
    • /
    • 2008
  • Tn this paper we described the process and the results of an implementation of Internet terminal using G.729.1 wideband speech codec for next generation network. For this purpose firstly we chose a high performance RISC application processor having DSP features for speech codec processing and enhanced Multimedia Accelerator(eMMA) function for video codec. In the implementation of this terminal, we used G.729.1 codec recently standardized in ITU-T which is a new scalable speech and audio codec that extends 0.729 speech coding standard. To adopt G.729.1 codec to this terminal we transformed most of the fixed point C codes which require more complexity into assembly codes so as to minimize processing time in the processor. As a result of this work we reduced the execution time of the original C codes about 80% and operated in real time on the terminal. For video we used H.263/MPEG-4 codec which is supported by the eMMA with hardware in the processor. In the SIP call processing test connected to real network we obtained under looms end-to-end delay and 3.8 MOS value measured with PESQ instrument. Besides this terminal operated well with commercial terminals.

Residual Energy-Aware Duty-Cycle Scheduling Scheme in Energy Harvesting Wireless Sensor Networks (에너지 생산이 가능한 무선 센서 네트워크에서 잔여 에너지 인지 듀티-사이클 스케줄링 기법)

  • Lee, Sungwon;Yoo, Hongseok;Kim, Dongkyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.10
    • /
    • pp.691-699
    • /
    • 2014
  • In order to increase network lifetime, duty-cycle MAC protocols which can reduce energy consumption caused by idle listening is proposed for WSNs. In common duty-cycle MAC protocols, each sensor node calculates its duty-cycle interval based on the current amount of residual energy. However, in WSNs with the capability of energy harvesting, existing duty-cycle intervals based on the residual energy may cause the sensor nodes which have high energy harvesting rate to suffer unnecessary sleep latency. Therefore, a duty-cycle scheduling scheme which adjust the duty-cycle interval based on both of the residual energy and the energy harvesting rate was proposed in our previous work. However, since this duty-cycle MAC protocol overlooked the performance variation according to the change of duty-cycle interval and adjusted the duty-cycle interval only linearly, the optimal duty-cycle interval could not be obtained to meet application requirements. In this paper, we propose three methods which calculate the duty-cycle interval and analyse their results. Through simulation study, we verify that network lifetime, end-to-end delay and packet delivery ratio can be improved up to 23%, 44% and 31% as compared to the existing linear duty-cycle scheduling method, respectively.

Continuous Moving Object Tracking Using Query Relaying in Tree-Based Sensor Network (트리 기반의 센서 네트워크에서 질의 중계를 통한 이동 객체의 연속적인 위치 획득 방안)

  • Kim, Sangdae;Kim, Cheonyong;Cho, Hyunchong;Yim, Yongbin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.5
    • /
    • pp.271-280
    • /
    • 2014
  • In wireless sensor networks, there have been two methods for sensing continuously moving object tracking: user-query based method and periodic report based method. Although the former method requires overhead for user query rather than the latter method, the former one is known as an energy-efficient method without transferring unnecessary information. In the former method, a virtual tree, consisting of sensor nodes, is exploited for the user querying and sensor reporting. The tree stores the information about mobile objects; the stored information is triggered to report by the user query. However, in case of fast moving object, the tracking accuracy reduces due to the time delay of end-to-end repeated query. To solve the problem, we propose a query relaying method reducing the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to the adjacent node according to the movement of mobile object tracking. Relaying the query message reduces the end-to-end querying time delay. Simulation results show that our method is superior to the existing ones in terms of tracking accuracy.

Convergence Speed Improvement in MMA Algorithm by Serial Connection of Two Stage Adaptive Equalizer (2단 적응 등화기의 직렬 연결에 의한 MMA 알고리즘의 수렴 속도 개선)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.99-105
    • /
    • 2015
  • This paper deals with the mMMA (modified MMA) which possible to improving the convergence speed that employing the serial connecting form of two stage digital filter instead of signal filter of MMA adaptive equalizer without applying the variable step size for compensates the intersymbol interference by channel distortion in the nonconstant modulus signal. The adaptive equalizer can be implemented by signal digital filter using the finite order tap delay line. In this paper, the equalizer is implemented by the two stage serial form and the filter coefficient are updated by the error signal using the same algorithm of MMA in each stage. The fast convergence speed is determined in the first stage, and the residual isi left at the output of first stage output is minimized in the second stage filter. The same digital filter length was considered in single stage and two stage system and the performance of these systems were compared. The performance index includes the output signal constellation, the residual isi and maximum distortion, MSE that is measure of the convergence characteristics, the SER. As a result of computer simulation, mMMA that has a FIR structure of two stage, has more good performance in every performance index except the constellation diagram due to equalization noise and improves the convergence speed about 1.5~1.8 time than the present MMA that has a FIR structure of single stage.

Performance Comparison of Taylor Series Approximation and CORDIC Algorithm for an Open-Loop Polar Transmitter (Open-Loop Polar Transmitter에 적용 가능한 테일러 급수 근사식과 CORDIC 기법 성능 비교 및 평가)

  • Kim, Sun-Ho;Im, Sung-Bin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.9
    • /
    • pp.1-8
    • /
    • 2010
  • A digital phase wrapping modulation (DPM) open-loop polar transmitter can be efficiently applied to a wideband orthogonal frequency division multiplexing (OFDM) communication system by converting in-phase and quadrature signals to envelope and phase signals and then employing the signal mapping process. This mapping process is very similar to quantization in a general communication system, and when taking into account the error that appears during mapping process, one can replace the coordinates rotation digital computer (CORDIC) algorithm in the coordinate conversion part with the Taylor series approximation method. In this paper, we investigate the application of the Taylor series approximation to the cartesian to polar coordinate conversion part of a DPM polar transmitter for wideband OFDM systems. The conventional approach relies on the CORDIC algorithm. To achieve efficient application, we perform computer simulation to measure mean square error (MSE) of the both approaches and find the minimum approximation order for the Taylor series approximation compatible to allowable error of the CORDIC algorithm in terms of hardware design. Furthermore, comparing the processing speeds of the both approaches in the implementation with FPGA reveals that the Taylor series approximation with lower order improves the processing speed in the coordinate conversion part.