Nothing Special   »   [go: up one dir, main page]

US7415045B2 - Method and a system for transferring AMR signaling frames on halfrate channels - Google Patents

Method and a system for transferring AMR signaling frames on halfrate channels Download PDF

Info

Publication number
US7415045B2
US7415045B2 US10/485,031 US48503104A US7415045B2 US 7415045 B2 US7415045 B2 US 7415045B2 US 48503104 A US48503104 A US 48503104A US 7415045 B2 US7415045 B2 US 7415045B2
Authority
US
United States
Prior art keywords
bit stream
bits
block
bit
modulation scheme
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related, expires
Application number
US10/485,031
Other versions
US20040240566A1 (en
Inventor
Benoist Sébire
Thierry Bellier
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Microsoft Technology Licensing LLC
2011 Intellectual Property Asset Trust
Original Assignee
Nokia Oyj
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
US case filed in Texas Eastern District Court litigation Critical https://portal.unifiedpatents.com/litigation/Texas%20Eastern%20District%20Court/case/6%3A12-cv-00100 Source: District Court Jurisdiction: Texas Eastern District Court "Unified Patents Litigation Data" by Unified Patents is licensed under a Creative Commons Attribution 4.0 International License.
US case filed in Court of Appeals for the Federal Circuit litigation https://portal.unifiedpatents.com/litigation/Court%20of%20Appeals%20for%20the%20Federal%20Circuit/case/2015-2037 Source: Court of Appeals for the Federal Circuit Jurisdiction: Court of Appeals for the Federal Circuit "Unified Patents Litigation Data" by Unified Patents is licensed under a Creative Commons Attribution 4.0 International License.
First worldwide family litigation filed litigation https://patents.darts-ip.com/?family=8555920&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=US7415045(B2) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Nokia Oyj filed Critical Nokia Oyj
Assigned to NOKIA CORPORATION reassignment NOKIA CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BELLIER, THIERRY, SEBIRE, BENOIST
Publication of US20040240566A1 publication Critical patent/US20040240566A1/en
Priority to US12/175,554 priority Critical patent/US7817679B2/en
Publication of US7415045B2 publication Critical patent/US7415045B2/en
Application granted granted Critical
Assigned to MICROSOFT CORPORATION, NOKIA CORPORATION reassignment MICROSOFT CORPORATION SHORT FORM PATENT SECURITY AGREEMENT Assignors: CORE WIRELESS LICENSING S.A.R.L.
Assigned to NOKIA 2011 PATENT TRUST reassignment NOKIA 2011 PATENT TRUST ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: NOKIA CORPORATION
Assigned to 2011 INTELLECTUAL PROPERTY ASSET TRUST reassignment 2011 INTELLECTUAL PROPERTY ASSET TRUST CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: NOKIA 2011 PATENT TRUST
Assigned to CORE WIRELESS LICENSING S.A.R.L. reassignment CORE WIRELESS LICENSING S.A.R.L. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: 2011 INTELLECTUAL PROPERTY ASSET TRUST
Assigned to MICROSOFT TECHNOLOGY LICENSING, LLC reassignment MICROSOFT TECHNOLOGY LICENSING, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CORE WIRELESS LICENSING, S.A.R.L.,
Assigned to MICROSOFT CORPORATION reassignment MICROSOFT CORPORATION UCC FINANCING STATEMENT AMENDMENT - DELETION OF SECURED PARTY Assignors: NOKIA CORPORATION
Adjusted expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/18Phase-modulated carrier systems, i.e. using phase-shift keying
    • H04L27/20Modulator circuits; Transmitter circuits
    • H04L27/2003Modulator circuits; Transmitter circuits for continuous phase modulation
    • H04L27/2007Modulator circuits; Transmitter circuits for continuous phase modulation in which the phase change within each symbol period is constrained
    • H04L27/2017Modulator circuits; Transmitter circuits for continuous phase modulation in which the phase change within each symbol period is constrained in which the phase changes are non-linear, e.g. generalized and Gaussian minimum shift keying, tamed frequency modulation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/32Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041Arrangements at the transmitter end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0067Rate matching
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0072Error control for data other than payload data, e.g. control data
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/08Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L2001/125Arrangements for preventing errors in the return channel

Definitions

  • the present invention relates generally to the transmission of signaling information. More specifically, the present invention relates to the transference of signaling frames on GERAN (GSM/EDGE Radio Access Network) half rate channels utilizing a modulation scheme.
  • GERAN GSM/EDGE Radio Access Network
  • GSM Global System for Mobile Communications
  • EDGE Enhanced Data rates GSM Evolution
  • TDMA Time Division Multiple Access
  • Each frame can be shared among users by dividing the frame into time slots.
  • a TDMA time frame thus comprises physical channels used to physically transfer information from one place to another.
  • the contents of the physical channels form logical channels, which can be divided into traffic and control channels.
  • the control channels can be further divided into dedicated and common channels.
  • the dedicated channels are used for traffic and signaling between the network and the Mobile Stations (MS), whereas the common channels are used for broadcasting different information to the MS and for setting up signaling channels between the Mobile Switching Center/Visitor Location Register (MSC/VLR) and the MSs.
  • MSC/VLR Mobile Switching Center/Visitor Location Register
  • different types of signaling channels are used to facilitate the discussions between the MSs and the Base Transceiver Stations (BTSs), Base Station Controllers (BSCs), and the MSC/VLR.
  • BTSs Base Transceiver Stations
  • BSCs Base Station Controllers
  • the logical channels are mapped onto physical channels as described in the technical specification 3GPP TS 45.002 (GERAN Multiplexing and multiple access on the radio path).
  • the modulation method used is a phase modulation known as Gaussian Minimum Shift Keying (GMSK).
  • GMSK Gaussian Minimum Shift Keying
  • the phase of a true bit is shifted 90°, whereas the phase of a false bit is not shifted.
  • 8-PSK Phase Shift Keying
  • the two types of speech traffic channels used in the GSM are the Full Rate GMSK Traffic Channel (TCH/F) and the Half Rate GMSK Traffic Channel (TCH/H).
  • the voice codecs normally used are the Full Rate (FR) and the Enhanced Full Rate (EFR) codecs.
  • the EFR speech coder provides the best quality of voice.
  • FR Full Rate
  • EFR Enhanced Full Rate
  • HR Half Rate
  • the HR coder can therefore be used to serve a double number of subscribers on a half rate speech traffic channel as compared to an FR coder on a full-rate speech traffic channel.
  • AMR Adaptive Multi-Rate
  • AMR signaling frame Purpose SID_FIRST_P1 indicates end of speech
  • start of DTX (1 st part) SID_FIRST_P2 indicates end of speech
  • start of DTX (2 nd part) SID_FIRST_INH inhibits the second part of a SID_FIRST_P1 if a speech onset occurs ONSET tells the codec the mode of the first speech frame after DTX SID_UPDATE conveys comfort noise parameters during DTX SID_UPDATE_INH inhibits the second part of a SID_UPDATE frame if a speech onset occurs
  • RATSCCH_MARKER identifies RATSSCH frames
  • RATSCCH_DATA conveys the actual RATSSCH message
  • a crucial part of the system is the Channel Coder 100 in FIG. 1A .
  • a block to be transmitted includes Inband Data 101 consisting of two bits. These bits are coded in a coding block 102 using predefined code words, which must be 48 bits in length in order to correspond to the reserved block length.
  • the bits to be transmitted further include Identification Marker Sequences 103 consisting of 9- or 11-bit sequence. Eleven bits are used for the RATSSCH_MARKER, for which a repetition of 58 times in the repetition block 104 is required to get the correct total block length of 636 bits. For the other AMR signaling frames a repetition of 71 times is required in the repetition block 104 .
  • Comfort Noise parameters 105 For the AMR signaling frames SID_UPDATE, which convey Comfort Noise parameters during a Discontinuous Transmission (DTX) period, and for the RATSCCH_DATA AMR signaling frame the Comfort Noise parameters 105 also need to be coded.
  • a Cyclic Redundancy Check (CRC) is performed in the check block 106 to protect the Comfort Noise against transmission errors. This checksum (14 bits) is added to the Comfort Noise parameters (49 bits total), and the result is fed through a convolutional encoder block 107 , which increases the block length to 636 bits.
  • All signals coming from the Channel Coder 100 are multiplexed in a multiplexing block 108 .
  • the total number of bits to be sent in a block is either 684 bits or 1368, depending on the AMR signaling frame.
  • the AMR signaling frames are mapped in the mapping block 109 to 8-PSK symbols, which modifies the block size to 228 or 456 symbols.
  • the symbols resulting from the signaling frames are then interleaved in the interleaving block 110 together with blocks from other frames, which may be speech frames, for example. After the interleaving a burst will be formatted in the burst formation block 111 . Then the burst is modulated in a modulation block 112 and directed to the transmission block 113 .
  • the signal after receiving a signal in a receiving block 129 , the signal must be demodulated in the demodulation block 130 .
  • the content of the original burst has to be recovered in the recovery block 131 .
  • the burst consists of interleaved symbols, they must first be fed through the deinterleaving block 132 and then converted back to bits in the converting block 133 .
  • the signaling Before the messages can be passed to the Channel Decoder 120 , the signaling must be de-multiplexed in the de-multiplexing block 134 so that the Inband Data part 136 is decoded in the codeword decoder block 135 , and the Identification Marker Sequence 138 in the Identification Marker decoder block 137 . If the AMR signaling frame includes Comfort Noise parameters, they are then decoded in the corresponding decoding block 139 , and the CRC bits are verified in the verification block 140 . Only after this are the Comfort Noise parameters 141 obtained.
  • the drawback of the solution described above is that both high rate convolutional codes and high rate block codes are required.
  • the convolutional coder 107 encodes the 49 bits sequence into 636 bits
  • the block coder 102 encodes the 2 bits into 48 bits.
  • the convolutional decoder 139 decodes the 636 bits into the 49 bits
  • the code word decoder 135 decodes the 48 bits into the 2 bits.
  • the rate of the convolutional encoder 107 for the Comfort Noise is 1/12, which is more demanding than the 1 ⁇ 4 for the GMSK.
  • the interested reader may find descriptions of the polynomials and the constraint lengths in the document 3GPP TS 45.003 V5.1.0 (GERAN Channel Coding). As explained above, the shorter 9 bit sequence of the identification marker has to be repeated 71 times.
  • the purpose of the present invention is to address the problem discussed above. This can be achieved using a method and system for processing AMR signaling frames as described in the independent claims.
  • the channel coding has to be performed in a novel way for channels that use a modulation scheme carrying several bits in one symbol.
  • the present invention provides such a novel mechanism, particularly for traffic channels utilizing the 8-PSK modulation method referred to above. Using a modulation scheme carrying several bits in one symbol, n bits can be represented with one symbol if there are 2 n possible modulation states.
  • the idea of the invention is that by using bit repetition the current channel encoders and interleavers defined for the use of corresponding GMSK channels can be utilized when transmitting AMR signaling frames on the GERAN half rate channels utilizing 8-PSK.
  • each bit c(i) is first repeated 3 times ⁇ c′(3(i ⁇ 1)+1), c′(3(i ⁇ 1)+2), c′(3(i ⁇ 1)+3) ⁇ . These 3 bits are then converted into one symbol C(i). After converting all m signaling bits, the resulting symbols C(1), . . . , C(m) are interleaved. After interleaving, the symbols are modulated and then transmitted.
  • the signal has to be demodulated.
  • the received symbols ⁇ C(1), C(2), C(3) ⁇ are then de-interleaved, after which the symbol C(i) is converted into 3 bits ⁇ c′(3(i ⁇ 1)+1), c′(3(i ⁇ 1)+2)), c′(3(i ⁇ 1)+3) ⁇ .
  • the 3-multiple bit sequence has to be converted back to the original bit c(i).
  • the soft value of c(i) can be computed by combining the soft values of the 3-multiple bit sequence received.
  • FIGS. 1A and 1B show a straightforward solution fortransfering AMR signaling frames on a GERAN half rate channel
  • FIGS. 2A and 2B illustrate the method of the invention
  • FIGS. 3A and 3B illustrate the system of the invention.
  • FIG. 2A illustrates the transmission side of the system of the invention.
  • Each bit c(i) transmitted from the existing channel encoder block 21 which is defined for the corresponding GMSK channel, is repeated in a repetition block 22 n times to correspond to the number of bits carried by one symbol.
  • the n bits ⁇ c′((i ⁇ 1)n+1), . . . , c′((i ⁇ 1)n+n) ⁇ generated on the basis of c(i) are then converted to a symbol C(i) in a conversion block 23 .
  • the symbols are then interleaved using an interleaver 24 , which is also already defined for the corresponding GMSK channel.
  • the receiving side of the system is the reverse of the sending side.
  • the received symbols C(i) have to be deinterleaved using a known de-interleaver 25 defined for the corresponding GMSK channel.
  • the n bit sequence ⁇ c′((i ⁇ 1)n+1), . . . , c′((i ⁇ 1)n+n) ⁇ is obtained using the normal symbol to bit conversion in the conversion block 26 .
  • the n bit sequence is combined in a combination block 27 to form a bit value corresponding to the original bit value c(i). Preferably, this is done by combining the soft values of the received n-multiple bit sequence. In this way the bit sequence is reduced to one bit, which is ready to be fed into the channel decoder 28 .
  • the channel decoder 28 is substantially the same as the one defined for the corresponding GMSK channel.
  • the application of the invention on the AMR signaling frames of an 8-PSK modulated HR AMR Speech Traffic Channel. is described.
  • the Inband Data 301 to be transmitted is encoded in the coder block 302 of the channel coder part 300 .
  • the Identification Marker sequence 303 is repeated in the repeating block 304 .
  • a CRC is calculated in the calculation block 306 and then the resulting bit sequence is convolutionally encoded in the corresponding coding block 307 .
  • Blocks 304 , 306 , and 307 are identical to the respective blocks already standardized for the corresponding GMSK channel (see 3GPP TS 45.003 GERAN Channel Coding).
  • the code words block 302 can be selected to correspond to the already existing TCH/AHS 16 bit code words, for example. Consequently, the tables in the Channel Coder 300 need not include longer high-rate codes, thus saving memory.
  • Another benefit of the invention is that if already existing code words are selected, there are only minor changes required in the network elements and in the terminal equipment.
  • the 9-bit sequence of the Identification Marker 303 need not be repeated 71 times but 24 times, and for the AMR signaling frame RATSCCH the 11-bit sequence of the Identification Marker 303 needs to be repeated only 20 times. After the repetition in the repetition block 304 , the Identification Marker block consists of 212 bits.
  • the Comfort Noise parameters 305 can be convolutionally encoded in the coder block 307 with a shorter code, which results in 212 bits. This is computationally cheaper, and, also saves memory.
  • the rate of the convolutional encoder will be 1 ⁇ 4.
  • the constraint length value k 5 and, similarly, the already existing polynomials G1, G2, and G3 can be used.
  • the multiplexing block 308 functions similarly to the solution described above.
  • the available bandwidth for the AMR signaling frames is threefold (stretched from 228 bits to 684 bits, or from 456 bits to 1368 bits).
  • Each bit is therefore repeated three times: a bit c(i) will be mapped to a bit triplet ⁇ c′(3(i ⁇ 1)+1), c′(3(i ⁇ 1)+2), c′(3(i ⁇ 1)+3) ⁇ .
  • the repeating ensures a correct block length for the AMR signaling frames.
  • the bit triplets are mapped in a mapping block 310 to 8-PSK symbols C(i) according to Table 1 in 3GPP TS 45.004 (GERAN Modulation).
  • the symbols are then interleaved in the interleaving block 311 together with other symbols, and then a burst is formatted in the formation block 312 .
  • the bursts are transmitted by the transmission block 314 after modulation in the modulation block 313 .
  • the received signal 320 is first demodulated in a demodulating block 321 .
  • the content of the original burst is recovered in the recovery block 322 and de-interleaved in the de-interleaving block 323 .
  • the signals are symbols C(i), which need to be converted back to bit triplets ⁇ c′(3(i ⁇ 1)+1), c′(3(i ⁇ 1)+2), c′(3(i ⁇ 1)+3) ⁇ .
  • the conversion is performed using the ordinary 8-PSK conversion table.
  • the triplet has to be combined in the combining block 325 to correspond to one bit.
  • the combined soft values c(i) of the bits are then de-multiplexed in the de-multiplexing block 326 , before the channel decoder 340 processes them.
  • the Inband Data 328 is then decoded in the decoding block 327 using the code word table, whereas the Identification Marker sequence 330 is decoded in the Identification Marker decoding part 212 .
  • the Comfort Noise 333 is obtained after convolutionally decoding the bit sequence coming from the demultiplexer 326 in the decoding block 331 and CRC checking them in the checking block 332 .
  • the decoder 340 and de-interleaver block 323 are the same as those used for the TCH/AHS traffic channels.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Nonlinear Science (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
  • Error Detection And Correction (AREA)

Abstract

The present invention relates to the transference of signaling frames on GERAN (GSM/EDGE radio Access Network) half rate channels utilizing a modulation scheme carrying n bits in one symbol. In order to be able to utilize the existing channel coding developed for channels with different modulations and to avoid high rate convolutional and block codes, the AMR signaling frame to be transferred is coded using a coding procedure defined for a GSM half rate channel utilizing a GMSK modulation scheme, the coding procedure outputting a coded output stream. In response to said coding, each bit of the coded output stream is repeated n times, whereby a repeated bit stream is obtained, and symbols to be transmitted are formed from the repeated bit stream.

Description

This application claims benefit of the earlier filed International Application No. PCT/FI01/00749, International Filing Date, Aug. 27, 2001, which designated the United States of America, and which international application was published under PCT Article 21(2) as WO Publication No. WO 03/019847 A.
FIELD OF THE INVENTION
The present invention relates generally to the transmission of signaling information. More specifically, the present invention relates to the transference of signaling frames on GERAN (GSM/EDGE Radio Access Network) half rate channels utilizing a modulation scheme.
BACKGROUND OF THE INVENTION
Recent development in mobile communications technologies has been towards increased bandwidths and faster data rates. The GSM (Global System for Mobile Communications) has been one of the most successful communications technologies ever. However, as the relatively slow transmission speed of GSM has been a bottleneck for creating better services to the consumer market, a lot of effort has been put into developing new faster technologies for mobile communications. One such example is EDGE (Enhanced Data rates GSM Evolution). The standardization of EDGE was completed at the European Telecommunications Standards Institute in 1997.
For GSM/EDGE Radio Access Network (GERAN), there have been several new challenges to overcome. Higher data rates are achieved in part by changing channel coding. The transmission in a TDMA (Time Division Multiple Access) system takes place in time frames. Each frame can be shared among users by dividing the frame into time slots. A TDMA time frame thus comprises physical channels used to physically transfer information from one place to another. The contents of the physical channels form logical channels, which can be divided into traffic and control channels. The control channels can be further divided into dedicated and common channels. The dedicated channels are used for traffic and signaling between the network and the Mobile Stations (MS), whereas the common channels are used for broadcasting different information to the MS and for setting up signaling channels between the Mobile Switching Center/Visitor Location Register (MSC/VLR) and the MSs. Over the radio path, different types of signaling channels are used to facilitate the discussions between the MSs and the Base Transceiver Stations (BTSs), Base Station Controllers (BSCs), and the MSC/VLR. The logical channels are mapped onto physical channels as described in the technical specification 3GPP TS 45.002 (GERAN Multiplexing and multiple access on the radio path).
In the GSM system, the modulation method used is a phase modulation known as Gaussian Minimum Shift Keying (GMSK). In GMSK, the phase of a true bit is shifted 90°, whereas the phase of a false bit is not shifted. With the increasing data rates of EDGE, new 8 Phase Shift Keying (8-PSK) with 8 possible shift values has been introduced (3GPP TS 45.004). Each of the shift values corresponds to a certain symbol consisting of 3 bits.
The two types of speech traffic channels used in the GSM are the Full Rate GMSK Traffic Channel (TCH/F) and the Half Rate GMSK Traffic Channel (TCH/H). For the TCH/F channels, the voice codecs normally used are the Full Rate (FR) and the Enhanced Full Rate (EFR) codecs. The EFR speech coder provides the best quality of voice. For the TCH/H channels a Half Rate (HR) coder is normally used, which consumes less bandwidth as compared to the FR codecs. The HR coder can therefore be used to serve a double number of subscribers on a half rate speech traffic channel as compared to an FR coder on a full-rate speech traffic channel.
In order to achieve a better voice quality, a new Adaptive Multi-Rate (AMR) coder has been introduced (Release 1998). Further, the introduction of AMR on TCH/H channels utilizing 8-PSK (O-TCH/H channels) has been considered. However, there has not been any channel coding for the AMR signaling frames defined for such traffic channels (O-TCH/H). The AMR signaling frames are listed in Table 1.
TABLE 1
The different AMR signaling frames used on half rate channels.
AMR signaling
frame Purpose
SID_FIRST_P1 indicates end of speech, start of DTX (1st part)
SID_FIRST_P2 indicates end of speech, start of DTX (2nd part)
SID_FIRST_INH inhibits the second part of a
SID_FIRST_P1 if a
speech onset occurs
ONSET tells the codec the mode of
the first speech frame
after DTX
SID_UPDATE conveys comfort noise parameters during DTX
SID_UPDATE_INH inhibits the second part of a
SID_UPDATE frame if
a speech onset occurs
RATSCCH_MARKER identifies RATSSCH frames
RATSCCH_DATA conveys the actual RATSSCH message
It is not possible to use GMSK for the AMR signaling frames and 8-PSK for the traffic at the same time, because some of the signaling frames, such as for the ONSET signaling messages, share the same bursts as the speech.
As the same AMR signaling frames are needed for the new half rate channels using 8-PSK modulation (O-TCH/H), a new channel coding for these frames has to be introduced. A straightforward solution to this problem is now discussed with reference to FIG. 1. The numbers under the data flow arrows in the figure denote the number of bits included in a bit block used in the system. The reader is kindly referred to the document 3GPP TS 45.003 V5.1.0 (GSM/EDGE Radio Access Network; Channel Coding) and to the references therein about the different messages referenced below.
A crucial part of the system is the Channel Coder 100 in FIG. 1A. Usually a block to be transmitted includes Inband Data 101 consisting of two bits. These bits are coded in a coding block 102 using predefined code words, which must be 48 bits in length in order to correspond to the reserved block length. Occasionally, the bits to be transmitted further include Identification Marker Sequences 103 consisting of 9- or 11-bit sequence. Eleven bits are used for the RATSSCH_MARKER, for which a repetition of 58 times in the repetition block 104 is required to get the correct total block length of 636 bits. For the other AMR signaling frames a repetition of 71 times is required in the repetition block 104. For the AMR signaling frames SID_UPDATE, which convey Comfort Noise parameters during a Discontinuous Transmission (DTX) period, and for the RATSCCH_DATA AMR signaling frame the Comfort Noise parameters 105 also need to be coded. A Cyclic Redundancy Check (CRC) is performed in the check block 106 to protect the Comfort Noise against transmission errors. This checksum (14 bits) is added to the Comfort Noise parameters (49 bits total), and the result is fed through a convolutional encoder block 107, which increases the block length to 636 bits.
All signals coming from the Channel Coder 100 are multiplexed in a multiplexing block 108. The total number of bits to be sent in a block is either 684 bits or 1368, depending on the AMR signaling frame. The AMR signaling frames are mapped in the mapping block 109 to 8-PSK symbols, which modifies the block size to 228 or 456 symbols. The symbols resulting from the signaling frames are then interleaved in the interleaving block 110 together with blocks from other frames, which may be speech frames, for example. After the interleaving a burst will be formatted in the burst formation block 111. Then the burst is modulated in a modulation block 112 and directed to the transmission block 113.
In FIG. 1B, after receiving a signal in a receiving block 129, the signal must be demodulated in the demodulation block 130. The content of the original burst has to be recovered in the recovery block 131. Because the burst consists of interleaved symbols, they must first be fed through the deinterleaving block 132 and then converted back to bits in the converting block 133. Before the messages can be passed to the Channel Decoder 120, the signaling must be de-multiplexed in the de-multiplexing block 134 so that the Inband Data part 136 is decoded in the codeword decoder block 135, and the Identification Marker Sequence 138 in the Identification Marker decoder block 137. If the AMR signaling frame includes Comfort Noise parameters, they are then decoded in the corresponding decoding block 139, and the CRC bits are verified in the verification block 140. Only after this are the Comfort Noise parameters 141 obtained.
The drawback of the solution described above is that both high rate convolutional codes and high rate block codes are required. The convolutional coder 107 encodes the 49 bits sequence into 636 bits, and the block coder 102 encodes the 2 bits into 48 bits. In the reverse direction, the convolutional decoder 139 decodes the 636 bits into the 49 bits, and the code word decoder 135 decodes the 48 bits into the 2 bits. These so-called fast-rate conversions are not desirable, as they increase the development cost and demand larger coding tables in the network elements and terminals. They are also computationally heavy and consume a lot of memory.
The rate of the convolutional encoder 107 for the Comfort Noise is 1/12, which is more demanding than the ¼ for the GMSK. The constraint length can also be increased from k=5 to k=7, as is done for speech, and the existing polynomials G4-G7 can be used. The interested reader may find descriptions of the polynomials and the constraint lengths in the document 3GPP TS 45.003 V5.1.0 (GERAN Channel Coding). As explained above, the shorter 9 bit sequence of the identification marker has to be repeated 71 times.
The purpose of the present invention is to address the problem discussed above. This can be achieved using a method and system for processing AMR signaling frames as described in the independent claims.
SUMMARY OF THE INVENTION
In order to be able to utilize the existing channel coding developed for channels with different modulations and to avoid high rate convolutional and block codes, the channel coding has to be performed in a novel way for channels that use a modulation scheme carrying several bits in one symbol. The present invention provides such a novel mechanism, particularly for traffic channels utilizing the 8-PSK modulation method referred to above. Using a modulation scheme carrying several bits in one symbol, n bits can be represented with one symbol if there are 2n possible modulation states.
The idea of the invention is that by using bit repetition the current channel encoders and interleavers defined for the use of corresponding GMSK channels can be utilized when transmitting AMR signaling frames on the GERAN half rate channels utilizing 8-PSK.
Thus, a coding procedure identical to the one already standardized for the GMSK channels can be used for the AMR signaling frames. In the method of the invention, in each block of m bits coded by means of said standardized coding process, each bit c(i) is first repeated 3 times {c′(3(i−1)+1), c′(3(i−1)+2), c′(3(i−1)+3)}. These 3 bits are then converted into one symbol C(i). After converting all m signaling bits, the resulting symbols C(1), . . . , C(m) are interleaved. After interleaving, the symbols are modulated and then transmitted.
In the receiver, the signal has to be demodulated. The received symbols {C(1), C(2), C(3)} are then de-interleaved, after which the symbol C(i) is converted into 3 bits {c′(3(i−1)+1), c′(3(i−1)+2)), c′(3(i−1)+3)}. The 3-multiple bit sequence has to be converted back to the original bit c(i). The soft value of c(i) can be computed by combining the soft values of the 3-multiple bit sequence received.
BRIEF DESCRIPTION OF THE DRAWINGS
FIGS. 1A and 1B show a straightforward solution fortransfering AMR signaling frames on a GERAN half rate channel,
FIGS. 2A and 2B illustrate the method of the invention, and
FIGS. 3A and 3B illustrate the system of the invention.
DETAILED DESCRIPTION OF THE INVENTION
FIG. 2A illustrates the transmission side of the system of the invention. Each bit c(i) transmitted from the existing channel encoder block 21, which is defined for the corresponding GMSK channel, is repeated in a repetition block 22 n times to correspond to the number of bits carried by one symbol. The value of n depends on the keying algorithm used; for the 8-PSK n=3. The n bits {c′((i−1)n+1), . . . , c′((i−1)n+n)} generated on the basis of c(i) are then converted to a symbol C(i) in a conversion block 23. The symbols are then interleaved using an interleaver 24, which is also already defined for the corresponding GMSK channel. It is important not to map one bit directly onto one symbol but to repeat them first, as, depending on the modulation, every time a bit is marked on a symbol there may be a rotation on the constellation. For example, the 8-PSK symbols are continuously rotated with 3π/8 radians per symbol before pulse shaping.
The receiving side of the system, as seen from FIG. 2B, is the reverse of the sending side. The received symbols C(i) have to be deinterleaved using a known de-interleaver 25 defined for the corresponding GMSK channel. After this, the n bit sequence {c′((i−1)n+1), . . . , c′((i−1)n+n)} is obtained using the normal symbol to bit conversion in the conversion block 26. The n bit sequence is combined in a combination block 27 to form a bit value corresponding to the original bit value c(i). Preferably, this is done by combining the soft values of the received n-multiple bit sequence. In this way the bit sequence is reduced to one bit, which is ready to be fed into the channel decoder 28. The channel decoder 28 is substantially the same as the one defined for the corresponding GMSK channel.
In the following, the application of the invention on the AMR signaling frames of an 8-PSK modulated HR AMR Speech Traffic Channel. (O-TCH/AHS) is described. On the transmission side (FIG. 3A), the Inband Data 301 to be transmitted is encoded in the coder block 302 of the channel coder part 300. The Identification Marker sequence 303 is repeated in the repeating block 304. Also for the Comfort Noise 305, if included in the signaling frame, a CRC is calculated in the calculation block 306 and then the resulting bit sequence is convolutionally encoded in the corresponding coding block 307. Blocks 304, 306, and 307 are identical to the respective blocks already standardized for the corresponding GMSK channel (see 3GPP TS 45.003 GERAN Channel Coding).
Thanks to the solution according to the invention, the code words block 302 can be selected to correspond to the already existing TCH/AHS 16 bit code words, for example. Consequently, the tables in the Channel Coder 300 need not include longer high-rate codes, thus saving memory. Another benefit of the invention is that if already existing code words are selected, there are only minor changes required in the network elements and in the terminal equipment. The 9-bit sequence of the Identification Marker 303 need not be repeated 71 times but 24 times, and for the AMR signaling frame RATSCCH the 11-bit sequence of the Identification Marker 303 needs to be repeated only 20 times. After the repetition in the repetition block 304, the Identification Marker block consists of 212 bits. The Comfort Noise parameters 305 can be convolutionally encoded in the coder block 307 with a shorter code, which results in 212 bits. This is computationally cheaper, and, also saves memory. As the convolutional encoder block 307 and the encoder block 302 are identical to the ones already standardized for the corresponding GMSK channels, the rate of the convolutional encoder will be ¼. The constraint length value k=5 and, similarly, the already existing polynomials G1, G2, and G3 can be used.
The multiplexing block 308 functions similarly to the solution described above. In the repetition part 309, when the invention is applied to O-TCH/H, the available bandwidth for the AMR signaling frames is threefold (stretched from 228 bits to 684 bits, or from 456 bits to 1368 bits). Each bit is therefore repeated three times: a bit c(i) will be mapped to a bit triplet {c′(3(i−1)+1), c′(3(i−1)+2), c′(3(i−1)+3)}. The repeating ensures a correct block length for the AMR signaling frames. When all bits have been repeated, the bit triplets are mapped in a mapping block 310 to 8-PSK symbols C(i) according to Table 1 in 3GPP TS 45.004 (GERAN Modulation).
The symbols are then interleaved in the interleaving block 311 together with other symbols, and then a burst is formatted in the formation block 312. The bursts are transmitted by the transmission block 314 after modulation in the modulation block 313.
In the receiving part (FIG. 3B) the received signal 320 is first demodulated in a demodulating block 321. The content of the original burst is recovered in the recovery block 322 and de-interleaved in the de-interleaving block 323. At this stage the signals are symbols C(i), which need to be converted back to bit triplets {c′(3(i−1)+1), c′(3(i−1)+2), c′(3(i−1)+3)}. The conversion is performed using the ordinary 8-PSK conversion table. The triplet has to be combined in the combining block 325 to correspond to one bit. The probable soft value of c(i) can be decided, for example, by combining the soft values of the received bit triplet, for instance c(i)=0.4*c′(3(i−1)+1)+0.4*c′(3(i−1)+2)+0.2*c′(3(i−1)+3).
The combined soft values c(i) of the bits are then de-multiplexed in the de-multiplexing block 326, before the channel decoder 340 processes them. The Inband Data 328 is then decoded in the decoding block 327 using the code word table, whereas the Identification Marker sequence 330 is decoded in the Identification Marker decoding part 212. If present, the Comfort Noise 333 is obtained after convolutionally decoding the bit sequence coming from the demultiplexer 326 in the decoding block 331 and CRC checking them in the checking block 332. Again, the decoder 340 and de-interleaver block 323 are the same as those used for the TCH/AHS traffic channels.
Although the invention was described above with reference to the examples shown in the appended drawings, it is obvious that the invention is not limited to these, but may be modified by those skilled in the art without departing from the scope and spirit of the invention. For example, another suitable modulation scheme, such as 16-PSK, can be selected to implement the invention.

Claims (5)

1. A system for processing an AMR signaling frame to be transmitted on a GERAN half rate channel utilizing a modulation scheme carrying n bits (n>/=2) in one symbol, the system comprising:
coder part (300), compatible with coder defined for a GSM half rate channel utilizing a GMSK modulation scheme, said coder part being adapted to output a coded bit stream,
repeater (309), responsive to the coder part, for repeating each bit of the coded bit stream n times, whereby a repeated bit stream is obtained, and
symbol former (310), responsive to said repeater, for forming symbols to be transmitted from said repeated bit stream.
2. A system for processing an AMR signaling frame received on a GERAN half rate channel utilizing a modulation scheme carrying n bits (n>/=2) in one symbol, the system comprising:
converter (324), for converting a received symbol stream to a first bit stream,
processor (325), for segmenting the first bit stream into successive blocks, each block consisting of n bits, and for converting each block into one bit, whereby a second bit stream is obtained, and
decoder part (340), compatible with decoder defined for a GSM half rate channel utilizing a GMSK modulation scheme, said decoder part being adapted to decode said second bit stream.
3. A method for processing an AMR signaling frame to be transmitted on a GERAN half rate channel utilizing a modulation scheme carrying n bits (n>/=2) in one symbol, the method comprising the steps of:
coding the AMR signaling frame using a coding procedure defined for a GSM half rate channel utilizing a GMSK modulation scheme, the coding procedure outputting a coded output stream,
in response to said coding, repeating each bit of the coded output stream n times, whereby a repeated bit stream is obtained, and
forming symbols to be transmitted from the repeated bit stream.
4. A method for processing an AMR signaling frame received on a GERAN half rate channel utilizing a modulation scheme carrying n bits (n>/=2) in one symbol, the method comprising the steps of:
converting a received symbol stream into a first bit stream,
segmenting said first bit stream into successive blocks, each block consisting of n bits,
converting each block into one bit, whereby a second bit stream is obtained, and
decoding said second bit stream using a coding procedure defined for a GSM half rate channel utilizing a GMSK modulation scheme.
5. A system for transferring an AMR signaling frame on a GERAN half rate channel utilizing a modulation scheme carrying n bits (n>/=2) in one symbol, the system comprising
at a transmitting end:
coder part (300), compatible with coder defined for a GSM half rate channel utilizing a GMSK modulation scheme, said coder part being adapted to output a coded bit stream,
repeater (309), responsive to the coder part, for repeating each bit of the coded bit stream n times, whereby a repeated bit stream is obtained, and
symbol former (310), responsive to said repeater, for forming symbols to be transmitted from said repeated bit stream, and
at a receiving end:
converter (324), for converting a received symbol stream to a first bit stream,
processor (325), for segmenting the first bit stream into successive blocks, each block consisting of n bits, and for converting each block into one bit, whereby a second bit stream is obtained, and
decoder part (340), compatible with decoder defined for a GSM half rate channel utilizing the GMSK modulation scheme, said decoder part being adapted to decode said second bit stream.
US10/485,031 2001-08-27 2001-08-27 Method and a system for transferring AMR signaling frames on halfrate channels Expired - Fee Related US7415045B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/175,554 US7817679B2 (en) 2001-08-27 2008-07-18 Method and a system for transferring AMR signaling frames on halfrate channels

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/FI2001/000749 WO2003019847A1 (en) 2001-08-27 2001-08-27 A method and a system for transfering amr signaling frames on halfrate channels

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/175,554 Continuation US7817679B2 (en) 2001-08-27 2008-07-18 Method and a system for transferring AMR signaling frames on halfrate channels

Publications (2)

Publication Number Publication Date
US20040240566A1 US20040240566A1 (en) 2004-12-02
US7415045B2 true US7415045B2 (en) 2008-08-19

Family

ID=8555920

Family Applications (2)

Application Number Title Priority Date Filing Date
US10/485,031 Expired - Fee Related US7415045B2 (en) 2001-08-27 2001-08-27 Method and a system for transferring AMR signaling frames on halfrate channels
US12/175,554 Expired - Fee Related US7817679B2 (en) 2001-08-27 2008-07-18 Method and a system for transferring AMR signaling frames on halfrate channels

Family Applications After (1)

Application Number Title Priority Date Filing Date
US12/175,554 Expired - Fee Related US7817679B2 (en) 2001-08-27 2008-07-18 Method and a system for transferring AMR signaling frames on halfrate channels

Country Status (12)

Country Link
US (2) US7415045B2 (en)
EP (1) EP1421729B1 (en)
JP (1) JP3845083B2 (en)
KR (1) KR100603909B1 (en)
CN (1) CN1288870C (en)
AT (1) ATE332597T1 (en)
BR (1) BR0117111A (en)
CA (1) CA2452774C (en)
DE (1) DE60121373T2 (en)
ES (1) ES2267805T3 (en)
TW (1) TWI237972B (en)
WO (1) WO2003019847A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080273625A1 (en) * 2001-08-27 2008-11-06 Nokia Corporation method and a system for transferring amr signaling frames on halfrate channels

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6832195B2 (en) * 2002-07-03 2004-12-14 Sony Ericsson Mobile Communications Ab System and method for robustly detecting voice and DTX modes
BRPI0410373A (en) * 2003-05-16 2006-06-13 Thomson Licensing repetitive coding in a satellite-based communication system
ATE352138T1 (en) * 2004-05-28 2007-02-15 Cit Alcatel ADAPTATION METHOD FOR A MULTI-RATE VOICE CODEC
WO2006050657A1 (en) * 2004-11-11 2006-05-18 Wei Xiang Method and device for adaptive multi-rate coding and transporting speech
CN1312946C (en) * 2004-11-11 2007-04-25 向为 Self adaptive multiple rate encoding and transmission method for voice
KR100666874B1 (en) * 2005-02-11 2007-01-10 삼성전자주식회사 Apparatus and Method for modulating bit stream to GMSK waveform using Dual Port Memory
CN100461663C (en) * 2005-08-01 2009-02-11 华为技术有限公司 Code/decode type confirming method
US8543388B2 (en) * 2005-11-30 2013-09-24 Telefonaktiebolaget Lm Ericsson (Publ) Efficient speech stream conversion
KR101253176B1 (en) * 2006-11-02 2013-04-10 엘지전자 주식회사 Digital broadcasting system and data processing method
CN101170755B (en) * 2007-11-20 2011-12-07 中兴通讯股份有限公司 A method for transmitting half-rate voice data
CN101677473B (en) * 2008-09-18 2012-07-18 中兴通讯股份有限公司 Processing method and device of half rate speech
CN102255686B (en) * 2010-05-20 2014-10-22 中兴通讯股份有限公司 Adaptive multi-rate codec (AMR) initial rate regulation method, device and system
US8416734B2 (en) 2010-08-02 2013-04-09 Research In Motion Limited System and method for joint voice and data transmission
US9026434B2 (en) * 2011-04-11 2015-05-05 Samsung Electronic Co., Ltd. Frame erasure concealment for a multi rate speech and audio codec

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6215762B1 (en) * 1997-07-22 2001-04-10 Ericsson Inc. Communication system and method with orthogonal block encoding
US20020133781A1 (en) * 2001-01-08 2002-09-19 Nokia Corporation Method and system for allocating convolutional encoded bits into symbols before modulation for wireless communication
US20020164980A1 (en) * 2001-05-01 2002-11-07 Stefan Eriksson PLMN radio interface with upper layer supervision of layer one transport channels
US6707806B1 (en) * 1997-11-18 2004-03-16 Oki Electric Industry Co., Ltd. Wireless transmitter with power control based on data type

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3426568C2 (en) * 1984-07-19 1995-05-11 Deutsche Aerospace Method for the transmission of data in a digital radiotelegraphy system
US6216107B1 (en) * 1998-10-16 2001-04-10 Ericsson Inc. High-performance half-rate encoding apparatus and method for a TDM system
WO2003019847A1 (en) * 2001-08-27 2003-03-06 Nokia Corporation A method and a system for transfering amr signaling frames on halfrate channels

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6215762B1 (en) * 1997-07-22 2001-04-10 Ericsson Inc. Communication system and method with orthogonal block encoding
US6707806B1 (en) * 1997-11-18 2004-03-16 Oki Electric Industry Co., Ltd. Wireless transmitter with power control based on data type
US20020133781A1 (en) * 2001-01-08 2002-09-19 Nokia Corporation Method and system for allocating convolutional encoded bits into symbols before modulation for wireless communication
US20020164980A1 (en) * 2001-05-01 2002-11-07 Stefan Eriksson PLMN radio interface with upper layer supervision of layer one transport channels

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080273625A1 (en) * 2001-08-27 2008-11-06 Nokia Corporation method and a system for transferring amr signaling frames on halfrate channels
US7817679B2 (en) * 2001-08-27 2010-10-19 Nokia Corporation Method and a system for transferring AMR signaling frames on halfrate channels

Also Published As

Publication number Publication date
US20080273625A1 (en) 2008-11-06
KR100603909B1 (en) 2006-07-24
EP1421729B1 (en) 2006-07-05
TWI237972B (en) 2005-08-11
KR20040019104A (en) 2004-03-04
ES2267805T3 (en) 2007-03-16
US20040240566A1 (en) 2004-12-02
JP3845083B2 (en) 2006-11-15
BR0117111A (en) 2004-08-17
CA2452774C (en) 2012-01-10
EP1421729A1 (en) 2004-05-26
DE60121373D1 (en) 2006-08-17
CN1545778A (en) 2004-11-10
CA2452774A1 (en) 2003-03-06
CN1288870C (en) 2006-12-06
DE60121373T2 (en) 2007-07-26
ATE332597T1 (en) 2006-07-15
US7817679B2 (en) 2010-10-19
WO2003019847A1 (en) 2003-03-06
JP2005501475A (en) 2005-01-13

Similar Documents

Publication Publication Date Title
US7817679B2 (en) Method and a system for transferring AMR signaling frames on halfrate channels
US6608828B1 (en) Methods and systems for decoding headers that are repeatedly transmitted and received along with data on a radio channel
US8730999B2 (en) Method and system for reduction of decoding complexity in a communication system
FI109251B (en) Communication method, radio system, radio transmitter and radio receiver
US7188300B2 (en) Flexible layer one for radio interface to PLMN
US6490260B1 (en) Transmitter with increased traffic throughput in digital mobile telecommunication system and method for operating the same
AU757352B2 (en) A method, communication system, mobile station and network element for transmitting background noise information in data transmission in data frames
US7712005B2 (en) Encoding and error correction system for enhanced performance of legacy communications networks
HU217142B (en) Process for transmitting data first of all gsm data
JP4276261B2 (en) Bit-swapping method, bit-swapping apparatus and computer program
US20030093747A1 (en) Method for transporting real-time data frames comprising at least two bit portions having different relevance, corresponding transmitter and receiver
CA2762915C (en) A method and a system for transfering amr signaling frames on halfrate channels
ZA200401569B (en) A method and a system for transfering AMR signaling frames on halfrate channels.
JPH07131400A (en) Transmission method for digital mobile communication
MXPA01002701A (en) Method and system for alternating transmission of codec mode information

Legal Events

Date Code Title Description
AS Assignment

Owner name: NOKIA CORPORATION, FINLAND

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SEBIRE, BENOIST;BELLIER, THIERRY;REEL/FRAME:015574/0294

Effective date: 20040413

STCF Information on status: patent grant

Free format text: PATENTED CASE

AS Assignment

Owner name: MICROSOFT CORPORATION, WASHINGTON

Free format text: SHORT FORM PATENT SECURITY AGREEMENT;ASSIGNOR:CORE WIRELESS LICENSING S.A.R.L.;REEL/FRAME:026894/0665

Effective date: 20110901

Owner name: NOKIA CORPORATION, FINLAND

Free format text: SHORT FORM PATENT SECURITY AGREEMENT;ASSIGNOR:CORE WIRELESS LICENSING S.A.R.L.;REEL/FRAME:026894/0665

Effective date: 20110901

AS Assignment

Owner name: NOKIA 2011 PATENT TRUST, DELAWARE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NOKIA CORPORATION;REEL/FRAME:027120/0608

Effective date: 20110531

Owner name: 2011 INTELLECTUAL PROPERTY ASSET TRUST, DELAWARE

Free format text: CHANGE OF NAME;ASSIGNOR:NOKIA 2011 PATENT TRUST;REEL/FRAME:027121/0353

Effective date: 20110901

AS Assignment

Owner name: CORE WIRELESS LICENSING S.A.R.L., LUXEMBOURG

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:2011 INTELLECTUAL PROPERTY ASSET TRUST;REEL/FRAME:027205/0001

Effective date: 20110831

FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CORE WIRELESS LICENSING, S.A.R.L.,;REEL/FRAME:035871/0519

Effective date: 20150427

FPAY Fee payment

Year of fee payment: 8

AS Assignment

Owner name: MICROSOFT CORPORATION, WASHINGTON

Free format text: UCC FINANCING STATEMENT AMENDMENT - DELETION OF SECURED PARTY;ASSIGNOR:NOKIA CORPORATION;REEL/FRAME:039872/0112

Effective date: 20150327

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20200819