• Title/Summary/Keyword: bit loading algorithm

Search Result 26, Processing Time 0.027 seconds

An Efficient Discrete Bit Allocation Algorithm for Multi-user Channels (다수 사용자 채널을 위한 효율적인 이산 비트 할당 방법)

  • Choi, Min-Ho;Song, Sang-Seob
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9A
    • /
    • pp.998-1004
    • /
    • 2004
  • In this paper we propose a discrete bit-loading algorithm that maximizes the transmit bit rate using the channel information. to optimize the performance of the very high-speed digital subscriber line(VDSL) system under the constraint of a maximum transmit power for each user. When the power level of crosstalk is high, the power allocation of a user changes the crosstalk experienced by the other users in the same binder. In this case, the performance of DSL modems can be improved by jointly considering the bit and power allocation of all users Simulation results shows that the proposed method improves the performance compared With that of iterative water-filling method.

Low Complexity Bit Loading Algorithm with Power-constraint for OFDM-based Wireless Sensor Communication (OFDM 기반 무선 센서 망에서 에너지 제한을 고려한 복잡도 낮은 비트 할당 알고리즘)

  • Oh, Seoung-Youl;Ko, Hyeon-Mok;Kwon, Soon-Mok;Kim, Chee-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1483-1490
    • /
    • 2009
  • Orthogonal frequency division multiplexing (OFDM) has been investigated as an enabling technology for future wireless communications such as ad hoc, mesh and sensor networks. However, prior works on bit-loading lack consideration of the constraints on energy and computing facility in sensor networks. In this paper, we suggest an adaptive bit allocation algorithm for a frequency selective fading channel environment which exploits channel state information obtained through a feedback channel. The proposed algorithm significantly reduces computational complexity and satisfies the power budget. Also, its throughput is comparable to the optimum solution. Simulation results support the claim stated.

Study on Network Throughput of Power Line Communication System in In-Building Network (전력선 통신 시스템의 구내 네트워크 데이터 처리량 연구)

  • Jang, Ho-Deok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.1
    • /
    • pp.43-47
    • /
    • 2021
  • This paper investigates the network throughput of PLC (Power Line Communication) system in the in-building network. The OFDM (Orthogonal Frequency Division Multiplexing) modulation format and adaptive bit loading algorithm is used to minimize the effect of signal loss and noise on transmission performance in the power line channel characterized by frequency selective fading. The network throughput of the PLC system which consists of gateway and CPE(Customer Premise Equipment) PLC modem in the in-building network is measured by network performance measurement tool, iperf and analyzed according to the TCP (Transmission Control Protocol) window size.

A Study on Optimal Bit Loading Algorithms for Discrete MultiTone ADSL (DMT 변조방식을 사용하는 ADSL에서의 최적 비트 할당 방식 연구)

  • 이철우;박광철;윤기방;장수영;김기두
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.4
    • /
    • pp.395-402
    • /
    • 2002
  • In the conventional public switched telephone network(PSTN), there are various types of modulation that can be used in ADSL to offer fast data communication, two of which are CAP(Carrierless Amplitude Phase) and DMT(Discrete MultiTone). As we consider the current situation, DMT is getting more predominant in the market than CAP. One of the reasons is that it gives high performance in spite of its high complexity Since DMT divides the full range of bandwidth into 256 sub-channels, it can be highly adaptive in the circumstances, where the problems of attenuation and noise caused by the propagation distance are very crucial. In this paper, a new bit loading algorithm for DMT modulation is proposed. The proposed algorithm can be efficiently implemented in a way that it requires less computation than the conventional modulation techniques. In contrast to the conventional algorithms which perform sorting processing, the proposed algorithm uses look-up tables to reduce the repetition of calculation. Consequently, it is shown that less processing time and lower complexity can be achieved.

ABR Congestion Control for Signal Transmissions in ATM Networks (신호 전송을 위한 ATM 망에서의 ABR 체증제어)

  • 정준영;양현석;계영철;고인선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.448-456
    • /
    • 2003
  • In this parer, an ABR (Available Bit Rate) congestion control algorithm for voice transmission in ATM networks was proposed. To deal with the network congestion problem, not only the buffer level of a switch but also the variation of the buffer level were considered. Also, to resolve the unfairness among sources where the bit transfer rates vary, a loading factor that is used to adjust the bit rate was introduced. To show the superiority of this paper over others, simulation was done with a network of 7 voice sources and 4 switches, which was represented by Petri net model. ExSpect was used for simulation. The simulation results showed that there was improvement in network utilization and that unfairness among sources were resolved a lot.

Adaptive OFDMA with Partial CSI for Downlink Underwater Acoustic Communications

  • Zhang, Yuzhi;Huang, Yi;Wan, Lei;Zhou, Shengli;Shen, Xiaohong;Wang, Haiyan
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.387-396
    • /
    • 2016
  • Multiuser communication has been an important research area of underwater acoustic communications and networking. This paper studies the use of adaptive orthogonal frequency-division multiple access (OFDMA) in a downlink scenario, where a central node sends data to multiple distributed nodes simultaneously. In practical implementations, the instantaneous channel state information (CSI) cannot be perfectly known by the central node in time-varying underwater acoustic (UWA) channels, due to the long propagation delays resulting from the low sound speed. In this paper, we explore the CSI feedback for resource allocation. An adaptive power-bit loading algorithm is presented, which assigns subcarriers to different users and allocates power and bits to each subcarrier, aiming to minimize the bit error rate (BER) under power and throughput constraints. Simulation results show considerable performance gains due to adaptive subcarrier allocation and further improvement through power and bit loading, as compared to the non-adaptive interleave subcarrier allocation scheme. In a lake experiment, channel feedback reduction is implemented through subcarrier clustering and uniform quantization. Although the performance gains are not as large as expected, experiment results confirm that adaptive subcarrier allocation schemes based on delayed channel feedback or long term statistics outperform the interleave subcarrier allocation scheme.

An Efficient Power Allocation Algorithm in OFDM-based Wireless Sensor Networks using Reserve Power (OFDM 기반 무선 센서 네트워크에서의 Reserve Power를 이용한 효율적인 파워 할당 알고리즘)

  • Kim, Byung-Ho;Oh, Seoung-Youl;Kim, Chee-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1251-1258
    • /
    • 2010
  • Orthogonal Frequency Division Multiplexing (OFDM) has been investigated as promising technology for future broadband communication. In this paper, we propose a power allocation algorithm for a frequency selective fading channel. However, many investigated algorithms that perform high computation overhead are not appropriate for sensor network systems due to hardware limitations. The proposed algorithm significantly reduces computational overhead and satisfies the power budget. Throughput of the algorithm is comparable to the optimum solution. Simulation results support the claim stated.

Real Time Related Key Attack on Hummingbird-2

  • Zhang, Kai;Ding, Lin;Li, Junzhi;Guan, Jie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.8
    • /
    • pp.1946-1963
    • /
    • 2012
  • Hummingbird is a lightweight encryption and message authentication primitive published in RISC'09 and WLC'10. In FSE'11, Markku-Juhani O.Saarinen presented a differential divide-and-conquer method which has complexity upper bounded by $2^{64}$ operations and requires processing of few megabytes of chosen messages under two related nonces (IVs). The improved version, Hummingbird-2, was presented in RFIDSec 2011. Based on the idea of differential collision, this paper discovers some weaknesses of the round function WD16. Combining with the simple key loading algorithm, a related-key chosen-IV attack which can recover the full secret key is proposed. Under 15 pairs of related keys, the 128 bit initial key can be recovered, requiring $2^{27}$ chosen IV and the computational complexity is $O(2^{27})$. In average, the attack needs several minutes to recover the full 128-bit secret key on a PC. The experimental result corroborates our attack. The result shows that the Hummingbird-2 cipher can't resist related key attack.

Design and Evaluation of a VOD Buffer Management Algorithm Using Fixed Prefetch and Drop Strategics (고정 선반입과 Drop 정책을 이용한 VOD 버퍼 관리 알고리즘 설계 및 평가)

  • 박규석;문병철
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.2
    • /
    • pp.101-111
    • /
    • 2000
  • Resource managing is very difficult because the multimedia data compressed by a VBR shows a bit rate change within high range, Therefore, the VOD server should use the prefetch method in order to improve system utilization, such as prefetching data in the overload period by a meta table that is the reference pattern of MPEG data which is analyzed off line. This prefetch method will not result in a failure to display at overload, however, this method can not keep a minimum loading time and low costs, because the prefetched section is being maximizes. In this paper, we suggest another method that the system utilization can be improved using the fixed prefetched section to keep loading time and costs under a constant range at overload. But this technique will result in a failure to display, due to fixed prefetched section. Rut, in this paper we suggest a drop module that drops only the B frame in the GOP, consistently distributes a lower drop in media quality for the user.

  • PDF

An energy-efficiency approach for bidirectional amplified-and-forward relaying with asymmetric traffic in OFDM systems

  • Jia, Nianlong;Feng, Wenjiang;Zhong, Yuanchang;Kang, Hong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.4087-4102
    • /
    • 2014
  • Two-way relaying is an effective way of improving system spectral efficiency by making use of physical layer network coding. However, energy efficiency in OFDM-based bidirectional relaying with asymmetric traffic requirement has not been investigated. In this study, we focused on subcarrier transmission mode selection, bit loading, and power allocation in a multicarrier single amplified-and-forward relay system. In this scheme, each subcarrier can operate in two transmission modes: one-way relaying and two-way relaying. The problem is formulated as a mixed integer programming problem. We adopt a structural approximation optimization method that first decouples the original problem into two suboptimal problems with fixed subcarrier subsets and then finds the optimal subcarrier assignment subsets. Although the suboptimal problems are nonconvex, the results obtained for a single-tone system are used to transform them to convex problems. To find the optimal subcarrier assignment subsets, an iterative algorithm based on subcarrier ranking and matching is developed. Simulation results show that the proposed method can improve system performance compared with conventional methods. Some interesting insights are also obtained via simulation.