• Title/Summary/Keyword: Area Throughput

Search Result 459, Processing Time 0.022 seconds

Performance Evaluation of a Enhanced Network Coding Scheme using NS2 (NS2를 이용한 향상된 네트워크 코딩 기법의 성능평가)

  • Kim, Kwan-Woong;Kim, Yong-Kab;Kim, Byun-Gon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.10
    • /
    • pp.2281-2287
    • /
    • 2013
  • Network Coding(NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. Network Coding has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Prior researches have been carried out to employ network coding to wireless ad-hoc network. In our study, intermediate nodes identify one-hop bidirectional flows for network coding decision. We expect that the proposed scheme shall improve decoding success rate of network coded packet. From the simulation, the proposed network coding scheme achieved better performance in terms of coding gain and packet delivery rate than traditional network coding scheme.

Fine-scalable SPIHT Hardware Design for Frame Memory Compression in Video Codec

  • Kim, Sunwoong;Jang, Ji Hun;Lee, Hyuk-Jae;Rhee, Chae Eun
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.17 no.3
    • /
    • pp.446-457
    • /
    • 2017
  • In order to reduce the size of frame memory or bus bandwidth, frame memory compression (FMC) recompresses reconstructed or reference frames of video codecs. This paper proposes a novel FMC design based on discrete wavelet transform (DWT) - set partitioning in hierarchical trees (SPIHT), which supports fine-scalable throughput and is area-efficient. In the proposed design, multi-cores with small block sizes are used in parallel instead of a single core with a large block size. In addition, an appropriate pipelining schedule is proposed. Compared to the previous design, the proposed design achieves the processing speed which is closer to the target system speed, and therefore it is more efficient in hardware utilization. In addition, a scheme in which two passes of SPIHT are merged into one pass called merged refinement pass (MRP) is proposed. As the number of shifters decreases and the bit-width of remained shifters is reduced, the size of SPIHT hardware significantly decreases. The proposed FMC encoder and decoder designs achieve the throughputs of 4,448 and 4,000 Mpixels/s, respectively, and their gate counts are 76.5K and 107.8K. When the proposed design is applied to high efficiency video codec (HEVC), it achieves 1.96% lower average BDBR and 0.05 dB higher average BDPSNR than the previous FMC design.

A Novel Adaptive Routing Algorithm for Delay-Sensitive Service in Multihop LEO Satellite Network

  • Liu, Liang;Zhang, Tao;Lu, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3551-3567
    • /
    • 2016
  • The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.

Low Complexity Gradient Magnitude Calculator Hardware Architecture Using Characteristic Analysis of Projection Vector and Hardware Resource Sharing (정사영 벡터의 특징 분석 및 하드웨어 자원 공유기법을 이용한 저면적 Gradient Magnitude 연산 하드웨어 구현)

  • Kim, WooSuk;Lee, Juseong;An, Ho-Myoung
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.4
    • /
    • pp.414-418
    • /
    • 2016
  • In this paper, a hardware architecture of low area gradient magnitude calculator is proposed. For the hardware complexity reduction, the characteristic of orthogonal projection vector and hardware resource sharing technique are applied. The proposed hardware architecture can be implemented without degradation of the gradient magnitude data quality since the proposed hardware is implemented with original algorithm. The FPGA implementation result shows the 15% of logic elements and 38% embedded multiplier savings compared with previous work using Altera Cyclone VI (EP4CE115F29C7N) FPGA and Quartus II v15.0 environment.

Coexistence of RFID and USN Systems in the Frequency Bands 908.5~914MHz (908.5~914MHz 대역에서 RFID와 USN 시스템의 주파수 공유 조건에 관한 연구)

  • Yoon, Hyun-Goo;Kang, Min-Soo;Jang, Byung-Jun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.6
    • /
    • pp.647-656
    • /
    • 2008
  • In this paper, we present interference power distribution results when radio frequency identification(RFID) and ubiquitous sensor network(USN) systems share the $908.5{\sim}914MHz$ frequency bands. Average interference powers are obtained by simulation and statistical analysis, respectively. Simulation results are then verified by statistical analysis. According to the number of interferers and the diameter of the protection area, the cumulative density functions(CDFs) of interference power are simulated under the various conditions. From the simulation results, the probability that both USN and RFID systems meet the required maximal interference power levels is 95 % on condition that there are 1 low revered RFID reader and several USN nodes and that the minimum distance between a RFID reader and an USN node is greater than 1 m. Our results can be used as an basic research for coexistence analysis of RFID and USN systems in the $908.5{\sim}914MHz$ frequency bands.

CRP-CMAC: A Priority-Differentiated Cooperative MAC Protocol with Contention Resolution for Multihop Wireless Networks

  • Li, Yayan;Liu, Kai;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2636-2656
    • /
    • 2013
  • To improve the cooperative efficiency of node cooperation and multiple access performance for multihop wireless networks, a priority-differentiated cooperative medium access control protocol with contention resolution (CRP-CMAC) is proposed. In the protocol, the helper selection process is divided into the priority differentiation phase and the contention resolution phase for the helpers with the same priority. A higher priority helper can choose an earlier minislot in the priority differentiation phase to send a busy tone. As a result, the protocol promptly selects all the highest priority helpers. The contention resolution phase of the same priority helpers consists of k round contention resolution procedures. The helpers that had sent the first busy tone and are now sending the longest busy tone can continue to the next round, and then the other helpers that sense the busy tone withdraw from the contention. Therefore, it can select the unique best helper from the highest priority helpers with high probability. A packet piggyback mechanism is also adopted to make the high data rate helper with packet to send transmit its data packets to its recipient without reservation. It can significantly decrease the reservation overhead and effectively improve the cooperation efficiency and channel utilization. Simulation results show that the maximum throughput of CRP-CMAC is 74%, 36.1% and 15% higher than those of the 802.11 DCF, CoopMACA and 2rcMAC protocols in a wireless local area network (WLAN) environment, and 82.6%, 37.6% and 46.3% higher in an ad hoc network environment, respectively.

$Cu_2ZnSnS_4$ Thin Film Absorber Synthesized by Chemical Bath Deposition for Solar Cell Applications

  • Arepalli, Vinaya Kumar;Kumar, Challa Kiran;Park, Nam-Kyu;Nang, Lam Van;Kim, Eui-Tae
    • Proceedings of the Materials Research Society of Korea Conference
    • /
    • 2011.10a
    • /
    • pp.35.1-35.1
    • /
    • 2011
  • New photovoltaic (PV) materials and manufacturing approaches are needed for meeting the demand for lower-cost solar cells. The prototypal thin-film photovoltaic absorbers (CdTe and $Cu(In,Ga)Se_2$) can achieve solar conversion efficiencies of up to 20% and are now commercially available, but the presence of toxic (Cd,Se) and expensive elemental components (In, Te) is a real issue as the demand for photovoltaics rapidly increases. To overcome these limitations, there has been substantial interest in developing viable alternative materials, such as $Cu_2ZnSnS_4$ (CZTS) is an emerging solar absorber that is structurally similar to CIGS, but contains only earth abundant, non-toxic elements and has a near optimal direct band gap energy of 1.4~1.6 ev and a large absorption coefficient of ${\sim}10^4\;cm^{-1}$. The CZTS absorber layers are grown and investigated by various fabrication methods, such as thermal evaporation, e-beam evaporation with a post sulfurization, sputtering, non-vacuum sol-gel, pulsed laser, spray-pyrolysis method and electrodeposition technique. In the present work, we report an alternative method for large area deposition of CZTS thin films that is potentially high throughput and inexpensive when used to produce monolithically integrated solar panel modules. Specifically, we have developed an aqueous chemical approach based on chemical bath deposition (CBD) with a subsequent sulfurization heat treatment. Samples produced by our method were analyzed by scanning electron microscopy, X-ray diffraction, transmission electron microscopy, absorbance and photoluminescence. The results show that this inexpensive and relatively benign process produces thin films of CZTS exhibiting uniform composition, kesterite crystal structure, and good optical properties. A preliminary solar cell device was fabricated to demonstrate rectifying and photovoltaic behavior.

  • PDF

Performance Evaluation of Distributed Cooperative MAC Protocol Algorithm for Enhancing Multimedia QoS of WiMedia Communication Network (와이미디어 통신네트워크의 멀티미디어 QoS 개선을 위한 분산협력방식 MAC 프로토콜 성능분석)

  • Kim, Jin-Woo;Lee, Yeon-Woo;Lee, Seong-Ro
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.4
    • /
    • pp.516-525
    • /
    • 2012
  • In this paper, an efficient technique for enhancing the QoS of multimedia service for an WiMedia network applying distributed cooperative medium access (D-MAC) protocol is proposed. D-MAC protocol has been proposed to support high-rate Wireless Personal Area Networks (HR-WPANs) by the WiMedia Alliance. Unlike the centralized IEEE 802.15.3 MAC, the D-MAC UWB specified by WiMedia supports all devices to be self-organized and removes the SOP (Simultaneous Operating Piconet) problem, i.e., packet collisions between overlapped piconets in the centralized IEEE 802.15.3 MAC. However the WiMedia D-MAC can't prevent reduce the throughput degradation occurred by mobile nodes with low data rate. Therefore, a distributed cooperative MAC protocol for multi-hop UWB network is proposed in this paper. The proposed technique can intelligently select the transmission path with higher data rate to provide real-time multimedia services with minimum delay, thus enhances QoS of multimedia service.

Mixed-Integer Programming based Techniques for Resource Allocation in Underlay Cognitive Radio Networks: A Survey

  • Alfa, Attahiru S.;Maharaj, B.T.;Lall, Shruti;Pal, Sougata
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.744-761
    • /
    • 2016
  • For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users. The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.

The future of bioinformntics

  • Gribskov, Michael
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2003.10a
    • /
    • pp.1-1
    • /
    • 2003
  • It is clear that computers will play a key role in the biology of the future. Even now, it is virtually impossible to keep track of the key proteins, their names and associated gene names, physical constants(e.g. binding constants, reaction constants, etc.), and hewn physical and genetic interactions without computational assistance. In this sense, computers act as an auxiliary brain, allowing one to keep track of thousands of complex molecules and their interactions. With the advent of gene expression array technology, many experiments are simply impossible without this computer assistance. In the future, as we seek to integrate the reductionist description of life provided by genomic sequencing into complex and sophisticated models of living systems, computers will play an increasingly important role in both analyzing data and generating experimentally testable hypotheses. The future of bioinformatics is thus being driven by potent technological and scientific forces. On the technological side, new experimental technologies such as microarrays, protein arrays, high-throughput expression and three-dimensional structure determination prove rapidly increasing amounts of detailed experimental information on a genomic scale. On the computational side, faster computers, ubiquitous computing systems, high-speed networks provide a powerful but rapidly changing environment of potentially immense power. The challenges we face are enormous: How do we create stable data resources when both the science and computational technology change rapidly? How do integrate and synthesize information from many disparate subdisciplines, each with their own vocabulary and viewpoint? How do we 'liberate' the scientific literature so that it can be incorporated into electronic resources? How do we take advantage of advances in computing and networking to build the international infrastructure needed to support a complete understanding of biological systems. The seeds to the solutions of these problems exist, at least partially, today. These solutions emphasize ubiquitous high-speed computation, database interoperation, federation, and integration, and the development of research networks that capture scientific knowledge rather than just the ABCs of genomic sequence. 1 will discuss a number of these solutions, with examples from existing resources, as well as area where solutions do not currently exist with a view to defining what bioinformatics and biology will look like in the future.

  • PDF