Specification
DATA PROCESSING APPARATUS AND METHOD Field of Invention
The present invention relates to data processing apparatus operable to map input symbols onto sub-carrier signals of Orthogonal Frequency Division Multiplexed (OFDM) symbols.
The present invention also relates to data processing apparatus operable to map symbols received from a predetermined number of sub-carrier signals of OFDM symbols into an output symbol stream.
Embodiments of the present invention can provide an OFDM transmitter/receiver. Background of the Invention
The Digital Video Broadcasting-Terrestrial standard (DVB-T) utilises Orthogonal Frequency Division Multiplexing (OFDM) to communicate data representing video images and sound to receivers via a broadcast radio communications signal. There are known to be two modes for the DVB-T standard which are known as the 2k and the 8k mode. The 2k mode provides 2048 sub-carriers whereas the 8k mode provides 8192 sub-carriers. Similarly for the Digital Video Broadcasting-Handheld standard (DVB-H) a 4k mode has been provided, in which the number of sub-carriers is 4096.
Error correction coding schemes such as LDPC/BCH coding, which have been proposed for DVB-T2 perform better when noise and degradation of the symbol values resulting from communication is un-correlated. Terrestrial broadcast channels may suffer from correlated fading in both the time and the frequency domains. As such, by separating encoded symbols on to different sub-carrier signals of the OFDM symbol by as much as possible, the performance of error correction coding schemes can be increased. Accordingly, in order to improve the integrity of data communicated using DVB-T or DVB-H, a symbol interleaver is provided in order to interleave input data symbols as these symbols are mapped onto the sub-carrier signals of an OFDM symbol. Such a symbol interleaver comprises an interleaver memory and an address generator. The interleaver is arranged to read-into the interleaver memory the data
symbols for mapping onto the OFDM sub-carrier signals, and to read-out of the memory the data symbols for the OFDM sub-carriers, the read-out being in a different order than the read-in, the order being determined from a set of addresses, which are generated by the address generator. For the 2k mode and the 8k mode an arrangement has been disclosed in the DVB-T standard for generating the addresses to effect the mapping. Likewise for the 4k mode of DVB-H standard, an arrangement for generating addresses for the mapping has been provided and an address generator for implementing this mapping is disclosed in European Patent application 04251667.4. The address generator comprises a linear feed back shift register which is operable to generate a pseudo random bit sequence and a permutation circuit. The permutation circuit permutes the order of the content of the linear feed back shift register in order to generate an address. The address provides an indication of a memory location of the interleaver memory for writing the input data symbol into or reading the input data symbol out from the interleaver memory for mapping onto one of the sub-carrier signal of the OFDM symbol. Similarly, an address generator in the receiver is arranged to generate addresses of the interleaver memory for writing the received data symbols into or reading the data symbols out from the interleaver memory to form an output data stream.
In accordance with a further development of the Digital Video Broadcasting-Terrestrial standard, known as DVB-T2, there is a desire to improve the communication of data, and more particularly to provide an improved arrangement for interleaving the data symbols onto the sub-carrier signals of OFDM symbols.
Summary of Invention
According to an aspect of the present invention there is provided a data processing apparatus operable to map input data symbols to be communicated onto a predetermined number of sub-carrier signals of an Orthogonal Frequency Division Multiplexed (OFDM) symbols. The data processing apparatus comprises an interleaver operable to read-into a memory the predetermined number of data symbols for mapping onto the OFDM sub-carrier signals, and to read-out of the memory the data symbols for the OFDM sub-carriers to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are interleaved on the sub-carrier signals. The data processing apparatus includes an address generator operable to generate the set of addresses, an address being generated for each of the input data symbols for mapping the input data symbols onto the sub-carrier signals. The address generator comprises a linear feedback shift register including a predetermined number of register stages, which are operable to generate a pseudo-random bit sequence in accordance with a generator polynomial, a permutation circuit arranged to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation code to form an address of one of the OFDM sub-carriers, and a control unit operable in combination with an address check circuit to regenerate an address when a generated address exceeds a predetermined maximum valid address. The predetermined maximum valid address is approximately four thousand, the linear feedback shift register has eleven register stages with a generator polynomial for the linear feedback shift register of R] [l 0] = /?,'_, [o] © /?,_, [2], and the
permutation order forms, with an additional bit, a twelve bit address. The data processing apparatus is characterised in that the permutation circuit is arranged to change the permutation code, which permutes the order of the bits of the register stages to form the set of addresses from one OFDM symbol to another.
Embodiments of the present invention can provide a data processing apparatus operable as a symbol interleaver for mapping data symbols to be communicated on an OFDM symbol, having substantially four thousand sub-carrier signals, which can provide an improvement in the integrity of the communicated data. The improvement
is provided as a result of a change of the permutation code, which is used to change the order of the bits in the feed back shift register, from one OFDM symbol to another. For example, the permutation code used may be one of a sequence of different permutation codes which is cycled through, for each of a plurality of OFDM symbols. As a result, an improvement is provided in reducing a possibility that successive or data bits which are close in order in an input data stream are mapped onto the same sub-carrier of an OFDM symbol, so that the error correction encoding can work more efficiently.
In one embodiment the number of sub-carrier signals maybe a value substantially between two thousand and four thousand and ninety six. Furthermore, the OFDM symbol may include pilot sub-carriers, which are arranged to carry known symbols, and the predetermined maximum valid address may depend on a number of the pilot sub-carrier symbols present in the OFDM symbol. As such the 4k mode can be provided with an efficient symbol interleaver, for example for a DVB standard, such as DVB-T2, DVB-T or DVB-H.
In one example the sequence of different permutation codes forms the twelve bit address Rt [n] for the i-th data symbol from the bit present in the n-th register stage
Rjin] in accordance with the permutation code defined by the table: (Table Removed)
Although the sequence of permutation codes can include any number of
For example, the approximately four thousand sub-carriers may be provided as one of a plurality of operating modes, the approximately four thousand sub-carriers providing half or less than half a maximum number of sub-carriers in the OFDM symbols of any of the operating modes. The input data symbols may be formed into or regarded as first sets of input data symbols for mapping onto first OFDM symbols and second sets of input data symbols for mapping onto second OFDM symbols. The data processing apparatus may be operable to interleave the input data symbols from both first and second sets in accordance with an odd interleaving process. The odd interleaving process includes writing the first sets of input data symbols into a first part of the interleaver memory in accordance with a sequential order of the first sets of input data symbols, reading out the first sets of input data symbols from the first part of the interleaver memory on to the sub-carrier signals of the first OFDM symbols in accordance with an order defined by one of the permutation codes of the sequence, writing the second set of input data symbols into a second part of the interleaver memory in accordance with a sequential order of the second sets of input data symbols, and reading out the second sets of input data symbols from the second part of the interleaver memory on to the sub-carrier signals of the second OFDM symbols in accordance with an order defined by another of the permutation codes of the sequence.
The first OFDM symbols may be odd OFDM symbols, and the second OFDM symbols may be even OFDM symbols.
In some conventional OFDM transmitters and receivers, which operate in accordance with the 2k or 8k modes for DVB-T and the 4k mode for DVB-H, two symbol interleaving processes are used in the transmitter and the receiver; one for even OFMD symbols and one for odd OFMD symbols. However, analysis has shown that the interleaving schemes designed for the 2k and 8k symbol interleavers for DVB-T and the 4k symbol interleaver for DVB-H work better for odd symbols than for even symbols. Embodiments of the present invention are arranged so that only the odd symbol interleaving process is used unless the transmitter/receiver is in the mode with the maximum number of sub-carriers. Therefore, when the number data symbols which can be carried by the sub-carriers of an OFDM symbol in one of the plurality of operating modes is less than half of the number of data symbols, which can be carried in an operating mode which proves the most number of data bearing sub-carrier signals
permutation codes, in one example there are two permutation codes. In one example, the two permutation codes are:
(Table Removed)
per OFDM symbol, then an interleaver of the transmitter and the receiver of the OFDM symbols is arranged to interleaver the data symbols of both the first and second sets using the odd interleaving process. Since the interleaver is interleaving the data symbols of both the first and second sets of data symbols onto the OFDM symbols using the odd interleaving process, the interleaver uses different parts of the interleaver memory to write in and read out the data symbols. Thus, compared with the example in which the interleaver is using the odd interleaving process and the even interleaving process to interleave the first and second sets of data symbols onto successive first and second OFDM symbols, which utilises the available memory, the amount of memory capacity used is twice the number of data symbols which can be carried by an OFDM symbol for the odd only interleaving. This is compared with a memory requirement of one times the number of data symbols, which can be carried in an OFDM symbol in the mode with the most number of data symbols per OFDM symbol using both the odd and even interleaving processes. However, the number of sub-carriers per OFDM symbol for this maximum operating mode is twice the capacity of the next largest number of sub-carriers per OFDM symbol for any other operating mode with the next largest number of sub-carriers per OFDM symbol.
According to some examples therefore, a minimum size of the interleaver memory can be provided in accordance with the maximum number of input data symbols which can be carried on the sub-carriers of the OFDM symbols which are available to carry the input data symbols in any of the operating modes.
In some embodiments the operating mode which provides the maximum number of sub-carriers per OFDM symbol is a 32K mode. The other modes may include one or more of IK, 2K, 4K, 8K and 16K modes. Thus, as will be appreciated from the above explanation, in the 32K mode the odd and even interleaving processes are used to interleave the data symbols, so that the size of the interleaver memory can be just enough to account for 32K data symbols. However, for the 16K mode and any of the other modes, then the odd interleaving process only is used, so that with the 16K mode an equivalent memory size of 32K symbols is required, with the 4K mode an equivalent memory size of 8K symbols is required, and with the 2K mode an equivalent memory size of 4K symbols is required.
Various aspects and features of the present invention are defined in the appended claims. Further aspects of the present invention include a method of mapping input symbols to be communicated onto a predetermined number of sub-carrier signals of an Orthogonal Frequency Division Multiplexed (OFDM) symbol, as well as a transmitter.
Brief Description of Drawings
Embodiments of the present invention will now be described by way of example only with reference to the accompanying drawings, wherein like parts are provided with corresponding reference numerals, and in which:
Figure 1 is a schematic block diagram of a Coded OFDM transmitter which may be used, for example, with the DVB-T2 standard;
Figure 2 is a schematic block diagram of parts of the transmitter shown in Figure 1 in which a symbol mapper and a frame builder illustrate the operation of an interleaver;
Figure 3 is a schematic block diagram of the symbol interleaver shown in Figure 2;
Figure 4 is a schematic block diagram of an interleaver memory shown in Figure 3 and the corresponding symbol de-interleaver in the receiver;
Figure 5 is a schematic block diagram of an address generator shown in Figure 3 for the 4k mode;
Figure 6 is a schematic block diagram of a Coded OFDM receiver which may be used, for example, with the DVB-T2 standard;
Figure 7 is a schematic block diagram of a symbol de-interleaver which appears in Figure 6;
Figure 8(a) is diagram illustrating results for an interleaver for even OFDM symbols and Figure 8(b) is a diagram illustrating results for odd OFDM symbols; Figures 8(a) and 8(b) show plots of the distance at the interleaver output of sub-carriers that were adjacent at the interleaver input;
Figure 9 provides a schematic block diagram of the symbol interleaver shown in Figure 3, illustrating an operating mode in which interleaving is performed in accordance with an odd interleaving mode only; and
Figure 10 provides a schematic block diagram of the symbol de-interleaver shown in Figure 7, illustrating the operating mode in which interleaving is performed in accordance with the odd interleaving mode only.
Description of Preferred Embodiments
The following description is provided to illustrate the operation of a symbol interleaver in accordance with the present technique, although it will be appreciated that the symbol interleaver can be used with other modes, other DVB standards and other OFDM systems.
Figure 1 provides an example block diagram of a Coded OFDM transmitter which may be used for example to transmit video images and audio signals in accordance with the DVB-T2 standard. In Figure 1 a program source generates data to be transmitted by the COFDM transmitter. A video coder 2, and audio coder 4 and a data coder 6 generate video, audio and other data to be transmitted which are fed to a program multiplexer 10. The output of the program multiplexer 10 forms a multiplexed stream with other information required to communicate the video, audio and other data. The multiplexer 10 provides a stream on a connecting channel 12. There may be many such multiplexed streams which are fed into different branches A, B etc. For simplicity, only branch A will be described.
As shown in Figure 1 a COFDM transmitter 20 receives the stream at a multiplexer adaptation and energy dispersal block 22. The multiplexer adaptation and energy dispersal block 22 randomises the data and feeds the appropriate data to a forward error correction encoder 24 which performs error correction encoding of the stream. A bit interleaver 26 is provided to interleave the encoded data bits which for the example of DVB-T2 is the LDCP/BCH encoder output. The output from the bit interleaver 26 is fed to a bit into constellation mapper 28, which maps groups of bits onto a constellation point, which is to be used for conveying the encoded data bits. The outputs from the bit into constellation mapper 28 are constellation point labels that represent real and imaginary components. The constellation point labels represent data symbols formed from two or more bits depending on the modulation scheme used. These will be referred to as data cells. These data cells are passed through a time-interleaver 30 whose effect is to interleaver data cells resulting from multiple LDPC code words.
The data cells are received by a frame builder 32, with data cells produced by branch B etc in Figure 1, via other channels 31. The frame builder 32 then forms many
data cells into sequences to be conveyed on COFDM symbols, where a COFDM symbol comprises a number of data cells, each data cell being mapped onto one of the sub-carriers. The number of sub-carriers will depend on the mode of operation of the system, which may include one of Ik, 2k, 4k, 8k, 16k or 32k, each of which provides a different number of sub-carriers according, for example to the following table:
(Table Removed)
Number of Sub-carriers Adapted from DVB-T/H
Thus in one example, the number of sub-carriers for the 4k mode is three thousand and twenty four. For the DVB-T2 system, the number of sub-carriers per OFDM symbol can vary depending upon the number of pilot and other reserved carriers. Thus, in DVB-T2, unlike in DVB-T, the number of sub-carriers for carrying data is not fixed. Broadcasters can select one of the operating modes from Ik, 2k, 4k, 8k, 16k, 32k each providing a range of sub-carriers for data per OFDM symbol, the maximum available for each of these modes being 1024, 2048, 4096, 8192, 16384, 32768 respectively. In DVB-T2 a physical layer frame is composed of many OFDM symbols. Typically the frame starts with one or more preamble or P2 OFDM symbols, which are then followed by a number payload carrying OFDM symbols. The end of the physical layer frame is marked by a frame closing symbols. For each operating mode, the number of sub-carriers may be different for each type of symbol. Furthermore, this may vary for each according to whether bandwidth extension is selected, whether tone reservation is enabled and according to which pilot sub-carrier pattern has been selected. As such a generalisation to a specific number of sub-carriers per OFDM symbol is difficult. However, the frequency interleaver for each mode can interleave any symbol whose number of sub-carriers is smaller than or the same as the maximum available number of sub-carriers for the given mode. For example, in the Ik mode, the interleaver would work for symbols with the number of sub-carriers being
less than or equal to 1024 and for 16k mode, with the number of sub-carriers being less than or equal to 16384.
The sequence of data cells to be carried in each COFDM symbol is then passed to the symbol interleaver 33. The COFDM symbol is then generated by a COFDM symbol builder block 37 which introduces pilot and synchronising signals fed from a pilot and embedded signal former 36. An OFDM modulator 38 then forms the OFDM symbol in the time domain which is fed to a guard insertion processor 40 for generating a guard interval between symbols, and then to a digital to analogue converter 42 and finally to an RF amplifier within an RF front end 44 for eventual broadcast by the COFDM transmitter from an antenna 46.
As explained above, the present invention provides a facility for providing a quasi-optimal mapping of the data symbols onto the OFDM sub-carrier signals. According to the example technique the symbol interleaver is provided to effect the optimal mapping of input data symbols onto COFDM sub-carrier signals in accordance with a permutation code and generator polynomial, which has been verified by simulation analysis.
As shown in Figure 2 a more detailed example illustration of the bit to symbol constellation mapper 28 and the frame builder 32 is provided to illustrate an example embodiment of the present technique. Data bits received from the bit interleaver 26 via a channel 62 are grouped into sets of bits to be mapped onto a data cell, in accordance with a number of bits per symbol provided by the modulation scheme. The groups of bits, which forms a data word, are fed in parallel via data channels 64 the a mapping processor 66. The mapping processor 66 then selects one of the data symbols, in accordance with a pre-assigned mapping. The constellation point, is represented by a real and an imaginary component that is provided to the output channel 29 as one of a set of inputs to the frame builder 32.
The frame builder 32 receives the data cells from the bit to constellation mapper 28 through channel 29, together with data cells from the other channels 31. After building a frame of many COFDM cell sequences, the cells of each COFDM symbol are then written into an interleaver memory 100 and read out of the interleaver memory 100 in accordance with write addresses and read addresses generated by an address generator 102. According to the write-in and read-out order, interleaving of
the data cells is achieved, by generating appropriate addresses. The operation of the address generator 102 and the interleaver memory 100 will be described in more detail shortly with reference to Figures 3, 4 and 5. The interleaved data cells are then combined with pilot and synchronisation symbols received from the pilot and embedded signalling former 36 into an OFDM symbol builder 37, to form the COFDM symbol, which is fed to the OFDM modulator 38 as explained above. Interleaver
Figure 3 provides an example of parts of the symbol interleaver 33, which illustrates the present technique for interleaving symbols. In Figure 3 the input data cells from the frame builder 32 are written into the interleaver memory 100. The data cells are written into the interleaver memory 100 according to a write address fed from the address generator 102 on channel 104, and read out from the interleaver memory 100 according to a read address fed from the address generator 102 on a channel 106. The address generator 102 generates the write address and the read address as explained below, depending on whether the COFDM symbol is odd or even, which is identified from a signal fed from a channel 108, and depending on a selected mode, which is identified from a signal fed from a channel 110. As explained, the mode can be one of a Ik mode, 2k mode, 4k mode, 8k mode, 16k mode or a 32k mode. As explained below, the write address and the read address are generated differently for odd and even symbols as explained with reference to Figure 4, which provides an example implementation of the interleaver memory 100.
In the example shown in Figure 4, the interleaver memory is shown to comprise an upper part 100 illustrating the operation of the interleaver memory in the transmitter and a lower part 340, which illustrates the operation of the de-interleaver memory in the receiver. The interleaver 100 and the de-interleaver 340 are shown together in Figure 4 in order to facilitate understanding of their operation. As shown in Figure 4 a representation of the communication between the interleaver 100 and the de-interleaver 340 via other devices and via a transmission channel has been simplified and represented as a section 140 between the interleaver 100 and the de-interleaver 340. The operation of the interleaver 100 is described in the following paragraphs:
Although Figure 4 provides an illustration of only four input data cells onto an example of four sub-carrier signals of a COFDM symbol, it will be appreciated that the technique illustrated in Figure 4 can be extended to a larger number of sub-carriers such as 756 for the Ik mode 1512 for the 2k mode, 3024 for the 4k mode and 6048 for the 8k mode, 12096 for the 16k mode and 24192 for the 32k mode.
The input and output addressing of the interleaver memory 100 shown in Figure 4 is shown for odd and even symbols. For an even COFDM symbol the data cells are taken from the input channel 77 and written into the interleaver memory 124.1 in accordance with a sequence of addresses 120 generated for each COFDM symbol by the address generator 102. The write addresses are applied for the even symbol so that as illustrated interleaving is effected by the shuffling of the write-in addresses. Therefore, for each interleaved symbol y(h(q)) = y'(q)-
For odd symbols the same interleaver memory 124.2 is used. However, as shown in Figure 4 for the odd symbol the write-in order 132 is in the same address sequence used to read out the previous even symbol 126. This feature allows the odd and even symbol interleaver implementations to only use one interleaver memory 100 provided the read-out operation for a given address is performed before the write-in operation. The data cells written into the interleaver memory 124 during odd symbols are then read out in a sequence 134 generated by the address generator 102 for the next even COFDM symbol and so on. Thus only one address is generated per symbol, with the read-in and write-out for the odd/even COFDM symbol being performed contemporaneously.
In summary, as represented in Figure 4, once the set of addresses H(q) has been calculated for all active sub-carriers, the input vector Y' = (yo', y1', y2'v-yNmax-r) is processed to produce the interleaved vector Y = (y0, y1, Y2, yNmax-l) defined by:
YH(q) = y'q for even symbols for q = 0,...,Nmax-l Yq = y'H(q) for odd symbols for q = 0,...,Nmax-l
In other words, for even OFDM symbols the input words are written in a permutated way into a memory and read back in a sequential way, whereas for odd
symbols, they are written sequentially and read back permutated. In the above case, the permutation H(q) is defined by the following table:
(Table Removed)
Table 1: permutation for simple case where Nmax =4
As shown in Figure 4, the de-interleaver 340 operates to reverse the interleaving applied by the interleaver 100, by applying the same set of addresses as generated by an equivalent address generator, but applying the write-in and read-out addresses in reverse. As such, for even symbols, the write-in addresses 342 are in sequential order, whereas the read out address 344 are provided by the address generator. Correspondingly, for the odd symbols, the write-in order 346 is determined from the set of addresses generated by the address generator, whereas read out 348 is in sequential order. Address Generation for the 4k Mode
A schematic block diagram of the algorithm used to generate the permutation function H(q) is represented in Figure 5 for the 4K mode. In Figure 5 a linear feed back shift register is formed by twelve shift register stages 200, in order to generate an address between 0 and four thousand and ninety five, and an xor-gate 202 which is connected to the stages of the shift register 200 in accordance with a generator polynomial. Therefore, in accordance with the content of the shift register 200 a next bit of the shift register is provided from the output of the xor-gate 202 by xoring the content of shift register R[0] and register stage R[2]. According to the generator polynomial a pseudo random bit sequence is generated from the content of the shift register 200. However, in order to generate an address for the 4k mode as illustrated, a permutation circuit 210 is provided which effectively permutes the order of the bits within the shift register 200 from an order R'ifn] to an order Rj[n] at the output of the
permutation circuit 210. Eleven bits from the output of the permutation circuit 210 are then fed on a connecting channel 212 to which is added a most significant bit via a channel 214 which is provided by a toggle circuit 218. A twelve bit address is therefore generated on channel 212. However, in order to ensure the authenticity of an address, an address check circuit 216 analyses the generated address to determine
whether it exceeds the maximum number of sub-carrier signals. If it does then a control signal is generated and fed via a connecting channel 220 to a control unit 224. If the generated address exceeds the maximum number of carrier signals then this address is rejected and a new address regenerated for the particular symbol.
In summary an (Nr - 1) bit word R'j is defined, with Nr = log2 Mmax, where Mmax = 4096 in the 4K mode, using a LFSR (Linear Feedback Shift Register).
The polynomials used to generate this sequence are as follows:
4K mode: R, [l0] = R,'_, [o] Ri-1 [2]
where i varies from 0 to Mmax - 1
Once one R'i word has been generated, it goes through a permutation to produce another (Nr - 1) bit word called Ri. Ri is derived from R'j by the bit permutations given in the table below:
(Table Removed)
Table: Bit permutation for the 4K mode
As an example, for the permutation code above this means that for mode 4K, the bit number 10 of R'j is sent in bit position number 7 of Ri.
The address H(q) is then derived from Ri through the following equation:
(Equation Removed)
The (i mod2) • 2Nr_1 part of the above equation is represented in Figure 5 by the
toggle block T 218.
An address check is then performed on H(q) to verify that the generated address is within the range of acceptable addresses: if (H(q)
Documents
Orders
| Section |
Controller |
Decision Date |
|
|
|
Application Documents
| # |
Name |
Date |
| 1 |
1325-DEL-2010-Form-18-(16-09-2010).pdf |
2010-09-16 |
| 2 |
1325-DEL-2010-Correspondence-Others-(16-09-2010).pdf |
2010-09-16 |
| 3 |
abstract.jpg |
2011-08-21 |
| 4 |
1325-del-2010-gpa.pdf |
2011-08-21 |
| 5 |
1325-del-2010-form-5.pdf |
2011-08-21 |
| 6 |
1325-del-2010-form-3.pdf |
2011-08-21 |
| 7 |
1325-del-2010-form-2.pdf |
2011-08-21 |
| 8 |
1325-del-2010-form-1.pdf |
2011-08-21 |
| 9 |
1325-del-2010-drawings.pdf |
2011-08-21 |
| 10 |
1325-del-2010-description (complete).pdf |
2011-08-21 |
| 11 |
1325-del-2010-correspondence-others.pdf |
2011-08-21 |
| 12 |
1325-del-2010-claims.pdf |
2011-08-21 |
| 13 |
1325-del-2010-abstract.pdf |
2011-08-21 |
| 14 |
1325-del-2010-Correspondence oters-(07-02-2012).pdf |
2012-02-07 |
| 15 |
1325-del-2010-Correspondence Others-(30-03-2012).pdf |
2012-03-30 |
| 16 |
1325-del-2010-Correspondence Others-(17-04-2013).pdf |
2013-04-17 |
| 17 |
1325-del-2010-Correspondence-Others-(11-06-2013).pdf |
2013-06-11 |
| 18 |
1325-del-2010-Form-3-(09-10-2013).pdf |
2013-10-09 |
| 19 |
1325-del-2010-Correspondence Others-(09-10-2013).pdf |
2013-10-09 |
| 20 |
1325-DEL-2010-Form 3-021214.pdf |
2014-12-10 |
| 21 |
1325-DEL-2010-Correspondence-021214.pdf |
2014-12-10 |
| 22 |
1325-del-2010-Form-3-(02-11-2015).pdf |
2015-11-02 |
| 23 |
1325-del-2010-Correspondence Others-(02-11-2015).pdf |
2015-11-02 |
| 24 |
Form 3 [17-02-2017(online)].pdf |
2017-02-17 |
| 25 |
1325-DEL-2010-FORM 3 [11-10-2017(online)].pdf |
2017-10-11 |
| 26 |
1325-DEL-2010-FER.pdf |
2018-06-14 |
| 27 |
1325-DEL-2010-FORM 4(ii) [14-12-2018(online)].pdf |
2018-12-14 |
| 28 |
1325-DEL-2010-PETITION UNDER RULE 137 [14-03-2019(online)].pdf |
2019-03-14 |
| 29 |
1325-DEL-2010-OTHERS [14-03-2019(online)].pdf |
2019-03-14 |
| 30 |
1325-DEL-2010-FER_SER_REPLY [14-03-2019(online)].pdf |
2019-03-14 |
| 31 |
1325-DEL-2010-CORRESPONDENCE [14-03-2019(online)].pdf |
2019-03-14 |
| 32 |
1325-DEL-2010-COMPLETE SPECIFICATION [14-03-2019(online)].pdf |
2019-03-14 |
| 33 |
1325-DEL-2010-CLAIMS [14-03-2019(online)].pdf |
2019-03-14 |
| 34 |
1325-DEL-2010-ABSTRACT [14-03-2019(online)].pdf |
2019-03-14 |
| 35 |
1325-DEL-2010-Power of Attorney-150319.pdf |
2019-03-22 |
| 36 |
1325-DEL-2010-OTHERS-150319.pdf |
2019-03-22 |
| 37 |
1325-DEL-2010-Correspondence-150319.pdf |
2019-03-22 |
| 38 |
1325-DEL-2010-US(14)-HearingNotice-(HearingDate-18-08-2020).pdf |
2020-07-27 |
| 39 |
1325-DEL-2010-Response to office action [07-08-2020(online)].pdf |
2020-08-07 |
| 40 |
1325-DEL-2010-Correspondence to notify the Controller [17-08-2020(online)].pdf |
2020-08-17 |
| 41 |
1325-DEL-2010-REQUEST FOR ADJOURNMENT OF HEARING UNDER RULE 129A [18-08-2020(online)].pdf |
2020-08-18 |
| 42 |
1325-DEL-2010-Correspondence to notify the Controller [09-09-2020(online)].pdf |
2020-09-09 |
| 43 |
1325-DEL-2010-FORM-26 [16-09-2020(online)].pdf |
2020-09-16 |
| 44 |
1325-DEL-2010-Written submissions and relevant documents [01-10-2020(online)].pdf |
2020-10-01 |
| 45 |
1325-DEL-2010-PETITION UNDER RULE 137 [01-10-2020(online)].pdf |
2020-10-01 |
| 46 |
1325-DEL-2010-Annexure [01-10-2020(online)].pdf |
2020-10-01 |
| 47 |
1325-DEL-2010-FORM 3 [16-02-2021(online)].pdf |
2021-02-16 |
| 48 |
1325-DEL-2010-FORM 3 [21-07-2021(online)].pdf |
2021-07-21 |
| 49 |
1325-DEL-2010-US(14)-ExtendedHearingNotice-(HearingDate-17-09-2020).pdf |
2021-10-03 |
| 50 |
1325-DEL-2010-PatentCertificate18-01-2022.pdf |
2022-01-18 |
| 51 |
1325-DEL-2010-IntimationOfGrant18-01-2022.pdf |
2022-01-18 |
| 52 |
1325-DEL-2010-RELEVANT DOCUMENTS [09-09-2023(online)].pdf |
2023-09-09 |
| 53 |
1325-DEL-2010-PROOF OF ALTERATION [28-06-2024(online)].pdf |
2024-06-28 |
| 54 |
1325-DEL-2010-POWER OF AUTHORITY [28-06-2024(online)].pdf |
2024-06-28 |
| 55 |
1325-DEL-2010-FORM-16 [28-06-2024(online)].pdf |
2024-06-28 |
| 56 |
1325-DEL-2010-ASSIGNMENT WITH VERIFIED COPY [28-06-2024(online)].pdf |
2024-06-28 |
Search Strategy
| 1 |
searchstrategy_23-06-2017.pdf |
ERegister / Renewals
3rd: 17 Mar 2022
From 27/10/2010 - To 27/10/2011
4th: 17 Mar 2022
From 27/10/2011 - To 27/10/2012
5th: 17 Mar 2022
From 27/10/2012 - To 27/10/2013
6th: 17 Mar 2022
From 27/10/2013 - To 27/10/2014
7th: 17 Mar 2022
From 27/10/2014 - To 27/10/2015
8th: 17 Mar 2022
From 27/10/2015 - To 27/10/2016
9th: 17 Mar 2022
From 27/10/2016 - To 27/10/2017
10th: 17 Mar 2022
From 27/10/2017 - To 27/10/2018
11th: 17 Mar 2022
From 27/10/2018 - To 27/10/2019
12th: 17 Mar 2022
From 27/10/2019 - To 27/10/2020
13th: 17 Mar 2022
From 27/10/2020 - To 27/10/2021
14th: 17 Mar 2022
From 27/10/2021 - To 27/10/2022
15th: 21 Oct 2022
From 27/10/2022 - To 27/10/2023
16th: 23 Oct 2023
From 27/10/2023 - To 27/10/2024
17th: 21 Oct 2024
From 27/10/2024 - To 27/10/2025
18th: 13 Oct 2025
From 27/10/2025 - To 27/10/2026