• Title/Summary/Keyword: System Throughput.

Search Result 1,746, Processing Time 0.031 seconds

Generalized Hardware Post-processing Technique for Chaos-Based Pseudorandom Number Generators

  • Barakat, Mohamed L.;Mansingka, Abhinav S.;Radwan, Ahmed G.;Salama, Khaled N.
    • ETRI Journal
    • /
    • v.35 no.3
    • /
    • pp.448-458
    • /
    • 2013
  • This paper presents a generalized post-processing technique for enhancing the pseudorandomness of digital chaotic oscillators through a nonlinear XOR-based operation with rotation and feedback. The technique allows full utilization of the chaotic output as pseudorandom number generators and improves throughput without a significant area penalty. Digital design of a third-order chaotic system with maximum function nonlinearity is presented with verified chaotic dynamics. The proposed post-processing technique eliminates statistical degradation in all output bits, thus maximizing throughput compared to other processing techniques. Furthermore, the technique is applied to several fully digital chaotic oscillators with performance surpassing previously reported systems in the literature. The enhancement in the randomness is further examined in a simple image encryption application resulting in a better security performance. The system is verified through experiment on a Xilinx Virtex 4 FPGA with throughput up to 15.44 Gbit/s and logic utilization less than 0.84% for 32-bit implementations.

Interference-limited Resource Allocation Algorithm in Cognitive Heterogeneous Networks

  • Zhuang, Ling;Yin, Yaohu;Guan, Juan;Ma, Xiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1471-1488
    • /
    • 2018
  • Interference mitigation is a significant issue in the cognitive heterogeneous networks, this paper studied how to reduce the interference to macrocell users (MU) and improve system throughput. Establish the interference model with imperfect spectrum sensing by analyzing the source of interference complexity. Based on the user topology, the optimize problem was built to maximize the downlink throughput under given interference constraint and the total power constraint. We decompose the resource allocation problem into subcarrier allocation and power allocation. In the subcarrier assignment step, the allocated number of subcarriers satisfies the requirement of the femtocell users (FU).Then, we designed the power allocation algorithm based on the Lagrange multiplier method and the improved water filling method. Simulation results and performance analyses show that the proposed algorithm causes less interference to MU than the algorithm without considering imperfect spectrum sensing, and the system achieves better throughput performance.

Pareto Optimized EDCA Parameter Control for Wireless Local Area Networks

  • Kim, Minseok;Oh, Wui Hwan;Chung, Jong-Moon;Lee, Bong Gyou;Seo, Myunghwan;Kim, Jung-Sik;Cho, Hyung-Weon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3458-3474
    • /
    • 2014
  • The performance of IEEE 802.11e enhanced distributed channel access (EDCA) is influenced by several interactive parameters that make quality of service (QoS) control complex and difficult. In EDCA, the most critical performance influencing parameters are the arbitration interframe space (AIFS) and contention window size (CW) of each access category (AC). The objective of this paper is to provide a scheme for parameter control such that the throughput per station as well as the overall system throughput of the network is maximized and controllable. For this purpose, a simple and accurate analytical model describing the throughput behavior of EDCA networks is presented in this paper. Based on this model, the paper further provides a scheme in which a Pareto optimal system configuration is obtained via an appropriate CW control for a given AIFS value, which is a different approach compared to relevant papers in the literature that deal with CW control only. The simulation results confirm the effectiveness of the proposed method which shows significant performance improvements compared to other existing algorithms.

Simulation-based Design and Performance Analysis of Two Phase Banker's Algorithm for Efficient Operation of Capacitated Automated Production Systems (유한용량 자동생산 시스템의 효율적인 운용을 위한 시뮬레이션 기반 2단계 은행가 알고리즘(BA) 설계 및 성능분석)

  • Shin, Hee Chul;Choi, Jin Young
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.4
    • /
    • pp.1-9
    • /
    • 2012
  • This paper suggests a two-phase look-ahead Banker's algorithm for efficient operation of capacitated automated production systems. The algorithm improves the ability of detecting safe states of the previous one by considering the possibility of processing each job to completion at once as well as partial movement between jobs. The improved performance of the proposed algorithm is testified by performing numerical experiment in terms of (i) detection rate of safe states and (ii) system throughput and verified by using paired t-test.

A New Physical Layer Transmission Scheme for LPI and High Throughput in the Cooperative SC-FDMA System

  • Li, Yingshan;Wu, Chao;Sun, Dongyan;Xia, Junli;Ryu, Heung-Gyoon
    • Journal of Communications and Networks
    • /
    • v.15 no.5
    • /
    • pp.457-463
    • /
    • 2013
  • In recent days, cooperative diversity and communication security become important research issues for wireless communications. In this paper, to achieve low probability of interception (LPI) and high throughput in the cooperative single-carrier frequency division multiple access (SC-FDMA) system, a new physical layer transmission scheme is proposed, where a new encryption algorithm is applied and adaptive modulation is further considered based on channel state information (CSI). By doing so, neither relay node nor eavesdropper can intercept the information signals transmitted from user terminal (UT). Simulation results show above new physical layer transmission scheme brings in high transmission safety and secrecy rate. Furthermore, by applying adaptive modulation and coding (AMC) technique according to CSI, transmission throughput can be increased significantly. Additionally, low peak-to-average power ratio (PAPR) characteristic can still be remained due to the uniform distribution of random coefficients used for encryption algorithm.

Resource Allocation Algorithm Based on Simultaneous Wireless Information and Power Transfer for OFDM Relay Networks

  • Xie, Zhenwei;Zhu, Qi;Zhao, Su
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5943-5962
    • /
    • 2017
  • A resource allocation algorithm based on simultaneous wireless information and power transfer (SWIPT) to maximize the system throughput is proposed in orthogonal frequency division multiplexing (OFDM) relay networks. The algorithm formulates the problem under the peak power constraints of the source and each subcarrier (SC), and the energy causality constraint of the relay. With the given SC allocation of the source, we give and prove the optimal propositions of the formulated problem. Then, the formulated problem could be decomposed into two separate throughput maximization sub-problems by setting the total power to transfer energy. Finally, several SC allocation schemes are proposed, which are energy priority scheme, information priority scheme, balanced allocation scheme and exhaustive scheme. The simulation results reveal that the energy priority scheme can significantly reduce computational complexity and achieve approximate performance with the exhaustive scheme.

Performance Evaluation of CDMA_ALOHA Techniques for Wireless Data Communications (무선 데이터통신을 위한 CDMA_ALOHA 기법의 성능 분석)

  • 허정석;양성용;이정태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.7
    • /
    • pp.1272-1281
    • /
    • 1994
  • CDMA technique has been largely focused for Wireless Data Network and PCN. ALOHA protocol also has been proven to be effective for Packet Radio Network regardless of low throughput due to channel colisions. In this paper, we evaluate the performance of CDMA_ALOHA scheme, denoted as S_CDMA_ALOHA(Soltted_CDAM_ALOHA) and MS_CDMA_ALOHA(Minislotted_CDMA_ALOHA) system, by analytic and simulation method. The superiority of the CDMA_ALOHA systems over conventional Slotted ALOHA system are clearely demonstrated for throughput, delay and stability performances. The MS_CDMA_ALOHA scheme provides better delay and throughput performance than the S_CDMA_ALOHA scheme.

  • PDF

MOPSO-based Data Scheduling Scheme for P2P Streaming Systems

  • Liu, Pingshan;Fan, Yaqing;Xiong, Xiaoyi;Wen, Yimin;Lu, Dianjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.10
    • /
    • pp.5013-5034
    • /
    • 2019
  • In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

Establishment of a High-Throughput Screening System for Caspase-3 Inhibitors

  • Park, Seung-Yong;Park, Song-Hee;Lee, Il-Sun;Kong, Jae-Yang
    • Archives of Pharmacal Research
    • /
    • v.23 no.3
    • /
    • pp.246-251
    • /
    • 2000
  • In most tissues, apoptosis plays a pivotal role in normal development and for regulating cell number, thus inappropriate apoptosis underlies a variety of diseases. Caspase-3 is one of a family of caspases that are mainly involved in the apoptotic signal transduction pathway, where caspase-3 acts as an effect molecule to proteolytically cleave intracellular substrates that are necessary for maintaining cell survival. Recent evidences show that apoptotic cell death can be blocked by inhibiting caspase-3, suggesting its inhibitors have potential to be therapeutic drugs for the diseases related with inappropriate apoptosis. We have established a screening system to search caspase-3 inhibitors from chemical libraries stocked in our institute. The enzyme assay is configured entirely in 96-well format, which is easily adapted for high throughput screening. Before performing mass screening, 80 in-house compounds were screened as a preliminary experiment, and we found that morin hydrate inhibited caspase-3 by 66.4 % at the final concentration of 20 ${\mu}g/m{\ell}$.

  • PDF

Determination of Optimal Buffer Size for Semiconductor Production System using Harmony Search Algorithm (하모니서치 알고리즘을 이용한 반도체 공정의 최적버퍼 크기 결정)

  • Lee, Byeong-Gil;Byun, Minseok;Kim, Yeojin;Lee, Jonghwan
    • Journal of the Semiconductor & Display Technology
    • /
    • v.19 no.4
    • /
    • pp.39-45
    • /
    • 2020
  • In the production process, the buffer acts as a buffer to alleviate some of the problems such as delays in delivery and process control failures in unexpected situations. Determining the optimal buffer size can contribute to system performance, such as increased output and resource utilization. However, there are difficulties in allocating the optimal buffer due to the complexity of the process or the increase in the number of variables. Therefore, the purpose of this research is proposing an optimal buffer allocation that maximizes throughput. First step is to design the production process to carry out the research. The second step is to maximize the throughput through the harmony search algorithm and to find the buffer capacity that minimizes the lead time. To verify the efficiency, comparing the ratio of the total increase in throughput to the total increase in buffer capacity.