The tag has no usage guidance.

learn more… | top users | synonyms

3
votes
1answer
85 views

Relationship between information retrieval and source separation in signal processing

In machine learning, for the task of classifying input data (called an example) which are in binary representation, $\mathbf{x}\in \mathbb{R}^D$, $\mathbf{x} \in \{0,1\}^D$ into its multiple class ...
0
votes
1answer
29 views

Do convolution encoders exist with two separate (independent) inputs?

Do convolution encoders exist with two separate (independent) inputs? I got the question in my mind when I saw the question attached here.
0
votes
1answer
30 views

Golay complementary sequences in 802.11ad

The Golay complementary sequences consist of two sequences of the same length $N$ such that there acyclic autocorrelation sequences have sidelobes equal in magnitude but opposite in sign. So, when the ...
1
vote
0answers
58 views

Generating LDPC codes of arbitrary sizes in MATLAB

I am having problems generating LDPC codes of arbitrary sizes in MATLAB primarily because MATLAB insists on the parity check matrix that is input into its ldpcenc ...
0
votes
0answers
13 views

Raptor RFC 6330 LDPC,HDPC

Is there anyone that could possibly point out what algorithm is used to build the HDPC and LDPC vectors under RFC 6330 Raptor code standard? I know that there are various methods for filling up these ...
0
votes
0answers
26 views

How to calculate transmission capacity of a channel with multiple frequencies? [duplicate]

So I have the following question: If a transmission channel uses an analog carrier wave that is modulated by eight amplitudes and sixteen frequencies per bit time, then what is the ...
3
votes
1answer
56 views

What is the cost of Hamming coding?

We know that (7,4) hamming code has 4 message bits and 7 code bits and can detect any single bit error. The (12,4) repetition code has 4 message bits and 12 code bits and can detect any single bit ...
0
votes
1answer
25 views

What is special about the theorem that over GF(2), $f^2(X) = f(X^2)$?

What is special about the theorem that over GF(2), $f^2(X) = f(X^2)$? There is a some 10-line proof for the same in "page no.42, Shu Lin, Daniel J. Costello-Error Control Coding (2nd Edition)-...
0
votes
0answers
27 views

Why is $x$ not considered a primitive polynomial while being considered an irreducible polynomial?

In "Shu Lin, Daniel J. Costello-Error Control Coding (2nd Edition), Prentice Hall 2004" it is given that in $GF(2)$, if $f(x)$ is an irreducible polynomial of degree $m$ it divides $x^n+1$ where $n = ...
-1
votes
1answer
25 views

How to write cyclic codes?

I am studying cyclic codes. From what I understood of it, a cyclic code is a special kind of linear code with the property that any codeword cyclic shift is also a codeword. Generally, we start with ...
0
votes
3answers
33 views

In cyclic codes, a code vector can be obtained from another by simple circular shift. Why then the other method?

In cyclic codes, a code vector can be obtained from another by simple circular shift. Why then the other method is taught that is a bit round about? Take the code polynomial. Multiply it by the ...
1
vote
1answer
13 views

In block codes (channel coding), in practice how is the message length ($k$) fixed?

In block codes (channel coding), in practice, how is the message length ($k$) fixed? If $k$ is large, the practical implementation of it requires huge memory if look up table approach is adopted. ...
1
vote
0answers
57 views

Is there any formula for coding gain of Turbo code?

I want to compare throughput under different MCS( modulation and coding scheme). We know Shannon capacity $C = B \log(1+SNR)$ can be used to calculate throughput by SNR. However, there is no MCS ...
0
votes
1answer
39 views

Block code error control with $d \ge c+u+1$

This is about error control coding formula $$ d \ge c+u+1$$ of a block code, with $c$ being the number of correctable errors, $u$ being the number of uncorrectable errors, and $d$ being the ...
2
votes
1answer
48 views

Generate Minimum distance codes

I am trying to generate a set of linear block codewords of length n and have minimum hamming distance dmin. I understand Hamming codes but they are not flexible with n. One possible way I can think of ...
1
vote
1answer
164 views

Transmission capacity in “duobinary coding”

In "duo-binary signalling" how exactly is the transmission capacity increased? Because , when we encode the binary bits, the bit duration remains the same, but the amplitude will change. Then how can ...
0
votes
1answer
133 views

Important differences between BCJR and SOVA algorithms?

BCJR algorithm needs noise variance for Gamma (branch metrices) calculation. So I am wondering does SOVA (soft output Viterbi algorithm) needs noise variance?
9
votes
3answers
3k views

Can we break the Shannon capacity?

I have a friend working in wireless communications research. He told me that we can transmit more than one symbol in a given slot using one frequency (of course we can decode them at the receiver). ...
3
votes
2answers
582 views

Meaning of channel capacity in the AWGN channel

I understand the concept of channel capacity as the maximal rate of the channel code I can apply without making a mistake in the receiver, in that sense the capacity is between 0 and 1. What I don't ...
0
votes
1answer
182 views

Limitations of Arithmetic coding?

I have been working on an assignment for university in which I have to compress an 80K message consisting of only two symbols, 'a' and 'b', having probability values of 0.6 and 0.4. I have ...
4
votes
1answer
90 views

Does any error correction code still work in such situation?

I'm looking for a kind of error correction code or solution that can correct my codeword in this case: My message holds $k$ bits, and $2k$ bits codeword (rate is $1/2$) is produced by the generator ...
4
votes
3answers
564 views

Optimal DC-free line encoding

I have a block of n bits that I'd like to encode into m bits that have an equal number of zeros and ones. I looked at protocols like 8b/10b but it wastes 25% of the data to achieve balance. As an ...
2
votes
1answer
1k views

increase of encoding rate increases bandwidth?

I came across this paragraph in an article about signal processing. Addition of redundant bits for improving the error probability leads to bandwidth expansion of the transmitted signal by an amount ...
3
votes
1answer
901 views

Hamming code exercise

I'm preparing for my exams I stumbled across this exercise. Now I can't seem to figure it out. Anybody can help me ? The exercise: For the 8bit data word: 00111001 the check bits are: 0111. Now if ...