Patent Grant
10419029
1. Technical Field
The present disclosure relates generally to an interleaver and, more particularly, to a bit interleaver that is capable of distributing burst errors occurring in a digital broadcast channel.
2. Description of the Related Art
Bit-Interleaved Coded Modulation (BICM) is bandwidth-efficient transmission technology, and is implemented in such a manner that an error-correction coder, a bit-by-bit interleaver and a high-order modulator are combined with one another.
BICM can provide excellent performance using a simple structure because it uses a low-density parity check (LDPC) coder or a Turbo coder as the error-correction coder. Furthermore, BICM can provide high-level flexibility because it can select modulation order and the length and code rate of an error correction code in various forms. Due to these advantages, BICM has been used in broadcasting standards, such as DVB-T2 and DVB-NGH, and has a strong possibility of being used in other next-generation broadcasting systems.
However, in spite of those advantages, BICM suffers from the rapid degradation of performance unless burst errors occurring in a channel are appropriately distributed via the bit-by-bit interleaver. Accordingly, the bit-by-bit interleaver used in BICM should be designed to be optimized for the modulation order or the length and code rate of the error correction code.
At least one embodiment of the present invention is directed to the provision of an intra-BICM bit interleaver that can effectively distribute burst errors occurring in a broadcasting system channel.
At least one embodiment of the present invention is directed to the provision of a bit interleaver that is optimized for an LDPC coder having a length of 64800 and a code rate of 4/15 and a modulator performing 256-symbol mapping and, thus, can be applied to next-generation broadcasting systems, such as ATSC 3.0.
In accordance with an aspect of the present invention, there is provided a bit interleaver, including a first memory configured to store a low-density parity check (LDPC) codeword having a length of 64800 and a code rate of 4/15; a processor configured to generate an interleaved codeword by interleaving the LDPC codeword on a bit group basis, the size of the bit group corresponding to a parallel factor of the LDPC codeword; and a second memory configured to provide the interleaved codeword to a modulator for 256-symbol mapping.
The 256-symbol mapping may be NUC (Non-Uniform Constellation) symbol mapping corresponding to 256 constellations (symbols).
The parallel factor may be 360, and each of the bit groups may include 360 bits.
The LDPC codeword may be represented by (u0, u1, . . . , uN
Xj={uk|360×j≤k<360×(j+1), 0≤k<Nldpc} for 0≤j<Ngroup
where Xj is an j-th bit group, Nldpc is 64800, and Ngroup is 180.
The interleaving may be performed using the following equation using permutation order:
Yj=Xπ(j) 0≤j≤Ngroup
where Xj is the j-th bit group, Yj is an interleaved j-th bit group, and π(j) is a permutation order for bit group-based interleaving (bit group-unit interleaving).
The permutation order may correspond to an interleaving sequence represented by the following equation:
interleaving sequence={13 121 137 29 27 1 70 116 35 132 109 51 55 58 11 67 136 25 145 7 75 107 45 21 127 52 90 22 100 123 69 112 155 92 151 59 5 179 44 87 56 139 65 170 46 0 124 78 166 8 61 97 120 103 4 19 64 79 28 134 93 86 60 135 126 53 63 14 122 17 150 76 42 39 23 153 95 66 50 141 176 34 161 26 106 10 43 85 131 2 147 148 144 54 115 146 101 172 114 119 3 96 133 99 167 164 9 142 68 149 94 83 16 175 73 38 143 159 130 84 169 18 138 102 72 47 32 160 82 81 168 30 12 173 156 158 125 98 62 178 48 163 117 110 91 37 80 105 31 174 111 49 113 108 74 157 128 24 118 40 88 177 154 6 162 129 77 36 165 20 89 140 15 33 104 152 71 171 57 41}
In accordance with another aspect of the present invention, there is provided a bit interleaving method, including storing an LDPC codeword having a length of 64800 and a code rate of 4/15; generating an interleaved codeword by interleaving the LDPC codeword on a bit group basis corresponding to the parallel factor of the LDPC codeword; and outputting the interleaved codeword to a modulator for 256-symbol mapping.
In accordance with still another aspect of the present invention, there is provided a BICM device, including an error-correction coder configured to output an LDPC codeword having a length of 64800 and a code rate of 4/15; a bit interleaver configured to interleave the LDPC codeword on a bit group basis corresponding to the parallel factor of the LDPC codeword and output the interleaved codeword; and a modulator configured to perform 256-symbol mapping on the interleaved codeword.
The above and other objects, features and advantages of the present invention will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings, in which:
Embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Repeated descriptions and descriptions of well-known functions and configurations that have been deemed to make the gist of the present invention unnecessarily obscure will be omitted below. The embodiments of the present invention are intended to fully describe the present invention to persons having ordinary knowledge in the art to which the present invention pertains. Accordingly, the shapes, sizes, etc. of components in the drawings may be exaggerated to make the description obvious.
Embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
Referring to
The BICM device 10 generates an n-bit codeword by encoding k information bits 11 using an error-correction coder 13. In this case, the error-correction coder 13 may be an LDPC coder or a Turbo coder.
The codeword is interleaved by a bit interleaver 14, and thus the interleaved codeword is generated.
In this case, the interleaving may be performed on a bit group basis (by a unit of a bit group). In this case, the error-correction coder 13 may be an LDPC coder having a length of 64800 and a code rate of 4/15. A codeword having a length of 64800 may be divided into a total of 180 bit groups. Each of the bit groups may include 360 bits, i.e., the parallel factor of an LDPC codeword.
In this case, the interleaving may be performed on a bit group basis (by a unit of a bit group) in accordance with an interleaving sequence, which will be described later.
In this case, the bit interleaver 14 prevents the performance of error correction code from being degraded by effectively distributing burst errors occurring in a channel. In this case, the bit interleaver 14 may be separately designed in accordance with the length and code rate of the error correction code and the modulation order.
The interleaved codeword is modulated by a modulator 15, and is then transmitted via an antenna 17.
In this case, the modulator 15 may be based on a concept including symbol mapper (symbol mapping device). In this case, the modulator 15 may be a symbol mapping device performing 256-symbol mapping which maps codes onto 256 constellations (symbols).
In this case, the modulator 15 may be a uniform modulator, such as a quadrature amplitude modulation (QAM) modulator, or a non-uniform modulator.
The modulator 15 may be a symbol mapping device performing NUC (Non-Uniform Constellation) symbol mapping which uses 256 constellations (symbols).
The signal transmitted via the wireless channel 20 is received via the antenna 31 of the BICM reception device 30, and, in the BICM reception device 30, is subjected to a process reverse to the process in the BICM device 10. That is, the received data is demodulated by a demodulator 33, is deinterleaved by a bit deinterleaver 34, and is then decoded by an error correction decoder 35, thereby finally restoring the information bits.
It will be apparent to those skilled in the art that the above-described transmission and reception processes have been described within a minimum range required for a description of the features of the present invention and various processes required for data transmission may be added.
Referring to
That is, at step S210, an n-bit codeword is generated by encoding k information bits using the error-correction coder.
In this case, step S210 may be performed as in an LDPC encoding method, which will be described later.
Furthermore, in the broadcast signal transmission and reception method, an interleaved codeword is generated by interleaving the n-bit codeword on a bit group basis at step S220.
In this case, the n-bit codeword may be an LDPC codeword having a length of 64800 and a code rate of 4/15. The codeword having a length of 64800 may be divided into a total of 180 bit groups. Each of the bit groups may include 360 bits corresponding to the parallel factors of an LDPC codeword.
In this case, the interleaving may be performed on a bit group basis (by a unit of a bit group) in accordance with an interleaving sequence, which will be described later.
Furthermore, in the broadcast signal transmission and reception method, the encoded data is modulated at step S230.
That is, at step S230, the interleaved codeword is modulated using the modulator.
In this case, the modulator may be based on a concept including symbol mapper (symbol mapping device). In this case, the modulator may be a symbol mapping device performing 256-symbol mapping which maps codes onto 256 constellations (symbols).
In this case, the modulator may be a uniform modulator, such as a QAM modulator, or a non-uniform modulator.
The modulator may be a symbol mapping device performing NUC (Non-Uniform Constellation) symbol mapping which uses 256 constellations (symbols).
Furthermore, in the broadcast signal transmission and reception method, the modulated data is transmitted at step S240.
That is, at step S240, the modulated codeword is transmitted over the wireless channel via the antenna.
Furthermore, in the broadcast signal transmission and reception method, the received data is demodulated at step S250.
That is, at step S250, the signal transmitted over the wireless channel is received via the antenna of the receiver, and the received data is demodulated using the demodulator.
Furthermore, in the broadcast signal transmission and reception method, the demodulated data is deinterleaved at step S260. In this case, the deinterleaving of step S260 may be reverse to the operation of step S220.
Furthermore, in the broadcast signal transmission and reception method, the deinterleaved codeword is subjected to error correction decoding at step S270.
That is, at step S270, the information bits are finally restored by performing error correction decoding using the error correction decoder of the receiver.
In this case, step S270 corresponds to a process reverse to that of an LDPC encoding method, which will be described later.
An LDPC code is known as a code very close to the Shannon limit for an additive white Gaussian noise (AWGN) channel, and has the advantages of asymptotically excellent performance and parallelizable decoding compared to a turbo code.
Generally, an LDPC code is defined by a low-density parity check matrix (PCM) that is randomly generated. However, a randomly generated LDPC code requires a large amount of memory to store a PCM, and requires a lot of time to access memory. In order to overcome these problems, a quasi-cyclic LDPC (QC-LDPC) code has been proposed. A QC-LDPC code that is composed of a zero matrix or a circulant permutation matrix (CPM) is defined by a PCM that is expressed by the following Equation 1:
In this equation, J is a CPM having a size of L×L, and is given as the following Equation 2. In the following description, L may be 360.
Furthermore, Ji is obtained by shifting an L×L identity matrix I (J0) to the right i (0≤i<L) times, and J∞ is an L×L zero matrix. Accordingly, in the case of a QC-LDPC code, it is sufficient if only index exponent i is stored in order to store Ji, and thus the amount of memory required to store a PCM is considerably reduced.
Referring to
where IL×L is an identity matrix having a size of L×L.
That is, the matrix B may be a bit-wise dual diagonal matrix, or may be a block-wise dual diagonal matrix having identity matrices as its blocks, as indicated by Equation 3. The bit-wise dual diagonal matrix is disclosed in detail in Korean Patent Application Publication No. 2007-0058438, etc.
In particular, it will be apparent to those skilled in the art that when the matrix B is a bit-wise dual diagonal matrix, it is possible to perform conversion into a Quasi-cyclic form by applying row or column permutation to a PCM including the matrix B and having a structure illustrated in
In this case, N is the length of a codeword, and K is the length of information.
The present invention proposes a newly designed QC-LDPC code in which the code rate thereof is 4/15 and the length of a codeword is 64800, as illustrated in the following Table 1. That is, the present invention proposes an LDPC code that is designed to receive information having a length of 17280 and generate an LDPC codeword having a length of 64800.
Table 1 illustrates the sizes of the matrices A, B, C, D and Z of the QC-LDPC code according to the present invention:
The newly designed LDPC code may be represented in the form of a sequence (progression), an equivalent relationship is established between the sequence and matrix (parity bit check matrix), and the sequence may be represented, as follows:
An LDPC code that is represented in the form of a sequence is being widely used in the DVB standard.
According to an embodiment of the present invention, an LDPC code presented in the form of a sequence is encoded, as follows. It is assumed that there is an information block S=(s0, s1, . . . , sK−1) having an information size K. The LDPC encoder generates a codeword Λ=(λ0, λ1, λ2, . . . , λN−1) having a size of N=K+M1+M2 using the information block S having a size K. In this case, M1=g, and M2=N−K−g. Furthermore, M1 is the size of parity bits corresponding to the dual diagonal matrix B, and M2 is the size of parity bits corresponding to the identity matrix D. The encoding process is performed, as follows:
Initialization:
λi=si for i=0,1, . . . ,K−1
pj=0 for j=0,1, . . . ,M1+M2−1 (4)
First information bit λ0 is accumulated at parity bit addresses specified in the 1st row of the sequence of the Sequence Table. For example, in an LDPC code having a length of 64800 and a code rate of 4/15, an accumulation process is as follows:
p276=p276⊕λ0 p1754=p1754⊕λ0 p1780=p1780⊕λ0 p3597=p3597⊕λ0 p8549=p8549⊕λ0 p15196=p15196⊕λ0 p26305=p26305⊕λ0 p27003=p27003⊕λ0 p33883=p33883⊕λ0 p37189=p37189⊕λ0 p41042=p41042⊕λ0 p41849=p41849⊕λ0 p42356=p42356⊕λ0
where the addition ⊕ occurs in GF(2).
The subsequent L−1 information bits, that is, λm, m=1, 2, . . . , L−1, are accumulated at parity bit addresses that are calculated by the following Equation 5:
(x+m×Q1)mod M1 if x<M1
M1+{(x−M1+m×Q2)mod M2} if x≥M1 (5)
where x denotes the addresses of parity bits corresponding to the first information bit λ0, that is, the addresses of the parity bits specified in the first row of the sequence of the Sequence Table, Q1=M1/L, Q2=M2/L, and L=360. Furthermore, Q1 and Q2 are defined in the following Table 2. For example, for an LDPC code having a length of 64800 and a code rate of 4/15, M1=1800, Q1=5, M2=45720, Q2=127 and L=360, and the following operations are performed on the second bit λ1 using Equation 5:
p281=p281⊕λ1 p1759=p1759⊕λ1 p1785=p1785⊕λ1 p3724=p3724⊕λ1 p8676=p8676⊕λ1 p15323=p15323⊕λ1 p26432=p26432⊕λ1 p27130=p27130⊕λ1 p34010=p34010⊕λ1 p37316=p37316⊕λ1 p41169=p41169⊕λ1 p41976=p41976⊕λ1 p42483=p42483⊕λ1
Table 2 illustrates the sizes of M1, Q1, M2 and Q2 of the designed QC-LDPC code:
The addresses of parity bit accumulators for new 360 information bits from λL to λ2L−1 are calculated and accumulated from Equation 5 using the second row of the sequence.
In a similar manner, for all groups composed of new L information bits, the addresses of parity bit accumulators are calculated and accumulated from Equation 5 using new rows of the sequence.
After all the information bits from λ0 to λK−1 have been exhausted, the operations of the following Equation 6 are sequentially performed from i=1:
pi=pi⊕pi−1 for i=0,1, . . . ,M1−1 (6)
Thereafter, when a parity interleaving operation, such as that of the following Equation 7, is performed, parity bits corresponding to the dual diagonal matrix B are generated:
λK+L·t+s=pQ
When the parity bits corresponding to the dual diagonal matrix B have been generated using K information bits λ0, λ1, . . . , λK−1, parity bits corresponding to the identity matrix D are generated using the M1 generated parity bits λK, λK+1, . . . , λK+M
For all groups composed of L information bits from λK to λK+M
When a parity interleaving operation, such as that of the following Equation 8, is performed after all the information bits from λK to λK+M
λK+M
Referring to
In this case, 360 may be the parallel factor (PF) of the LDPC codeword. That is, since the PF is 360, the LDPC codeword having a length of 64800 is divided into 180 bit groups, as illustrated in
Referring to
In this case, 360 may be the parallel factor (PF) of the LDPC codeword. That is, since the PF is 360, the LDPC codeword having a length of 16200 is divided into 45 bit groups, as illustrated in
Referring to
For example, it is assumed that an interleaving sequence for an LDPC codeword having a length of 16200 is as follows:
interleaving sequence={24 34 15 11 2 28 17 25 5 38 19 13 6 39 1 14 33 37 29 12 42 31 30 32 36 40 26 35 44 4 16 8 20 43 21 7 0 18 23 3 10 41 9 27 22}
Then, the order of the bit groups of the LDPC codeword illustrated in
That is, it can be seen that each of the LDPC codeword 610 and the interleaved codeword 620 includes 45 bit groups, and it can be also seen that, by the interleaving sequence, the 24th bit group of the LDPC codeword 610 is changed into the 0th bit group of the interleaved LDPC codeword 620, the 34th bit group of the LDPC codeword 610 is changed into the 1st bit group of the interleaved LDPC codeword 620, the 15th bit group of the LDPC codeword 610 is changed into the 2nd bit group of the interleaved LDPC codeword 620, and the 11st bit group of the LDPC codeword 610 is changed into the 3rd bit group of the interleaved LDPC codeword 620, and the 2nd bit group of the LDPC codeword 610 is changed into the 4th bit group of the interleaved LDPC codeword 620.
An LDPC codeword (u0, u1, . . . , uN
Xj={uk|360×j≤k<360×(j+1), 0≤k<Nldpc} for 0≤j<Ngroup (9)
where Xj is an j-th bit group, and each Xj is composed of 360 bits.
The LDPC codeword divided into the bit groups is interleaved, as in Equation 10 below:
Yj=Xπ(j) 0≤j≤Ngroup (10)
where Yj is an interleaved j-th bit group, and π(j) is a permutation order for bit group-based interleaving (bit group-unit interleaving). The permutation order corresponds to the interleaving sequence of Equation 11 below:
interleaving sequence={13 121 137 29 27 1 70 116 35 132 109 51 55 58 11 67 136 25 145 7 75 107 45 21 127 52 90 22 100 123 69 112 155 92 151 59 5 179 44 87 56 139 65 170 46 0 124 78 166 8 61 97 120 103 4 19 64 79 28 134 93 86 60 135 126 53 63 14 122 17 150 76 42 39 23 153 95 66 50 141 176 34 161 26 106 10 43 85 131 2 147 148 144 54 115 146 101 172 114 119 3 96 133 99 167 164 9 142 68 149 94 83 16 175 73 38 143 159 130 84 169 18 138 102 72 47 32 160 82 81 168 30 12 173 156 158 125 98 62 178 48 163 117 110 91 37 80 105 31 174 111 49 113 108 74 157 128 24 118 40 88 177 154 6 162 129 77 36 165 20 89 140 15 33 104 152 71 171 57 411 (11)
That is, when each of the codeword and the interleaved codeword includes 180 bit groups ranging from a 0th bit group to a 179th bit group, the interleaving sequence of Equation 11 means that the 13st bit group of the codeword becomes the 0th bit group of the interleaved codeword, the 121th bit group of the codeword becomes the 1st bit group of the interleaved codeword, the 137th bit group of the codeword becomes the 2nd bit group of the interleaved codeword, the 29th bit group of the codeword becomes the 3rd bit group of the interleaved codeword, . . . , the 57th bit group of the codeword becomes the 178th bit group of the interleaved codeword, and the 41th bit group of the codeword becomes the 179th bit group of the interleaved codeword.
In particular, the interleaving sequence of Equation 11 has been optimized for a case where 256-symbol mapping (NUC symbol mapping) is employed and an LDPC coder having a length of 64800 and a code rate of 4/15 is used.
Referring to
The memory 710 stores an LDPC codeword having a length of 64800 and a code rate of 4/15.
The processor 720 generates an interleaved codeword by interleaving the LDPC codeword on a bit group basis corresponding to the parallel factor of the LDPC codeword.
In this case, the parallel factor may be 360. In this case, each of the bit groups may include 360 bits.
In this case, the LDPC codeword may be divided into 180 bit groups, as in Equation 9.
In this case, the interleaving may be performed using Equation 10 using permutation order.
In this case, the permutation order may correspond to the interleaving sequence represented by Equation 11.
The memory 730 provides the interleaved codeword to a modulator for 256-symbol mapping.
In this case, the modulator may be a symbol mapping device performing NUC (Non-Uniform Constellation) symbol mapping.
The memories 710 and 730 may correspond to various types of hardware for storing a set of bits, and may correspond to a data structure, such as an array, a list, a stack, a queue or the like.
In this case, the memories 710 and 730 may not be physically separate devices, but may correspond to different addresses of a physically single device. That is, the memories 710 and 730 are not physically distinguished from each other, but are merely logically distinguished from each other.
The error-correction coder 13 illustrated in
That is, the error-correction coder may include memories and a processor. In this case, the first memory is a memory that stores an LDPC codeword having a length of 64800 and a code rate of 4/15, and a second memory is a memory that is initialized to 0.
The memories may correspond to λi(i=0, 1, . . . , N−1) and Pj(j=0, 1, . . . , M1+M2−1), respectively.
The processor may generate an LDPC codeword corresponding to information bits by performing accumulation with respect to the memory using a sequence corresponding to a parity check matrix (PCM).
In this case, the accumulation may be performed at parity bit addresses that are updated using the sequence of the above Sequence Table.
In this case, the LDPC codeword may include a systematic part λ0, λ1, . . . , λK−1 corresponding to the information bits and having a length of 17280 (=K), a first parity part λK, λK+1, . . . , λK+M
In this case, the sequence may have a number of rows equal to the sum (17280/360+1800/360=53) of a value obtained by dividing the length of the systematic part, i.e., 17280, by a CPM size L corresponding to the PCM, i.e., 360, and a value obtained by dividing the length M1 of the first parity part, i.e., 1800, by 360.
As described above, the sequence may be represented by the above Sequence Table.
In this case, the second memory may have a size corresponding to the sum M1+M2 of the length M1 of the first parity part and the length M2 of the second parity part.
In this case, the parity bit addresses may be updated based on the results of comparing each x of the previous parity bit addresses, specified in respective rows of the sequence, with the length M1 of the first parity part.
That is, the parity bit addresses may be updated using Equation 5. In this case, x may be the previous parity bit addresses, m may be an information bit index that is an integer larger than 0 and smaller than L, L may be the CPM size of the PCM, Q1 may be M1/L, M1 may be the size of the first parity part, Q2 may be M2/L, and M2 may be the size of the second parity part.
In this case, it may be possible to perform the accumulation while repeatedly changing the rows of the sequence by the CPM size L (=360) of the PCM, as described above.
In this case, the first parity part λK, λK+1, . . . , λK+M
In this case, the second parity part λK+M
Referring to
In this case, the LDPC codeword may be represented by u0, u1, . . . , uN
Furthermore, in the bit interleaving method according to the present embodiment, an interleaved codeword is generated by interleaving the LDPC codeword on a bit group basis at step S820.
In this case, the size of the bit group may correspond to the parallel factor of the LDPC codeword.
In this case, the interleaving may be performed using Equation 10 using permutation order.
In this case, the permutation order may correspond to the interleaving sequence represented by Equation 11.
In this case, the parallel factor may be 360, and each of the bit groups may include 360 bits.
In this case, the LDPC codeword may be divided into 180 bit groups, as in Equation 9.
Moreover, in the bit interleaving method according to the present embodiment, the interleaved codeword is output to a modulator for 256-symbol mapping at step 830.
In accordance with at least one embodiment of the present invention, there is provided an intra-BICM bit interleaver that can effectively distribute burst errors occurring in a broadcasting system channel.
In accordance with at least one embodiment of the present invention, there is provided a bit interleaver that is optimized for an LDPC coder having a length of 64800 and a code rate of 4/15 and a modulator performing 256-symbol mapping and, thus, can be applied to next-generation broadcasting systems, such as ATSC 3.0.
Although the specific embodiments of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible without departing from the scope and spirit of the invention as disclosed in the accompanying claims.
| Number | Date | Country | Kind |
|---|---|---|---|
| 10-2014-0026681 | Mar 2014 | KR | national |
| 10-2015-0009440 | Jan 2015 | KR | national |
This application is a continuation of and claims priority to U.S. application Ser. No. 14/636,053 filed Mar. 2, 2015, which claims the benefit of Korean Patent Application Nos. 10-2014-0026681 and 10-2015-0009440, filed Mar. 6, 2014 and Jan. 20, 2015, which are hereby incorporated by reference herein in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 20040086059 | Eroz et al. | May 2004 | A1 |
| 20100162077 | Kim et al. | Jun 2010 | A1 |
| 20110075710 | Park et al. | Mar 2011 | A1 |
| 20110090948 | Zhou et al. | Apr 2011 | A1 |
| 20110119568 | Jeong | May 2011 | A1 |
| 20110167317 | Kim et al. | Jul 2011 | A1 |
| 20120134446 | Zhou et al. | May 2012 | A1 |
| 20130142219 | Park et al. | Jun 2013 | A1 |
| 20130254617 | Shinohara et al. | Sep 2013 | A1 |
| 20140126672 | Petrov | May 2014 | A1 |
| 20150222471 | Myung | Aug 2015 | A1 |
| Number | Date | Country |
|---|---|---|
| 2 525 495 | Nov 2012 | EP |
| Entry |
|---|
| IEEE 100, The authoritative Dictionary of IEEE Standards Terms, 2000, Seventh Edition, IEEE Standards Information Network, IEEE Press, pertinent pp. 1, 2, 41, 121, 155, 159, 684, 703, 1209, 1210. |
| Number | Date | Country | |
|---|---|---|---|
| 20170149448 A1 | May 2017 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14636053 | Mar 2015 | US |
| Child | 15426927 | US |
