Methods, systems, and computer program products for silence insertion descriptor (SID) conversion

Information

  • Patent Grant
  • 8346239
  • Patent Number
    8,346,239
  • Date Filed
    Friday, December 28, 2007
    16 years ago
  • Date Issued
    Tuesday, January 1, 2013
    11 years ago
Abstract
Methods, systems, and computer program products for silence insertion descriptor (SID) conversion are disclosed. According to one aspect, the subject matter described herein includes a method for silence insertion descriptor (SID) conversion. The method includes receiving a wireless frame, the frame identifying a first node as a frame source and a second node as a frame destination; determining whether tandem-free operation (TFO) is applicable; responsive to a determination that TFO is applicable, determining whether the frame is a SID frame; responsive to a determination that the frame is a SID frame, determining whether the SID format used by the first node is incompatible with the SID format used by the second node; and responsive to a determination that the SID format used by the first node is incompatible with the SID format used by the second node, converting the SID frame from the SID format used by the first node to the SID format used by the second node.
Description
TECHNICAL FIELD

The subject matter described herein relates to methods and systems for enhancing the quality of voice calls across mixed-generation wireless networks by obviating, in some circumstances, the need for transcoding and thus avoiding the attendant reduction of voice quality. More particularly, the subject matter described herein relates to methods, systems, and computer program products for silence insertion descriptor (SID) conversion.


BACKGROUND

As wireless communications networks become more pervasive and the number of subscribers continues to increase, wireless bandwidth becomes increasingly scarce. To mitigate this problem, advanced voice compression techniques are used to reduce the bandwidth needed by each voice call. For example, a standard 8-bits per data, 8000 samples per second voice coding, such as 64 kbits/s, may be reduced to 8 kbits/s or less via coder/decoders (codecs) such as the GSM (Global System for Mobile communication) AMR (Adaptive MultiRate) and EFR (Enhanced Full Rate) codecs and the CDMA (Code Division Multiple Access) EVRC (Enhanced Variable Rate Codec). Codecs typically operate on a collection of samples, which are compressed and sent as a frame of data. Some codecs, for example, divide a voice call into 20 ms time slices, sending a frame of data every 20 ms.


Some voice codecs define not only a speech compression algorithm but also a silence compression algorithm. It has been estimated that fifty percent or more of a typical telephone conversation is silence—i.e., the part of the conversation during which neither party is speaking. During these periods of silence, transmitting the background noise detected by the cell phone's microphone would be an unnecessary use of network bandwidth, since the silence (e.g., the background noise) has no information content. However, sending no information during periods of silence has the undesirable side-effect of causing the receiving party to wonder, due to the lack of any sound coming from the sender's phone, whether the sender has hung up or terminated the call.


Therefore, many codecs detect the background noise present at the near-end device and characterize it, such as determining its pitch and volume, and transmit the characterization parameters to the far-end device. At the far-end device, the noise parameters are used to generate a slight background noise, such as soft white noise, recreate the background noise at the near-end device and thus convey the continued presence of the other party on the line. GSM_EFR codecs send what is called a silence insertion descriptor (SID) to the far-end codec. The far-end codec generates natural background noise for the call based on parameters within the received SID frame. Example parameters within the SID frame include line spectral frequency (LSF) and energy gain. With these two pieces of information, roughly equivalent to the pitch and volume of the background noise, respectively, the receiving end is able to recreate the background sound. These SID frames are sent relatively infrequently compared to speech frames. In some codecs, the SID frames are sent at call initiation and again only when the character of the near-end background noise changes significantly.


While the clear advantage to using voice compression is that it uses less bandwidth per call, the disadvantage of using voice compression is that it introduces signal distortion. Whenever a signal is transcoded, or converted from one format to another, there is a potential for introduction of signal distortion. Transcoding refers not only to compression but also to compression/expansion (“companding”) operations, such as A-law and mu-law encoding/decoding. As shown below, in a typical mobile-to-mobile call there may be many transcoding steps, each of which having the potential to degrade the voice quality of the call.



FIG. 1 is a block diagram illustrating a conventional mobile-to-mobile call. Caller's cell phone 100 is connected via a radio frequency (RF) interface to the nearest cell phone tower and associated base station subsystem (BSS1102). Caller's cell phone 100 typically uses a voice encoder to compress caller's voice from 64˜128 kbit/s to 12.2 kbit/s, for example, before transmitting the compressed speech data to the BSS1102. BSS1102 provides the interface between the RF network and the wireline network. BSS1102 may send the speech data to a transcoded rate adaptive unit (TRAU1104), which may decode the compressed speech data into uncompressed 8˜16 bit per sample, 8000 sample per second audio data. TRAU1104 may transmit the uncompressed data across the network, as shown in FIG. 1, but typically it will re-encode the uncompressed voice data using a compression/expansion algorithm, such as A-law or mu-law, to boost the signal-to-noise ratio of the signal being transmitted, creating a 64 kbits/s PCM G.711 data stream. In other words, TRAU1104 may transcode the voice data from one encoding format to another, such as from 3G_GSM_AMR to G.711. TRAU1104 may forward the speech data across the phone network to TRAU2106. TRAU2106 may transcode the speech data into the compressed format used by the destination network. For example, TRAU2106 may convert the speech data from G.711 to 2G_GSM_EFR. TRAU2106 may send the transcoded speech data to the destination network's base station subsystem, BSS2108. BSS2108 may transmit the re-encoded speech data to Callee's cell phone 110.


In summary, the voice data may be encoded (and decoded) several times along the path between caller's cell phone 100 and callee's cell phone 110: encoding using the source codec by caller's cell phone 100, encoding using the intermediate codec by TRAU1104, and encoding using the destination codec by TRAU2106. Since both TRAU1104 and TRAU2106 must agree on an intermediate format, which may be 64 kbit/s mu-law PCM data, for example, TRAU1104 and TRAU2106 are said to be operating in tandem, and are commonly referred to as being a tandem pair.


As used herein, the term “internal format” refers to the intermediate format which the tandem pair uses to communicate data with each other, and the term “external format” refers to the format that each member of the tandem pair uses to communicate data with its respective network. The respective external formats may incompatible, as can be seen in FIG. 1, in which the external format for TRAU1104 achieves a compression of 12.2 kbits per second, while the external format TRAU2106 achieves a compression of 16 kbits per second.


Each encoding step—by caller's cell phone 100, BSS1102, and BSS2108—may introduce additional signal distortion, which degrades the overall quality of the voice call. One way to avoid the degradation of voice signal quality in a mobile-to-mobile scenario is to reduce the number of transcoding steps performed. For example, if the external format used by the caller's base station is the same or compatible with the external format used by the callee's base station, there may be no need to transcode to an intermediate format. In other words, there may be no need for a tandem pair to perform transcoding. Operation in such a mode is commonly referred to as “tandem-free operation”, or TFO. FIG. 2 illustrates an example of a network operating in TFO mode. In conventional systems, two codecs are the same or compatible if they use the same speech and silence compression algorithms and the same bit rates.



FIG. 2 is a block diagram illustrating a conventional mobile-to-mobile call using tandem-free operation. As stated above, TFO mode is possible only if the two mobile networks use the same or compatible external format. Thus, in FIG. 2 the codec used by BSS1102 to communicate with caller's cell phone 100 is the same as, or compatible with, the codec used by BSS2108 to communicate with callee's cell phone 110. For example, BSS1102 and BSS2108 may use codecs that use the same speech and silence compression algorithms and same bit rate. In this case, it is unnecessary for TRAU1104 to transode the speech data into an internal format, such as G.711, before sending the speech data across the network to TRAU2106, and vice versa. Instead, TRAU1104 and TRAU2106 may send the speech data to without transcoding, avoiding two transcoding steps. Furthermore, BSS2108 may transmit the encoded speech data over its RF interface directly to the callee's mobile phone, thus avoiding two additional transcoding steps: the transcoding of data as it passes from the radio interface to the wired network interface in each of the respective wireless networks. In summary, by not transcoding voice data to and from an intermediate format (i.e., G.711), degradation of voice quality due to introduced signal distortion is avoided. The TFO principle may apply anywhere along the network path in which transcoding to an internal codec may be eliminated by agreement between nodes that use the same external codec.


For TFO to work, however, additional requirements must be met. One requirement is that the nodes or network entities be able to support TFO, which means that the nodes need be able to communicate with each other regarding the TFO stream. For example, the nodes may need to negotiate a TFO link, monitor link status, or provide fallback procedures in case of TFO interruption. Typically, in-band signaling is used for communication of TFO messages, since the compressed voice data stream uses a fraction of the bandwidth and thus makes bits available for a control channel. A common practice is to map the control channel onto the least significant bit or bits of the 8-bit, 64 kbit/s channel. This causes only a slight degradation of quality of uncompressed voice data, and causes no degradation of quality of the compressed voice data. Thus, the bearer channel must support in-band signaling. Another requirement is that external codecs should be the same or likewise compatible; otherwise, any benefit to skipping the intermediate transcoding step may be reduced by the need to convert from one external codec to another external codec.


An additional challenge is raised when attempting to implement TFO for a mobile-to-mobile voice call that crosses a boundary between 2G wireless networks and 3G wireless networks: there may be a difference between the 2G version of a codec and its 3G equivalent. FIG. 3 illustrates such an example.



FIG. 3 is a block diagram illustrating a conventional mobile-to-mobile call that crosses the boundary between 2G and 3G wireless networks. Although BSS1102 and BSS2108 both use the GSM_EFR (enhanced full rate) codec, BSS1102 is a 3G network, and therefore uses the 3G version of the GSM_EFR codec, while BSS2108 is a 2G mobile network, and therefore uses the 2G version of the GSM_EFR codec. Although the 2G and 3G versions of the GSM_EFR codec have the same 12.2 kbits/s rate for voice compression, their silence insertion description frames are incompatible. To address this incompatibility, conventional networks perform at least one transcoding operation, from 3G_GSM_EFR to 2G_GSM_EFR and vice versa. In practice, conventional systems, such as the one shown in FIG. 3, will perform not one but two transcoding operations, into and out of the preferred or native format used by the network backbone. In FIG. 3, for example, TRAU1104 and TRAU2106 may operate in tandem to transcode into and out of a common internal codec format such as the 12.2 kbit/s AMR format. Thus, although the 2G_GSM_EFR and 3G_GSM_EFR codecs are essentially identical, the incompatible silence insertion description frames prevent efficient mobile to mobile communication, which introduces distortion into the call.



FIG. 4 illustrates the general frame format for a conventional 3G EFR frame. The radio frequency channel index (RFCI) field indicates the type of frame. An RFCI value of “3” indicates that the frame is a SID frame. For a SID frame, the LSF and energy gain data will be contained in the frame payload part, which starts at octet 3.



FIG. 5 illustrates the general frame format for a conventional 2G EFR frame. A 2G EFR frame includes a payload field and four subframes. The LSF data is located in the payload field, in bits 1-38. The energy gain data is located in sub-frame 1, in bits 87-91. For a 2G EFR SID frame, sub-frames 2 through 4 do not contain any SID-specific information.


Unlike the 3G version of an EFR frame, the 2G EFR frame does not include a frame type field. Rather, a SID frame type is indicated by a particular bit pattern of sub-frame 1. The particular bit pattern is also called a frame signature. The frame signature must be analyzed in order to determine whether an incoming 2G EFR frame is a SID frame.


As can be seen from FIG. 5 and FIG. 4, the 2G GMS SID frame is 244 bits long, while the 3G UMTS SID frame is 43 bits long. This incompatibility is significant enough to prevent tandem-free operation between two otherwise compatible codecs. Referring back to FIG. 3, the incompatibility of the SID frames may force TRAU1104 and TRAU2106 to operate in tandem mode and use an intermediate format, such as a 12.2 kbit/s AMR. Thus, in a mobile-to-mobile voice call between a 2G network and a 3G network, tandem-free operation may not be possible, and the benefits of TFO, such as increased voice quality, may be unavailable.


Thus, there is a need for a way to enable TFO operation between 2G and 3G networks that use codecs with similar speech compression algorithms and bit rates but which have dissimilar SID frame formats. In particular, there is a need for methods, systems, and computer program products for silence insertion descriptor (SID) conversion.


SUMMARY

According to one aspect, the subject matter described herein includes a method for silence insertion descriptor (SID) conversion. The method includes receiving a wireless frame, the frame identifying a first node as a frame source and a second node as a frame destination; determining whether tandem-free operation (TFO) is applicable; responsive to a determination that TFO is applicable, determining whether the frame is a SID frame; responsive to a determination that the frame is a SID frame, determining whether the SID format used by the first node is incompatible with the SID format used by the second node; and responsive to a determination that the SID format used by the first node is incompatible with the SID format used by the second node, converting the SID frame from the SID format used by the first node to the SID format used by the second node.


As used herein, the term “wireless frame” refers to data that originates from a device in a wireless mobile network, is organized into a frame, and contains voice or other media traffic. Voice traffic data may include both active speech (i.e., when at least one party is talking) and silence (i.e., when no party is talking), and may be compressed or uncompressed.


According to another aspect, the subject matter described herein includes a method for silence insertion descriptor (SID) conversion. The method includes receiving a wireless frame, the frame identifying a first node as a frame source and a second node as a frame destination; identifying a first codec used by the first node and a second codec used by the second node, and determining whether one of the first and second codecs comprise a second generation global system for mobile enhanced full rate (2G_GSM_EFR) codec and the other of the first and second codes comprises a third generation global system for mobile enhanced full rate (3G_GSM_EFR) codec; responsive to a determination that the codecs comprise a 2G_GSM_EFR codec and a 3G_GSM_EFR codec, determining whether the frame is a SID frame; responsive to a determination that the frame is a SID frame, determining whether the SID format used by the first node is incompatible with the SID format used by the second node; responsive to a determination that the SID format used by the first node is incompatible with the SID format used by the second node, converting the frame from the SID format used by the first node to the SID format used by the second node and sending the converted SID frame to the second node.


According to yet another aspect, the subject matter described herein includes a system for silence insertion descriptor (SID) conversion. The system includes a control module for receiving a wireless frame, the frame identifying a first node as a frame source and a second node as a frame destination, and for determining whether tandem-free operation (TFO) is applicable. The system also includes a SID conversion module, operatively associated with the control module, for determining whether the frame is a SID frame, and, responsive to a determination that the frame is a SID frame, determining whether a SID format used by the first node is incompatible with a SID format used by the second node, and, responsive to a determination that the SID format used by the first node is incompatible with the SID format used by the second node, converting the frame from the SID format used by the first node to the SID format used by the second node and sending the converted frame to the second node.


The subject matter described herein for silence insertion description conversion may be implemented in software in combination with hardware and/or firmware. As such, the term “module” as used herein refers to software in combination with hardware and/or firmware for implementing the feature being described. In one exemplary implementation, the subject matter described herein may be implemented using a computer program product comprising computer executable instructions embodied in a non-transitory computer readable medium.


Exemplary computer readable media suitable for implementing the subject matter described herein include non-transitory devices, such as disk memory devices, chip memory devices, programmable logic devices, and application specific integrated circuits. In addition, a computer program product that implements the subject matter described herein may be located on a single device or computing platform or may be distributed across multiple devices or computing platforms.





BRIEF DESCRIPTION OF THE DRAWINGS

Preferred embodiments of the subject matter described herein will now be explained with reference to the accompanying drawings of which:



FIG. 1 is a block diagram illustrating a conventional mobile-to-mobile call;



FIG. 2 is a block diagram illustrating a conventional mobile-to-mobile call using tandem-free operation;



FIG. 3 is a block diagram illustrating a conventional mobile-to-mobile call that crosses the boundary between 2G and 3G wireless networks;



FIG. 4 illustrates the general frame format for a conventional 3G EFR frame;



FIG. 5 illustrates the general frame format for a conventional 2G EFR frame;



FIG. 6 is a block diagram illustrating an exemplary system for silence insertion descriptor (SID) conversion in accordance with an embodiment of the subject matter described herein;



FIG. 7 is a flow chart illustrating an exemplary process for silence insertion descriptor conversion in accordance with an embodiment of the subject matter described herein;



FIG. 8 a flow chart illustrating an exemplary process for converting a SID frame according to an embodiment of the subject matter described herein; and



FIG. 9 is a message flow diagram illustrating the steps of an exemplary process for determining whether TFO is applicable according to an embodiment of the subject matter described herein.





DETAILED DESCRIPTION

In accordance with the subject matter disclosed herein, methods, systems, and computer program products for silence insertion descriptor (SID) conversion are provided. Where a mobile-to-mobile call spans mobile networks that use the same or compatible speech compression algorithms and bit rates but incompatible silence insertion descriptors, an intermediate transcoding step is avoided by efficiently detecting SID frames in the format used by the source network, extracting the SID information contained within the incoming SID frames, and using the extracted information to create outgoing SID frames of a format used by the destination network. Speech frames may simply be forwarded without transcoding. By avoiding transcoding into an intermediate format, distortion otherwise caused by those transcoding steps is eliminated, improving the sound quality of the call.



FIG. 6 is a block diagram illustrating an exemplary system for silence insertion descriptor (SID) conversion in accordance with an embodiment of the subject matter described herein. In one embodiment, system 600 may contain a control module 602 for receiving a wireless frame, the frame identifying a first node as a frame source and a second node as a frame destination, and a SID conversion module 604, operatively associated with control module 602, for determining whether tandem-free operation (TFO) is applicable, and, responsive to a determination that TFO is applicable, determining whether the frame is a SID frame, and, responsive to a determination that the frame is a SID frame, determining whether a SID format used by the first node is incompatible with a SID format used by the second node, and, responsive to a determination that the SID format used by the first node is incompatible with the SID format used by the second node, converting the frame from the SID format used by the first node to the SID format used by the second node and sending the converted frame to the second node.


In one embodiment, control module 602 and SID conversion module 604 may be components of a wireless media gateway WMG 606 for communicating messages between a packet-based mobile wireless network MWN1608 and a TDM-based mobile wireless network MWN2610 via a TDM trunk 612.


In one embodiment, MWN1608 may be a 3G UMTS terrestrial radio access network (UTRAN), including a UMTS base transceiver station (BTS), referred to as a NodeB 614, for providing a radio communications link between mobile user equipment 616 and the 3G core network 618. A radio network controller RNC 620 manages a group of NodeBs.


In one embodiment, MWN2610 may be a 2G GSM network, including a base transceiver station (BTS 622) for providing a radio communications link between mobile stations 624 and the 2G core network 626. A base station controller (BSC 628) manages a group of BTSs. MWN2610 may include a transcoding rate adapter unit TRAU 630 for transcoding from a codec format used by TDM trunk 612 into a codec format used by MWN2610. Furthermore, each wireless network may have one or more mobile switching centers (MSC 632) which handle the signaling messages for call setup.


In addition to converting messages from packet to TDM format, WMG 606 may also transcode messages. For example, MWN1608 may use a codec, such as a 3G GSM AMR or EFR codec, to compress bearer data transmitted within 3G core network 618, in which case WMG 606 may need to transcode the compressed data into an uncompressed format, such as PCM data, and optionally transcode again into a format such as G.711, which uses a companding algorithm, such as A-law or mu-law, to improve the signal to noise ratio of data transmitted across TDM trunk 612. Similarly, TRAU 630 may transcode the PCM G.711 data into uncompressed PCM data, and then recompress the data using a codec used by MWN2610, such as Abis or 2G GSM EFR.


Because SID conversion module 604 is capable of converting between incompatible SID formats, WMG 606 and TRAU 630 may enter into a tandem-free operation (TFO) mode; in this case, WMG 606 may convert wireless frames from packet format to TDM format without transcoding into an intermediate codec format used by TDM trunk 612, and TRAU 630 may similarly avoid the transcoding step and simply pass the wireless frames through to BTS 622 without modification.


In conventional systems, WMG 606 and TRAU 630 would not be able to enter TFO mode if the codec used by MWN1608 and MWN2610 are the 3G and 2G versions, respectively, of the GSM EFR codec. Here, however, TFO mode may be taken advantage of if the respective codecs have the same speech compression algorithm and bit rate, but the formats of their respective SID frames differ, as is the case with the GSM EFR codecs. The operation of system 600 will now be described.



FIG. 7 is a flow chart illustrating an exemplary process for silence insertion descriptor conversion in accordance with an embodiment of the subject matter described herein.


At block 700, a wireless frame is received, the frame identifying a first node as a frame source and a second node as a frame destination. For example, WMG 606 may receive a wireless frame that originates from caller 616 and is intended for callee 624.


At block 702, it is determined whether tandem-free operation (TFO) is applicable or not. For example, as part of the call setup, RNC 620 and its TFO peer, TRAU 630, may exchange information about the codecs supported by the respective networks MWN1608 and MWN2610, through signaling messages sent via MSCs 632. To determine whether TFO is applicable, control module 602 may determine whether the speech compression algorithms and bit rates of the respective codecs are the same. For example, at call setup, WMG 606 may analyze call setup signaling messages to identify codecs used by the incoming and outgoing call legs in order to determine whether the codecs are the same or compatible. If so, WMG 606 may store an indication that TFO is applicable, and control module 602 may read this indication to determine whether or not TFO is applicable. Alternatively, SID conversion module 604 may read this indication to determine whether or not TFO is applicable. This process is described in more detail in FIG. 9, below. If TFO is not applicable, the process moves to block 704, in which the frame may be transcoded into an intermediate format used by TDM trunk 612, and then to block 706, in which the frame, transcoded in this case, is sent to the frame destination. However, if TFO is applicable, the process moves to block 708.


At block 708, it is determined whether the wireless frame is a SID frame. For example, if the received frame is a 43-bit 3G_GSM_EFR frame, SID conversion module 604 may look for a value of “3” in the radio frequency channel index (RFCI) field of the frame, indicating a 3G SID frame. On the other hand, if the received frame is a 244-bit 2G_GSM_EFR frame, SID conversion module 604 may look for a specific pattern of 95 bits in the frame set to “1”, indicating that the frame is a 2G SID frame. If the wireless frame is not a SID frame, the process moves to block 706, in which the frame is sent, without transcoding, to the frame destination. However, if the frame is a SID frame, the process moves to block 710.


At block 710, it is then determined whether the format of a SID frame used by the first node is incompatible with the SID format used by the second node. For example, SID conversion module 604 may maintain information about the call from caller 616 to callee 624, including information about the codec formats negotiated between RNC 620 and BSC 628, and use that information to determine whether the SID formats are compatible or not. In one embodiment, the first and second nodes may be the respective air interfaces NodeB 614 and BTS 622. Alternatively, the first and second nodes may be the mobile devices themselves, UE 616 and MS 624. If the SID frame formats are compatible, the process moves to block 706, in which the SID frame is sent, without conversion, to the frame destination. However, if the SID frame formats are incompatible, the process moves to block 712.


At block 712, the SID frame is converted from the SID format used by the first node to the SID format used by the second node. For example, if SID conversion module 604 determines that the SID formats are incompatible, it may use the procedure illustrated in FIG. 8, below, to convert the SID frame from into a format used by the destination node. The process then moves to block 706, in which the converted SID frame is sent to the frame destination.



FIG. 8 a flow chart illustrating an exemplary process for converting a SID frame according to an embodiment of the subject matter described herein.


At block 800, SID conversion module 604 determines the SID format used by the source node. For example, SID conversion module 604 may be able to determine the SID format simply from the length of the frame: a 3G SID frame is 43 bits long while a 2G SID frame is 244 bits long.


At block 802, SID conversion module 604 chooses a conversion method based on the source format. For example, if SID conversion module 604 determines that the frame is a 2G SID frame, control flow goes to block 804, and if the frame is a 3G SID frame, control flow goes to block 808.


At block 804, SID conversion module 604 generates an output SID frame from a 3G SID template as illustrated in FIG. 4.


At block 806, SID conversion module 604 populates the output SID frame in the following way, using field names described in FIGS. 4 and 5 for reference: bits S1-S8 of the 2G SID frame are copied into bits P1-P38 of the 3G SID template, and bits S87-S91 are copied into bits P39-P43. The RFCI field is then set with the value for indicating that the frame is a 3G SID frame. Control flow then goes continues to block 712 in FIG. 7, in which the generated output SID frame is sent to the destination node.


At block 808, SID conversion module 604 generates an output SID frame from a 2G SID template as illustrated in FIG. 5.


At block 810, SID conversion module 604 populates the output SID frame in the following way, again using field names described in FIGS. 4 and 5 for reference: bits P1-P8 of the 3G SID frame are copied into bits S1-S38 of the 2G SID template, bits P39-P43 are copied into bits S87-S91, and bits S39-S86 of the 2G SID template are filled with the GSM_EFR_SID codeword. Control flow then goes continues to block 712 in FIG. 7, in which the generated output SID frame is sent to the destination node.



FIG. 9 is a message flow diagram illustrating the steps of an exemplary process for determining whether TFO is applicable according to an embodiment of the subject matter described herein. FIG. 9 illustrates the process for negotiating TFO between a 2G network (GSM) and a 3G network (UMTS). TFO is negotiated between two end devices during call setup: a TFO peer on the 2G side, TRAU 630 and RNC 620 on the 3G side. In one embodiment, wireless media gateway WMG 606 is controlled by its mobile switching center MSC 632 via a proprietary protocol EGCP (Extended Gateway Control Protocol). Alternatively, other media gateway control protocols, such as MEGACO/H.248 and MGCP, may be used.


The first pair of messages (messages 900 and 902) are exchanged by MSC 632 and WMG 606 to establish a wireless call at WMG 606. Once the media gateway connection is established, the 3G end device communicates its AMR rate information to the media gateway (messages 904 and 906). A similar process (not shown) establishes a connection between the 2G end device and the closest BTS 622. A media path is established between RNC 620 and TRAU 630. At this point, on the 3G side, the media stream in AMR format is transcoded into PCM at the media gateway and vice versa, without TFO (data stream 908). The two end devices may then start the TFO negotiation.


As the first step of TFO negotiation, WMG 606 sends a notification event (messages 910 and 912) to let that TFO negotiation may commence. RNC 620 sends rate and rate adjustment information to WMG 606 (messages 914 and 916), which passes on the information to the 2G side and starts TFO negotiation (918). During the negotiation process, RNC 620 may negotiate a new AMR rate with the 2G side (920). If the rates of 3G side can be supported by the 2G side and SID frames also match (922), then TFO negotiation concludes successfully (924), and WMG 606 notifies MSC 632 of this fact (messages 926 and 928). As stated above, WMG 606 may store an indication that TFO is in use for the particular call. This indication may be read by control module 602, or in alternative embodiments, by SID conversion module 604, to determine whether TFO is applicable to incoming wireless frame, as illustrated in step 702 of FIG. 7.


It will be understood that various details of the subject matter described herein may be changed without departing from the scope of the subject matter described herein. Furthermore, the foregoing description is for the purpose of illustration only, and not for the purpose of limitation.

Claims
  • 1. A method for silence insertion descriptor (SID) conversion, the method comprising: receiving a wireless frame, the frame identifying a first node as a frame source and a second node as a frame destination;determining whether tandem-free operation (TFO) is applicable;responsive to a determination that TFO is applicable, determining whether the frame is a SID frame;responsive to a determination that the frame is a SID frame, determining whether the SID format used by the first node is incompatible with the SID format used by the second node; andresponsive to a determination that the SID format used by the first node is incompatible with the SID format used by the second node, converting the frame from the SID format used by the first node to the SID format used by the second node and sending the converted SID frame to the second node.
  • 2. The method of claim 1 wherein determining whether TFO is applicable includes determining whether a speech compression algorithm and data rate used by the first node is the same as a speech compression algorithm and data rate used by the second node.
  • 3. The method of claim 1 wherein determining whether the input frame is a SID frame includes determining, based on the contents of a frame index field indicator, whether the input frame is a SID frame for a third generation (3G) network.
  • 4. The method of claim 1 wherein determining whether the input frame is a SID frame includes determining, based on a designated bit pattern, whether the input frame is a SID frame for a second generation (2G) network.
  • 5. The method of claim 1 wherein converting the SID frame includes: locating line spectral frequency information and energy gain information within the frame;extracting the line spectral frequency and energy gain information from the frame; andgenerating, as the converted SID frame, a wireless frame of the SID format used by the second node and containing the extracted line spectral frequency and energy gain information.
  • 6. A method for silence insertion descriptor (SID) conversion, the method comprising: receiving a wireless frame, the frame identifying a first node as a frame source and a second node as a frame destination;identifying a first codec used by the first node and a second codec used by the second node, and determining whether one of the first and second codecs comprises a second generation global system for mobile enhanced full rate (2G_GSM_EFR) codec and the other of the first and second codecs comprises a third generation global system for mobile enhanced full rate (3G_GSM_EFR) codec;responsive to a determination that the codecs comprise a 2G_GSM_EFR codec and a 3G_GSM_EFR codec, determining whether the frame is a SID frame;responsive to a determination that the frame is a SID frame, determining whether the SID format used by the first node is incompatible with the SID format used by the second node; andresponsive to a determination that the SID format used by the first node is incompatible with the SID format used by the second node, converting the frame from the SID format used by the first node to the SID format used by the second node and sending the converted SID frame to the second node.
  • 7. The method of claim 6 wherein determining whether the input frame is a SID frame includes determining, based on the contents of a frame index field indicator, whether the input frame is a SID frame for a third generation (3G) network.
  • 8. The method of claim 6 wherein determining whether the input frame is a SID frame includes determining, based on a designated bit pattern, whether the input frame is a SID frame for a second generation (2G) network.
  • 9. The method of claim 6 wherein converting the SID frame includes: locating line spectral frequency information and energy gain information within the frame;extracting the line spectral frequency and energy gain information from the frame; andgenerating, as the converted SID frame, a wireless frame of the SID format used by the second node and containing the extracted line spectral frequency and energy gain information.
  • 10. A system for silence insertion descriptor (SID) conversion, the system comprising: a control module for receiving a wireless frame, the frame identifying a first node as a frame source and a second node as a frame destination, and for determining whether tandem-free operation (TFO) is applicable; anda SID conversion module, operatively associated with the control module, for determining whether the frame is a SID frame, and, responsive to a determination that the frame is a SID frame, determining whether a SID format used by the first node is incompatible with a SID format used by the second node, and, responsive to a determination that the SID format used by the first node is incompatible with the SID format used by the second node, converting the frame from the SID format used by the first node to the SID format used by the second node and sending the converted frame to the second node.
  • 11. The system of claim 10 wherein the SID conversion module is adapted to determine whether a speech compression algorithm and data rate used by the first node is the same as a speech compression algorithm and data rate used by the second node.
  • 12. The system of claim 10 wherein the SID conversion module is adapted to determine, based on the contents of a frame index field indicator, whether the frame is a SID frame for a third generation (3G) network.
  • 13. The system of claim 10 wherein the SID conversion module is adapted to determine, based on a designated bit pattern, whether the frame is a SID frame for a second generation (2G) network.
  • 14. The system of claim 10 wherein the SID conversion module is adapted to convert the SID frame by: locating line spectral frequency information and energy gain information within the frame;extracting the line spectral frequency and energy gain information from the frame;generating, as the converted SID frame, a wireless frame of the SID format used by the second node and containing the extracted line spectral frequency and energy gain information.
  • 15. A computer program product comprising computer executable instructions embodied in a non-transitory computer readable medium for performing steps comprising: receiving a wireless frame, the frame identifying a first node as a frame source and a second node as a frame destination;determining whether tandem-free operation (TFO) is applicable;responsive to a determination that TFO is applicable, determining whether the frame is a SID frame;responsive to a determination that the frame is a SID frame, determining whether the SID format used by the first node is incompatible with the SID format used by the second node;responsive to a determination that the SID format used by the first node is incompatible with the SID format used by the second node, converting the frame from the SID format used by the first node to the SID format used by the second node and sending the converted SID frame to the second node.
PRIORITY CLAIM

This application claims the benefit of U.S. Provisional Patent Application Ser. No. 60/877,439, filed Dec. 28, 2006; the disclosure of which is incorporated herein by reference in its entirety.

US Referenced Citations (222)
Number Name Date Kind
3652798 McNeilly et al. Mar 1972 A
4048446 Hafner et al. Sep 1977 A
4455649 Esteban et al. Jun 1984 A
4545052 Steierman Oct 1985 A
5295136 Ashley et al. Mar 1994 A
5375121 Nishino et al. Dec 1994 A
5612957 Gregerson et al. Mar 1997 A
5710976 Hill et al. Jan 1998 A
5740157 Demiray et al. Apr 1998 A
5905873 Hartmann et al. May 1999 A
5930264 Nguyen Jul 1999 A
5933487 Strickland Aug 1999 A
5995923 Mermelstein et al. Nov 1999 A
5999529 Bernstein et al. Dec 1999 A
6006189 Strawczynski et al. Dec 1999 A
6009467 Ratcliff et al. Dec 1999 A
6026086 Lancelot et al. Feb 2000 A
6031904 An et al. Feb 2000 A
6046999 Miki et al. Apr 2000 A
6078595 Jones et al. Jun 2000 A
6141784 Davis et al. Oct 2000 A
6144667 Doshi et al. Nov 2000 A
6147988 Bartholomew et al. Nov 2000 A
6172990 Deb et al. Jan 2001 B1
6185424 Pon et al. Feb 2001 B1
6246879 Segura et al. Jun 2001 B1
6256612 Vo et al. Jul 2001 B1
6272358 Brent et al. Aug 2001 B1
6275578 De Trana et al. Aug 2001 B1
6295302 Hellwig et al. Sep 2001 B1
6298055 Wildfeuer Oct 2001 B1
6324409 Shaffer et al. Nov 2001 B1
6324515 Rabipour et al. Nov 2001 B1
6339594 Civanlar et al. Jan 2002 B1
6353666 Henderson et al. Mar 2002 B1
6389005 Cruickshank May 2002 B1
6389016 Sabaa et al. May 2002 B1
6392993 Hamilton et al. May 2002 B1
6414964 Holmquist et al. Jul 2002 B1
6424637 Pecen et al. Jul 2002 B1
6463454 Lumelsky et al. Oct 2002 B1
6549945 Sinibaldi et al. Apr 2003 B1
6553423 Chen Apr 2003 B1
6574469 Xiang et al. Jun 2003 B1
6600738 Alperovich et al. Jul 2003 B1
6614781 Elliott et al. Sep 2003 B1
6625169 Tofano Sep 2003 B1
6647428 Bannai et al. Nov 2003 B1
6658064 Rotola-Pukkila et al. Dec 2003 B1
6671367 Graf et al. Dec 2003 B1
6693996 Mansfield Feb 2004 B2
6721269 Cao et al. Apr 2004 B2
6731627 Gupta et al. May 2004 B1
6731647 Yao May 2004 B2
6765931 Rabenko et al. Jul 2004 B1
6778517 Lou et al. Aug 2004 B1
6781983 Armistead Aug 2004 B1
6795437 Räsänen et al. Sep 2004 B1
6842461 Harris Jan 2005 B2
6845089 Gu et al. Jan 2005 B1
6850778 Honkala et al. Feb 2005 B1
6850883 Kapanen et al. Feb 2005 B1
6865220 Abrishami Mar 2005 B2
6876646 Dore et al. Apr 2005 B1
6885638 Xu et al. Apr 2005 B2
6898208 Sligo et al. May 2005 B1
6944166 Perinpanathan et al. Sep 2005 B1
6956816 Alexander et al. Oct 2005 B1
6967958 Ono et al. Nov 2005 B2
6967972 Volftsun et al. Nov 2005 B1
6973024 Joseph et al. Dec 2005 B1
6983163 Sato et al. Jan 2006 B2
6985530 Zerbe Jan 2006 B1
6990340 Tamura et al. Jan 2006 B2
6999459 Callon et al. Feb 2006 B1
7006489 Li et al. Feb 2006 B2
7023819 Falsafi Apr 2006 B2
7054318 Eneroth et al. May 2006 B2
7054320 Lee et al. May 2006 B1
7058085 Earnshaw et al. Jun 2006 B2
7068623 Barany et al. Jun 2006 B1
7072358 Suvanen Jul 2006 B2
7082143 LeBlanc et al. Jul 2006 B1
7085289 Cromer et al. Aug 2006 B2
7089011 Mangal Aug 2006 B1
7095733 Yarlagadda et al. Aug 2006 B1
7103021 Jou Sep 2006 B2
7106701 Stümpert et al. Sep 2006 B2
7136375 Koistinen Nov 2006 B1
7162024 Wah et al. Jan 2007 B2
7180892 Tackin Feb 2007 B1
7181209 Tamura Feb 2007 B2
7203226 Rabipour et al. Apr 2007 B1
7233595 Hollis et al. Jun 2007 B1
7240000 Harada Jul 2007 B2
7245589 Neulist et al. Jul 2007 B2
7245931 Wang et al. Jul 2007 B2
7280530 Chang et al. Oct 2007 B2
7304984 Butler et al. Dec 2007 B2
7305229 Fox et al. Dec 2007 B2
7349698 Gallagher et al. Mar 2008 B2
7369859 Gallagher May 2008 B2
7400881 Kallio Jul 2008 B2
7471655 Gallagher et al. Dec 2008 B2
7483374 Nilakantan et al. Jan 2009 B2
7593415 Li et al. Sep 2009 B2
7639601 Rabipour et al. Dec 2009 B2
7729346 Lee et al. Jun 2010 B2
20010024960 Mauger Sep 2001 A1
20010036158 Hallenstal et al. Nov 2001 A1
20010043577 Barany et al. Nov 2001 A1
20020001302 Pickett Jan 2002 A1
20020013147 Fauconnier et al. Jan 2002 A1
20020019881 Bokhari et al. Feb 2002 A1
20020027930 Huh et al. Mar 2002 A1
20020049860 Koistinen Apr 2002 A1
20020054571 Falsafi May 2002 A1
20020072364 Tamura Jun 2002 A1
20020106029 Bunn et al. Aug 2002 A1
20020118673 Abrishami et al. Aug 2002 A1
20030005106 Isoda Jan 2003 A1
20030032440 Sato et al. Feb 2003 A1
20030058822 Jou Mar 2003 A1
20030063569 Kalliokulju et al. Apr 2003 A1
20030072273 Aiello et al. Apr 2003 A1
20030093509 Li et al. May 2003 A1
20030112796 Kwan Jun 2003 A1
20030117954 De Neve et al. Jun 2003 A1
20030123466 Somekh et al. Jul 2003 A1
20030123485 Yi et al. Jul 2003 A1
20030133423 LaDue Jul 2003 A1
20030134653 Sarkkinen et al. Jul 2003 A1
20030135376 Harada Jul 2003 A1
20030135784 Yamaguchi et al. Jul 2003 A1
20030189270 Bei et al. Oct 2003 A1
20030195981 Graf et al. Oct 2003 A1
20030210659 Chu et al. Nov 2003 A1
20030233274 Urken et al. Dec 2003 A1
20040008652 Tanzella et al. Jan 2004 A1
20040010582 Oliver Jan 2004 A1
20040037224 Choi et al. Feb 2004 A1
20040037314 Spear Feb 2004 A1
20040047364 Briggs et al. Mar 2004 A1
20040066745 Joe Apr 2004 A1
20040073424 Geppert et al. Apr 2004 A1
20040090989 Kobayashi May 2004 A1
20040100914 Hellwig et al. May 2004 A1
20040101125 Graf et al. May 2004 A1
20040110539 El-Maleh et al. Jun 2004 A1
20040114588 Bhaskaran Jun 2004 A1
20040114626 Cline et al. Jun 2004 A1
20040114922 Hardee Jun 2004 A1
20040131025 Dohler et al. Jul 2004 A1
20040131051 Rabipour et al. Jul 2004 A1
20040133419 El-Maleh et al. Jul 2004 A1
20040136447 LeBlanc Jul 2004 A1
20040196867 Ejzak et al. Oct 2004 A1
20040208132 Neulist et al. Oct 2004 A1
20040228279 Midtun et al. Nov 2004 A1
20040252681 Rabipour et al. Dec 2004 A1
20040254786 Kirla et al. Dec 2004 A1
20040266426 Marsh et al. Dec 2004 A1
20040267897 Hill et al. Dec 2004 A1
20050007973 Jang et al. Jan 2005 A1
20050013281 Milton et al. Jan 2005 A1
20050013286 Holland et al. Jan 2005 A1
20050027948 Marlan et al. Feb 2005 A1
20050048973 Hou et al. Mar 2005 A1
20050064907 Nealon Mar 2005 A1
20050073977 Vanghi et al. Apr 2005 A1
20050074017 Qian et al. Apr 2005 A1
20050084094 Gass et al. Apr 2005 A1
20050085181 Tao Apr 2005 A1
20080740174 Qian et al. Apr 2005
20050099940 Ohenoja et al. May 2005 A1
20050105512 Myhre et al. May 2005 A1
20050157823 Sudhakar Jul 2005 A1
20050172013 Tan et al. Aug 2005 A1
20050185604 Agarwal Aug 2005 A1
20050195829 Ward Sep 2005 A1
20050232232 Farber et al. Oct 2005 A1
20050265279 Markovic et al. Dec 2005 A1
20050267746 Jelinek et al. Dec 2005 A1
20050286466 Tagg et al. Dec 2005 A1
20060046658 Cruz et al. Mar 2006 A1
20060050664 Guey Mar 2006 A1
20060062225 Li et al. Mar 2006 A1
20060067221 Lee et al. Mar 2006 A1
20060072555 St. Hilaire et al. Apr 2006 A1
20060092927 Li et al. May 2006 A1
20060133353 Wang et al. Jun 2006 A1
20060154686 Sarkkinen et al. Jul 2006 A1
20060193289 Ronneke et al. Aug 2006 A1
20060198347 Hurtta et al. Sep 2006 A1
20060209873 Knabchen et al. Sep 2006 A1
20060229068 Niemela et al. Oct 2006 A1
20060268845 He et al. Nov 2006 A1
20060286981 Suumaki et al. Dec 2006 A1
20060291454 Ali Dec 2006 A1
20060291483 Sela Dec 2006 A1
20070011727 Mielenz et al. Jan 2007 A1
20070041360 Gallagher et al. Feb 2007 A1
20070043558 Schwarz et al. Feb 2007 A1
20070123196 Tamura May 2007 A1
20070127357 Tamura Jun 2007 A1
20070127436 Karimi-Cherkandi et al. Jun 2007 A1
20070135165 Junghanns et al. Jun 2007 A1
20070140214 Zoltan Jun 2007 A1
20070140293 Agarwal et al. Jun 2007 A1
20070171841 Witzel et al. Jul 2007 A1
20070186002 Campbell et al. Aug 2007 A1
20070286082 Hikspoors et al. Dec 2007 A1
20080008312 Ganesamoorthi et al. Jan 2008 A1
20080039087 Gallagher et al. Feb 2008 A1
20080102794 Keevill et al. May 2008 A1
20080123596 Gallagher et al. May 2008 A1
20080151845 Jaakkola et al. Jun 2008 A1
20080225765 Marinier et al. Sep 2008 A1
20080288245 El-Maleh et al. Nov 2008 A1
20080293416 Yi et al. Nov 2008 A1
20080316980 Ahlen et al. Dec 2008 A1
20100305943 Witzel et al. Dec 2010 A1
Foreign Referenced Citations (24)
Number Date Country
2336699 Jan 2000 CA
1504039 Jun 2004 CN
1 553 723 Dec 2004 CN
1553723 Dec 2004 CN
198 29 822 Jan 2000 DE
0 907 280 Apr 1999 EP
1 017 217 Jul 2000 EP
1 076 466 Feb 2001 EP
20011715 Feb 2003 FI
2363295 Dec 2001 GB
2 389 486 Dec 2003 GB
WO 99291326 Jun 1999 WO
WO 9940569 Aug 1999 WO
WO 0051330 Aug 2000 WO
WO 0070885 Nov 2000 WO
WO 0126390 Apr 2001 WO
WO 02052414 Jul 2002 WO
WO 03019961 Mar 2003 WO
WO 2004019568 Mar 2003 WO
WO 03043299 May 2003 WO
WO 03103313 Dec 2003 WO
WO 2004075582 Sep 2004 WO
WO 2005050960 Jun 2005 WO
WO 2005089055 Sep 2005 WO
Related Publications (1)
Number Date Country
20080160987 A1 Jul 2008 US
Provisional Applications (1)
Number Date Country
60877439 Dec 2006 US