Eugene Zhiwei Han · DR-NTU (Nanyang Technological University) · 2016
Uncoded transmissions are suitable for a low-noise environment, but these ideal conditions are not usually available. While a multitude of options exists for reducing errors during transmission, it is challenging to estimate the volume of additional resources required for an improvement in its error-reduction capability. As such, this report compares uncoded communication systems with some coding schemes, examining their resource efficiency and overall effectiveness. \nExtensive research has been conducted before and the literature of bit error rate (BER) and block error rate (BLER) relating to binary linear block code is widely available. This project strives to reinforce those findings by employing myriad simulative methods. Hamming-coded transmissions aid in reducing error caused by noise, but their performance varies across different orders of coding systems. Focussing on Hamming codes, a common platform where various types of Hamming codes can be normalized is built, allowing them to be compared based on BER and BLER. \nBER and BLER are examined in greater details as well, through both theoretical models and simulations. A relationship has been found between the two. It is observed that BLER is higher than BER in all cases. For Hamming codes, the relationship is BER = 3 𝑛� BLER, where 𝑛� is the length of the code. This linearity applies to non-perfect linear block code too. This report also highlights the importance of supporting theory with applications. An investigation into the discrepancy in errors correction between degrees of error reveals that Hamming code performs unpredictably when an error of greater than 1 is introduced. As such, careful analysis shows that many factors like 𝐸�𝑏�/𝑁�0 and predicted errors must be considered for each type of communication system.
Cited by 0
Fumiyuki Adachi, Tadashi Matsumoto · Electronics Letters · 1991
The double symbol error rate (DSER) is calculated for an M-ary DPSK (MDPSK) system to show that double symbol errors are less likely to be produced when M ≥ 4 than for the binary case (M = 2) and that MDPSK with M ≥ 4 provides similar conditional SER (defined as the SER when the previous symbol decision was in error) when compared at the same SER value. The block error rate (BKER) is also shown to be well approximated by that determined assuming independent symbol error when M ≥ 4.
Cited by 2
Tamer A. Samir, Said Elnoubi, Ayman Elnashar · IEEE Transactions on Vehicular Technology · 2008
Beamforming is a key technology in smart antenna systems that can increase capacity and coverage and mitigate multipath propagation in mobile radio communication systems. The most popular criterion for linear beamforming is the minimum mean square error (MMSE). However, the mean square error (MSE) cost function is not optimal in terms of the bit error probability performance of the system. A class of adaptive beamforming algorithms has been proposed based on minimizing the bit error rate (BER) cost function directly. Unfortunately, the popular least minimum BER (LMBER) stochastic beamforming algorithm suffers from low convergence speed. Gradient Newton algorithms have been proposed to speed up the convergence rate and enhance performance but at the expense of complexity. In this paper, a block processing objective function for the minimum BER (MBER) is formulated, and a nonlinear optimization strategy, which produces the so-called block-Shanno MBER (BSMBER), is developed. A complete discussion for the complexity calculations of the proposed algorithm is demonstrated. Simulation scenarios are carried out in a multipath Rayleigh-fading direct-sequence code-division multiple access (DS-CDMA) system to explore the performance of the proposed algorithm. Simulation results show that the proposed algorithm offers good performance in terms of convergence speed, steady-state performance, and even system capacity compared to other MBER- and MSE-based algorithms.
Cited by 9
Michele Elia · 1983
Cited by 4
Gérard Cohen, Philippe Godlewski · 1975
Cited by 0
Mirza Hamza, Adriana Lipovac, Vlatko Lipovac · Tehnicki vjesnik - Technical Gazette · 2020
This paper provides a simple estimation of the Long Term Evolution (LTE) physical and Medium Access Control (MAC) layer peak transmission performance-the irreducible Block-Error-Rate (BLER) that determines the Hybrid Automatic Repeat Request (HARQ) residual channel available to higher-layer protocols. With this regard, the general pre-HARQ BLER prediction is developed for the redundancy version 0 (RV0) codeword transmission, expressed by the Bit-Error-Rate (BER)), considering the cyclic prefix protection against inter-symbol interference sufficient to prevent long error bursts. This implies only sporadic bit error occurrences, exhibiting moderate mutual interdependence that we modelled considering errored bits of each block of data as a sample without replacement and consequently describing it with the hypergeometric distribution instead of the mostly used binomial one. The HARQ BLER estimation model is verified by both problem-dedicated Monte-Carlo simulations and industry-standard LTE software simulation tool, specifically for the LTE FDD downlink channel environment, as the test results exhibit excellent matching with the residual BLER prediction.
Cited by 2Open access
Ekkehard Glimm, David S. Robertson · Statistical Methods in Medical Research · 2023
Response-adaptive randomization allows the probabilities of allocating patients to treatments in a clinical trial to change based on the previously observed response data, in order to achieve different experimental goals. One concern over the use of such designs in practice, particularly from a regulatory viewpoint, is controlling the type I error rate. To address this, Robertson and Wason (Biometrics, 2019) proposed methodology that guarantees familywise error rate control for a large class of response-adaptive designs by re-weighting the usual <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>z</mml:mi></mml:math>-test statistic. In this article, we propose an improvement of their method that is conceptually simpler, in the context where patients are allocated to the experimental treatment arms in a trial in blocks (i.e. groups) using response-adaptive randomization. We show the modified method guarantees that there will never be negative weights for the contribution of each block of data to the adjusted test statistics, and can also provide a substantial power advantage in practice.
Cited by 2Open access
Tai-Yang Hwang · IEEE Transactions on Information Theory · 1979
Two modifications of the basic correlation decoding approach are presented. One of them yields a nonexhaustive optimum word decoding algorithm whose complexity depends upon the "projecting" structure of the code. This algorithm is then modified to yield a second decoding algorithm which, while not optimum, has simpler complexity. Applications to the AWGN channel are discussed and performance curves are given for (24, 12) and (31, 15) codes.
Cited by 45
Zhentian Zhang, David Morales‐Jiménez, Hao Jiang et al. · ArXiv.org · 2025
Fluid antenna systems (FASs) offer genuine simplicity for communication network design by eliminating expensive hardware overhead and reducing the complexity of access protocol architectures. Through the discovery of significant spatial diversity within a compact antenna space, FASs enable the implementation of reconfigurable-antenna-based architectures. However, current state-of-the-art studies rarely investigate the impact of finite blocklength constraints on FAS-based designs, leaving a gap in both analytical modeling and the establishment of a solid, universally applicable performance metric for finite blocklength fluid antenna systems (FBL-FAS). In this work, we focus on the study of FBL-FAS and, more importantly, derive a block error rate (BLER) bound that serves as a general and practical performance benchmark across various FAS architectures. The proposed BLER bound is computable both with and without an explicit statistical model, meaning that the BLER performance can be characterized analytically or empirically under model-aware or model-free system scenarios. Moreover, when the statistical model is known, the analytical results derived from the proposed BLER bound exhibit strong alignment with the empirical findings, demonstrating the remarkable simplicity, accuracy, and universality of the proposed BLER bound.
Cited by 0Open access
J.L.H. Webb, D.C. Munson · IEEE Signal Processing Letters · 1995
We consider a simple modification to classical block truncation coding (BTC) that may permit the use of larger block sizes for some applications. although BTC is favored for its simple encoding and decoding, its disadvantage is the relatively low compression ratio achieved. Bit rates on the order of 1 bit/pixel require large block sizes, which generally produce unacceptable degradation. However, these undesirable effects can be reduced considerably by incorporating error diffusion, which is a technique used in halftoning, into the BTC encoding stage.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 1
Xuqing Chai, Haitao Liu, Yajie Dong · Journal of Convergence Information Technology · 2013
Cited by 1
Hojin Ha, Eun‐Seok Ryu · Applied Sciences · 2017
This paper describes a three-screen television system using a block recovery rate (BRR)-based unequal error protection (UEP). The proposed in-home wireless network uses scalable video coding (SVC) and UEP with forward error correction (FEC) for maximizing the quality of service (QoS) over error-prone wireless networks. For efficient FEC packet assignment, this paper proposes a simple and efficient performance metric, a BRR which is defined as a recovery rate of temporal and quality layer from FEC assignment by analyzing the hierarchical prediction structure including the current packet loss. It also explains the SVC layer switching scheme according to network conditions such as packet loss rate (PLR) and available bandwidth (ABW). In the experiments conducted, gains in video quality with the proposed UEP scheme vary from 1 to 3 dB in Y-peak signal-to-noise ratio (PSNR) with corresponding subjective video quality improvements.
Cited by 1Open access
Hsiang-Cheh Huang, Feng-Cheng Chang, Po‐Liang Chen · 2022 IEEE 11th Global Conference on Consumer Electronics (GCCE) · 2022
Block-based compressed sensing has emerged as a newly developed compression technique in the last couple of years. With the concepts from the rate-distortion theory, block-based compressed sensing aims at reducing the distortion while keeping the constant rate. In addition, transmission of compressed data forms an inevitable part in multimedia communications. We would like to explore the error resilient transmission from both the encoder and the decoder. At the encoder, we classify the original image into smooth and active regions, and set the measurement rates adaptively to both regions in order to keep the weighted measurement rate as a constant. At the decoder, we expect there might be effects to compressed media to cause quality degradation to the decoder. And we apply error protection techniques to the smooth and active regions in order to reach the goal of error resilient transmission. Simulation results have demonstrated the effects with adaptive measurement rates, and the capability with the error protection and regression techniques.
Cited by 2
Tahmasebi Toyserkani, Arash, Ström, Erik, Svensson, Arne · Chalmers Publication Library (Chalmers University of Technology) · 2009
<p>One of the main performance measures of any packet based communication\nsystem is the success rate of the packets. A packet\nis successfully received if the arrival of the packet is detected correctly,\nheader is received successfully, and payload is decoded without\nerrors. At the moment, the probability of failure to decode the\npayload, i.e., block error rate (BLER), is often obtained by numerical\nmethods, such as Monte-Carlo simulations due to shortage of\nanalytical expressions for BLER.</p>\n\n<p>In this work, an approximation method for estimating the BLER\nin Nakagami-m block-fading channels is proposed. Furthermore, an\nanalytical expression with a single parameter is derived for Nakagami-\nm channels. This parameter can be obtained by single simulation\nat a single signal to noise ratio (SNR) in Rayleigh fading channel.\nOur simulation results demonstrates that the proposed methods is\nhighly accurate is estimating the BLER of many important wireless\ntechnologies.</p>
Cited by 0
Tahmasebi Toyserkani, Arash · Chalmers Publication Library (Chalmers University of Technology) · 2010
This thesis may be distinguished into two interdependent\nparts. The first part outlines the outcome of our efforts to\nconstruct accurate and yet simple models that account for the probability of successful reception of a packet for a wide range of physical layer parameters. The probability of successful reception of a packet in many applications can be accurately approximated by the probability of successfully receiving the payload, which in turn is a simple function of the block error rate (BLER). The presented studies are limited to block interference fading channels for which there exists few analytical solutions to the BLER. Therefore when needed, various numerical\nsolutions are employed to obtain an approximation of the BLER. A large part of this thesis is devoted to a detailed study of one of these numerical methods, known as the threshold method. We study the applicability of this method to Nakagami-$m$ block fading channels and to Rayleigh block interference channels. We also investigate the effect of physical layer and channel parameters on the accuracy of this approximation method and the value of the\nthreshold. As a result, a low complexity method of approximating the BLER in Nakagami-$m$ block fading channels is developed which is shown to be accurate for a wide range of different physical layer parameters and the practical values of $m$.\n\n\nThe second part of the thesis is devoted to applications of above models towards the study of various issues at the medium access control (MAC) layer. For instance, we formulate the scheduling problem in TDMA based clustered ad hoc networks as an optimization problem for which the cost function is obtained from the BLER models. The optimum schedule for maximizing the network throughput was obtained using the Lagrangian relaxation method. In addition, a simpler sub-optimum version of this algorithm with adaptable\ncomplexity is proposed.\n\n\nThe developed BLER model is also utilized to obtain both an\naccurate solution and a less-complex estimate of the link\nthroughput in slotted Aloha networks. The main advantage of these methods is that the detailed state of all nodes in the network is taken into account. Therefore, the obtained results are applicable to arbitrary topologies and traffic models.
Cited by 0
Tahmasebi Toyserkani, Arash, Ström, Erik G., Svensson, Arne · Chalmers Publication Library (Chalmers University of Technology) · 2010
With few exceptions, an analytical closed-form expression for the block error rate (BLER) is lacking in block fading channels. Thus, the BLER is often obtained by numerical methods, such as Monte-Carlo simulations, resulting in additional computational complexity. In this paper, we propose a single-parameter analytical approximation for the BLER in flat, block-fading Nakagami-m channels, which significantly reduces the computational overhead. The low computational cost of the approximation makes it feasible to include the BLER in the objective function of larger optimization problems.
Cited by 0
Arash Tahmasebi Toyserkani, Erik G. Ström, Arne Svensson · IEEE Transactions on Wireless Communications · 2010
With few exceptions, an analytical closed-form expression for the block error rate (BLER) is lacking in block fading channels. Thus, the BLER is often obtained by numerical methods, such as Monte-Carlo simulations, resulting in additional computational complexity. In this paper, we propose a single-parameter analytical approximation for the BLER in flat, block-fading Nakagami-m channels, which significantly reduces the computational overhead. The low computational cost of the approximation makes it feasible to include the BLER in the objective function of larger optimization problems.
Cited by 13Open access
César A. Medina, Tiago T. V. Vinhoza, Raimundo Sampaio‐Neto · 2010
We investigate adaptive minimum bit error rate (MBER) multiuser receivers for single (SC) and multicarrier (MC) CDMA systems in frequency selective channels. The approximate minimum BER (AMBER) receiver is examined and a Newton adaptive implementation is presented. Simulations results show how the proposed algorithm outperforms minimum mean squared error based algorithms.
Cited by 0
Lei Yuan, Nan Yang, Nan Yang et al. · 2022
<p>We comprehensively analyze the average block error rate (BLER) performance of intelligent reflecting surface (IRS) aided short-packet communication (SPC) systems over Rician fading. Our analysis covers two communication scenarios, depending on whether or not the direct link exists between the base station and the user, addresses two types of phase errors, namely, phase estimation errors modeled by the Von Mises distribution and quantization errors, and facilitates system design based on the instantaneous channel state information (CSI) and the statistical CSI. In our analysis, we first derive the distributions of the end-to-end channel and the received signal-to-noise ratio at the user under different phase adjustment strategies. Then we propose a more accurate approximation of the $Q$ function to derive closed-form expressions for the average BLER. Using numerical and simulation results, we corroborate the accuracy of our analysis and investigate the impacts of various parameters of the system, such as the number of IRS elements and the phase adjustment strategy, and different CSI availabilities on the average BLER performance. We also show that compared to the instantaneous CSI based design, the statistical CSI based design yields the near-optimal BLER performance for a large Rician factor, making it attractive for ultra-reliable and low-latency communications, given its low implementation complexity.</p>
Cited by 2Open access
Lei Yuan, Nan Yang, Nan Yang et al. · 2022
<p>We comprehensively analyze the average block error rate (BLER) performance of intelligent reflecting surface (IRS) aided short-packet communication (SPC) systems over Rician fading. Our analysis covers two communication scenarios, depending on whether or not the direct link exists between the base station and the user, addresses two types of phase errors, namely, phase estimation errors modeled by the Von Mises distribution and quantization errors, and facilitates system design based on the instantaneous channel state information (CSI) and the statistical CSI. In our analysis, we first derive the distributions of the end-to-end channel and the received signal-to-noise ratio at the user under different phase adjustment strategies. Then we propose a more accurate approximation of the $Q$ function to derive closed-form expressions for the average BLER. Using numerical and simulation results, we corroborate the accuracy of our analysis and investigate the impacts of various parameters of the system, such as the number of IRS elements and the phase adjustment strategy, and different CSI availabilities on the average BLER performance. We also show that compared to the instantaneous CSI based design, the statistical CSI based design yields the near-optimal BLER performance for a large Rician factor, making it attractive for ultra-reliable and low-latency communications, given its low implementation complexity.</p>
Cited by 0Open access