• Title/Summary/Keyword: Block Based Information

Search Result 2,206, Processing Time 0.031 seconds

A Real-Time Multiple Circular Buffer Model for Streaming MPEG-4 Media (MPEG-4 미디어 스트리밍에 적합한 실시간형 다중원형버퍼 모델)

  • 신용경;김상욱
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.1
    • /
    • pp.13-24
    • /
    • 2003
  • MPEG-4 is a standard for multimedia applications and provides a set of technologies to satisfy the needs of authors, service providers and end users alike. In this paper, we suggest a Real-time Multiple Circular Buffer (M4RM Buffer) model, which is suitable for streaming these MPEG-4 contents efficiently. M4RM buffer generates each structure of the buffer, which matches well with each object composing an MPEG-4 content, according to the transferred information, and manipulates multiple read/write operations only by its reference. It divides the decoder buffer and the composition buffer, which are described in the standard, by the unit of frame allocated to minimize the range of access. This buffer unit of a frame is allocated according to the object description. Also, it processes the objects synchronization within the buffer and provides APIs for an efficient buffer management to process the real-time user events. Based on the performance evaluation, we show that M4RM buffer model decreases the waiting time in a buffer frame, and so allows the real-time streaming of an MPEG-4 content using the smaller size of the memory block than IM1-2D and Window Media Player.

A Combined Call Control Algorithm based on Moving Speed and Bandwidth in Hierarchical Cellular Systems (계층셀 구조에서 이동 속도와 대역폭을 고려한 복합 호 처리 알고리즘)

  • Park, Jeong-Eun;Chae, Ki-Joon
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.299-313
    • /
    • 2002
  • Recently, the demand for mobile communications and multimedia services has rapidly increased so that conventional cellular system cannot fulfill the requirement of users (capacity and QoS) any more. Therefore, the hierarchical cellular system has been suggested in order to guarantee the QoS and to admit large population of users. IMT-2000 adopts the hierarchical cellular structure, which requires a call control algorithm capable of manipulating and utilizing the complicated structure of hierarchical cellular structure with handiness and efficiency. In this thesis, as an improvement of conventional combined algorithm, a new call control algorithm considering the moving speed of terminal and bandwidth is suggested. This algorithm employs buffers and guard channels to reduce the failure rate. Also, this algorithm considers the moving speed of terminal and bandwidth to elevate the efficiency. Furthermore, calls are handled separately according to the moving speeds of terminal and bandwidths to improve the QoS and reduce the handover rate. As an evaluation of the suggested algorithm, a model hierarchical cellular system is constructed and simulations are conducted with various types of traffic. As the result of the simulations, such indices as block rate, drop rate, channel utilization, and the number of inter layer handovers are examined to demonstrate the excellency fo the suggested algorithm.

Motion Estimation Skipping Technique for Fast Motion Estimation (고속 움직임 추정을 위한 움직임 추정 생략 기법)

  • 강현수;박성모
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7C
    • /
    • pp.726-732
    • /
    • 2003
  • The paper proposes a motion estimation (ME) technique to reduce computational complexity. It is achieved by skipping ME process for macro-blocks decided to be in no need of the operation. Thus, it is called ME skipping technique(MEST). In general, the ME is composed of integer pixel precision ME (IME) followed by half pixel precision ME (HME). The MEST is performed just before an IME process and makes a decision on skipping the IME process according to a criterion based on ME errors of adjacent macro-blocks (MBs) already encoded. When the IME process for a MB is decided to be skipped, which is called ME skip mode, the IME process is skipped and the integer pixel precision motion vector of the MB is just replaced by a predicted vector and used as the input of HME. On the other hands, the IME processes for MBs in ME non-skip mode are not skipped but normally performed. Accordingly, the MEST is very effective to reduce computational complexity when MBs in ME skip mode is abundant. In addition, when the MEST is applied to video encoder, it contributes to more accurate rate control and more robusaess for channel errors. It is experimentally shown that the MEST has the above advantages while maintaining good reconstructed image quality.

Performance Evaluation of Scheduling Algorithm for VoIP under Data Traffic in LTE Networks (데이터 트래픽 중심의 LTE망에서 VoIP를 위한 스케줄링 알고리즘 성능 분석)

  • Kim, Sung-Ju;Lee, Jae Yong;Kim, Byung Chul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.12
    • /
    • pp.20-29
    • /
    • 2014
  • Recently, LTE is preparing to make a new leap forward LTE-A all over the world. As LTE privides high speed service, the role of mobile phones seems to change from voice to data service. According to Cisco, global mobile data traffic will increase nearly 11-fold between 2013 and 2018. Mobile video traffic will reach 75% by 2018 from 66% in 2013 in Korea. However, voice service is still the most important role of mobile phones. Thus, controllability of throughput and low BLER is indispensable for high-quality VoIP service among various type of traffic. Although the maximum AMR-WB, 23.85 Kbps is sufficient to a VoIP call, it is difficult for the LTE which can provide tens to hundreds of MB/s may not keep the certain level VoIP QoS especially in the cell-edge area. This paper proposes a new scheduling algorithm in order to improve VoIP performance after analyzing various scheduling algorithms. The proposal is the technology which applies more priority processing for VoIP than other applications in cell-edge area based on two-tier scheduling algorithm. The simulation result shows the improvement of VoIP performance in the view point of throughput and BLER.

An analysis of optimal design conditions of LDPC decoder for IEEE 802.11n Wireless LAN Standard (IEEE 802.11n 무선랜 표준용 LDPC 복호기의 최적 설계조건 분석)

  • Jung, Sang-Hyeok;Na, Young-Heon;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.4
    • /
    • pp.939-947
    • /
    • 2010
  • The LDPC(Low-Density Parity-Check) code, which is one of the channel encoding methods in IEEE 802.11n wireless LAN standard, has superior error-correcting capabilities. Since the hardware complexity of LDPC decoder is high, it is very important to take into account the trade-offs between hardware complexity and decoding performance. In this paper, the effects of LLR(Log-Likelihood Ratio) approximation on the performance of MSA(Min-Sum Algorithm)-based LDPC decoder are analyzed, and some optimal design conditions are derived. The parity check matrix with block length of 1,944 bits and code rate of 1/2 in IEEE 802.11n WLAN standard is used. In the case of $BER=10^{-3}$, the $E_b/N_o$ difference between LLR bit-widths (6,4) and (7,5) is 0.62 dB, and $E_b/N_o$ difference for iteration cycles 6 and 7 is 0.3 dB. The simulation results show that optimal BER performance can be achieved by LLR bit-width of (7,5) and iteration cycle of 7.

Access Frequency Based Selective Buffer Cache Management Strategy For Multimedia News Data (접근 요청 빈도에 기반한 멀티미디어 뉴스 데이터의 선별적 버퍼 캐쉬 관리 전략)

  • Park, Yong-Un;Seo, Won-Il;Jeong, Gi-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.9
    • /
    • pp.2524-2532
    • /
    • 1999
  • In this paper, we present a new buffer pool management scheme designed for video type news objects to build a cost-effective News On Demand storage server for serving users requests beyond the limitation of disk bandwidth. In a News On Demand Server where many of users request for video type news objects have to be serviced keeping their playback deadline, the maximum numbers of concurrent users are limited by the maximum disk bandwidth the server provides. With our proposed buffer cache management scheme, a requested data is checked to see whether or not it is worthy of caching by checking its average arrival interval and current disk traffic density. Subsequently, only granted news objects are permitted to get into the buffer pool, where buffer allocation is made not on the block basis but on the object basis. We evaluated the performance of our proposed caching algorithm through simulation. As a result of the simulation, we show that by using this caching scheme to support users requests for real time news data, compared with serving those requests only by disks, 30% of extra requests are served without additional cost increase.

  • PDF

A Study on Lambertian Color Segmentation and Canny Edge Detection Algorithms for Automatic Display Detection in CamCom (저속 카메라 통신용 자동 디스플레이 검출을 위한 Lambertian 색상 분할 및 Canny Edge Detection 알고리즘 연구)

  • Han, Jungdo;Said, Ngumanov;Vadim, Li;Cha, Jaesang
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.5
    • /
    • pp.615-622
    • /
    • 2018
  • Recent advancements in camera communication (CamCom) technology using visible light exploited to use display as an luminance source to modulate the data for visible light data communication. The existing display-CamCom techniques uses the selected region of interest based camera capturing approach to detect and decode the 2D color coded data on display screen. This is not effective way to do communicate when the user on mobility. This paper propose the automatic display detection using Lambertian color segmentation combined with canny edge detection algorithms for CamCom in order to avoid manual region of interest selection to establish communication link between display and camera. The automatic display detection methods fails using conventional edge detection algorithms when content changes dynamically in displays. In order to solve this problem lambertian color segmentation combined with canny edge detection algorithms are proposed to detect display automatically. This research analysed different algorithms on display edge recognition and measured the performance on rendering dynamically changing content with color code on display. The display detection rate is achieved around 96% using this proposed solutions.

A Design of Memory-efficient 2k/8k FFT/IFFT Processor using R4SDF/R4SDC Hybrid Structure (R4SDF/R4SDC Hybrid 구조를 이용한 메모리 효율적인 2k/8k FFT/IFFT 프로세서 설계)

  • 신경욱
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.430-439
    • /
    • 2004
  • This paper describes a design of 8192/2048-point FFT/IFFT processor (CFFT8k2k), which performs multi-carrier modulation/demodulation in OFDM-based DVB-T receiver. Since a large size FFT requires a large buffer memory, two design techniques are considered to achieve memory-efficient implementation of 8192-point FFT/IFFT. A hybrid structure, which is composed of radix-4 single-path delay feedback (R4SDF) and radix-4 single-path delay commutator (R4SDC), reduces its memory by 20% compared to R4SDC structure. In addition, a memory reduction of about 24% is achieved by a novel two-step convergent block floating-point scaling. As a result, it requires only 57% of memory used in conventional design, reducing chip area and power consumption. The CFFT8k2k core is designed in Verilog-HDL, and has about 102,000 Bates, RAM of 292k bits, and ROM of 39k bits. Using gate-level netlist with SDF which is synthesized using a $0.25-{\um}m$ CMOS library, timing simulation show that it can safely operate with 50-MHz clock at 2.5-V supply, resulting that a 8192-point FFT/IFFT can be computed every 164-${\mu}\textrm{s}$. The functionality of the core is fully verified by FPGA implementation, and the average SQNR of 60-㏈ is achieved.

A Review of the Legal Nature that Users of the Virtual Currency Exchange Obtain and the Compensation Responsibility for the Damages Caused By Internet Problems or Network Errors (가상통화거래소 이용자가 가지는 법적 성격과 전산장애로 인한 손해배상 책임 연구)

  • Choi, JangWon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.11
    • /
    • pp.287-294
    • /
    • 2018
  • This thesis covers legal aspects of the crypto-currency exchange and the legal rights of crypto-currencies holders. Unlike financial markets in which central authorities or intermediaries determine the validity of transactions and manage records, crypto-currency markets utilize a decentralization system based on block chain technology. Such distinct characteristics distinguish crypto-currency from currency, notes, or financial instruments. Therefore, we need to check closely the legal principles that are applicable to crypto-currency. Crypto-currency users possess rights indirectly through the crypto-currency exchange. However, we should look at whether crypto-currency can be an object of ownership. This research found that legal protection for crypto-currency exchanges are limited. Domestic laws have many shortcomings to protect users' rights. This study found that users who incurred damages due to internet computation errors at exchanges require a protective system like stock markets. Therefore, studies on the legal controls and system regulations are required to protect users' rights. Also, crypto-currency information exchanges keep inside and protections for users' private information need to be further examined.

The Impact of Blockchain Technology on Banks' Conventional Trade Settlements (블록체인기술이 무역결제방식에 미치는 영향에 관한 연구)

  • Zhao, Xiao;Hwang, Ki-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.3
    • /
    • pp.346-354
    • /
    • 2021
  • Since 2015, Blockchain has experienced rapid development throughout the world, institutions including Central Banks, Government Departments, Commercial Banks, IT Giants are all accelerating their exploration on Blockchain, and investment on Blockchain related R&D departments and start-up companies also shows explosive growth. This paper studies the impact of blockchain technology on banks' conventional trade settlement methods and describes blockchain technology in term of its concepts, advantages, and disadvantages. It also studies the application processes of blockchain technology combined with conventional trade settlement methods (remittance, collection, and L/C), and analyzes the positive and negative impacts of blockchain technology on the conventional trade settlement methods. In addition, this paper lists the blockchain application cases, analyzes the technology development status and existing problems, and puts forward suggestions and measures for the development of blockchain finance in China based on the case analysis and impact research.