A New PWL Approximation for the &quotSelf-Adjustable Offset Min-Sum&quot Decoding With a Highly Reduced-Complexity

International Journal of Computer Applications
doi 10.5120/10033-5068
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Foundation of Computer Science

Related search

A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover

2010English

Low-Density Parity-Check Codes for Discretized Min-Sum Decoding

English

Gaussian Approximation for Sum-Product Decoding of Low-Density Parity-Check Codes

English

A New Reduced-Complexity Detection Scheme for Zero-Padded OFDM Transmissions

Eurasip Journal on Wireless Communications and Networking
Computer NetworksComputer Science ApplicationsSignal ProcessingCommunications
2011English

Highly Accurate Log Skew Normal Approximation to the Sum of Correlated Lognormals

2014English

Non-Preemptive Min-Sum Scheduling With Resource Augmentation

2007English

Effects of Clipping and Quantization on Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes

English

Approximation Complexity of Min-Max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Approximation Schemes for the Min-Max Starting Time Problem

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy