• Title/Summary/Keyword: coding delay

Search Result 248, Processing Time 0.034 seconds

Routing optimization algorithm for logistics virtual monitoring based on VNF dynamic deployment

  • Qiao, Qiujuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1708-1734
    • /
    • 2022
  • In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

A Nucleolar Protein, MoRRP8 Is Required for Development and Pathogenicity in the Rice Blast Fungus

  • Minji Kim;Song Hee Lee;Junhyun Jeon
    • Mycobiology
    • /
    • v.51 no.5
    • /
    • pp.273-280
    • /
    • 2023
  • The nucleolus is the largest, membrane-less organelle within the nucleus of eukaryotic cell that plays a critical role in rRNA transcription and assembly of ribosomes. Recently, the nucleolus has been shown to be implicated in an array of processes including the formation of signal recognition particles and response to cellular stress. Such diverse functions of nucleolus are mediated by nucleolar proteins. In this study, we characterized a gene coding a putative protein containing a nucleolar localization sequence (NoLS) in the rice blast fungus, Magnaporthe oryzae. Phylogenetic and domain analysis suggested that the protein is orthologous to Rrp8 in Saccharomyces cerevisiae. MoRRP8-GFP (translational fusion of MoRRP8 with green fluorescence protein) co-localizes with a nucleolar marker protein, MoNOP1 fused to red fluorescence protein (RFP), indicating that MoRRP8 is a nucleolar protein. Deletion of the MoRRP8 gene caused a reduction in vegetative growth and impinged largely on asexual sporulation. Although the asexual spores of DMorrp8 were morphologically indistinguishable from those of wild-type, they showed delay in germination and reduction in appressorium formation. Our pathogenicity assay revealed that the MoRRP8 is required for full virulence and growth within host plants. Taken together, these results suggest that nucleolar processes mediated by MoRRP8 is pivotal for fungal development and pathogenesis.

Modified SMPO for Type-II Optimal Normal Basis (Type-II 최적 정규기저에서 변형된 SMPO)

  • Yang Dong-Jin;Chang Nam-Su;Ji Sung-Yeon;Kim Chang-Han
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.2
    • /
    • pp.105-111
    • /
    • 2006
  • Cryptographic application and coding theory require operations in finite field $GF(2^m)$. In such a field, the area and time complexity of implementation estimate by memory and time delay. Therefore, the effort for constructing an efficient multiplier in finite field have been proceeded. Massey-Omura proposed a multiplier that uses normal bases to represent elements $CH(2^m)$ [11] and Agnew at al. suggested a sequential multiplier that is a modification of Massey-Omura's structure for reducing the path delay. Recently, Rayhani-Masoleh and Hasan and S.Kwon at al. suggested a area efficient multipliers for modifying Agnew's structure respectively[2,3]. In [2] Rayhani-Masoleh and Hasan proposed a modified multiplier that has slightly increased a critical path delay from Agnew at al's structure. But, In [3] S.Kwon at al. proposed a modified multiplier that has no loss of a time efficiency from Agnew's structure. In this paper we will propose a multiplier by modifying Rayhani-Masoleh and Hassan's structure and the area-time complexity of the proposed multiplier is exactly same as that of S.Kwon at al's structure for type-II optimal normal basis.

Layer-separable PES Packetization and Processing Scheme for SVC-based Satellite Broadcasting Service (SVC 기반의 위성방송 서비스를 위한 계층 분리형 PES 패킷화 및 처리 기법)

  • Chi, Won-Sup;Seo, Kwang-Deok;Kim, Jin-Soo;Lee, In-Ki;Chang, Dae-Ig
    • Journal of Broadcast Engineering
    • /
    • v.14 no.5
    • /
    • pp.561-572
    • /
    • 2009
  • In this paper, we propose an efficient layer-separable PES packetization and processing scheme for DVB-S2 satellite broadcasting service based on SVC video. Unlike the conventional single layer-based video coding such as MPEG-2, MPEG-4 and H.264, SVC can combine numerous number of video layers, which are aggregated to a single bitstream. Therefore, it is necessary to devise a new PES packetization scheme that can efficiently separate multiple video layers of SVC. In order to combine the layered characteristics of the SVC video and the robust channel coding capability of LDPC (Low Density Parity Check) of DVB-S2 for unequal error protection, we propose an efficient PES packetization in the transmitter side and PES packet processing scheme in the receiver side of DVB-S2. We prove the effectiveness of the proposed scheme in terms of processing speed and time delay required for processing of the separated layers of SVC video in the satellite broadcasting service.

Interleaver Design for Mobile Satellite Communication Systems Using LTE based AMC Scheme (이동 위성통신 시스템에서의 LTE 기반 AMC 방식을 위한 인터리버 설계)

  • Yeo, Sung-Moon;Hong, Tae-Chul;Kim, Soo-Young;Song, Sang-Seob;Ahn, Do-Seob
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.3
    • /
    • pp.8-15
    • /
    • 2010
  • Due to the increasing demand of network convergence, in future, hybrid/integrated satellite and terrestrial systems will play an important role. In that case, compatibilities between the satellite and terrestrial systems are very important for efficiency of the systems. 3GPP Long Term Evolution (LTE) is one of the most powerful candidates of the 4G system Therefore, in this paper, we introduce the design of interleaver for mobile satellite system based 3GPP LTE specification. The 4G system including the LTE specification adopted adaptive modulation and coding (AMC) schemes for efficient usage of resources, and the updating interval of resource allocation is an order of msec. However, because of the long round trip delay of satellite systems, we cannot employ the same AMC scheme specified for the terrestrial system, and thus it cannot effectively counteract to short term fadings. Therefore, in order to overcome these problems, we propose an interleaver scheme combined with AMC. We present the interleaγer design results considering mobile satellite system based on the LTE and analyze the simulation results.

A New Wideband Speech/Audio Coder Interoperable with ITU-T G.729/G.729E (ITU-T G.729/G.729E와 호환성을 갖는 광대역 음성/오디오 부호화기)

  • Kim, Kyung-Tae;Lee, Min-Ki;Youn, Dae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.2
    • /
    • pp.81-89
    • /
    • 2008
  • Wideband speech, characterized by a bandwidth of about 7 kHz (50-7000 Hz), provides a substantial quality improvement in terms of naturalness and intelligibility. Although higher data rates are required, it has extended its application to audio and video conferencing, high-quality multimedia communications in mobile links or packet-switched transmissions, and digital AM broadcasting. In this paper, we present a new bandwidth-scalable coder for wideband speech and audio signals. The proposed coder spits 8kHz signal bandwidth into two narrow bands, and different coding schemes are applied to each band. The lower-band signal is coded using the ITU-T G.729/G.729E coder, and the higher-band signal is compressed using a new algorithm based on the gammatone filter bank with an invertible auditory model. Due to the split-band architecture and completely independent coding schemes for each band, the output speech of the decoder can be selected to be a narrowband or wideband according to the channel condition. Subjective tests showed that, for wideband speech and audio signals, the proposed coder at 14.2/18 kbit/s produces superior quality to ITU-T 24 kbit/s G.722.1 with the shorter algorithmic delay.

Characteristics of Underwater Acoustic Channel and Performance of Multi-Carrier System in Littoral Ocean near Busan City (부산인근 해역의 수중음향통신 채널특성과 다중반송파 시스템의 성능)

  • Kim, Jongjoo;Park, Jihyun;Bae, Minja;Yoon, Jong Rak
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.12
    • /
    • pp.2394-2402
    • /
    • 2017
  • The frequency selective fading by multipaths determines a performance of underwater acoustic communication system in shallow littoral ocean. In this study, a characteristics of underwater acoustic channel and performance of multi-carrier system is evaluated in littoral ocean with a 50m deep water, an effective wave height of 0.5m and sandy mud bottom near Busan city. A multipath delay spread and time and frequency domain are presented as a function of a transmitter-to-receiver range. A bit-error-rate of a 5 channel 4FSK(Frequency Shift Keying) with a transmission rate of 1kbps, is examined and RS(Reed-Solomon) code is also adopted to remove a burst error due to time domain fading. A number of multipath are less than four and a bit-error-rate is decreased as an increase of a transmitter-to-receiver range which gives a congestion of multi-paths resulting in a decrease of time and frequency domain fading. The measured bit-error-rate is about 10-4 at greater than 600m of transmitter-to-receiver range.

Implementation of Stopping Criterion Algorithm using Variance Values of LLR in Turbo Code (터보부호에서 LLR 분산값을 이용한 반복중단 알고리즘 구현)

  • Jeong Dae-Ho;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.9 s.351
    • /
    • pp.149-157
    • /
    • 2006
  • Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations is increased in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of LLR in turbo decoder, the proposed algerian can largely reduce the average number of iterations without BER performance degradation in all SNR regions. As a result of simulation, the average number of iterations in the upper SNR region is reduced by about $34.66%{\sim}41.33%$ compared to method using variance values of extrinsic information. the average number of iterations in the lower SNR region is reduced by about $13.93%{\sim}14.45%$ compared to CE algorithm and about $13.23%{\sim}14.26%$ compared to SDR algorithm.

An Anti-Collision Algorithm with 4-Slot in RFID Systems (RFID 시스템에서 4 슬롯을 이용한 충돌방지 알고리즘)

  • Kim, Yong-Hwan;Kim, Sung-Soo;Ryoo, Myung-Chun;Park, Joon-Ho;Chung, Kyung-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.12
    • /
    • pp.111-121
    • /
    • 2014
  • In this paper, we propose tree-based hybrid query tree architecture utilizing time slot. 4-Bit Pattern Slot Allocation(4-SL) has a 8-ary tree structure and when tag ID responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to extract the location and the number of collided bits. Also, this algorithm can recognize multiple Tags by single query using 4 fixed time slots. The architecture allows the reader to identify 8 tags at the same time by responding 4 time slots utilizing the first bit($[prefix+1]^{th}$, F ${\in}$ {'0' or '1'}) and bit pattern from second ~ third bits($[prefix+2]^{th}{\sim}[prefix+3]^{th}$, $B_2{\in}$ {"00" or "11"}, $B_1{\in}$ {"01" or "10"}) in tag ID. we analyze worst case of the number of query nodes(prefix) in algorithm to extract delay time for recognizing multiple tags. The identification delay time of the proposed algorithm was based on the number of query-responses and query bits, and was calculated by each algorithm.

Implementation of Stopping Criterion Algorithm using Sign Change Ratio for Extrinsic Information Values in Turbo Code (터보부호에서 외부정보에 대한 부호변화율을 이용한 반복중단 알고리즘 구현)

  • Jeong Dae-Ho;Shim Byong-Sup;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.143-149
    • /
    • 2006
  • Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations is increased in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using sign changed ratio of extrinsic information values in turbo decoder, the proposed algorithm can largely reduce the average number of iterations without BER performance degradation. As a result of simulations, the average number of iterations is reduced by about $12.48%{\sim}22.22%$ compared to CE algorithm and about $20.43%{\sim}54.02%$ compared to SDR algorithm.