1、 Access to Additional Content for TIA/IS-893, Dated: June 2005 (Click here to view the publication) This Page is not part of the original publication This page has been added by IHS as a convenience to the user in order to provide access to additional content as authorized by the Copyright holder of
2、 this document Click the link(s) below to access the content and use normal procedures for downloading or opening the files. TIA-893_Files Information contained in the above is the property of the Copyright holder and all Notice of Disclaimer (b) there is no assurance that the Document will be appro
3、ved by any Committee of TIA or any other body in its present or any other form; (c) the Document may be amended, modified or changed in the standards development or any editing process. The use or practice of contents of this Document may involve the use of intellectual property rights (“IPR”), incl
4、uding pending or issued patents, or copyrights, owned by one or more parties. TIA makes no search or investigation for IPR. When IPR consisting of patents and published pending patent applications are claimed and called to TIAs attention, a statement from the holder thereof is requested, all in acco
5、rdance with the Manual. TIA takes no position with reference to, and disclaims any obligation to investigate or inquire into, the scope or validity of any claims of IPR. TIA will neither be a party to discussions of any licensing terms or conditions, which are instead left to the parties involved, n
6、or will TIA opine or judge whether proposed licensing terms or conditions are reasonable or non-discriminatory. TIA does not warrant or represent that procedures or practices suggested or provided in the Manual have been complied with as respects the Document or its contents. TIA does not enforce or
7、 monitor compliance with the contents of the Document. TIA does not certify, inspect, test or otherwise investigate products, designs or services or any claims of compliance with the contents of the Document. ALL WARRANTIES, EXPRESS OR IMPLIED, ARE DISCLAIMED, INCLUDING WITHOUT LIMITATION, ANY AND A
8、LL WARRANTIES CONCERNING THE ACCURACY OF THE CONTENTS, ITS FITNESS OR APPROPRIATENESS FOR A PARTICULAR PURPOSE OR USE, ITS MERCHANTABILITY AND ITS NON-INFRINGEMENT OF ANY THIRD PARTYS INTELLECTUAL PROPERTY RIGHTS. TIA EXPRESSLY DISCLAIMS ANY AND ALL RESPONSIBILITIES FOR THE ACCURACY OF THE CONTENTS
9、AND MAKES NO REPRESENTATIONS OR WARRANTIES REGARDING THE CONTENTS COMPLIANCE WITH ANY APPLICABLE STATUTE, RULE OR REGULATION, OR THE SAFETY OR HEALTH EFFECTS OF THE CONTENTS OR ANY PRODUCT OR SERVICE REFERRED TO IN THE DOCUMENT OR PRODUCED OR RENDERED TO COMPLY WITH THE CONTENTS. TIA SHALL NOT BE LI
10、ABLE FOR ANY AND ALL DAMAGES, DIRECT OR INDIRECT, ARISING FROM OR RELATING TO ANY USE OF THE CONTENTS CONTAINED HEREIN, INCLUDING WITHOUT LIMITATION ANY AND ALL INDIRECT, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES (INCLUDING DAMAGES FOR LOSS OF BUSINESS, LOSS OF PROFITS, LITIGATION, OR THE LIKE),
11、WHETHER BASED UPON BREACH OF CONTRACT, BREACH OF WARRANTY, TORT (INCLUDING NEGLIGENCE), PRODUCT LIABILITY OR OTHERWISE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. THE FOREGOING NEGATION OF DAMAGES IS A FUNDAMENTAL ELEMENT OF THE USE OF THE CONTENTS HEREOF, AND THESE CONTENTS WOULD NOT BE PU
12、BLISHED BY TIA WITHOUT SUCH LIMITATIONS. TIA/IS-893 NNNOTIFICATION Each of the companies; Ericsson, Lucent, Mindspeed, Motorola, Nokia, Nortel Networks, 2 and Qualcomm (hereinafter referred to individually as “Source” or collectively as “Sources”) 3 do hereby state: 4 To the extent to which the Sour
13、ce(s) may legally and freely do so, the Source(s), upon 5 submission of a Contribution, grant(s) a free, irrevocable, non-exclusive, license to the Third 6 Generation Partnership Project 2 (3GPP2) and its Organizational Partners: ARIB, CCSA, 7 TIA, TTA, and TTC, under the Sources copyright or copyri
14、ght license rights in the 8 Contribution, to, in whole or in part, copy, make derivative works, perform, display and 9 distribute the Contribution and derivative works thereof consistent with 3GPP2s and each 10 Organizational Partners policies and procedures, with the right to (i) sublicense the 11
15、foregoing rights consistent with 3GPP2s and each Organizational Partners policies and 12 procedures and (ii) copyright and sell, if applicable) in 3GPP2s name or each Organizational 13 Partners name any 3GPP2 or transposed Publication even though this Publication may 14 contain the Contribution or a
16、 derivative work thereof. The Contribution shall disclose any 15 known limitations on the Sources rights to license as herein provided. 16 When a Contribution is submitted by the Source(s) to assist the formulating groups of 3GPP2 17 or any of its Organizational Partners, it is proposed to the Commi
17、ttee as a basis for discussion 18 and is not to be construed as a binding proposal on the Source(s). The Source(s) specifically 19 reserve(s) the right to amend or modify the material contained in the Contribution. Nothing 20 contained in the Contribution shall, except as herein expressly provided,
18、be construed as 21 conferring by implication, estoppel or otherwise, any license or right under (i) any existing or 22 later issuing patent, whether or not the use of information in the document necessarily 23 employs an invention of any existing or later issued patent, (ii) any copyright, (iii) any
19、 24 trademark, or (iv) any other intellectual property right. 25 With respect to the Software necessary for the practice of any or all Normative portions of 26 the Selectable Mode Vocoder (SMV) as it exists on the date of submittal of this form, should 27 the SMV be approved as a Specification or Re
20、port by 3GPP2, or as a transposed Standard by 28 any of the 3GPP2s Organizational Partners, the Source(s) state(s) that a worldwide license to 29 reproduce, use and distribute the Software, the license rights to which are held by the 30 Source(s), will be made available to applicants under terms and
21、 conditions that are 31 reasonable and non-discriminatory, which may include monetary compensation, and only to 32 the extent necessary for the practice of any or all of the Normative portions of the SMV or 33 the field of use of practice of the SMV Specification, Report, or Standard. The statement
22、34 contained above is irrevocable and shall be binding upon the Source(s). In the event the 35 rights of the Source(s) in and to copyright or copyright license rights subject to such 36 commitment are assigned or transferred, the Source(s) shall notify the assignee or transferee 37 of the existence
23、of such commitments. 38 39 Intentionally left blank.TIA/IS-893 i FOREWORD 1 These technical requirements form a standard for Service Option 56, a variable-rate 2 two-way speech service option. The maximum speech-coding rate of the service option is 3 8.55 kbps. 4 This standard does not address the q
24、uality or reliability of Service Option 56, nor does it 5 cover equipment performance or measurement procedures. 6 7 TIA/IS-893 ii NOTES 1 1. Accompanying “Recommended Minimum Performance Standard for the Selectable 2 Mode Vocoder, Service Option 56,” provides specifications and measurement methods.
25、 3 2. “Base station” refers to the functions performed on the land-line side, which are 4 typically distributed among a cell, a sector of a cell, a mobile switching center, and a 5 personal communications switching center. 6 3. This document uses the following verbal forms: “Shall” and “shall not” i
26、dentify 7 requirements to be followed strictly to conform to the standard and from which no 8 deviation is permitted. “Should” and “should not” indicate that one of several 9 possibilities is recommended as particularly suitable, without mentioning or excluding 10 others; that a certain course of ac
27、tion is preferred but not necessarily required; or that 11 (in the negative form) a certain possibility or course of action is discouraged but not 12 prohibited. “May” and “need not” indicate a course of action permissible within the 13 limits of the standard. “Can” and “cannot” are used for stateme
28、nts of possibility and 14 capability, whether material, physical, or causal. 15 4. Footnotes appear at various points in this specification to elaborate and further clarify 16 items discussed in the body of the specification. 17 5. Unless indicated otherwise, this document presents numbers in decima
29、l form. 18 Binary numbers are distinguished in the text by the use of single quotation marks. In 19 some tables, binary values may appear without single quotation marks if table notation 20 clearly specifies that values are binary. The character x is used to represent a binary 21 bit of unspecified
30、value. For example xxx00010 represents any 8-bit binary value such 22 that the least significant five bits equal 00010. 23 Hexadecimal numbers (base 16) are distinguished in the text by use of the form 0xh h 24 where h h represents a string of hexadecimal digits. For example, 0x2fa1 represents a 25
31、number whose binary value is 10111110100001 and whose decimal value is 913. 26 27 TIA/IS-893 iii NOTES 1 6. The following conventions apply to mathematical expressions in this standard: 2 x indicates the largest integer less than or equal to x: 1.1 = 1, 1.0 = 1. 3 x indicates the smallest integer gr
32、eater than or equal to x: 1.1 = 2, 2.0 = 2. 4 |x| indicates the absolute value of x: |-17|=17, |17|=17. 5 indicates exclusive OR. 6 min(x, y) indicates the minimum of x and y. 7 max(x, y) indicates the maximum of x and y. 8 In figures, indicates multiplication. In formulas within the text, multiplic
33、ation is 9 implicit. For example, if h(n) and pL(n) are functions, then h(n) pL(n) = h(n) pL(n). 10 x mod y indicates the remainder after dividing x by y: x mod y = x - (y x/y). 11 round(x) is traditional rounding: round(x) = x + 0.5. 12 sign x()=1x 01xSMC . 104 44 5.3.15.2.1 Determining Parameters.
34、 105 45 5.3.15.2.2 Target Signal Determination for Current Local Delay Search 106 46 5.3.15.2.3 Searching Range Determination for Local Delay . 107 47 5.3.15.2.4 Local Delay Search. 109 48 5.3.15.2.4.1 Modification of Target Signal 109 49 5.3.15.2.4.2 Integer Local Delay Search 109 50 5.3.15.2.4.3 F
35、ractional Local Delay Determination 110 51 5.3.15.2.4.4 Warping Current Weighted Speech With Determined Delay52 110 53 5.3.15.2.5 Further Modification of Weighted Speech for Half_Rate_Max 110 54 TIA/IS-893 viii 5.3.15.2.5.1 Generating a Backward Waveform Vector 111 1 5.3.15.2.5.2 Generating a Candid
36、ate Vector by Waveform Interpolation2 111 3 5.3.15.2.5.3 Making a Decision to Use Interpolated Modified Weighted 4 Speech 112 5 5.3.15.2.6 Final Determination of Current Local Delay and Accumulated Delay 113 6 5.3.15.2.7 Updating Modified Weighted Speech Buffer 113 7 5.3.15.2.8 Pitch Pre-Enhancement
37、 and Periodicity Detection 113 8 5.3.15.3 Detecting Stationary Voiced Speech and Calculating Open-Loop Pitch Gain 9 for each Fixed Subframe . 115 10 5.3.15.3.1 Detecting Stationary Voiced Speech and Calculating Open-Loop Pitch 11 Gains for Rate 1 115 12 5.3.15.3.2 Detecting Stationary Voiced Speech
38、and Calculating Open-Loop Pitch 13 Gains for Rate 1/2 116 14 5.3.16 Final Frame Class and Type Decisions, Rate Selection, and Pitch Lag 15 Refinement . 118 16 5.3.16.1 Final Classification, Type and Rate Selection . 118 17 5.3.16.2 Pitch Lags Refinement . 119 18 5.3.17 Adaptive-codebook Gain De-emph
39、asis for Type-1 Frame (Rate 1 and Rate 1/2)19 120 20 5.3.18 Adaptive-codebook Gain Quantization for Type-1 Frame (Rate 1 and Rate 1/2)21 121 22 5.3.19 Generating Modified Speech from Modified Weighted Speech. 122 23 5.3.20 LSFs Smoothing Parameter . 123 24 5.3.21 LSFs Smoothing 125 25 5.3.22 LSFs Qu
40、antization 126 26 5.3.22.1 Calculation of LSFs Quantization Weights . 126 27 5.3.22.2 LSFs Mean Removal 127 28 5.3.22.3 LSFs Prediction . 127 29 5.3.22.4 Quantization of the LSFs Prediction Error 127 30 5.3.22.4.1 LSFs Quantization for Rate 1 . 129 31 5.3.22.4.2 LSFs Quantization for Rate 1/2 129 32
41、 5.3.22.4.3 LSFs Quantization for Rate 1/4 129 33 5.3.22.4.4 LSFs Quantization for Rate 1/8 130 34 5.3.23 Interpolation of Quantized and Unquantized LSFs. 131 35 5.3.23.1 Interpolation of Quantized LSFs for Rate 1 Type-0 Frames. 131 36 5.3.23.1.1 Calculating of Distance Weights. 131 37 5.3.23.1.2 De
42、termination of Best Interpolation Path . 131 38 5.3.23.2 Interpolation of Quantized LSFs for Rate 1 Type-1 frames, Rate 1/4 frames, 39 and Rate 1/8 Frames 132 40 5.3.23.3 Interpolation of Quantized and Unquantized LSFs for Rate 1/2 Type-0 41 Frames 132 42 5.3.23.4 Interpolation of Quantized and Unqu
43、antized LSFs for Rate 1/2 Type-1 43 Frames 132 44 5.3.24 Recalculating of Weighting Filter Coefficients for Rate 1/2 134 45 5.3.25 Identifying Long-Term Spectral Characteristic. 135 46 5.4 Excitation Coding at Rate 1/8. 137 47 5.4.1 Excitation and Unquantized Gain Determination 137 48 5.4.2 Gain qua
44、ntization . 137 49 5.5 Excitation Coding at Rate 1/4. 139 50 5.5.1 Computation and Quantization of Gains . 139 51 5.5.2 Random number generation 140 52 5.5.3 Creation of sparse non-zero excitation. 141 53 5.5.4 Shaping the excitation 141 54 5.6 Excitation Coding at Rate 1 and Rate 1/2 . 143 55 TIA/I
45、S-893 ix 5.6.1 Introduction to Excitation Coding for Rate 1 and Rate 1/2 143 1 5.6.2 Calculation of Impulse Response of the Combined Synthesis and Weighting 2 Filter 146 3 5.6.3 Generating the Target Signal. 147 4 5.6.4 Generating the Ideal Excitation . 148 5 5.6.5 Adaptive-codebook Contribution for
46、 Type-1 Frames 149 6 5.6.5.1 The Adaptive-codebook Vector Contribution 149 7 5.6.5.2 The Filtered Adaptive Vector Contribution and Normalized Pitch Correlation8 150 9 5.6.6 Adaptive-codebook Contribution For Rate 1 Type-0 Frames 151 10 5.6.6.1 Normalized Cross Correlation Between the Target and the
47、Filtered Excitation11 152 12 5.6.6.2 Fractional Pitch Search and Quantization 152 13 5.6.6.3 Adaptive-codebook Gain (Closed-Loop Pitch Gain) and Normalized 14 Correlation 152 15 5.6.7 Adaptive-codebook Contribution For Rate 1/2 Type-0 Frames. 154 16 5.6.7.1 Normalized Cross Correlation Between the T
48、arget and the Filtered Excitation17 154 18 5.6.7.2 Integer Pitch Search and Quantization. 155 19 5.6.7.3 Adaptive-codebook Gain (Closed-Loop Pitch Gain) and Normalized 20 Correlation 155 21 5.6.8 Scaling of Adaptive-Codebook Gain. 156 22 5.6.9 Update of Target and Ideal Excitation 156 23 5.6.10 Calc
49、ulation of Fixed-codebook Smoothing Parameters. 157 24 5.6.11 Principles and Algorithms for Pulse Codebook Search . 159 25 5.6.11.1 Analysis-by-Synthesis Approach for Fixed-Codebook Contribution 159 26 5.6.11.2 Principles of Iterative Search Procedure for Pulse Sub-Codebooks . 159 27 5.6.11.3 Updates of Pulse Contributions . 160 28 5.6.11.4 Concept of Pitch Enhancement for Pulse Codebooks 160 29 5.6.11.5 Pre-Calculation Procedure . 161 30 5.6.11.6 An Iterative Algorithm Based on Position Search for a Single Pulse 162 31 5.6.11
