• Title/Summary/Keyword: prefix

Search Result 319, Processing Time 0.026 seconds

Data Transmission Rate Improvement Scheme in Power Line Communication System for Smart Grid (스마트 그리드를 위한 전력선 통신 시스템에서의 데이터 전송률 향상 기법)

  • Kim, Yo-Cheol;Bae, Jung-Nam;Kim, Yoon-Hyun;Kim, Jin-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1183-1191
    • /
    • 2010
  • In this paper, I propose an adaptive OFDM CP length algorithm for in PLC systems for smart grid. The proposed scheme calculates the channel delay information at the CP controller of the receiver by taking correlation between a received data frame and the following delayed one. The CP controller, immediately, feeds back the channel delay information to the transmitter. Then, the transmitter adapts CP length for next data frame. As an impulsive noise model, Middleton Class A interference model was employed. The performance is evaluated in terms of packet data rate, cumulative packet data rate, and bit error rate (BER). The simulation results showed data gain (which is the amount of the reduced bits) gets larger as the number of packets increase, but the amount of data gain reduced as the number of branches ($N_{br}$) increase. In respects of BER for the cases $N_{br}$ is 3, 4, and 5, performance of the adaptive CP length algorithm and the fixed CP scheme are similar. Therefore, it is confirmed the proposed scheme achieved data rate increment without BER performance reduction compared to the conventional fixed CP length scheme.

A Study on the Efficient Algorithm for Converting Range Matching Rules into TCAM Entries in the Packet Filtering System (패킷 필터링 시스템에서 범위 규칙의 효율적 TCAM 엔트리 변환 알고리즘 연구)

  • Kim, Yong-Kwon;Cho, Hyun-Mook;Choe, Jin-Kyu;Lee, Kyou-Ho;Ki, Jang-Geun
    • Journal of IKEEE
    • /
    • v.9 no.1 s.16
    • /
    • pp.19-30
    • /
    • 2005
  • Packet classification is defined as the action to match the packet with a set of predefined rules. One of classification is to use Ternary Content Addressable Memory hardware search engine that has faster than other algorithmic methods. However, TCAM has some limitations. One of them is that TCAM can not perform range matching efficiently. A range has to be expanded into prefixes to fit the boundary. In general, the number of expansion could be up to 2w-2, where w is the width of the field. For example, if two range fields with 16 bits are used, there could be up to $30\;{\times}\;30\;=\;900$ expansions for a single rule. In this paper, we describe the novel algorithm for converting range matching rules into TCAM entry efficiently. The number of maximum entry is 2w-4 when using the algorithm. Furthermore, it has also benefit about the negation range. In the result of experimentation, the new scheme practically reduces 14 percent in case that searched fields are source port and destination port number.

  • PDF

Enhanced Spatial Covariance Matrix Estimation for Asynchronous Inter-Cell Interference Mitigation in MIMO-OFDMA System (3GPP LTE MIMO-OFDMA 시스템의 인접 셀 간섭 완화를 위한 개선된 Spatial Covariance Matrix 추정 기법)

  • Moon, Jong-Gun;Jang, Jun-Hee;Han, Jung-Su;Kim, Sung-Soo;Kim, Yong-Serk;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5C
    • /
    • pp.527-539
    • /
    • 2009
  • In this paper, we propose an asynchonous ICI (Inter-Cell Interference) mitigation techniques for 3GPP LTE MIMO-OFDMA down-link receiver. An increasing in symbol timing misalignments may occur relative to sychronous network as the result of BS (Base Station) timing differences. Such symbol synchronization errors that exceed the guard interval or the cyclic prefix duration may result in MAI (Multiple Access Interference) for other carriers. In particular, at the cell boundary, this MAI becomes a critical factor, leading to degraded channel throughput and severe asynchronous ICI. Hence, many researchers have investigated the interference mitigation method in the presence of asynchronous ICI and it appears that the knowledge of the SCM (Spatial Covariance Matrix) of the asynchronous ICI plus background noise is an important issue. Generally, it is assumed that the SCM estimated by using training symbols. However, it is difficult to measure the interference statistics for a long time and training symbol is also not appropriate for MIMO-OFDMA system such as LTE. Therefore, a noise reduction method is required to improve the estimation accuracy. Although the conventional time-domain low-pass type weighting method can be effective for noise reduction, it causes significant estimation error due to the spectral leakage in practical OFDM system. Therefore, we propose a time-domain sinc type weighing method which can not only reduce the noise effectively minimizing estimation error caused by the spectral leakage but also implement frequency-domain moving average filter easily. By using computer simulation, we show that the proposed method can provide up to 3dB SIR gain compared with the conventional method.

IRFP-tree: Intersection Rule Based FP-tree (IRFP-tree(Intersection Rule Based FP-tree): 메모리 효율성을 향상시키기 위해 교집합 규칙 기반의 패러다임을 적용한 FP-tree)

  • Lee, Jung-Hun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.3
    • /
    • pp.155-164
    • /
    • 2016
  • For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.

A Filtering Technique of Streaming XML Data based Postfix Sharing for Partial matching Path Queries (부분매칭 경로질의를 위한 포스트픽스 공유에 기반한 스트리밍 XML 데이타 필터링 기법)

  • Park Seog;Kim Young-Soo
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.138-149
    • /
    • 2006
  • As the environment with sensor network and ubiquitous computing is emerged, there are many demands of handling continuous, fast data such as streaming data. As work about streaming data has begun, work about management of streaming data in Publish-Subscribe system is started. The recent emergence of XML as a standard for information exchange on Internet has led to more interest in Publish - Subscribe system. A filtering technique of streaming XML data in the existing Publish- Subscribe system is using some schemes based on automata and YFilter, which is one of filtering techniques, is very popular. YFilter exploits commonality among path queries by sharing the common prefixes of the paths so that they are processed at most one and that is using the top-down approach. However, because partial matching path queries interrupt the common prefix sharing and don't calculate from root, throughput of YFilter decreases. So we use sharing of commonality among path queries with the common postfixes of the paths and use the bottom-up approach instead of the top-down approach. This filtering technique is called as PoSFilter. And we verify this technique through comparing with YFilter about throughput.

Representational aspects and effects of K-food in K-content (K콘텐츠에서 K푸드 표상 양상과 효과)

  • Jaeeung Yoo;Hyunkyung Lee
    • The Journal of the Convergence on Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.165-170
    • /
    • 2024
  • 'K-contents' is in the spotlight worldwide. As the prefix 'K' became popular, interest in K-food(Korean food) also increased. Various studies on K-contents are being conducted, but research on K-food is still very limited. References and articles about K-food are mainly limited to the overseas expansion, marketing status, and sales of domestic brands, and a few research papers deal with only cases of a specific brand's overseas expansion. This paper aims to analyze how K-food is represented in TV unscripted shows and TV series produced in Korea and what their effects are through empirical works. Among the unscripted shows based on food, they are estimated that the point of competitiveness as K contents deal with foreigners' Korean food experiences. Representative examples here are the way foreigners who visit Korea experience Korean food as part of their Korean culture experience, or the type of temporarily setting up a restaurant overseas to sell Korean food to local people. However, the problem with such shows are that it lacks long-term appeal because it is based on the 'Gukbbong(a slang term for 'extreme nationalism')' sentiment. The exposure of K-food in K-contents creates a tremendous advertising effect. It is judged that the current status and analysis of K-contents based on K-food can help establish the direction of future program production and the identity of K-food.

A study of Development of Transmission Systems for Terrestrial Single Channel Fixed 4K UHD & Mobile HD Convergence Broadcasting by Employing FEF (Future Extension Frame) Multiplexing Technique (FEF (Future Extension Frame) 다중화 기법을 이용한 지상파 단일 채널 고정 4K UHD & 이동 HD 융합방송 전송시스템 개발에 관한 연구)

  • Oh, JongGyu;Won, YongJu;Lee, JinSeop;Kim, JoonTae
    • Journal of Broadcast Engineering
    • /
    • v.20 no.2
    • /
    • pp.310-339
    • /
    • 2015
  • In this paper, the possibility of a terrestrial fixed 4K UHD (Ultra High Definition) and mobile HD (High Definition) convergence broadcasting service through a single channel employing the FEF (Future Extension Frame) multiplexing technique in DVB (Digital Video Broadcasting)-T2 (Second Generation Terrestrial) systems is examined. The performance of such a service is also investigated. FEF multiplexing technology can be used to adjust the FFT (fast Fourier transform) and CP (cyclic prefix) size for each layer, whereas M-PLP (Multiple-Physical Layer Pipe) multiplexing technology in DVB-T2 systems cannot. The convergence broadcasting service scenario, which can provide fixed 4K UHD and mobile HD broadcasting through a single terrestrial channel, is described, and transmission requirements of the SHVC (Scalable High Efficiency Video Coding) technique are predicted. A convergence broadcasting transmission system structure is described by employing FEF and transmission technologies in DVB-T2 systems. Optimized transmission parameters are drawn to transmit 4K UHD and HD convergence broadcasting by employing a convergence broadcasting transmission structure, and the reception performance of the optimized transmission parameters under AWGN (additive white Gaussian noise), static Brazil-D, and time-varying TU (Typical Urban)-6 channels is examined using computer simulations to find the TOV (threshold of visibility). From the results, for the 6 and 8 MHz bandwidths, reliable reception of both fixed 4K UHD and mobile HD layer data can be achieved under a static fixed and very fast fading multipath channel.

Digital painting: Image transfonnation, simulation, heterologie and transfonnation (현대회화에서의 형태와 물질 -Digital Transfiguration에 관한 연구-)

  • Jeong, Suk-Yeong
    • Journal of Science of Art and Design
    • /
    • v.10
    • /
    • pp.161-181
    • /
    • 2006
  • The words which appeared in my theoretical study and work are image transformation to digital painting, simulation, heterologie and transfiguration, etc. Firstly, let's look into 'digital era' or 'new media era'. Nowadays, the image world including painting within the rapid social and cultural change, which is called as digital era, is having the dramatic change. Together with the development of scientific technology, large number of events which was deemed to be impossible is happening as real in image world Moreover, these changes in image world is greatly influencing to our life. The word which compresses this change of image world and shows is 'digital'. Digit, which means fingers in Latin, indicates separately changing signal, and to be more narrow, it indicates the continual signal of '0' and ' 1' in computer. The opposite word is 'analogue'. As analogue is the word meaning 'infer' or 'similarity', it indicates the signal or form which continuously changes along the series of time when it is compared to digital. Instead of analogue, digital is embossed as a major ruler along the whole area of our current culture. In whole culture and art area, and in whole generalscience, digital is appearing as it has the modernism and importance. The prefix, 'digital', e.g. digital media, digital culture, digital design, digital philosophy, etc, is treated as the synonym of modernism and something new. This advent of digital results the innovative change to the image world, creates the new beauty experience which we could not experience before, and forecasts the formation of advanced art and expansion of creative area. Various intellectual activities using computer is developing the whole world with making the infrastructure. Computer in painting work immediately accomplishes the idea of painters, takes part in simulation work, contingency such as abrupt reversal, extraction, twisting, shaking, obscureness, overlapping, etc, and timing to stimulate the creativity of painters, and provides digital formative language which enables new visual experience to the audience. When the change of digital era, the image appeared in my work is shown in 'transfiguration' like drawing. The word, 'transfiguration' does not indicate the completed and fixed real substance but indicate endlessly moving and floating shape. Thus, this concept is opposite to the substantial consideration, so that various concepts which is able to replace this in accordance with the similar cases are also exist such as change, deterioration, mutation, deformity of appearance and morphing which is frequently used in computer as a technical word. These concepts are not clearly classified, and variably and complicatedly related. Transfiguration basically means the denial of "objectivity' and '(continual) stagnation' or deviation from those. This phenomenon is appeared through the all art schools of art ever since the realism is denied in the 19th century. It is called as 'deformation' in case of expressionism, futurism, cubism, etc, in the beginning of the century, which its former indication is mostly preserved within the process of structural deviation and which has the realistic limit which should be preserved. On the contrary, dramatic transfiguration which has been showing in the modern era through surrealism is different in the point that dramatic transfiguration tends to show the deterioration and deviation rather than the preservation of indicated object. From this point, transfiguration coming out from morphing using computer deteriorates and hides the reality and furthermore, it replaces the 'reality'. Moreover, transfiguration is closely approached to the world of fake or 'imaginary' simulation world of Baudrillard. According to Baudrillard, the image hides and deteriorates the reality, and furthermore, expresses 'not existing' to 'imaginary' under the name of transfiguration. Certain reality, that is, image which is absent from the reality is created and overflowed, so that it finally replaces the reality. This is simulation as it is said by Baudrillard. In turn, Georges Bataille discusses about the image which is produced by digital technology in terms of heterologie. Image of heterologie is the visual signal which is established with the media. Image of media is to have the continuous characteristics of produce, extinction, and transformation, and its clear boundary between images becomes meaningless. The meaning of composition, excess, violation, etc of digital image is explained to heterological study or heteologie suggested as important meaning of Georges Bataille who is a heretic philosopher. As the form and image of mutation shows the shape in accordance with mechanical production, heterologie is introduced as very low materialism (or bas materialisme), in this theory. Heterologie as low materialism which is gradually changing is developing as a different concept and analysis because of the change of time in the late 20s century beside high or low meaning. Including my image, all images non-standardizes and transforms the code. However, reappearance and non-standardization of this code does not seem to be simple. The problem of transformation caused by transfiguration which appears in my digital drawing painting, simulation, heterologie, etc, are the continual problems. Moreover, the subject such as existence of human being, distance from the real life, politics and social problems are being extended to actual research and various expressing work. Especially, individual image world is established by digital painting transfiguration technique, and its change and review start to have the durability. The consciousness of observers who look at the image is changing the subject. Together with theoretical research, researchers are to establish the first step to approach to various image change of digital era painting through transfiguration technique using our realistic and historical image.

  • PDF

Adaptive RFID anti-collision scheme using collision information and m-bit identification (충돌 정보와 m-bit인식을 이용한 적응형 RFID 충돌 방지 기법)

  • Lee, Je-Yul;Shin, Jongmin;Yang, Dongmin
    • Journal of Internet Computing and Services
    • /
    • v.14 no.5
    • /
    • pp.1-10
    • /
    • 2013
  • RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.