IP Library Granted Patent US 8,065,592
Granted Patent B2
US 8,065,592 · App. 12/847,968 · Granted Nov 22, 2011

Multi-source data encoding, transmission and decoding using slepian-wolf codes based on channel code partitioning

Assignee: The Texas A&M University System
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,065,592
App. No.
12/847,968
Granted
Nov 22, 2011
Kind
B2
Abstract

System and method for designing Slepian-Wolf codes by channel code partitioning. A generator matrix is partitioned to generate a plurality of sub-matrices corresponding respectively to a plurality of correlated data sources. The partitioning is performed in accordance with a rate allocation among the plurality of correlated data sources. A corresponding plurality of parity matrices are generated based respectively on the sub-matrices, where each parity matrix is useable to encode data from a respective one of the correlated data sources.

Claims (81)

1. A method comprising:

at a first of L encoding systems,

encoding, using an electronic device, a first of L correlated information sources using a first of L distinct submatrices of a parity check matrix, in order to generate a first of L syndromes;

sending the generated first syndrome to a joint decoder;

wherein the L distinct submatrices of the parity check matrix are derived from L corresponding submatrices of a generator matrix G,

wherein the L submatrices of the generator matrix G have ranks determined by a point selected in a Slepian-Wolf admissible rate region.

2. The method of claim 1 , wherein the joint decoder is configured to:

receive the L syndromes; and

decode the L syndromes using, respectively, the L submatrices of the generator matrix G.

3. The method of claim 1 , wherein the electronic device includes:

a processor configured to execute program instructions; or

one or more application-specific integrated circuits (ASICs); or

a combination of the processor configured to execute program instructions and one or more ASICs.

4. The method of claim 1 , wherein the L correlated information sources include sensors in a distributed sensor network.

5. The method of claim 1 , wherein the L correlated information sources include at least video sources, audio sources, or both video sources and audio sources in a distributed network.

6. An apparatus comprising:

one or more processors; and

a memory storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:

encoding a first of L correlated information sources using a first of L distinct submatrices of a parity check matrix, in order to generate a first of L syndromes;

sending the first syndrome to a joint decoder;

wherein the L distinct submatrices of the parity check matrix are derived from L corresponding submatrices of a generator matrix G,

wherein the L submatrices of the generator matrix G have ranks determined by a point selected in a Slepian-Wolf admissible rate region.

7. The apparatus of claim 6 , wherein the L correlated information sources include sensors in a distributed sensor network.

8. The apparatus of claim 6 , wherein the L correlated information sources include at least video sources, audio sources, or both video sources and audio sources in a distributed network.

9. A tangible, non-transitory computer-readable medium having computer-executable instructions stored thereon that, if executed by a computing device, cause the computing device to perform operations comprising:

encoding a first of L correlated information sources using a first of L distinct submatrices of a parity check matrix, in order to generate a first of L syndromes;

sending the first syndrome to a joint decoder;

wherein the L distinct submatrices of the parity check matrix are derived from L corresponding submatrices of a generator matrix G,

wherein the L submatrices of the generator matrix G have ranks determined by a point selected in a Slepian-Wolf admissible rate region.

10. The tangible, non-transitory computer-readable medium of claim 9 , wherein the L correlated information sources include sensors in a distributed sensor network.

11. The tangible, non-transitory computer-readable medium of claim 9 , wherein the L correlated information sources include at least video sources, audio sources, or both video sources and audio sources in a distributed network.

12. A method of decoding Slepian-Wolf encoded data, the method comprising:

receiving a plurality of syndromes associated with Slepian-Wolf encoded data, the plurality of syndromes including

L syndromes from L corresponding transmitters,

wherein L is greater than one;

computing, using an electronic device, a codeword using the L syndromes;

multiplying, using the electronic device,

each of L portions of the codeword by a corresponding submatrix of a generator matrix G to determine a corresponding vector,

wherein the submatrices of the generator matrix G has a dimension corresponding to a point in a Slepian-Wolf admissible rate region; and

generating, using the electronic device, decoded outputs based on the vectors.

13. The method as defined in claim 12 , wherein the corresponding vector is an intermediate vector.

14. The method as defined in claim 12 , wherein the point in a Slepian-Wolf admissible rate region is arbitrarily close to a Slepian-Wolf sum rate limit.

15. The method as defined in claim 12 , wherein the dimension is a row dimension.

16. The method as defined in claim 12 , wherein the plurality of syndromes is received via L codewords from the L transmitters.

17. The method as defined in claim 12 , wherein the plurality of syndromes is received via L codewords from the L transmitters, the method further comprising:

generating L expanded syndromes by inserting zero values at appropriate locations so that each of the L expanded syndromes are of the same length.

18. The method as defined in claim 12 , wherein the L corresponding transmitters are associated with corresponding sensors in a distributed sensor network.

19. The method as defined in claim 12 , wherein the L corresponding transmitters are associated with video sources, audio sources, or both video and audio sources in a distributed sensor network.

20. The method of claim 12 , wherein the electronic device includes:

a processor configured to execute program instructions,

one or more application-specific integrated circuits (ASICs) or

a combination of the processor configured to execute program instructions and one or more ASICs.

21. An apparatus comprising:

one or more processors; and

a memory storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:

receiving a plurality of syndromes associated with Slepian-Wolf encoded data, the plurality of syndromes including

L syndromes from L corresponding transmitters,

wherein L is greater than one;

computing, using an electronic device, a codeword using the L syndromes;

multiplying, using the electronic device,

each of L portions of the codeword by a corresponding submatrix of a generator matrix G to determine a corresponding vector,

wherein the submatrices of the generator matrix G has a dimension corresponding to a point in a Slepian-Wolf admissible rate region; and

generating, using the electronic device, decoded outputs based on the vectors.

22. The apparatus as defined in claim 21 , wherein the corresponding vector is an intermediate vector.

23. The apparatus as defined in claim 21 , wherein the dimension is a row dimension.

24. The apparatus as defined in claim 21 , wherein the plurality of syndromes is received via L codewords from the L transmitters.

25. The apparatus as defined in claim 21 , wherein the plurality of syndromes is received via L codewords from the L transmitters, the operations further comprising:

generating L expanded syndromes by inserting zero values at appropriate locations so that each of the L expanded syndromes are of the same length.

26. A tangible, non-transitory computer-readable medium having computer-executable instructions stored thereon that, if executed by a computing device, cause the computing device to perform operations comprising:

receiving a plurality of syndromes associated with Slepian-Wolf encoded data, the plurality of syndromes including

L syndromes from L corresponding transmitters,

wherein L is greater than one;

computing, using an electronic device, a codeword using the L syndromes;

multiplying, using the electronic device,

each of L portions of the codeword by a corresponding submatrix of a generator matrix G to determine a corresponding vector,

wherein the submatrices of the generator matrix G has a dimension corresponding to a point in a Slepian-Wolf admissible rate region; and

generating, using the electronic device, decoded outputs based on the vectors.

27. The tangible, non-transitory computer-readable medium as defined in claim 26 , wherein the corresponding vector is an intermediate vector.

28. The tangible, non-transitory computer-readable medium as defined in claim 26 , wherein the dimension is a row dimension.

29. The tangible, non-transitory computer-readable medium as defined in claim 26 , wherein the plurality of syndromes is received via L codewords from the L transmitters, the operations further comprising:

generating L expanded syndromes by inserting zero values at appropriate locations so that each of the L expanded syndromes are of the same length.

Assignments (2)
CONFIRMATORY LICENSE Recorded Jan 23, 2018
From: TEXAS A&M UNIVERSITY SYSTEM
To: NIH - DEITR
Reel/Frame 044701/0516 →
CONFIRMATORY LICENSE Recorded Dec 14, 2017
From: TEXAS A&M UNIVERSITY
To: NATIONAL SCIENCE FOUNDATION
Reel/Frame 044877/0023 →
Continuity (2)
Division 11069935 · Mar 1, 2005
Related Publication 20110029846A1 · Feb 3, 2011