Discrete universal denoising with reliability information

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

10876958

ABSTRACT:
A method of and system for generating reliability information for a noisy signal received through a noise-introducing channel. In one embodiment, symbol-transition probabilities are determined for the noise-introducing channel. Occurrences of metasymbols in the noisy signal are counted, each metasymbol providing a context for a symbol of the metasymbol. For each metasymbol occurring in the noisy signal, reliability information for each possible value of the symbol of the metasymbol is determined, the reliability information representing a probability that the value in the original signal corresponding to the symbol of the metasymbol assumed each of the possible values. In another embodiment, error correction coding may be performed by adding redundant data to an original signal prior to transmission by the noise-introducing channel and performing error correction decoding after transmission.

REFERENCES:
patent: 5920599 (1999-07-01), Igarashi
patent: 5968198 (1999-10-01), Hassan et al.
patent: 6499128 (2002-12-01), Gerlach et al.
patent: 6654926 (2003-11-01), Raphaelie et al.
patent: 6738941 (2004-05-01), Todoroki
patent: 2003/0115028 (2003-06-01), Summerfield et al.
patent: 2005/0289433 (2005-12-01), Weissman et al.
patent: 2006/0045218 (2006-03-01), Ordentlich et al.
patent: 2006/0045360 (2006-03-01), Weissman et al.
patent: 2006/0047438 (2006-03-01), Ordentlich et al.
patent: 2006/0047484 (2006-03-01), Seroussi et al.
patent: 2006/0047501 (2006-03-01), Seroussi et al.
patent: 2006/0070256 (2006-04-01), Weissman et al.
patent: 2006/0070257 (2006-04-01), Weissman et al.
Weissman, T et al.; Universal discrete denoising; Information Theory Workshop, 2002, Proceedings of the 2002 IEEE; Oct. 20-25, 2002; pp. 11-14.
Ordentlich, E. et al.; A discrete universal denoiser and its application to binary images; Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on; vol. 1, Sep. 14-17, 2003; pp. I—117-120 vol. 1.
Weissman, T et al.; Universal discrete denoising; known channel; Information Theory, 2003. Proceedings. IEEE International Symposium on; Jun. 29-Jul. 4, 2003; p. 84.
Weissman et al., HP Labs: Tech Report: HPL-2003-29: Universal Discrete Denoising: Known Channel, Feb. 24, 2003; pp. 1-50.
P Strauch et al—“Low Complexity Source Controlled Channel Decoding in a GSM System” —1999 IEEE Int'l Conf on Acoustics, Speech and Signal Processing—vol. 5-Mar. 15, 1999.
Ma Dawei—“A Reliable Data Transmission Scheme Under Wireless Condition”—Proc 3rd Int'l Conference on Microwave & Millileter Wave Technology—Aug. 18, 2002, pp. 245-248.
M Adrat et al—“Convergence Behavior of Iterative Source-Channel Decoding”—2003 IEEE Int'l Conf on Acoustics, Speech and Signal Processing—vol. 1 of 6—Apr. 6, 2003.
Weissman, Tsachy et al., Universal Discrete Denoising, ITW2002, Bangladore, India, Oct. 20-25, 2002.
Gortz, N., A Generalized Framework for Iterative Source-Channel Decoding, Turbo Codes; Error-Correcting Codes of Widening Application, Chapter 6, 2001, pp. 105-126.
Gortz, N., On the Iterative Approximation of Optimal Joint Source-Channel Decoding, IEEE Journal on Selected Areas in Communications, vol. 19, No. 9, Sep. 2001.
Garcia-Frias et al., Joint Turbo Decoding and Estimation of Hidden Markov Sources, IEEE Journal on Selected Areas in Communications, vol. 19, No. 9, Sep. 2001.
Weissman et al., U.S. Appl. No. 10/688,520, filed Oct. 17, 2003.
Hindelang et al., Combined Source/Channel (De-)Coding: Can a Priori Information Be Used Twice?, IEEE International Conference on Communications, 2000, pp. 1208-1212.
Bauer et al., Symbol-by-Symbol MAP Decoding of Variable Length Codes, Proc. of 3rd ITG Conference on Source and Channel Coding, Munich, Germany, Jan. 2000, pp. 111-116.
Bauer et al., On Variable Length Codes for Iterative Source/Channel Decoding, Proc. IEEE Data Compression Conference, Mar. 2001, pp. 272-282.
Caire et al., Almost-Noisless Joint Source-Channel Coding-Decoding of Sources with Memory, 5th International ITG Conference on Source and Channel Coding, Erlangen, Germany, Jan. 14-16, 2004.
Garcia-Frias et al., Combining Hidden Markov Source Models and Parallel Concatenated Codes, IEEE Communications Letters, vol. 1, No. 4, Jul. 1997.
Garcia-Frias, J., Joint Source-Channel Decoding of Correlated Sources over Noisy Channels, IEEE Data Compression Conference, 2001.
Bystrom et al., Soft Source Decoding With Applications, IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, No. 10, Oct. 2001.
Lakovic et al., Parallel Concatenated Codes Iterative Source-Channel Decoding, Proceedings of 39th Annual Allerton Conference on Communications, Control and Computing, Oct. 3-5, 2001.
Hagenauer, Source-Controlled Channel Decoding, IEEE Transactions on Communications, vol. 43, No. 9, Sep. 1995.
Bauer et al., Iterative Source/Channel-Decoding Using Reversible Variable Length Codes, Data Compression Conference, 2000, pp. 93-102.
Fingscheidt et al., Combined Source/Channel Decoding: When Minimizing Bit Error Rate is Suboptimal, ITG-Fachbericht 159, 2000, pp. 273-278.
Gortz, N., Iterative Source-Channel Decoding using Soft-In/Soft-Out Decoders, ISIT 2000, Sorrento, Italy, Jun. 25-30, 2000, p. 173.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Discrete universal denoising with reliability information does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Discrete universal denoising with reliability information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discrete universal denoising with reliability information will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3757535

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.