low-complexity block codes
Low complexity trellis decoding of linear block codes
... Examples are presented for a number of widely used codes, Reed-Muller, Hamming, Golay, optimum etc.; however, the technique can be employed in the design of a wide variety of known linea[r] ...
9
Full Diversity Space Time Error Correcting Codes with Low Complexity Receivers
... Space-time block (STB) code designs have recently attracted considerable attention, since they improve the reliability of communication systems over fading ...STB codes (for the high SNR regime), in order ...
9
A Class of High Rate Low Complexity Error Detecting RLL Codes
... cient, low complexity, RLL/PED constrained codes has been ...information block length N , so that a fixed rate-independent endec architecture for encoder/decoder/error-control is accomplished, ...
8
Design & Analysis of Space Time Trellis Codes for Different Fading Channels
... space-time block code (STBC) design is not ...trellis codes (STTC) that provide full diversity as well as significant coding gains but at a cost of higher decoding ...space-time codes called ...
6
Low Complexity Decoding Algorithms and Architectures for Non Binary LDPC Codes
... LDPC codes, measured in Bit Error Rate (BER), come very close to the Shannon limit for the AWGN channel (within ...long block sizes (on the order of 10 6 to 10 7 ...
5
A Polar Code Successive Cancellation Decoder Implimentation through a Combinational Logic Circuit
... polar codes based on combinational ...relatively low clock frequencies compared to sequential circuits, but takes advantage of the high degree of parallelism inherent in such architectures to provide a ...
7
An Overview of Various Techniques to Improve Receive Diversity in MIMO OFDM
... space-time codes may combat fading and hence may significantly enhance the channel ...time block coding (STBC) schemes including Alamouti’s STBC for 2 transmit antennas as well as orthogonal STBC for 3 and ...
7
FPGA Implementation of Polar Codes for Low Complexity Decoder for High Speed Applications
... Here binary bits are transmitted over the channel and noisy version of those bits is being received. Now, all that has to be done is to recover the original bits that are transmitted from noisy varieties of those digital ...
8
Low complexity video coding on Block based Singular Value Decomposition (SVD) Algorithm
... of block codes of given length n to have small error probability is a more difficult and more interesting problem for correlated sources than for a single source ...
8
An Area Efficient Low Complexity Architecture for Comparing Data Encoded with Linear Block Codes
... efficient, low complexity, low latency architecture for matching data protected with linear block codes that can correct single errors, double-adjacent errors, triple-adjacent errorsand ...
8
Low-Complexity Low-Latency Architecture for Matching Of Data Encoded With Hard Systematic Error-Correcting Codes
... building block for calculating the Hamming ...hardware complexity by resolving the aforementioned ...systematic codes in designing the proposed architecture and propose a low-complexity ...
8
Accumulator Aided Decoding of Low Complexity SISO Arithmetic Codes with Image Transmission Application
... Use of accumulators (ACC) have been proposed in many wireless communication systems for close mapping of EXIT charts of two SISO decoders. Authors in [18] use doped accumulator on the top of a bit interleaved coded ...
8
Low-Complexity Low-Latency Architecture for Identical of Data Encoded With Hard Systematic Error-Correcting Codes
... of the comparison determines the flow of the succeeding operations. When the memory array is protected by ECC, it exacerbates the criticality because of the added latency due to ECC logic. In the cache tag matching ...
6
Low complexity soft demapping for non binary LDPC codes
... relatively low complexity LDPC decoding algorithms have been proposed in ...Space-Time Block Code (STBC) codewords, the complex- ity of the soft demapper at the receiver turns out to repre- sent a ...
16
Adaptive nested trellis decoding for block codes
... The technique can be employed for decoding a number of different block codes in single decoder, and provides low complexity implementation in comparison with other techniques A new adapt[r] ...
5
IMAGE STEGANOGRAPHY USING BLOCK COMPLEXITY ANALYSIS
... We segment the wavelet representation of the image into 8x8 blocks and determine the capacity of each block, in terms of bit per pixel, using the BPCS. A random seed is used to determine the order of conveying ...
7
Query Complexity Lower Bounds for Reconstruction of Codes
... are codes with an (O(log n),Ω(1)) codeword ...linear codes, and furthermore they satisfy R( C ) = n ...linear codes with an (O(log R(C)),Ω(1)) codeword ...linear codes one cannot get ...
19
A new computational decoding complexity measure of convolutional codes
... trellis complexity for a specific ...convolutional codes having the same complexity TC(M) defined in [4] may compare differently under ...interesting codes may have been overlooked in previous ...
10
HIGH RESOLUTION DOA ESTIMATION IN FULLY COHERENT ENVIRONMENTS S. N. Shahi, M. Emadi, and K. Sadeghi
... In the previous section, we see that we can reduce the computational burden by working in beamspace domain instead of element space domain. If we know the approximate location of targets, we can create beams just near ...
14
Block-wise Non-Malleable Codes
... non-malleable codes in the information theoretic ...non-malleable codes. They gave two constructions of such codes that are secure against continual tampering, where their concept of continuity is ...
51