• Title/Summary/Keyword: 멀티미디어 통신

Search Result 3,301, Processing Time 0.031 seconds

The Integer Number Divider Using Improved Reciprocal Algorithm (개선된 역수 알고리즘을 사용한 정수 나눗셈기)

  • Song, Hong-Bok;Park, Chang-Soo;Cho, Gyeong-Yeon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.7
    • /
    • pp.1218-1226
    • /
    • 2008
  • With the development of semiconductor integrated technology and with the increasing use of multimedia functions in computer, more functions have been implemented as hardware. Nowadays, most microprocessors beyond 32 bits generally implement an integer multiplier as hardware. However, as for a divider, only specific microprocessor implements traditional SRT algorithm as hardware due to complexity of implementation and slow speed. This paper suggested an algorithm that uses a multiplier, 'w bit $\times$ w bit = 2w bit', to process $\frac{N}{D}$ integer division. That is, the reciprocal number D is first calculated, and then multiply dividend N to process integer division. In this paper, when the divisor D is '$D=0.d{\times}2^L$, 0.5 < 0.d < 1.0', approximate value of ' $\frac{1}{D}$', '$1.g{\times}2^{-L}$', which satisfies ' $0.d{\times}1.g=1+e$, $e<2^{-w}$', is defined as over reciprocal number and then an algorithm for over reciprocal number is suggested. This algorithm multiplies over reciprocal number '$01.g{\times}2^{-L}$' by dividend N to process $\frac{N}{D}$ integer division. The algorithm suggested in this paper doesn't require additional revision, because it can calculate correct reciprocal number. In addition, this algorithm uses only multiplier, so additional hardware for division is not required to implement microprocessor. Also, it shows faster speed than the conventional SRT algorithm and performs operation by word unit, accordingly it is more suitable to make compiler than the existing division algorithm. In conclusion, results from this study could be used widely for implementation SOC(System on Chip) and etc. which has been restricted to microprocessor and size of the hardware.

Design and Implementation of Clipcast Service via Terrestrial DMB (지상파 DMB를 이용한 클립캐스트 서비스 설계 및 구현)

  • Cho, Suk-Hyun;Seo, Jong-Soo
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.23-32
    • /
    • 2011
  • Design and Implementation of Clipcast Service via Terrestrial DMB This paper outlines the system design and the implementation process of clipcast service that can send clips of video, mp3, text, images, etc. to terrestrial DMB terminals. To provide clipcast service in terrestrial DMB, a separate data channel needs to be allocated and this requires changes in the existing bandwidth allocation. Clipcast contents can be sent after midnight at around 3 to 4 AM, when terrestrial DMB viewship is low. If the video service bit rate is lowered to 352 Kbps and the TPEG service band is fully used, then 320 Kbps bit rate can be allocated to clipcast. To enable clipcast service, the terminals' DMB program must be executed, and this can be done through SMS and EPG. Clipcast service applies MOT protocol to transmit multimedia objects, and transmits twice in carousel format for stable transmission of files. Therefore, 72Mbyte data can be transmitted in one hour, which corresponds to about 20 minutes of full motion video service at 500Kbps data rate. When running the clip transmitted through terrestrial DMB data channel, information regarding the length of each clip is received through communication with the CMS(Content Management Server), then error-free files are displayed. The clips can be provided to the users as preview contents of the complete VOD contents. In order to use the complete content, the user needs to access the URL allocated for that specific content and download the content by completing a billing process. This paper suggests the design and implementation of terrestrial DMB system to provide clipcast service, which enables file download services as provided in MediaFLO, DVB-H, and the other mobile broadcasting systems. Unlike the other mobile broadcasting systems, the proposed system applies more reliable SMS method to activate the DMB terminals for highly stable clipcast service. This allows hybrid, i.e, both SMS and EPG activations of terminals for clipcast services.

A Study on Mobile Antenna System Design with Tri-band Operation for Broadband Satellite Communications and DBS Reception (광대역 위성 통신/방송용 삼중 대역 이동형 안테나 시스템 설계에 관한 연구)

  • Eom Soon-Young;Jung Young-Bae;Son Seong-Ho;Yun Jae-Seung;Jeon Soon-Ick
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.17 no.5 s.108
    • /
    • pp.461-475
    • /
    • 2006
  • In this paper, it is described about the tri-band mobile antenna system design to provide broadband multimedia and direct broadcasting services using goo-stationary Koreasat 3, simultaneously operated in Ka/K/Ku band. The radiating part of the antenna system with a fan beam characteristic in the elevation plane is composed of the quasi-offset dual shaped reflector and the tri-band feeder. The tri-band feeder is also composed of the Ka/K dual band feeder with the protruding dielectric rod, the circular polarizer, the ortho-mode transducer and the circular-polarized Ku band feed array. Especially, the Ka/K dual band circular polarizer was realized firstly using the comb-type structure. For fast satellite-tracking on the movement, the Ku band feed array has the structure of the $2{\times}2$ active phased array which can make electrical beams. And, the circular-polarized characteristic in the feed array was improved by $90^{\circ}$ rotating arrangement of four radiating elements polarized circularly by a $90^{\circ}$ hybrid coupler, respectively. Four beam forming channels to make electrical beams at Ku band are divided into the main beam channel and the tracking beam channel in the output, and noise temperature characteristics of each channel were analyzed on the basis of the contributions of internal sub_units. From the fabricated antenna system, the output power at $P_{1dBc}$ of Ka_Tx channel was measured more than 34.1 dBm and the measured noise figures of K/Ku_Rx channels were less than 2.4 dB and 1.5 dB, respectively, over the operating band. The radiation patterns with co- and cross-polarization in the tri-band were measured using a near-field measurement in the anechoic chamber. Especially, Ku radiation patterns were measured after correcting each initial phase of active channels with partial radiation patterns obtained from the independent excitation of each channel. The antenna gains measured in Ka/K/Ku band of the antenna system were more than 39.6 dBi, 37.5 dBi, 29.6 dBi, respectively. And, the antenna system showed good system performances such as Ka_Tx EIRP more than 43.7 dBW and K/Ku_Rx G/T more than 13.2 dB/K and 7.12 dB/K, respectively.

A Variable Latency Goldschmidt's Floating Point Number Square Root Computation (가변 시간 골드스미트 부동소수점 제곱근 계산기)

  • Kim, Sung-Gi;Song, Hong-Bok;Cho, Gyeong-Yeon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.188-198
    • /
    • 2005
  • The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

A Variable Latency Goldschmidt's Floating Point Number Divider (가변 시간 골드스미트 부동소수점 나눗셈기)

  • Kim Sung-Gi;Song Hong-Bok;Cho Gyeong-Yeon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.2
    • /
    • pp.380-389
    • /
    • 2005
  • The Goldschmidt iterative algorithm for a floating point divide calculates it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's divide algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To calculate a floating point divide '$\frac{N}{F}$', multifly '$T=\frac{1}{F}+e_t$' to the denominator and the nominator, then it becomes ’$\frac{TN}{TF}=\frac{N_0}{F_0}$'. And the algorithm repeats the following operations: ’$R_i=(2-e_r-F_i),\;N_{i+1}=N_i{\ast}R_i,\;F_{i+1}=F_i{\ast}R_i$, i$\in${0,1,...n-1}'. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than ‘$e_r=2^{-p}$'. The value of p is 29 for the single precision floating point, and 59 for the double precision floating point. Let ’$F_i=1+e_i$', there is $F_{i+1}=1-e_{i+1},\;e_{i+1}',\;where\;e_{i+1}, If '$[F_i-1]<2^{\frac{-p+3}{2}}$ is true, ’$e_{i+1}<16e_r$' is less than the smallest number which is representable by floating point number. So, ‘$N_{i+1}$ is approximate to ‘$\frac{N}{F}$'. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables ($T=\frac{1}{F}+e_t$) with varying sizes. 1'he superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a divider. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc

A Study of design component of character that appear Mobile game (모바일게임에 나타난 캐릭터의 디자인요소에 관한 연구)

  • Choi, Tae-Jun;Ryu, Seuc-Ho;Lee, Heung-Woo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.05a
    • /
    • pp.204-210
    • /
    • 2006
  • Mobile phone has become one of the most essential thing in modern life. In the past, it was only means of cummunication among people. But now, the function of mobile phone is getting diversified. People listen to music, take pictures and play games with their mobile phone. According to the Research in Jan. 2005, members of Korean 3 mobile cummunication companies were 36 million. And the Research in Jan. 2006 shows that number of 2 million and 16 thousand of members are incresed in a year. (36million to 38million 16 thousands) Mobile game is the most popular fuction among teenagers. People like mobile game becase they can enjoy the mobile game anywhere with easy and simple way. So some companies are even launching dedicated phone for mobile game. And with the unification of platform, people can enjoy various kinds of mobile game now. Most of the mobile character bobies are divided into 2 parts such as 'Head parts' and 'Body parts'. If the body is divided into more than 4 parts, it is difficult to express emotions and actions of the character becase of the small screen of mobile phone. That is why most of the characters have 2 parts - divided body. I stadied how the Design Factor of Mobile Characters such as materials of characters, shape of characters and Frame of accessory's movement are used in the mobile game.

  • PDF

Non-Disruptive Server Management for Sustainable Resource Service Based on On-Premise (온-프레미스 기반 지속적인 자원 서비스를 위한 서버 무중단 기법)

  • Kim, Hyun-Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.12
    • /
    • pp.295-300
    • /
    • 2018
  • The rapid development of IT, many conventional passive jobs have been automated. This automation increases the leisure time of many people and various services are being developed for them. In addition, with the advent of smart devices that are compact and portable, it is possible to use various internet services without any time and place discretion. Various studies based on virtualization are under way to efficiently store and process large data generated by many devices and services. Desktop Storage Virtualization (DSV), which integrates and provides users with on-premise-based distributed desktop resources during these studies, uses virtualization to consolidate unused resources within distributed, legacy desktops. This DSV is very important for providing high reliability to users. In addition, research on hierarchical structure and resource integration for efficient data distribution storage processing in a distributed desktop-based resource integration environment is underway. However, there is a lack of research on efficient operation in case of server failure in on-premise resource integration environment. In this paper, we propose Non-disruptive Server Management (NSM) which can actively cope with the failure of desktop server in distributed desktop storage environment based on on-premise. NSM is easy to add and remove desktops in a desktop-based integrated environment. In addition, an alternative server is actively performed in response to a failure occurrence.

Multi-blockchain model ensures scalability and reliability based on intelligent Internet of Things (지능형 사물인터넷 기반의 확장성과 신뢰성을 보장하는 다중 블록체인 모델)

  • Jeong, Yoon-Su;Kim, Yong-Tae
    • Journal of Convergence for Information Technology
    • /
    • v.11 no.3
    • /
    • pp.140-146
    • /
    • 2021
  • As the environment using intelligent IoT devices increases, various studies are underway to ensure the integrity of information sent and received from intelligent IoT devices. However, all IoT information generated in heterogeneous environments is not fully provided with reliable protocols and services. In this paper, we propose an intelligent-based multi-blockchain model that can extract only critical information among various information processed by intelligent IoT devices. In the proposed model, blockchain is used to ensure the integrity of IoT information sent and received from IoT devices. The proposed model uses the correlation index of the collected information to trust a large number of IoT information to extract only the information with a high correlation index and bind it with blockchain. This is because the collected information can be extended to the n-tier structure as well as guaranteed reliability. Furthermore, since the proposed model can give weight information to the collection information based on blockchain, similar information can be selected (or bound) according to priority. The proposed model is able to extend the collection information to the n-layer structure while maintaining the data processing cost processed in real time regardless of the number of IoT devices.

IoT data processing techniques based on machine learning optimized for AIoT environments (AIoT 환경에 최적화된 머신러닝 기반의 IoT 데이터 처리 기법)

  • Jeong, Yoon-Su;Kim, Yong-Tae
    • Journal of Industrial Convergence
    • /
    • v.20 no.3
    • /
    • pp.33-40
    • /
    • 2022
  • Recently, IoT-linked services have been used in various environments, and IoT and artificial intelligence technologies are being fused. However, since technologies that process IoT data stably are not fully supported, research is needed for this. In this paper, we propose a processing technique that can optimize IoT data after generating embedded vectors based on machine learning for IoT data. In the proposed technique, for processing efficiency, embedded vectorization is performed based on QR such as index of IoT data, collection location (binary values of X and Y axis coordinates), group index, type, and type. In addition, data generated by various IoT devices are integrated and managed so that load balancing can be performed in the IoT data collection process to asymmetrically link IoT data. The proposed technique processes IoT data to be orthogonalized based on hash so that IoT data can be asymmetrically grouped. In addition, interference between IoT data may be minimized because it is periodically generated and grouped according to IoT data types and characteristics. Future research plans to compare and evaluate proposed techniques in various environments that provide IoT services.

Developed an output device for high-frequency cosmetic medical equipment using micro multi-needle (마이크로 멀티니들을 이용한 고주파 피부미용 의료기기를 위한 출력 장치 개발)

  • Kim, Jun-tae;Joo, Kyu-tai;Cha, Eun Jong;Kim, Myung-mi;Jeong, Jin-hyoung
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.5
    • /
    • pp.394-402
    • /
    • 2021
  • The entry of an aging society and the extension of human life expectancy, the increasing interest in women's social advancement and men's appearance, and the natural interest in K-culture through media media, while receiving worldwide attention, Focus on K-Bueaty. Recently, looking at the occupation of the medical tourism field, in the case of aesthetic medicine tourism such as molding and dermatology, it has gained popularity not only in Asia such as China and Japan, but also in North America and Europe. The first external confirmation of human aging is the wrinkles on the skin of the face. Clean, wrinkle-free, elastic and healthy skin is a desire of most people. Skin condition and condition such as focused ultrasonic stimulation (HIFU: High Intensity Focused Utrasound) and low frequency, high frequency (RF: Radio Frequency), galvanic therapy using microcurrent, cryotherapy using rapid cooling, etc. Depending on the method of management, the effect of the treatment differs depending on the output and the stimulation site, etc., even in the treatment of medical equipment and beauty equipment using the same mechanism. In this research, in order to develop invasive high-frequency dermatological devices using a large number of beauty medical devices and microneedles of beauty devices, the international standards IEC 60601-2 (standards for individual medical devices) and MFDS (Ministry of) We designed and developed a high-frequency output device in compliance with the high-frequency stimulation standard announced in the Food and Drug Safety (Ministry of Food and Drug Safety). The circuit design consists of an amplifier (AMP: Amplifier) using Class-A Topology and a power supply device using Half-Bridge Topology. As a result of measuring the developed high-frequency output device, an average efficiency of 63.86% was obtained, and the maximum output was measured at 116.7W and 50.67dBm.