Performance Comparison of List Viterbi Algorithm of Tail-Biting Convolutional Code for Future Machine Type Communications

2017 ◽  
Vol E100.B (8) ◽  
pp. 1293-1300 ◽  
Author(s):  
Shunichi BUSHISUE ◽  
Satoshi SUYAMA ◽  
Satoshi NAGATA ◽  
Nobuhiko MIKI
Keyword(s):  
Viterbi Algorithm ◽  
Convolutional Code ◽  
Performance Comparison ◽  
Machine Type ◽  
Tail Biting ◽  
Machine Type Communications ◽  
List Viterbi Algorithm

scholarly journals A Form of List Viterbi Algorithm for Decoding Convolutional Codes

2018 ◽  
Vol 4 (2) ◽  
pp. 42-48
Author(s):  
Shamsuddeen Hassan Muhammad ◽  
Abdulrasheed Mustapha
Keyword(s):  
Communication Systems ◽  
Viterbi Algorithm ◽  
Convolutional Code ◽  
Convolutional Codes ◽  
Wireless Communication Systems ◽  
Voice Over Internet Protocol ◽  
Viterbi Decoding ◽  
Maximum Likelihood Decoding ◽  
Error Performance ◽  
List Viterbi Algorithm

Viterbi algorithm is a maximum likelihood decoding algorithm. It is used to decode convolutional code in several wireless communication systems, including Wi-Fi. The standard Viterbi algorithm gives just one decoded output, which may be correct or incorrect. Incorrect packets are normally discarded thereby necessitating retransmission and hence resulting in considerable energy loss and delay. Some real-time applications such as Voice over Internet Protocol (VoIP) telephony do not tolerate excessive delay. This makes the conventional Viterbi decoding strategy sub-optimal. In this regard, a modified approach, which involves a form of List Viterbi for decoding the convolutional code is investigated. The technique employed combines the bit-error correction capabilities of both the Viterbi algorithm and the Cyclic Redundancy Check (CRC) procedures. It first uses a form of ‘List Viterbi Algorithm’ (LVA), which generates a list of possible decoded output candidates after the trellis search. The CRC check is then used to determine the presence of correct outcome. Results of experiments conducted using simulation shows considerable improvement in bit-error performance when compared to classical approach.

scholarly journals Performance comparison of channel coding schemes for 5G massive machine type communications

2021 ◽  
Vol 22 (2) ◽  
pp. 902
Author(s):  
Salima Belhadj ◽  
Abdelmounaim Moulay Lakhdar ◽  
Ridha Ilyas Bendjillali
Keyword(s):  
Error Rate ◽  
Channel Coding ◽  
Convolutional Code ◽  
Turbo Code ◽  
Low Complexity ◽  
Performance Comparison ◽  
Machine Type ◽  
Coding Schemes ◽  
Fifth Generation ◽  
Information Block

<p><span>Channel coding for the fifth generation (5G) mobile communication is currently facing new challenges as it needs to uphold diverse emerging applications and scenarios. Massive machine-type communication (mMTC) constitute one of the main usage scenarios in 5G systems, which promise to provide low data rate services to a large number of low power and low complexity devices. Research on efficient coding schemes for such use case is still ongoing and no decision has been made yet. Therefore, This paper compares the performance of different coding schemes, namely: tail-biting convolutional code (TBCC), low density parity check codes (LDPC), Turbo code and Polar codes, in order to select the appropriate channel coding technique for 5G-mMTC scenario. The considered codes are evaluated in terms of bit error rate (BER) and block error rate (BLER) for short information block lengths (K ≤ 256). We further investigate their Algorithmic complexity in terms of the number of basic operations. The Simulation results indicate that polar code with CRC-aided successive cancelation list decoder has better performance compared with other coding schemes for 5G-mMTC scenario.</span></p>

scholarly journals Event-Driven Source Traffic Prediction in Machine-Type Communications Using LSTM Networks

2020 ◽  
Author(s):  
Thulitha Senevirathna ◽  
Bathiya Thennakoon ◽  
Tharindu Sankalpa ◽  
Chatura Seneviratne ◽  
Samad Ali ◽  
...  
Keyword(s):  
Traffic Prediction ◽  
Machine Type ◽  
Machine Type Communications ◽  
Event Driven

scholarly journals Autonomous Power Decision for the Grant Free Access MUSA Scheme in the mMTC Scenario

Sensors ◽  
2020 ◽  
Vol 21 (1) ◽  
pp. 116
Author(s):  
Wissal Ben Ameur ◽  
Philippe Mary ◽  
Jean-François Hélard ◽  
Marion Dumay ◽  
Jean Schwoerer
Keyword(s):  
Interference Cancellation ◽  
Error Propagation ◽  
Multiple Access ◽  
Transmission Rate ◽  
Free Access ◽  
Decoding Complexity ◽  
Machine Type ◽  
Machine Type Communications ◽  
Multiple Access Schemes ◽  
Lower Complexity

Non-orthogonal multiple access schemes with grant free access have been recently highlighted as a prominent solution to meet the stringent requirements of massive machine-type communications (mMTCs). In particular, the multi-user shared access (MUSA) scheme has shown great potential to grant free access to the available resources. For the sake of simplicity, MUSA is generally conducted with the successive interference cancellation (SIC) receiver, which offers a low decoding complexity. However, this family of receivers requires sufficiently diversified received user powers in order to ensure the best performance and avoid the error propagation phenomenon. The power allocation has been considered as a complicated issue especially for a decentralized decision with a minimum signaling overhead. In this paper, we propose a novel algorithm for an autonomous power decision with a minimal overhead based on a tight approximation of the bit error probability (BEP) while considering the error propagation phenomenon. We investigate the efficiency of multi-armed bandit (MAB) approaches for this problem in two different reward scenarios: (i) in Scenario 1, each user reward only informs about whether its own packet was successfully transmitted or not; (ii) in Scenario 2, each user reward may carry information about the other interfering user packets. The performances of the proposed algorithm and the MAB techniques are compared in terms of the successful transmission rate. The simulation results prove that the MAB algorithms show a better performance in the second scenario compared to the first one. However, in both scenarios, the proposed algorithm outperforms the MAB techniques with a lower complexity at user equipment.

Sign in / Sign up

Export Citation Format

Share Document