The present embodiments of the invention relate to a method for quasi-cyclic low-density parity-check (QC-LDPC) encoding and decoding and an apparatus for quasi-cyclic low-density parity-check encoding and decoding.
The present embodiments of the invention also relate to a computer-readable storage medium storing program code, the program code comprising instructions for carrying out such a method.
Error-correcting coding is an efficient method to improve capacity of a communication system. Wireless systems may require employing a large set of code with different length and rate. For example LTE provides more than several thousand of different code lengths and rates using a hardware friendly interleaver and simply puncturing pattern, but the sequential nature of the BCJR decoder of Turbo code significantly limits parallelism decoder throughput. Hence, it is thus a problem how to create a compact representation of QC-LDPC codes, which supports sets of QC-LDPC codes with different lengths and rates. Other problems to be solved include getting additive increase of circulant size to minimize gap between several lengths of code; to define some block-structured memory efficient puncture pattern with minimal performance lost; and to maximize number of variable node in block-structured which recover under practical number iteration.
A problem of existing floor lifting methods is the possibility of appearing of short cycles in parity check matrices and bad weight spectrum of codewords. This leads to lower code gain.
The objective of the present embodiments of the invention is to provide a method for quasi-cyclic low-density parity-check encoding and decoding and an apparatus for quasi-cyclic low-density parity-check encoding and decoding, wherein the method for QC-LDPC encoding and decoding and the apparatus for QC-LDPC encoding and decoding overcome one or more of the above-mentioned problems of the prior art. Aspects of the embodiments of the invention provide error correction, especially to channel coding for wireless communication, such as WI-FI or 5G communication.
The foregoing and other objects are achieved by the features of the independent claims. Further implementation forms are apparent from the dependent claims, the description and the figures.
A first aspect of the embodiments of the invention provides a method for quasi-cyclic low-density parity-check (QC-LDPC) encoding and decoding of a data packet by a lifted matrix, obtained by floor scale modular lifting of a base matrix of QC-LDPC code, the method comprising: lifting the QC-LDPC code for maximal code length Nmax and maximal circulant size Zupper of the base matrix, Nmax=Zupper*L, wherein L is a column in the base matrix; generating a plurality of optimal values ri for a plurality of circulants Z1, Z2, . . . , Zupper based on the QC-LDPC code lifted for maximal length Nmax, 0≤ri≤Zupper−1; saving the generated plurality of optimal values ri corresponding to the plurality of circulants Z1, Z2, . . . , Zupper and a matrix for the QC-LDPC code lifted for maximal length Nmax the memory unit. These steps may be made offline only once. The method further comprises receiving a current circulant Zcurrent from the plurality of circulants Z1, Z2, . . . , Zupper; selecting a current optimal value rcurrent from the plurality of optimal values ri stored in the memory unit corresponding to the current circulant Zcurrent; and lifting the base matrix based on the current optimal value rcurrent, wherein a floor lifting of the base matrix is calculated as:
where E(Hupper) is a value of circulant shift in the base matrix for maximal circulant size; wherein 0≤rcurrent≤Zupper−1 and rcurrent=1 is excluded. Therefore, a QC-LDPC mother code lifting method with flexible length and rate is provided to be used for encoding and decoding of data packets. This method provides memory efficient QC-LDPC code representation with maximal flexibility of length and rate. The overall code performance is also therefore increased due to providing memory consumption and processing speed increase.
The methods according to the first aspect of the embodiments of the invention can be performed by a computer-readable storage medium according to the second aspect of the embodiments of the invention. Further features or implementations of the method according to the first aspect of the embodiments of the invention can perform the functionality of an apparatus for QC-LDPC encoding and decoding according to the third aspect of the embodiments of the invention and its different implementation forms.
In a first implementation of the method for QC-LDPC encoding and decoding of a data packet by a lifted matrix according to the first aspect, generating the plurality of optimal values ri for the plurality of circulants Z1, Z2, . . . , Zupper further comprises: constructing a plurality of families of parity-check matrixes, each family corresponds to value r in a plurality of values r1, r2, . . . , rk corresponding to code lengths N1, N2, N3, . . . , Nk; and based on the plurality of the families of the parity-check matrixes, selecting the plurality of optimal values ri for the plurality of circulants Z1, Z2, . . . , Zupper by multi-parameter filtering. Using at least one parity-check matrix a set of code can be represented with minimal performance degradation and high memory efficiency.
In a second implementation of the method for QC-LDPC encoding and decoding of a data packet by a lifted matrix according to the first implementation of the first aspect, the multi-parameter filtering includes at least on of: Extrinsic Message Degree, ACE Spectrum, Tanner Spectral Bound, Code Distance, Codeword's weight spectrum enumerator, Trapping Set Weight Enumerator, simulations result. All these ways of choosing best r value provide improved filtering quality due to better consideration of multiple parameters and enable choosing the optimal r value to be used in a lifting procedure.
In a third implementation of the method for QC-LDPC encoding and decoding of a data packet by a lifted matrix according to any of the first or second implementations of the first aspect, constructing the plurality of the families of the parity-check matrixes is performed using formula: Er(Hupper)=E(Hupper)·r mod Zupper. Using Er(Hupper) provides additional flexibility due to possibility to choose r value to avoid critical points.
A second aspect of the embodiments of the invention refers to a a computer-readable storage medium storing program code, the program code comprising instructions for carrying out the method of the first aspect or one of the implementations of the first aspect.
A third aspect of the embodiments of the invention refers to an apparatus for quasi-cyclic low-density parity-check (QC-LDPC) encoding and decoding of a data packet by a lifted matrix, obtained by floor scale modular lifting of a base matrix of QC-LDPC code, the apparatus comprising a processing unit and a memory unit, the memory unit storing: a maximal length Nmax and a maximal circulant size Zupper of the base matrix, a matrix for the QC-LDPC code lifted for maximal length Nmax; and a plurality of optimal values ri corresponding to a plurality of circulants Z1, Z2, . . . , Zupper, the plurality of optimal values ri is generated based on the QC-LDPC code lifted for maximal length Nmax and maximal circulant size Zupper of the base matrix, wherein Nmax=Zupper*L, L is a column in the base matrix and 0≤ri≤Zupper−1. The processing unit is configured to: receive a current circulant Zcurrent from the plurality of circulants Z1, Z2, . . . , Zupper select a current optimal value rcurrent from the plurality of optimal values ri stored in the memory unit corresponding to the current circulant Zcurrent; and lift the base matrix based on the current optimal value rcurrent, wherein a floor lifting of the base matrix is calculated as:
where E(Hupper) is a value of circulant shift in the base matrix for maximal circulant size; wherein 0≤rcurrent≤Zupper−1 and rcurrent=1 is excluded.
In a first implementation of the apparatus for QC-LDPC encoding and decoding of a data packet by a lifted matrix of the third aspect, generating the plurality of optimal values ri for the plurality of circulants Z1, Z2, . . . , Zupper comprises: constructing a plurality of families of parity-check matrixes, each family corresponds to value r in a plurality of values r1, r2, . . . , rk corresponding to code lengths N1, N2, N3, . . . , Nk; and based on the plurality of the families of the parity-check matrixes, selecting the plurality of optimal values ri for the plurality of circulants Z1, Z2, . . . , Zupper by multi-parameter filtering.
In a second implementation of the apparatus for QC-LDPC encoding and decoding of a data packet by a lifted matrix according to the first implementation of the third aspect, the multi-parameter filtering includes at least on of: Extrinsic Message Degree, ACE Spectrum, Tanner Spectral Bound, Code Distance, Codeword's weight spectrum enumerator, Trapping Set Weight Enumerator, simulations result.
In a third implementation of the apparatus for QC-LDPC encoding and decoding of a data packet by a lifted matrix according to any of the first or second implementations of the third aspect, the processing unit is further configured to construct the plurality of the families of the parity-check matrixes using formula: Er(Hupper)=E(Hupper)·r mod Zupper.
All the implementations of the first aspect may be easily combined and used together with all the implementations of the third aspect.
These and other aspects of the embodiments of the invention will be apparent from the embodiments described below.
To illustrate the technical features of embodiments of the present invention more clearly, the accompanying drawings provided for describing the embodiments are introduced briefly in the following. The accompanying drawings in the following description are merely some embodiments of the present invention, modifications on these embodiments are possible without departing from the scope of the present embodiments of the invention as defined in the claims.
Nmax=Zupper*L, (1)
wherein L is a column in the base matrix.
At step 102 a plurality of optimal values ri for a plurality of circulants Z1, Z2, . . . , Zupper is generated based on the QC-LDPC code lifted for maximal length Nmax, 0≤ri≤Zupper−1. The generated plurality of optimal values ri corresponding to the plurality of circulants Z1, Z2, . . . , Zupper and a matrix for the QC-LDPC code lifted for maximal length Nmax are saved in the memory unit at step 103. At step 104 a current circulant Zcurrent from the plurality of circulants Z1, Z2, . . . , Zupper is received. Then a current optimal value rcurrent is selected from the plurality of optimal values ri stored in the memory unit corresponding to the current circulant Zcurrent (step 105). Finally at step 106 the base matrix is lifted based on the current optimal value rcurrent. A floor lifting of the base matrix is calculated as:
where E(Hupper) is a value of circulant shift in the base matrix for maximal circulant size; wherein 0≤rcurrent≤Zupper−1 and rcurrent=1 is excluded.
The method for QC-LDPC encoding and decoding in accordance with the present embodiment of the invention may be widely used, for example in cryptography, in data transfer and for data storage.
A (J,L) regular QC-LDPC code of length N is usually defined by a parity-check matrix:
where 1≤j≤J−1, 1≤l≤L−1 and I(pj,l) represents the p×p circulant permutation matrix obtained by cyclically right-shifting the p×p identity matrix I(0) by pj,l positions, with p=N/L.
For a specific QC-LDPC code the corresponding “base matrix” (“mother matrix” or protograph) is defined as the matrix of circulant shift that defines the QC-LDPC code:
Mask matrix for which regular QC-LDPC code can become irregular for different column weight case or QC-LDPC regular code with zero block circulant may be defined as:
where ⊗ is Hadamard product.
Lifting is operation under base matrix (protograph), by using of which code with different authomorphism or circulant size from a similar base matrix can be obtained.
Normally floor-lifting of base matrix is calculated by formula:
where zcurrent—lifting size of circulant,
zupper—maximal circulant size of base matrix,
E(Hupper)—value of circulant shift in base matrix for maximal size of circulant.
Length of code N from zcurrent*VNprotograph to zupper*VNprotograph with some additive step between zcurrent:step:zupper, where VNprotograph is number of variable nodes in base matrix.
The method according to the present embodiment of the invention uses random matrix design approach lifting QC-LDPC directly from mask matrix (base matrix or protograph).
A cycle of even length 2K in H is defined by 2K positions such that:
1) Two consecutive positions are obtained by changing alternatively column of row only;
2) All positions are distinct except first and last one;
Two consecutive elements of the path belong to different circulant permutation matrices. So a chain of circulant permutation matrices can be defined:
I(pi
where ia≠ia+1, ja≠ja+1, for all 0≤a≤K−1.
As each part of cycle is one, the circulant permutation matrix I(pi,j) participating in cycle cannot be empty. Using these shifts of identity matrix necessary and sufficient conditions of existing of the cycle can be defined as:
Σa=0K−1pi
The input for floor modular scale lifting represents a QC-LDPC code lifted for maximal circulant size Zupper with L variable nodes (columns in base matrix) and J parity-check (rows in base matrix):
Zupper*L=Nmax. (11)
Circulant sizes for which lifting this base matrix is desired: Z1<Z2< . . . <Zk<Zupper, to get lengths Z1*L=N1<Z2*L=N2<Z3*L=N3<Z4*L=N4< . . . <Zupper*L=Nmax. The output of the floor modular scale lifting represents scale values r1, r2, . . . , rk for every circulant sizes Z1, Z2, . . . , Zk. By using these values it is possible to generate code for every code lengths N1, N2, N3, . . . , Nk in a fast manner using formula (12).
QC-LDPC code lifted for maximal code length is received and for every value r1, r2, . . . , rk (related to circulants size Z1, Z2, . . . , Zk) which corresponds to codes with lengths N1, N2, N3, . . . , Nk using formula (12) i parity-check matrixes are determined. Every rcurrent can be in the range 1 . . . Z, −1. After using multi-parameter sieving, best value r is chosen based on: Extrinsic Message Degree, ACE Spectrum, Tanner Spectral Bound, Code Distance, Codeword's weight spectrum enumerator, Trapping Set Weight Spectrum Enumerator, simulation result, as shown in
This procedure may be made offline only once, then a matrix lifted for maximal length is saved along with r values.
After value ri is got for every circulant Z1, Z2, . . . , Zupper parity-check matrix for every length N1, N2, N3, . . . , Nk can be constructed using formula:
Er(Hupper)=E(Hupper)·r mod zupper (12)
where r is integer 1≤r≤zupper−1 and GCD(r, zupper)=1.
For any path P shift d′P in the Er(Hupper) is equal to r times of shift dP by same path in E(Hupper):
When GCD(r, zupper)=1, d′p≡0(mod zupper) in the same time with dp≡0 (mod zupper).
So, structure of cycles of E(Hupper) and E_r(Hupper) are equivalent. In comparison with classical floor lifting approach, this method provides additional freedom and flexibility. Such r can be chosen as to avoid catastrophic (critical) points and to improve quality of graph in general, example of improving using change of r is presented in
Combining formula (12) with formula (7) of classical floor-lifting of base matrix the following formula for a floor lifting can be obtained:
where rcurrent−scale factor, being an integer value from 0 . . . zupper−1,
CGD(rcurrent,zupper)=1.
This increases freedom and flexibility of floor lifting.
For each zcurrent we can find such rcurrent that bring best possible quality of E(Hcurrent). This method can be applied to any QC-LDPC codes to get flexible length properties.
Comparison of the floor lifting in accordance with the present embodiment of the invention with traditional floor lifting is further provided with the reference to
Table 1 contains a comparison of the lifting approach in accordance with the provided method and a traditional floor lifting approach based on the number of cycles.
Comparison based on the ACE Spectrum for lifting with circulant size zcurrent=60, N=1440 is provided in
BER performance comparison of traditional floor-lifting QC-LDPC and QC-LDPC lifted using the provided approach of same base-matrix under min-sum decoder 15 iterations under AWGN channel is illustrated in
Using the floor scale modular lifting method described in the present description the following two parity-check matrix of Repeat Accumulate QC-LDPC code may be designed: 12×24 circulant from 28 to 2304 with step 4, length 672 to 55296 with step 96, rate 0.5
and
6×24 circulant from 4 to 2304 with step 4 length 96 to 55296 with step 96, rate 0.75
The foregoing descriptions are only implementation manners of the present embodiments of the invention, the scope of the present embodiments of the invention is not limited to this. Any variations or replacements can be easily made through person skilled in the art. Therefore, the protection scope of the present embodiments of the invention should be subject to the protection scope of the attached claims.
This application is a continuation of International Application No. PCT/RU2016/000777, filed on Nov. 14, 2016, the disclosure of which is hereby incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
8266512 | Park et al. | Sep 2012 | B2 |
8433984 | Khandekar | Apr 2013 | B2 |
8578249 | Khandekar et al. | Nov 2013 | B2 |
9100052 | Pisek | Aug 2015 | B2 |
20080008270 | Li et al. | Jan 2008 | A1 |
20080178065 | Khandekar et al. | Jul 2008 | A1 |
20090049357 | Ueng et al. | Feb 2009 | A1 |
20100257425 | Yue et al. | Oct 2010 | A1 |
20130086455 | Pisek | Apr 2013 | A1 |
20170134050 | Abu-Surra | May 2017 | A1 |
20170149528 | Kim | May 2017 | A1 |
Number | Date | Country |
---|---|---|
101432968 | May 2009 | CN |
101854228 | Oct 2010 | CN |
103795424 | May 2014 | CN |
Entry |
---|
V. Usatyuk and S. Egorov, “Generalization of floor lifting for QC-LDPC codes,” 2017 IEEE East-West Design & Test Symposium (EWDTS), Novi Sad, 2017, pp. 1-6. |
Seho Myung and Kyeongcheol Yang, “Extension of quasi-cyclic LDPC codes by lifting,” Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., Adelaide, SA, 2005, pp. 2305-2309. |
Seho Myung, Kyeongcheol Yang and Youngkyun Kim, “Lifting methods for quasi-cyclic LDPC codes,” in IEEE Communications Letters, vol. 10, No. 6, pp. 489-491, Jun. 2006. |
A. Tasdighi, A. H. Banihashemi and M. Sadeghi, “Efficient Search of Girth-Optimal QC-LDPC Codes,” in IEEE Transactions on Information Theory, vol. 62, No. 4, pp. 1552-1564, Apr. 2016. |
Seho Myung et al.,“Lifting Methods for Quasi-Cyclic LDPC Codes”,IEEE Communications Letters, vol. 10, No. 6, Jun. 2006,total 3 pages. |
IEEE Standard C802.16e-05/066r3 Brian Classon et al.,“LDPC Coding for OFDMA PHY”,dated Jan. 27, 2005,total 16 pages. |
Ming Jiang et al.,“An improved variable length coding scheme using structured LDPC codes”,2010 International Conference on Wireless Communications and Signal Processing (WCSP),total 5 pages. |
[1] R. Gallager, “Low density parity-check codes,”IRE Trans, Information Theory, pp. 21-18.Jan. 1962. |
[2] R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Trans. Information Theory, pp. 533-547, Sep. 1981. |
[3] D. Mackay and R. Neal, “Good codes based on very sparse matrices,” Cryptography and Coding, 5th IMA Conf., C. Boyd, Ed., Lecture Notes in Computer Science, pp. 99-111, Berlin, Germany, 1995. |
[4] D. Mackay, “Good error correcting codes based on very sparse matrices,” IEEE Trans. Information Theory, pp. 399-431, Mar. 1999. |
[5] N. Alon and M. Luby, “A linear time erasure-resilient code with nearly optimal recovery,” in IEEE Transactions on Information Theory, vol. 42, No. 6, pp. 1732-1736, Nov. 1996. |
[6] T. Richardson, M. Shokrollahi, and R. Urbanke, “Design of capacity approaching irregular low-density parity-check codes,” IEEE Trans. Inform. Theory, vol. 47, No. 2, pp. 619-637, Feb. 2001. |
[7] Sae-Young Chung; Forney, G.D., Jr.; Richardson, T.J.; Urbanke, R., “On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit,” Communications Letters, IEEE , vol. 5, No. 2, pp. 58-60, Feb. 2001. |
[9] Kasai, K.; Sakaniwa, K., “Spatially-coupled MacKay-Neal codes and Hsu-Anastasopoulos codes,” Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , vol., No., pp. 747-751, Jul. 31, 2011-Aug. 5, 2011. |
[10] Sugihara, K.; Miyata, Y.; Sugihara, T.; Kubo, K.; Yoshida, H.; Matsumoto, W.; Mizuochi, T., “A spatially-coupled type LDPC Code with an NCG of 12 dB for optical transmission beyond 100 Gb/s,” Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013 , vol., No., pp. 1-3, Mar. 2013. |
[11] Maunder, R.G., “A Fully-Parallel Turbo Decoding Algorithm,” in Communications, IEEE Transactions on , vol. 63, No. 8, pp. 2762-2775, Aug. 2015. |
[12] Niclas Wiberg ,“Codes and Decoding on General Graphs” Volym 440 Linköping studies in science and technology: Dissertations, Linköping University, 1996 ,total 108 pages. |
[13] Tanner, R.M.; Sridhara, D.; Sridharan, A.; Fuja, T.E.; Costello, D.J., “LDPC block and convolutional codes based on circulant matrices,” in Information Theory, IEEE Transactions on , vol. 50, No. 12, pp. 2966-2984, Dec. 2004. |
[14] Beermann, M.; Wickert, F.; Vary, P., “Highly flexible design of multi-rate multi-length quasi-cyclic LDPC codes,” in Turbo Codes and Iterative Information Processing (ISTC), 2014 8th International Symposium on , vol., No., pp. 37-41. |
[15] Seho Myung; Kyeongcheol Yang, “Extension of quasi-cyclic LDPC codes by lifting,” in Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on, vol., No., pp. 1-5, Sep. 4-9, 2005. |
[17] Ming Jiang; Chen Wang; Yuan Zhang; Chunming Zhao, “An improved variable length coding scheme using structured LDPC codes,” in Wireless Communications and Signal Processing (WCSP), 2010 International Conference on , vol., No., pp. 1-5, Oct. 21-23, 2010. |
[18] Jin Xu; Jun Xu, “Structured LDPC Applied in IMT-Advanced System,” in Wireless Communications, Networking and Mobile Computing, 2008. WiCOM 08. 4th International Conference on , vol., No., pp. 1-4. |
[20] Jeongseok Ha, Jaehong Kim, Demijan Klinc, and Steven W. McLaughlin ,“Rate-Compatible Punctured Low-Density Parity-Check Codes With Short Block Lengths”. IEEE Transactions on information theory, vol. 52, No. 2, Feb. 2006.,pp. 728-738. |
[22] Cuizhu Shi; Ramamoorthy, A., “Design and analysis of E2RC codes,” in Selected Areas in Communications, IEEE Journal on , vol. 27, No. 6, pp. 889-898, Aug. 2009. |
[23] R. C. Bose, “On the construction of balanced incomplete block designs”, Ann. Eugenics 9 (1939), pp. 353-399. |
[24] Lan Lan; Ying Yu Tai; Shu Lin; Memari, Behshad; Honary, B., “New constructions of quasi-cyclic LDPC codes based on special classes of BIBDs for the AWGN and binary erasure channels,” Communications, IEEE Transactions on , vol. 56, No. 1, pp. 39-48. |
[25] Yu Kou; Shu Lin; Fossorier, M.P.C., “Low-density parity-check codes based on finite geometries: a rediscovery and new results,” Information Theory, IEEE Transactions on , vol. 47, No. 7, pp. 2711-2736. |
[26] Tom Høholdt, Heeralal Janwa, “Eigenvalues and expansion of bipartite graphs Designs Codes and Cryptography”. Dec. 2012; 65(3), pp. 259-273. |
[27] Tom Høholdt, Heeralal Janwa ,“Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes.” Proceeding AAECC-18 09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp. 53-64. |
[28] Y. Hu, E. Eleftheriou, and D. M. Arnold, “Regular and Irregular Progressive Edge-Growth Tanner Graphs”, IEEE Trans. on Inform. Theory, vol. 51, No. 1, pp. 386-398, 2005. |
[29] H. Xiao and A. H. Banihashemi, “Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes”, IEEE Communication Letters, vol. 8, No. 12, pp. 489-492, Dec. 2004. |
[30] Marc P. C. Fossorier, “Quasi-cyclic low-density parity-check codes from circulant permutation matrices”, IEEE Trans. Inf. Theory, vol. 50, No. 8, pp. 1788-1793 2004 |
[31]Yige Wang; Draper, S.C.; Yedidia, J.S., “Hierarchical and High-Girth QC LDPC Codes,” Information Theory, IEEE Transactions on , vol. 59, No. 7, pp. 4553,4583, Jul. 2013. |
[32] Yang, M.; Ryan, W.E.; Yan Li, “Design of efficiently encodable moderate-length high-rate irregular LDPC codes,” in Communications, IEEE Transactions on , vol. 52, No. 4, pp. 564-571, Apr. 2004. |
[34] Yang, M.; Ryan, W.E.; Yan Li, “Design of efficiently encodable moderate-length high-rate irregular LDPC codes,” in Communications, IEEE Transactions on , vol. 52, No. 4, pp. 564-571, Apr. 2004. |
[36] I. Vorobyev, N. Polyanskii, G. Svistunov, S. Egorov and V. Usatyuk, “Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications,” 2018 IEEE East-West Design and Test Symposium (EWDTS), Kazan, 2018, pp. 1-6. |
Smarandache, R.; Vontobel, P.O., “Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds”,IEEE Transactions on Information Theory ( vol. 58 , Issue: 2 , Feb. 2012 ),pp. 585-607. |
[21] C30-20061204-061 TSG-C WG3 Sung-Eun Park, Seung-HoonChoi, Hongsil Jeong, Jerry Kim, Jay Yu, Eddy Kwon, Jin-Kyu Han, Donghee Kim LDPC Proposal for LBC FDD, Dec. 4-8, 2006, Maui, HI,total 10 pages. |
[22] C30-20070212-024 TSG-C WG3 Sung-Eun Park, Seung-HoonChoi, Hongsil Jeong, Jerry Kim, Jay Yu, Eddy Kwon, Jin-Kyu Han, Donghee Kim LDPC Proposal for LBC FDD, Feb. 12-16, 2007. Seoul, Korea ,total 30 pages. |
[23] C30-20070212-024A1 TSG-C WG3 Sung-Eun Park, Seung-HoonChoi, Hongsil Jeong, Jerry Kim, Jay Yu, Eddy Kwon, Jin-Kyu Han, Donghee Kim LDPC Proposal for LBC FDD, Supply material with Samsung parity-check matrices. Feb. 12-16, 2007, Seoul, Korea,total 21 pages. |
Lu Liu et al, “Efficient encoding of quasi-cyclic LDPC codes with continuously variable length”, 2012 2nd International Conference on Consumer Electronics, Communications and Networks (CECNet), Date Added to IEEE Xplore: May 17, 2012. (4 pages). |
Office Action dated May 13, 2020, issued in counterpart CN application No. 201680090820.1, with English translation. (8 pages). |
Search Report dated May 6, 2020, issued in counterpart CN application No. 2016800908201, with English translation. (4 pages). |
Office Action dated Oct. 7, 2020, issued in counterpart IN Application No. 201917019480, with English Translation. (7 pages). |
Issue Notification dated Dec. 4, 2020, issued in counterpart CN Application No. 201680090820.1, with English Translation. (5 pages). |
Notice of Allowance dated Dec. 4, 2020, issued in counterpart CN Application No. 201680090820.1, with English Translation. (3 pages). |
Number | Date | Country | |
---|---|---|---|
20190268021 A1 | Aug 2019 | US |
Number | Date | Country | |
---|---|---|---|
Parent | PCT/RU2016/000777 | Nov 2016 | US |
Child | 16411268 | US |