USPatent applicationPatented

Method for determining transport block size and signal transmission method using the same

Granted 29 Dec 2015 · 1 office action

Current assignee: Lg Electronics Inc. · originally LG Electronics

Law firm: Law firm · Log in to unlock

Attorney: Attorney · Log in to unlock

Inventors: Bong Hoe Kim, Joon Kui Ahn, Ki Jun Kim, Dong Youn Seo · Examiner: Jason Bryan · AU 2114 · TC 2100

Life of the application

8 dated events
⤢ drag to zoom201020152020202520302035ProsecutionTerm & fees
ProsecutionTerm & feeshover for detail · click to open

Abstract

A method for performing, by a first device, channel coding of data to be transmitted to a second device, the method includes: determining a size of a transport block for the data; attaching a first cyclic redundancy check (CRC) code to the transport block having the determined size to produce a first CRC-attached transport block; and segmenting the first CRC-attached transport block into multiple code blocks, wherein the size of the transport block is determined from among a plurality of predetermined transport block sizes such that the multiple code blocks have a same size as each other.

Description

8 parts
›CROSS REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. application Ser. No. 13/584,600, filed Aug. 13, 2012, which claims priority to U.S. application Ser. No. 12/332,165, filed on Dec. 10, 2008, now U.S. Pat. No. 8,266,513, which claims priority to Korean Patent Application 10-2008-0097705, filed on Oct. 6, 2008, U.S. Provisional Application 61/024,914, filed on Jan. 31, 2008 and U.S. Provisional Application 61/026,143, filed on Feb. 5, 2008. The entire contents of all these applications are hereby incorporated by reference as fully set forth herein in their entirety.

›BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a method and device for effectively determining the size of a data block or a transport block in a wireless communication system, and a method for transmitting signals using the same method.

2. Discussion of the Related Art

Generally, in a communication system, a transmission end of the communication system encodes transmission information using a forward error correction code, and transmits the encoded information to a reception end of the communication system, such that errors caused by a channel can be corrected in the information received in the reception end. The reception end demodulates a reception signal, decodes a forward error correction code, and recovers the transmission information transferred from the transmission end. During this decoding process, reception signal errors caused by a channel can be corrected.

There are various kinds of forward error correction codes that may be used. For the convenience of description, a turbo code will hereinafter be described as an example of the forward error correction code. The turbo code includes a recursive systematic convolution encoder and an interleaver. In case of actually implementing the turbo code, the interleaver facilitates parallel decoding, and an example of this interleaver may be a quadratic polynomial permutation (QPP) interleaver. It is well known in the art that this QPP interleaver maintains a superior throughput or performance in only a specific-sized data block. In this case, the term “data block” is block unit data encoded by the encoder. If we think block unit data transferred from an upper layer to a physical layer is encoded without segmentation discussed below, this data block may also be called as a transport block (TB). On the other hand, if we think the segmentation of the transport block to be encoded, this data block may be matched to “a code block”.

In general, the larger the data-block size, the higher the turbo-code performance. A data block of more than a specific size is segmented into a plurality of small-sized data blocks by an actual communication system, such that the small-sized data blocks are encoded for the convenience of actual implementation. The divided small-sized data blocks are called code blocks. Generally, although these code blocks have the same size, one of several code blocks may have another size due to the limitation of the QPP interleaver size. A forward error correction coding process on the basis of a code block of a predetermined interleaver size is performed on the small-sized data blocks, and the resultant data blocks are then transferred to an RF (Radio Frequency) channel. In this case, a burst error may occur in the above process of transferring the resultant data blocks to the RF channel, such that the above resultant data blocks are interleaved to reduce an influence of the burst error. The interleaved data blocks are mapped to actual radio resources, such that the mapped result is transferred.

An amount of radio resources used in an actual transmission process is constant, such that a rate matching process should be performed on the encoded code blocks due to the constant amount of radio resources. Generally, the rate matching process is implemented by a puncturing or a repetition. For example, the rate matching may also be performed on the basis of an encoded code block in the same manner as in a WCDMA of the 3GPP. For another example, a systematic part and a parity part of the encoded code block may be separated from each other. The rate matching process may be performed on the systematic part and the parity part together. On the other hand, the rate matching process may also be independently performed on each of the systematic part and the parity part.

FIG. 1 is a conceptual diagram illustrating basic operations of a turbo encoder.

As shown in FIG. 1 , if a turbo-encoder receives one code block, it divides the received one code block into a systematic part (S) and parity parts (P 1 and P 2 ). The systematic part S and the parity parts P 1 and P 2 pass through individual sub-block interleavers, respectively. Thus, the systematic part S and the parity parts P 1 and P 2 may be interleaved by different sub-block interleavers, and the interleaved result is stored in a circular buffer.

As can be seen from FIG. 1 , the systematic part and the parity parts of the code block may be separated from each other, and the rate matching process is performed on the individual separated parts, but the example of FIG. 1 has been disclosed for only illustrative purposes and the scope and spirit of the present invention are not limited to this example and can also be applied to other examples. For the convenience of description, it is assumed that a code rate is a value of ⅓.

Although a variety of transport block sizes may be defined according to service categories of an upper layer, it is preferable that the transport block sizes may be quantized to effectively perform the signaling of various transport block sizes. During the quantization process, in order to adjust a source data block transferred from an upper layer to the size of a data block of a physical layer, a dummy bit is added to the source data block. During this quantization process, it is preferable to minimize the amount of added dummy bits.

›SUMMARY OF THE INVENTION · 1 of 2

To achieve these objects and other advantages and in accordance with the purpose of the invention, as embodied and broadly described herein, a signal transmission method and device is presented, the method comprising: determining the number of code blocks to be used for transmitting a transport block with a specific size, and mapping the transport block to the code blocks corresponding to the determined number; attaching a cyclic redundancy check (CRC) to each of the code blocks; encoding each of the CRC-attached code blocks by a turbo-encoder including an internal interleaver; and transmitting the encoded code blocks, wherein the specific size of the transport block corresponds to any transport block size in predetermined transport block size combinations, and wherein any transport block size in the predetermined transport block size combinations is predetermined such that the sum of a length of any one code block from among the code blocks mapped to the transport block with the specific length and a length of the CRC attached to the one code block is equal to a block size of the internal interleaver.

The block size of the internal interleaver of the turbo-encoder may be predetermined as a combination of predetermined bit lengths.

Under the above-mentioned assumption, if the number of code blocks to be used for transmitting the transport block is 1, the specific transport block size may be any one of the predetermined transport block size combinations in which any one of the predetermined transport block size corresponds to the sum of a CRC length and the predetermined internal interleaver's block sizes.

Under the same assumption, if the number of code blocks to be used for transmitting the transport block is at least 2, the transport block is segmented into at least two code blocks having the same length, and is mapped to the at least two code blocks.

The above-mentioned operations may be generalized as the following expression.

If the specific size of the transport block is N, the number of the code blocks to be used for transmitting the transport block is M, the length of each of the M code blocks is N c , and the length of the CRC is L, the specific transport block size N may satisfy an equation denoted by N=M*N C −L, and the specific transport block size may correspond to any one of the predetermined transport block size combinations in which a value of Nc+L corresponds to the internal interleaver's block sizes predetermined as a combination of predetermined bit lengths.

In more detail, the block size of the internal interleaver of the turbo-encoder may predetermined as ‘K’ value according to an index (i) in a following Table 1:

Under the above-mentioned assumption, if the number of code blocks to be used for transmitting the transport block is 1, the specific transport block size may be any one of the transport block size combinations in which any transport block size corresponds to the sum of a K value shown in Table 1 and a CRC length.

The above-mentioned operations may be generalized as the following expression.

If the specific size of the transport block is N, the number of the code blocks to be used for transmitting the transport block is M, the length of each of the M code blocks is N c , and the length of the CRC is L, the specific transport block size N may satisfy an equation denoted by N=M*N C −L, and the specific transport block size may correspond to any one of transport block size combinations in which a value of Nc+L corresponds to the K value shown in the above table 1.

The specific size N of the transport block may be set to a length selected from among combinations shown in a following table 2 according to the number M of the code blocks to be used for transmitting the transport block.

The method may further comprise: transmitting information indicating a Modulation and Coding Scheme (MCS) and an available resource area size to a reception end; wherein the MCS and that available resource size represent the specific transport block size.

And, if the transport block size value based on the MCS and the available resource size is not contained in the predetermined transport block size combinations, a maximum transport block size in the predetermined transport block size combinations, which is equal to or smaller than the transport block size value based on the MCS and the available resource size; a minimum transport block size in the predetermined transport block size combinations, which is larger than the transport block size value based on the MCS and the available resource size; or a specific transport block size in the predetermined transport block size combinations, which has a minimum difference with the transport block size value based on the MCS and the available resource size, may be used as the specific transport block size.

In another aspect of the present invention, there is provided a signal transmission method comprising: attaching a first cyclic redundancy check (CRC) having a length of L to a transport block having a length of N; segmenting the transport block to which the first CRC is attached into M number of code blocks, each of which has a length of Nc; attaching a second cyclic redundancy check (CRC) having a length of L to each of the M code blocks; encoding, by a turbo-encoder comprising an internal interleaver, the M code blocks, each of which has the second CRC; and transmitting the encoded M code blocks, wherein the transport block size N satisfies an equation denoted by N=M*NC−L (where N, Nc, M, and L are natural numbers), where a value of Nc+L has any one of block sizes of the internal interleaver of the turbo-encoder.

In another aspect of the present invention, there is provided a signal transmission method comprising: mapping a transport block having a length of N to at least one code block; encoding the at least one code block by a turbo-encoder comprising an internal interleaver; and transmitting the encoded code block, wherein the transport block size N is selected from a transport block size combination comprising all or some of values shown in a following table 3.

›SUMMARY OF THE INVENTION · 2 of 2

According to the above-mentioned embodiments of the present invention, if a transport block received from an upper layer is segmented into a plurality of code blocks, and the code blocks are encoded by a turbo-encoder, the present invention is able to avoid addition of dummy bits due to the length of an input bit of an internal interleaver of the turbo-encoder, such that it can effectively transmit signals.

›BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are included to provide a further understanding of the invention, illustrate embodiments of the invention and together with the description serve to explain the principle of the invention.

In the drawings:

FIG. 1 is a conceptual diagram illustrating basic operations of a turbo-encoder according to the present invention;

FIGS. 2A , 2 B and 3 are conceptual diagrams illustrating a method for dividing a long transport block into a plurality of short transport blocks in a 3GPP system, and attaching a CRC to the short transport blocks according to the present invention;

FIG. 4 is a conceptual diagram illustrating a principle of establishing the transport block size according to one embodiment of the present invention; and

FIG. 5 shows an example of a resource structure according to the present invention.

FIG. 6 shows a flow chart according to the present invention.

›DETAILED DESCRIPTION OF THE INVENTION · 1 of 3

Reference will now be made in detail to the preferred embodiments of the present invention, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts. Prior to describing the present invention, it should be noted that most terms disclosed in the present invention correspond to general terms well known in the art, but some terms have been selected by the applicant as necessary and will hereinafter be disclosed in the following description of the present invention. Therefore, it is preferable that the terms defined by the applicant be understood on the basis of their meanings in the present invention.

For the convenience of description and better understanding of the present invention, the following detailed description will disclose a variety of embodiments and modifications of the present invention. In some cases, in order to prevent ambiguous concepts of the present invention from occurring, conventional devices or apparatus well known to those skilled in the art will be omitted and be denoted in the form of a block diagram on the basis of the important functions of the present invention. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.

As described above, it is well known to those skilled in the art that the internal interleaver of the turbo code has a superior performance in only a specific-sized data block. If the data block size is larger than a predetermined size, a transport block or a data block is segmented into a plurality of code blocks, and this process is called segmentation. Due to the limitation of the interleaver size, the transport or data block may not be segmented into the same-sized code blocks.

However, in the case of a downlink, a channel quality indicator must be applied to all code blocks segmented from the data block, such that it is preferable that the transport or data block be segmented into the same-sized code blocks. If the data block size or the segmented code block size is different from the internal interleaver size of the turbo code, a dummy bit is inserted such that transmission efficiency is reduced. In order to solve this problem, it is preferable that the segmentation process be performed not to require this dummy bit.

For the above-mentioned operations, there is needed a consideration of the block size of the internal encoder of the turbo-encoder caused by the inserted dummy bit. In order to perform the channel coding, a CRC is attached to a transport block or code blocks segmented from the transport block, and at the same time the length of each data block is changed to another length, such that a consideration of the channel coding is needed.

Firstly, the above-mentioned CRC attachment process will hereinafter be described in detail.

The CRC for detecting errors is attached to the transport block received from an upper layer. For the convenience of implementation, and it can also be attached to each of the segmented code blocks.

FIGS. 2A , 2 B and 3 are conceptual diagrams illustrating a method for dividing a long transport block into a plurality of short length code blocks in a 3GPP system, and attaching a CRC to the short code blocks according to the present invention.

The 3GPP system segments a long transport block (TB) into a plurality of short code blocks, encodes the short code blocks, collects the encoded short code blocks, and transmits the collected short code blocks. Detailed descriptions of the above operations of the 3GPP system will hereinafter be described with reference to FIGS. 2A , 2 B and 3 .

Referring to FIGS. 2A , 2 B and 3 , the long transport block is CRC-attached, that is, a CRC is attached to the transport block at step S 101 . Thereafter, the CRC-attached long transport block is segmented into a plurality of short code blocks at step S 102 . Similar to this, as shown in reference numbers S 201 ˜S 203 of FIGS. 2B and 3 , the CRC is attached to the long transport block, and the CRC-attached transport block is segmented into a plurality of code blocks. However, if the length of the transport block received from the upper layer is equal to or shorter than a predetermined length capable of being constructed by one code block, i.e., a maximum length of the internal interleaver of the turbo-encoder, the segmentation of the transport block may be omitted. In this case, the process for attaching a CB CRC may also be omitted.

In the meantime, each of short code blocks is CRC-attached, that is, the CRC attachment process is then performed on each of the code blocks at step S 103 . In more detail, as shown in the reference number S 204 of FIGS. 2B and 3 , each of the code blocks includes a CRC.

Also, the code blocks, each of which includes the CRC, are applied to a channel encoder, such that the channel coding process is performed on the resultant code blocks at step S 104 . Thereafter, the rate matching process S 105 , and the code block concatenation and channel interleaving process S 106 are sequentially applied to the individual code blocks, such that the resultant code blocks are transmitted to a reception end.

Therefore, according to the following embodiment, there is proposed a process for determining the size of a transport block in consideration of the two-stage CRC attachment process. In the case where the size of a transport block is less than a predetermined size (such as, maximum internal interleaver size) and this transport block is mapped to one code block, the embodiment of the present invention provides a method for establishing the transport block size in consideration of only one CRC.

Under the above-mentioned assumption, a method for mapping the transport block to one code block will hereinafter be described. In order to remove the necessity of the conventional art of attaching the dummy bit on the condition that the transport block is mapped to one codeword, this embodiment of the present invention allows the sum of the transport block size (N) and one CRC length to be equal to an block size of the internal interleaver of the turbo-interleaver. The following Table 1 represents a combination of block sizes of the internal interleaver of the turbo-encoder.

›DETAILED DESCRIPTION OF THE INVENTION · 2 of 3

Therefore, as shown in Table 1, if the transport block is mapped to one code block, it is preferable that the transport block has a specific length acquired when the length of a CRC attached to the transport block is subtracted from an block size (K) of the internal interleaver. Provided that the length of a CRC attached to the transport block is 24 bits, the transport block size (N) acquired when the transport block is mapped to one code block may be a K−24. That is, the transport block size according to this embodiment may be selected from combinations of the following Table 4.

In the meantime, a method for segmenting one transport block into two or more code blocks and performing a mapping process on the segmented code blocks will hereinafter be described in detail.

If one transport block is segmented into two or more code blocks, a CRC for the transport block is attached to the transport block as shown in FIGS. 2 and 3 , and a CRC for each code block is attached to each of the segmented code blocks. Under this assumption, in order to avoid the conventional practice of adding of dummy bits, it is preferable that the sum of the size of a any one segmented code block and the size of a CRC attached to a corresponding code block is equal to an input bit size of the internal interleaver, as shown in Table 1.

Also, this embodiment of the present invention allows each of the segmented codewords to have the same size. Different-sized code blocks created by the segmentation of the transport block are caused by the limitation of the size of the internal interleaver of the turbo-encoder. If the transport block size is pre-established in consideration of the size of the internal interleaver of the turbo-encoder as described in this embodiment, there is no need for the individual code blocks to have different sizes.

Under the above-mentioned assumption, a method for establishing the size of the transport block according to this embodiment will hereinafter be described in detail.

FIG. 4 is a conceptual diagram illustrating a principle of establishing the transport block size according to one embodiment of the present invention.

Firstly, it is assumed that an L-sized CRC is attached to an N-sized transport block (TB). If the CRC-attached transport block (TB) size is longer than the maximum length of the internal interleaver, the transport block is segmented into a plurality of code blocks (CBs). As can be seen from FIG. 4 , the transport block (TB) size is segmented into M (CB 1 ˜CB M ), each of which has the same length of N c bits.

In the meantime, the L-sized CRC is attached to each of the M code blocks.

In this way, provided that each of the segmented code blocks has the same length and the lengths of two attached CRCs are considered, the transport block size N can be represented by the following equation 1:

N+L*M+L=M *( Nc+L )=> N=M*Nc−L   [Equation 1]

If the CRC of 24 bits is used, the above Equation 1 may be represented by another equation of N=M*Nc−24.

Each of the segmented code blocks includes the CRC, such that the CRC-attached code blocks are applied to the internal interleaver of the turbo-encoder. Therefore, as shown in FIG. 4 , the length of the CRC-attached code blocks is equal to the internal interleaver's block size (K) shown in Table 1, as represented by the following equation 2:

Nc+L=K   [Equation 2]

Based on the above-mentioned description, this embodiment provides a method for using the following transport block sizes shown in the following Table 2. The following Table 2 shows a variety of cases illustrating a relationship between a single transport block and a maximum of 25 code blocks mapped to this single transport block.

The Table 2 satisfies the above equations 1 and 2, and shows that up to the case when one transport block is segmented into 25 code blocks. Within the scope of satisfying the equations 1 and 2, those skilled in the art can easily appreciate an additional transport block (TB) size on the analogy of values shown in Table 2.

Since signal transmission is conducted by the above-mentioned embodiment of the present invention, the addition of dummy bit due to the limitation of the block size of the turbo-encoder can be removed, such that a system performance or throughput can be increased.

Meanwhile, in the case of considering not only a first case in which a transport block is mapped to one code block, but also a second case in which a transport block is segmented into two or more code blocks, the size of an available transport block can be represented by the following Table 3.

When implementing the above described methodology, when a terminal identifies that the length of the CRC-attached transport block is larger than the largest interleaver block size, the terminal may determine the predetermined number of code blocks from a look-up table (as seen in step S 601 of FIG. 6 ) or may calculate the predetermined number of code blocks based upon a formula. The calculation may include calculating the predetermined number of code blocks based on the following equation:

C=┌B /( Z−L )┐, where

┌ ┐ represents a ceiling function,

C is the predetermined number of code blocks,

B is the length of the CRC-attached transport block,

Z is the largest interleaver block size, and

L is the first CRC length.

A signal transmission method and device according to this embodiment enables the transport block to have a predetermined length corresponding to any one of various values shown in Table 3. Table 3 shows the available transport block (TB) sizes which obviates the need for the conventional practice of inserting the dummy bit into the signal. The signal transmission method may allow sub-sets of Table 3 to be shared between a transmission end and a reception end in consideration of signaling overhead and the like, instead of using all the values of Table 36.

In the meantime, in order to inform the reception end of the transport block size, the transmission end is able to represent the transport block size by a combination of a modulation and coding scheme (MCS), and the size of allocated resources (as seen in step S 603 of FIG. 6 ). By means of a channel quality indicator transferred from the reception end, a scheduler decides the MCS. The size of allocated resources is decided in consideration of not only resources for transferring control information but also other resources for a reference signal for channel estimation. As noted above, the code block is mapped to a transport block with the transport block size (S 605 ).

›DETAILED DESCRIPTION OF THE INVENTION · 3 of 3

FIG. 5 shows an example of a resource structure according to the present invention.

Referring to FIG. 5 , a horizontal axis indicates a time domain, and a vertical axis indicates a frequency domain. On the assumption that the resource structure of FIG. 5 is used, it is assumed that the resources for transferring control information correspond to 3 symbols and two transmission (Tx) antennas are used, one resource block (RB) includes 120 resource elements (REs) capable of being used to transmit data.

In this case, if it is assumed that the modulation rate is 64 QAM, the coding rate is 0.6504, and the number of allocated resource blocks (RBs) is 10, the size of a data block capable of being transmitted is 4658 bits. These 4658 bits are located between 4608 bits and 4672 bits of Table 1. If it is assumed that the size of the transmittable data block is set to the 4608 bits or the 4672 bits, the data block size can be decided by various modulation and coding rates and the size of allocated resources.

As previously described in the above-mentioned example, if the size of an actually-transmittable data block is different from the size of a supportable data block, the size of the actually-transmittable data block can be decided by any of the following rules i)˜iii):

A method for deciding the actually-transmittable data block size as a maximally-supportable data block size which is equal to or smaller than the actually-transmittable data block size;

A method for deciding the actually-transmittable data block size as a minimally-supportable data block size larger than the actually-transmittable data block size; and

A method for deciding the actually-transmittable data block size as a supportable data block size which has a minimum difference with the actually-transmittable data block size.

In this case, if one transport block is transferred via one code block, the data block may correspond to the transport block. Otherwise, if one transport block is transferred via two or more code blocks, the data block may be considered to be the code blocks.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention cover the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents. For example, although the signal transmission method according to the present invention has been disclosed on the basis of the 3GPP LTE system, it can also be applied to other communication systems, each of which has a limitation in the block size during the encoding process and uses a combination of predetermined transport block sizes.

If a transport block received from an upper layer is segmented into a plurality of code blocks, and the code blocks are encoded by a turbo-encoder, the signal transmission method according to the present invention is able to remove the added dummy bits caused by a limitation of the block size of the internal interleaver of the turbo-encoder, such that it can effectively transmit signals.

›Tables in the description — 7
TABLE 1
iKiKiKiK
140484169511201423200
248494249611521433264
356504329711841443328
464514409812161453392
572524489912481463456
6805345610012801473520
7885446410113121483584
8965547210213441493648
91045648010313761503712
101125748810414081513776
111205849610514401523840
121285950410614721533904
131366051210715041543968
141446152810815361554032
151526254410915681564096
161606356011016001574160
171686457611116321584224
181766559211216641594288
191846660811316961604352
201926762411417281614416
212006864011517601624480
222086965611617921634544
232167067211718241644608
242247168811818561654672
252327270411918881664736
262407372012019201674800
272487473612119521684864
282567575212219841694928
292647676812320161704992
302727778412420481715056
312807880012521121725120
322887981612621761735184
332968083212722401745248
343048184812823041755312
353128286412923681765376
363208388013024321775440
373288489613124961785504
383368591213225601795568
393448692813326241805632
403528794413426881815696
413608896013527521825760
423688997613628161835824
433769099213728801845888
4438491100813829441855952
4539292102413930081866016
4640093105614030721876080
4740894108814131361886144
TABLE 2
MNMNMNMNMNMNMN
26200211448419080530576848424137454419112608
26328211576419336630936848936137537619113824
26456211704419592631320949296137620819115040
26584211832419848631704949872137704019116256
26712211960420104632088950448137787220117256
26840212088420360632472951024137870420118536
26968212216420616632856951600137953620119816
27096312384420872633240952176148028020121096
27224312576421128633624952752148117620122376
27352312768421384634008953328148207221123120
27480312960421640634392953904148296821124464
27608313152421896634776954480148386421125808
27736313344422152635160955056148476021127152
278643135364224086355441055416148565621128496
279923137284226646359281056056158601622130392
281203139204229206363121056696158697622131800
282483141124231766366961057336158793622133208
283763143044234327369921057976158889622134616
285043144964236887374401058616158985623134848
286323146884239447378881059256159081623136320
287603148804242007383361059896159177623137792
288883150724244567387841060536169277623139264
290163152645244967392321061176169380023140736
291443154565248167396801161664169482424142248
292723156485251367401281162368169584824143784
294003158405254567405761163072169687224145320
295283160325257767410241163776169789624146856
296563162245260967414721164480179857625148176
297843164165264167419201165184179966425149776
2991231660852673674236811658881710075225151376
21004031680052705674281611665921710184025152976
210168316992527376843304116729617102928
210296317184527696843816126804017104016
210424317376528016844328126880818104376
210552317568528336844840126957618105528
210680317760528656845352127034418106680
210808317952528976845864127111218107832
210936318144529296846376127188018108984
211064318336529616846888127264818110136
211192418568529936847400127341619110176
211320418824530256847912137371219111392
TABLE 3
1639210963176620012216221523744062368101840
2440011283240632812384224083788863072102928
3240811603304645612576226643833663776104016
4041611923368658412768229203878464480104376
4842412243432671212960231763923265184105528
5643212563496684013152234323968065888106680
6444012883560696813344236884012866592107832
7244813203624709613536239444057667296108984
8045613523688722413728242004102468040110136
8846413843752735213920244564147268808110176
9647214163816748014112244964192069576111392
10448014483880760814304248164236870344112608
11248814803944773614496251364281671112113824
12050415124008786414688254564330471880115040
12852015444072799214880257764381672648116256
13653615764136812015072260964432873416117256
14455216084200824815264264164484073712118536
15256816404264837615456267364535274544119816
16058416724328850415648270564586475376121096
16860017044392863215840273764637676208122376
17661617364456876016032276964688877040123120
18463217684520888816224280164740077872124464
19264818004584901616416283364791278704125808
20066418324648914416608286564842479536127152
20868018644712927216800289764893680280128496
21669618964776940016992292964929681176130392
22471219284840952817184296164987282072131800
23272819604904965617376299365044882968133208
24074419924968978417568302565102483864134616
24876020245032991217760305765160084760134848
256776208850961004017952309365217685656136320
264792215251601016818144313205275286016137792
272808221652241029618336317045332886976139264
280824228052881042418568320885390487936140736
288840234453521055218824324725448088896142248
296856240854161068019080328565505689856143784
304872247254801080819336332405541690816145320
312888253655441093619592336245605691776146856
320904260056081106419848340085669692776148176
328920266456721119220104343925733693800149776
336936272857361132020360347765797694824151376
344952279258001144820616351605861695848152976
352968285658641157620872355445925696872
360984292059281170421128359285989697896
3681000298459921183221384363126053698576
3761032304860561196021640366966117699664
38410643112612012088218963699261664100752
TABLE 1
iKiKiKiK
140484169511201423200
248494249611521433264
356504329711841443328
464514409812161453392
572524489912481463456
6805345610012801473520
7885446410113121483584
8965547210213441493648
91045648010313761503712
101125748810414081513776
111205849610514401523840
121285950410614721533904
131366051210715041543968
141446152810815361554032
151526254410915681564096
161606356011016001574160
171686457611116321584224
181766559211216641594288
191846660811316961604352
201926762411417281614416
212006864011517601624480
222086965611617921634544
232167067211718241644608
242247168811818561654672
252327270411918881664736
262407372012019201674800
272487473612119521684864
282567575212219841694928
292647676812320161704992
302727778412420481715056
312807880012521121725120
322887981612621761735184
332968083212722401745248
343048184812823041755312
353128286412923681765376
363208388013024321775440
373288489613124961785504
383368591213225601795568
393448692813326241805632
403528794413426881815696
413608896013527521825760
423688997613628161835824
433769099213728801845888
4438491100813829441855952
4539292102413930081866016
4640093105614030721876080
4740894108814131361886144
TABLE 4
iNiNiNiN
116483929510961423176
224494009611281433240
332504089711601443304
440514169811921453368
548524249912241463432
6565343210012561473496
7645444010112881483560
8725544810213201493624
9805645610313521503688
10885746410413841513752
11965847210514161523816
121045948010614481533880
131126048810714801543944
141206150410815121554008
151286252010915441564072
161366353611015761574136
171446455211116081584200
181526556811216401594264
191606658411316721604328
201686760011417041614392
211766861611517361624456
221846963211617681634520
231927064811718001644584
242007166411818321654648
252087268011918641664712
262167369612018961674776
272247471212119281684840
282327572812219601694904
292407674412319921704968
302487776012420241715032
312567877612520881725096
322647979212621521735160
332728080812722161745224
342808182412822801755288
352888284012923441765352
362968385613024081775416
373048487213124721785480
383128588813225361795544
393208690413326001805608
403288792013426641815672
413368893613527281825736
423448995213627921835800
433529096813728561845864
443609198413829201855928
4536892100013929841865992
4637693103214030481876056
4738494106414131121886120
TABLE 2
MNMNMNMNMNMNMN
26200211448419080530576848424137454419112608
26328211576419336630936848936137537619113824
26456211704419592631320949296137620819115040
26584211832419848631704949872137704019116256
26712211960420104632088950448137787220117256
26840212088420360632472951024137870420118536
26968212216420616632856951600137953620119816
27096312384420872633240952176148028020121096
27224312576421128633624952752148117620122376
27352312768421384634008953328148207221123120
27480312960421640634392953904148296821124464
27608313152421896634776954480148386421125808
27736313344422152635160955056148476021127152
278643135364224086355441055416148565621128496
279923137284226646359281056056158601622130392
281203139204229206363121056696158697622131800
282483141124231766366961057336158793622133208
283763143044234327369921057976158889622134616
285043144964236887374401058616158985623134848
286323146884239447378881059256159081623136320
287603148804242007383361059896159177623137792
288883150724244567387841060536169277623139264
290163152645244967392321061176169380023140736
291443154565248167396801161664169482424142248
292723156485251367401281162368169584824143784
294003158405254567405761163072169687224145320
295283160325257767410241163776169789624146856
296563162245260967414721164480179857625148176
297843164165264167419201165184179966425149776
2991231660852673674236811658881710075225151376
21004031680052705674281611665921710184025152976
210168316992527376843304116729617102928
210296317184527696843816126804017104016
210424317376528016844328126880818104376
210552317568528336844840126957618105528
210680317760528656845352127034418106680
210808317952528976845864127111218107832
210936318144529296846376127188018108984
211064318336529616846888127264818110136
211192418568529936847400127341619110176
211320418824530256847912137371219111392
TABLE 3
1639210963176620012216221523744062368101840
2440011283240632812384224083788863072102928
3240811603304645612576226643833663776104016
4041611923368658412768229203878464480104376
4842412243432671212960231763923265184105528
5643212563496684013152234323968065888106680
6444012883560696813344236884012866592107832
7244813203624709613536239444057667296108984
8045613523688722413728242004102468040110136
8846413843752735213920244564147268808110176
9647214163816748014112244964192069576111392
10448014483880760814304248164236870344112608
11248814803944773614496251364281671112113824
12050415124008786414688254564330471880115040
12852015444072799214880257764381672648116256
13653615764136812015072260964432873416117256
14455216084200824815264264164484073712118536
15256816404264837615456267364535274544119816
16058416724328850415648270564586475376121096
16860017044392863215840273764637676208122376
17661617364456876016032276964688877040123120
18463217684520888816224280164740077872124464
19264818004584901616416283364791278704125808
20066418324648914416608286564842479536127152
20868018644712927216800289764893680280128496
21669618964776940016992292964929681176130392
22471219284840952817184296164987282072131800
23272819604904965617376299365044882968133208
24074419924968978417568302565102483864134616
24876020245032991217760305765160084760134848
256776208850961004017952309365217685656136320
264792215251601016818144313205275286016137792
272808221652241029618336317045332886976139264
280824228052881042418568320885390487936140736
288840234453521055218824324725448088896142248
296856240854161068019080328565505689856143784
304872247254801080819336332405541690816145320
312888253655441093619592336245605691776146856
320904260056081106419848340085669692776148176
328920266456721119220104343925733693800149776
336936272857361132020360347765797694824151376
344952279258001144820616351605861695848152976
352968285658641157620872355445925696872
360984292059281170421128359285989697896
3681000298459921183221384363126053698576
3761032304860561196021640366966117699664
38410643112612012088218963699261664100752

Claims as granted

10 claims

Log in to read the claims of this application.

Log in to unlock

Classifications

2 codes
IPC · International Patent Classification
Section G — Physics
  • G06F11/00
Section H — Electricity
  • H04L1/00

Claim changes

Soon
Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this application are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoomApr 2014Jul 2014Oct 2014Jan 2015Apr 2015Jul 2015Oct 2015Jan 2016USPTOApplicantNon-final rejectionResponse after non-finalNotice of allowance
USPTOApplicanthover for detail · click to open
Pendency
1.7 y
627 days filing → grant
Office actions
1
non-final + final
Responses
1
no RCE
Examiner
Jason Bryan
art unit 2114 · TC 2100
Citations: 39 back · 6 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Documents

Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.

Log in to unlock

Chain of title

No assignments have been recorded for this application yet.