OFDM Tutorial Series: Reed Solomon Coding

Silicon DSP Corporation
Silicon DSP Corporation
9,941
0
Published 2021-06-01
The OFDM Tutorial Series goes in depth into the theory and implementation of OFDM wireless communication systems. Starting with the treatment of multipath fading channels, OFDM is introduced as a bandwidth efficient robust communication system for multipath fading channels. Using IEEE 802.11a as a basis, a full OFDM system is described in both theory and implementation. In particular, detailed description of acquisition including packet detection, timing synchronization, carrier frequency offset estimation and correction and channel estimation and equalization is presented along with implementation details.

For the Tutorial on OFDM and OFDMNA visit:
silicondsp.com/ofdm_tutorial_overview.htm

For MIMO OFDM Tutorial Series visit the following site for detailed information:
silicondsp.com/mimo_tutorial_overview.htm

For the PDF File for Each OFDM Tutorial See the Link Below :
silicondsp.com/OFDM_Tutorial_PDF_Files.html
All Comments (7)
  • @sidharth1109
    Thank you very much for this lecture. The only lecture I found easy to follow after thorough research.
  • @baahoosh
    This video is very good! BUT WHY THERE IS NO EXAMPLE FOR ERROR LOCATING AND CURRECTING ?! There was an example for generating codes with rs in GF(2^3) and it was very useful but in decoding stage we had just formulas!
  • @rcgldr
    HIstory - the code that Reed Solomon worked with in 1958 to 1960 or so was based on using a fixed set of data points, treating a message as a sequence of values. At around the same time, BCH code treated a bit stream as a polynomial with 1 bit coefficients, and there was a practical decoder (versus the original scheme of generating polynomials for every combination of k symbols out of n symbols, and choosing the most common one, which wasn't practical except for small messages). As noted in the WIki article: "By 1963 (or possibly earlier), J. J. Stone (and others) recognized that Reed Solomon codes could use the BCH scheme of using a fixed generator polynomial", instead of a fixed set of data points, and although the two encoding schemes are different, both are called Reed Solomon. https://en.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_correction .
  • @okanerturk7837
    In 46:40, i think $X_l = \gamma_j^{l}$ should be corrected as $X_l =\gamma_j^{j_l}$. Am I right?
  • @Spacekriek
    0:30.. I think it is more appropriate to say the codes were invented. You discover something when it was existing already but invent something which did not exist before.