• Title/Summary/Keyword: Area Throughput

Search Result 459, Processing Time 0.025 seconds

AES-128/192/256 Rijndael Cryptoprocessor with On-the-fly Key Scheduler (On-the-fly 키 스케줄러를 갖는 AED-128/192/256 Rijndael 암호 프로세서)

  • Ahn, Ha-Kee;Shin, Kyung-Wook
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.11
    • /
    • pp.33-43
    • /
    • 2002
  • This paper describes a design of cryptographic processor that implements the AES (Advanced Encryption Standard) block cipher algorithm "Rijndael". To achieve high throughput rate, a sub-pipeline stage is inserted into a round transformation block, resulting that two consecutive round functions are simultaneously operated. For area-efficient and low-power implementation, the round transformation block is designed to share the hardware resources for encryption and decryption. An efficient on-the-fly key scheduler is devised to supports the three master-key lengths of 128-b/192-b/256-b, and it generates round keys in the first sub-pipeline stage of each round processing. The Verilog-HDL model of the cryptoprocessor was verified using Xilinx FPGA board and test system. The core synthesized using 0.35-${\mu}m$ CMOS cell library consists of about 25,000 gates. Simulation results show that it has a throughput of about 520-Mbits/sec with 220-MHz clock frequency at 2.5-V supply.

Link Adaptation with SNR Offset for Wireless LAN Systems (무선 LAN 시스템에서의 SNR 오프셋을 이용한 링크 적응화)

  • Kim, Chan-Hong;Jeong, Kyo-Won;Ko, Kyeong-Jun;Lee, Jung-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.10A
    • /
    • pp.839-846
    • /
    • 2011
  • Link Adaptation should select the best modulation and coding scheme (MCS) which gives the highest throughput as channel conditions vary. Several link adaptation algorithms for wireless local area network (WLAN) have been proposed but for the future WLAN systems such as 802.11n system, these algorithms do not guarantee the best performance. In this paper, we propose a new link adaptation algorithm in which an MCS level is chosen by the received SNR plus the offset value obtained from the transmission results. The performance of proposed algorithm is simulated by an IEEE 802.11n system. From the analysis, we conclude the proposed algorithm performs better than the well-known link adaptation algorithms such as auto rate fallback and general SNR-based techniques. Particularly, the proposed algorithm improves throughput when the packet error ratio (PER) is constrained for fast fading channels.

Fault-Management Scheme for Recovery Time and Resource Efficiency in OBS Networks (OBS 망에서 복구 시간과 자원의 효율성을 고려한 장애 복구 기법)

  • 이해정;정태근;소원호;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9B
    • /
    • pp.793-805
    • /
    • 2003
  • In OBS (Optical Burst Switching) networks which decouple the burst from its header, the fault of a fiber link can lead to the failure of all the light-path that traverses the fiber. Because each light-path is expected to operate at a rate of a few Gbps by using WDM (Wavelength Division Multiplexing) technology, any failure may lead to large data loss. Therefore, an efficient recovery scheme must be provided. In this paper, we analyze network utilization and BCP (Burst Control Packet) loss rate according to each link failure by applying the conventional restoration schemes in OBS networks. And through these simulation results, an ASPR scheme is proposed improve the fault management scheme in terms of recovery time and throughput. Finally, We compare the performance of our proposed scheme with that of the conventional one with respect to burst loss rate, resource utilization and throughput by OPNET simulations.

A Study on the Formation of Air Bubble by the Droplet Volume and Dispensing Method in UV NIL (UV NIL공정에서 액적의 양과 도포방법에 따른 기포형성 연구)

  • Lee, Ki Yeon;Kim, Kug Weon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.9
    • /
    • pp.4178-4184
    • /
    • 2013
  • Nanoimprint lithography (NIL) is an emerging technology enabling cost-effective and high-throughput nanofabrication. Recently, the major trends of NIL are high throughput and large area patterning. UV curable type NIL (UV NIL) can be performed at room temperature and low pressure. And one advantage of UV NIL is that it does not need vacuum, which greatly simplifies tool construction, so that vacuum oprated high-precision stages and a large vacuum chamber are no longer needed. However, one key issue in non-vacuum environment is air bubble formation problem. Namely, can the air bubbles be completely removed from the resist. In this paper, the air bubbles formation by the method of droplet application in UV NIL with non-vacuum environment are experimentally studied. The effects of the volume of droplet and the number of dispensing points on air bubble formation are investigated.

IDMMAC: Interference Aware Distributed Multi-Channel MAC Protocol for WSAN

  • Kakarla, Jagadeesh;Majhi, Banshidhar;Battula, Ramesh Babu
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1229-1242
    • /
    • 2017
  • In this paper, an interference aware distributed multi-channel MAC (IDMMAC) protocol is proposed for wireless sensor and actor networks (WSANs). The WSAN consists of a huge number of sensors and ample amount of actors. Hence, in the IDMMAC protocol a lightweight channel selection mechanism is proposed to enhance the sensor's lifetime. The IDMMAC protocol divides the beacon interval into two phases (i.e., the ad-hoc traffic indication message (ATIM) window phase and data transmission phase). When a sensor wants to transmit event information to the actor, it negotiates the maximum packet reception ratio (PRR) and the capacity channel in the ATIM window with its 1-hop sensors. The channel negotiation takes place via a control channel. To improve the packet delivery ratio of the IDMMAC protocol, each actor selects a backup cluster head (BCH) from its cluster members. The BCH is elected based on its residual energy and node degree. The BCH selection phase takes place whenever an actor wants to perform actions in the event area or it leaves the cluster to help a neighbor actor. Furthermore, an interference and throughput aware multi-channel MAC protocol is also proposed for actor-actor coordination. An actor selects a minimum interference and maximum throughput channel among the available channels to communicate with the destination actor. The performance of the proposed IDMMAC protocol is analyzed using standard network parameters, such as packet delivery ratio, end-to-end delay, and energy dissipation, in the network. The obtained simulation results indicate that the IDMMAC protocol performs well compared to the existing MAC protocols.

Research on Relay Selection Technology Based on Regular Hexagon Region Segmentation in C-V2X

  • Li, Zhigang;Yue, Xinan;Wang, Xin;Li, Baozhu;Huang, Daoying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3138-3151
    • /
    • 2022
  • Traffic safety and congestion are becoming more and more serious, especially the frequent occurrence of traffic accidents, which have caused great casualties and economic losses. Cellular Vehicle to Everything (C-V2X) can assist in safe driving and improve traffic efficiency through real-time information sharing and communication between vehicles. All vehicles communicate directly with Base Stations (BS), which will increase the base station load. And when the communicating vehicles are too far apart, too fast or there are obstacles in the communication path, the communication link can be unstable or even interrupted. Therefore, choosing an effective and reliable multi-hop relay-assisted Vehicle to Vehicle (V2V) communication can not only reduce the base station load and improve the system throughput but also expand the base station coverage and improve the communication quality of edge vehicles. Therefore, a communication area division scheme based on regular hexagon segmentation technology is proposed, a relay-assisted V2V communication mechanism is designed for the divided communication areas, and an efficient communication link is constructed by selecting the best relay node. Simulation results show that the scheme can improve the throughput of the system by nearly 55% and enhance the robustness of the V2V communication link.

A Memory-Efficient Block-wise MAP Decoder Architecture

  • Kim, Sik;Hwang, Sun-Young;Kang, Moon-Jun
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.615-621
    • /
    • 2004
  • Next generation mobile communication system, such as IMT-2000, adopts Turbo codes due to their powerful error correction capability. This paper presents a block-wise maximum a posteriori (MAP) Turbo decoding structure with a low memory requirement. During this research, it has been observed that the training size and block size determine the amount of required memory and bit-error rate (BER) performance of the block-wise MAP decoder, and that comparable BER performance can be obtained with much shorter blocks when the training size is sufficient. Based on this observation, a new decoding structure is proposed and presented in this paper. The proposed block-wise decoder employs a decoding scheme for reducing the memory requirement by setting the training size to be N times the block size. The memory requirement for storing the branch and state metrics can be reduced 30% to 45%, and synthesis results show that the overall memory area can be reduced by 5.27% to 7.29%, when compared to previous MAP decoders. The decoder throughput can be maintained in the proposed scheme without degrading the BER performance.

  • PDF

Further Specialization of Clustered VLIW Processors: A MAP Decoder for Software Defined Radio

  • Ituero, Pablo;Lopez-Vallejo, Marisa
    • ETRI Journal
    • /
    • v.30 no.1
    • /
    • pp.113-128
    • /
    • 2008
  • Turbo codes are extensively used in current communications standards and have a promising outlook for future generations. The advantages of software defined radio, especially dynamic reconfiguration, make it very attractive in this multi-standard scenario. However, the complex and power consuming implementation of the maximum a posteriori (MAP) algorithm, employed by turbo decoders, sets hurdles to this goal. This work introduces an ASIP architecture for the MAP algorithm, based on a dual-clustered VLIW processor. It displays the good performance of application specific designs along with the versatility of processors, which makes it compliant with leading edge standards. The machine deals with multi-operand instructions in an innovative way, the fetching and assertion of data is serialized and the addressing is automatized and transparent for the programmer. The performance-area trade-off of the proposed architecture achieves a throughput of 8 cycles per symbol with very low power dissipation.

  • PDF

Analysis of Resource Assignment for Directional Multihop Communications in mm-Wave WPANs

  • Kim, Meejoung;Hong, Seung-Eun;Kim, Yongsun;Kim, Jinkyeong
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.120-130
    • /
    • 2013
  • This paper presents an analysis of resource assignment for multihop communications in millimeter-wave (mm-wave) wireless personal area networks. The purpose of this paper is to figure out the effect of using directional antennas and relaying devices (DEVs) in communications. The analysis is performed based on a grouping algorithm, categorization of the flows, and the relaying DEV selection policy. Three schemes are compared: direct and relaying concurrent transmission (DRCT), direct concurrent transmission (DCT), and direct nonconcurrent transmission (DNCT). Numerical results show that DRCT is better than DCT and DCT is better than DNCT for any antenna beamwidths under the proposed algorithm and policy. The results also show that using relaying DEVs increases the throughput up to 30% and that there is an optimal beamwidth that maximizes spatial reuse and depends on parameters such as the number of flows in the networks. This analysis can provide guidelines for improving the performance of mm-wave band communications with relaying DEVs.

Using DSP Algorithms for CRC in a CAN Controller

  • Juan, Ronnie O. Serfa;Kim, Hi Seok
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.1
    • /
    • pp.29-34
    • /
    • 2016
  • A controller area network (CAN) controller is an integral part of an electronic control unit, particularly in an advanced driver assistance system application, and its characteristics should always be advantageous in all aspects of functionality especially in real time application. The cost should be low, while maintaining the functionality and reliability of the technology. However, a CAN protocol implementing serial operation results in slow throughput, especially in a cyclical redundancy checking (CRC) unit. In this paper, digital signal processing (DSP) algorithms are implemented, namely pipelining, unfolding, and retiming the CAN controller in the CRC unit, particularly for the encoder and decoder sections. It must attain a feasible iteration bound, a critical path that is appropriate for a CAN system, and must obtain a superior design of a high-speed parallel circuit for the CRC unit in order to have a faster transmission rate. The source code for the encoder and decoder was formulated in the Verilog hardware description language.