Low-Complexity and High Performance SISO Decoding for Block Product Turbo Code (105,44)

2015 ◽  
Author(s):  
Je Hun Lim ◽  
Jun Ho Lee ◽  
Min Su Shin ◽  
Guk Han Cho ◽  
Young Joon Song
Keyword(s):  
High Performance ◽  
Turbo Code ◽  
Low Complexity ◽  
Block Product

scholarly journals High Area-Efficient Parallel Encoder with Compatible Architecture for 5G LDPC Codes

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 700
Author(s):  
Yufei Zhu ◽  
Zuocheng Xing ◽  
Zerun Li ◽  
Yang Zhang ◽  
Yifan Hu
Keyword(s):  
High Performance ◽  
Ldpc Codes ◽  
Low Complexity ◽  
Cmos Technology ◽  
Area Efficiency ◽  
Prior Art ◽  
New Radio ◽  
High Area ◽  
Significant Area ◽  
Area Efficient

This paper presents a novel parallel quasi-cyclic low-density parity-check (QC-LDPC) encoding algorithm with low complexity, which is compatible with the 5th generation (5G) new radio (NR). Basing on the algorithm, we propose a high area-efficient parallel encoder with compatible architecture. The proposed encoder has the advantages of parallel encoding and pipelined operations. Furthermore, it is designed as a configurable encoding structure, which is fully compatible with different base graphs of 5G LDPC. Thus, the encoder architecture has flexible adaptability for various 5G LDPC codes. The proposed encoder was synthesized in a 65 nm CMOS technology. According to the encoder architecture, we implemented nine encoders for distributed lifting sizes of two base graphs. The eperimental results show that the encoder has high performance and significant area-efficiency, which is better than related prior art. This work includes a whole set of encoding algorithm and the compatible encoders, which are fully compatible with different base graphs of 5G LDPC codes. Therefore, it has more flexible adaptability for various 5G application scenarios.

FULL-RATE AND LOW-COMPLEXITY SPACE-TIME BLOCK CODING CONCATENATED WITH CHANNEL CODES

2007 ◽  
Vol 06 (01) ◽  
pp. 5-14 ◽  
Author(s):  
XIANGBIN YU ◽  
GUANGGUO BI
Keyword(s):  
Channel Coding ◽  
Turbo Code ◽  
Multiple Antennas ◽  
Low Complexity ◽  
Space Time ◽  
System Throughput ◽  
Time Block ◽  
Coding Schemes ◽  
Full Diversity ◽  
Full Rate

Space-time block (STB) coding has been an effective transmit diversity technique for combating fading recently. In this paper, a full-rate and low-complexity STB coding scheme with complex orthogonal design for multiple antennas is proposed, and turbo code is employed as channel coding to improve the proposed code scheme performance further. Compared with full-diversity multiple antennas STB coding schemes, the proposed scheme can implement full data rate, partial diversity and a smaller complexity, and has more spatial redundancy information. Moreover, using the proposed scheme can form efficient spatial interleaving, thus performance loss due to partial diversity is effectively compensated by the concatenation of turbo coding. Simulation results show that on the condition of the same system throughput and concatenation of turbo code, the proposed scheme has lower bit error rate (BER) than those low-rate and full-diversity multiple antennas STB coding schemes.

A novel low-complexity and high-performance frame-skipping transcoder in dct domain

2005 ◽  
Vol 51 (4) ◽  
pp. 1306-1312 ◽  
Author(s):  
Chunrong Zhang ◽  
Shibao Zheng ◽  
Chi Yuan ◽  
Feng Wang
Keyword(s):  
High Performance ◽  
Low Complexity ◽  
Dct Domain ◽  
Performance Frame

scholarly journals Low-Complexity High-Performance Cyclic Caching for Large MISO Systems

2021 ◽  
pp. 1-1
Author(s):  
Mohammad Javad Salehi ◽  
Emanuele Parrinello ◽  
Seyed Pooya Shariatpanahi ◽  
Petros Elia ◽  
Antti Tolli
Keyword(s):  
High Performance ◽  
Low Complexity

scholarly journals Efficient Low-Complexity Digital Predistortion for Power Amplifier Linearization

2016 ◽  
Vol 6 (3) ◽  
pp. 1096
Author(s):  
Siba Monther Yousif ◽  
Roslina M. Sidek ◽  
Anwer Sabah Mekki ◽  
Nasri Sulaiman ◽  
Pooria Varahram
Keyword(s):  
Power Amplifier ◽  
High Performance ◽  
Low Complexity ◽  
Memory Effects ◽  
Model Complexity ◽  
Model Parameters ◽  
Digital Predistortion ◽  
Nonlinear Memory ◽  
Proposed Model ◽  
Code Division Multiple

<span lang="EN-US">In this paper, a low-complexity model is proposed for linearizing power amplifiers with memory effects using the digital predistortion (DPD) technique. In the proposed model, the linear, low-order nonlinear and high-order nonlinear memory effects are computed separately to provide flexibility in controlling the model parameters so that both high performance and low model complexity can be achieved. The performance of the proposed model is assessed based on experimental measurements of a commercial class AB power amplifier by applying a single-carrier wideband code division multiple access (WCDMA) signal. The linearity performance and the model complexity of the proposed model are compared with the memory polynomial (MP) model and the DPD with single-feedback model. The experimental results show that the proposed model outperforms the latter model by 5 dB in terms of adjacent channel leakage power ratio (ACLR) with comparable complexity. Compared to MP model, the proposed model shows improved ACLR performance by 10.8 dB with a reduction in the complexity by 17% in terms of number of floating-point operations (FLOPs) and 18% in terms of number of model coefficients.</span>

scholarly journals A high throughput architecture for a low complexity soft-output demapping algorithm

2015 ◽  
Vol 13 ◽  
pp. 73-80 ◽  
Author(s):  
I. Ali ◽  
U. Wasenmüller ◽  
N. Wehn
Keyword(s):  
Wireless Communication ◽  
High Throughput ◽  
Turbo Code ◽  
Low Complexity ◽  
Implementation Cost ◽  
Qam Modulation ◽  
Iterative Systems ◽  
Very High ◽  
Complexity Algorithm ◽  
Hardware Performance

Abstract. Iterative channel decoders such as Turbo-Code and LDPC decoders show exceptional performance and therefore they are a part of many wireless communication receivers nowadays. These decoders require a soft input, i.e., the logarithmic likelihood ratio (LLR) of the received bits with a typical quantization of 4 to 6 bits. For computing the LLR values from a received complex symbol, a soft demapper is employed in the receiver. The implementation cost of traditional soft-output demapping methods is relatively large in high order modulation systems, and therefore low complexity demapping algorithms are indispensable in low power receivers. In the presence of multiple wireless communication standards where each standard defines multiple modulation schemes, there is a need to have an efficient demapper architecture covering all the flexibility requirements of these standards. Another challenge associated with hardware implementation of the demapper is to achieve a very high throughput in double iterative systems, for instance, MIMO and Code-Aided Synchronization. In this paper, we present a comprehensive communication and hardware performance evaluation of low complexity soft-output demapping algorithms to select the best algorithm for implementation. The main goal of this work is to design a high throughput, flexible, and area efficient architecture. We describe architectures to execute the investigated algorithms. We implement these architectures on a FPGA device to evaluate their hardware performance. The work has resulted in a hardware architecture based on the figured out best low complexity algorithm delivering a high throughput of 166 Msymbols/second for Gray mapped 16-QAM modulation on Virtex-5. This efficient architecture occupies only 127 slice registers, 248 slice LUTs and 2 DSP48Es.

scholarly journals Data Detection in Single User Massive MIMO Using Re-Transmissions

2019 ◽  
Vol 6 (1) ◽  
pp. 15-26 ◽  
Author(s):  
K. Vasudevan ◽  
K. Madhu ◽  
Shivani Singh
Keyword(s):  
Massive Mimo ◽  
Turbo Code ◽  
Additive White Gaussian Noise ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Base Station ◽  
Mimo Channel ◽  
Data Detection ◽  
Major Drawback ◽  
Single User

Background:Single user Massive Multiple Input Multiple Output (MIMO) can be used to increase the spectral efficiency since the data is transmitted simultaneously from a large number of antennas located at both the base station and mobile. It is feasible to have a large number of antennas in the mobile, in the millimeter wave frequencies. However, the major drawback of single user massive MIMO is the high complexity of data recovery at the receiver.Methods:In this work, we propose a low complexity method of data detection with the help of re-transmissions. A turbo code is used to improve the Bit-Error-Rate (BER).Results and Conclusion:Simulation results indicate a significant improvement in BER with just two re-transmissions as compared to the single transmission case. We also show that the minimum average SNR per bit required for error-free propagation over a massive MIMO channel with re-transmissions is identical to that of the Additive White Gaussian Noise (AWGN) channel, which is equal to -1.6 dB.

scholarly journals Orthogonal Time Sequency Multiplexing Modulation

2021 ◽  
Author(s):  
Tharaj Thaj ◽  
Emanuele Viterbo
Keyword(s):  
Time Domain ◽  
Orthogonal Frequency Division Multiplexing ◽  
High Performance ◽  
High Mobility ◽  
Low Complexity ◽  
Modulation Scheme ◽  
Frequency Space ◽  
Time Frequency ◽  
Single Carrier ◽  
The Time Domain

This paper proposes <i>orthogonal time sequency multiplexing</i> (OTSM), a novel single carrier modulation scheme based on the well known Walsh-Hadamard transform (WHT) combined with row-column interleaving, and zero padding (ZP) between blocks in the time-domain. The information symbols in OTSM are multiplexed in the delay and sequency domain using a cascade of time-division and Walsh-Hadamard (sequency) multiplexing. By using the WHT for transmission and reception, the modulation and demodulation steps do not require any complex multiplications. We then propose two low-complexity detectors: (i) a simpler non-iterative detector based on a single tap minimum mean square time-frequency domain equalizer and (ii) an iterative time-domain detector. We demonstrate, via numerical simulations, that the proposed modulation scheme offers high performance gains over orthogonal frequency division multiplexing (OFDM) and exhibits the same performance of orthogonal time frequency space (OTFS) modulation, but with lower complexity. In proposing OTSM, along with simple detection schemes, we offer the lowest complexity solution to achieving reliable communication in high mobility wireless channels, as compared to the available schemes published so far in the literature.

Sign in / Sign up

Export Citation Format

Share Document