Computer Science – Information Theory
Scientific paper
2008-10-04
Computer Science
Information Theory
Scientific paper
In this paper we wish to introduce a method to reconstruct large size Welch Bound Equality (WBE) codes from small size WBE codes. The advantage of these codes is that the implementation of ML decoder for the large size codes is reduced to implementation of ML decoder for the core codes. This leads to a drastic reduction of the computational cost of ML decoder. Our method can also be used for constructing large Binary WBE (BWBE) codes from smaller ones. Additionally, we explain that although WBE codes are maximizing the sum channel capacity when the inputs are real valued, they are not necessarily appropriate when the input alphabet is binary. The discussion shows that when the input alphabet is binary, the Total Squared Correlation (TSC) of codes is not a proper figure of merit.
Faraji Mohammad Javad
Marvasti Farokh
Pad Pedram
No associations
LandOfFree
A New Method for Constructing Large Size WBE Codes with Low Complexity ML Decoder does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A New Method for Constructing Large Size WBE Codes with Low Complexity ML Decoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Method for Constructing Large Size WBE Codes with Low Complexity ML Decoder will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-541710