Interference cancellation in multirate DSCDMA systems
GSMR接口需求规范

ERTMS/ETCS – Class 1GSM-R InterfacesClass 1 RequirementsREF : SUBSET-093ISSUE : 2.3.0DATE : 10-Oct-2005Company Technical Approval Management approval ALCATELALSTOMANSALDO SIGNALBOMBARDIERINVENSYS RAILSIEMENS1. M ODIFICATION H ISTORYIssue NumberDateSection Number Modification / Description Author0.1.0 (8-Aug-02) Creation based on subset052LK0.1.1 (8-Aug-02) All Minor editorial changes LK0.1.1ec All englishcheck JH0.2.0 (9-Sep-02) 3., 4.2, 4.1, 6.3, 7.2,8.2 Updated after email discussionLK0.3.0 (24-Oct-02) All Updated after FlorencemeetingLK+TS0.4.0 (14-Nov-02) All Updated after LondonmeetingLK0.5.0 (5-Dec-02) 4.2, 5.6.1, 6.2, 7.1,7.3, 9.2 Updated after Berlin meetingLK0.6.0 (12-Dec-02) 3., 6.3., 10.4.3 Email comments included TS+LK2.0.0 (12-Dec-02) Erroneous versionnumber 2.2.0correctedFinal issue LK2.1.0 (28-March-03)3.1.1.1, 6.3.1.3,7.1.1.1, 8.1.1.1 Update acc. to super group commentsLK2.2.0 (28-March-03) - Final version LK2.2.2.31-03-03 Versionnumberchangedfor release to the usersGroupWLH2.2.3 (12-June-03) All Update after Brussels mtg.and GSM-R Op. grp.commentsLK2.2.4 (26-June-03) editorial Draft release to UsersGroupJH2.2.5 - FormalreleaseJH 2.2.5.1 4.2, 6.2, 6.3, new 6.4 Update after Paris mtg. andGSM-R Op. grp. commentsLK2.2.5.2 Various update after further GSM-ROp grp reviewJH2.2.5.3 cleanversion JH 2.2.5.4 6.4 Updated after further GSM-R Op grp requestRB2.2.6 CleanversionRB2.2.6 revA (31-Jan-05) 4.2, 6.3, 6.4, Annex A Proposal for QoS parametervaluesLK2.2.6 revB (14-Feb-05) 6.3, 6.4, Annex A Updated after QoSmeeting#6 BrusselsLK2.2.6 revC (24-Feb-05) 6.3, 6.4, Annex A,Annex B added Updated during BerlinmeetingLK2.2.6 revD (25-Feb-05) 6.2, 6.3.5, 10.3, 10.5.2 Email comments inserted LK2.2.6 revE (6-Apr-05)3.1., 3.2,4.1,5.1,6.3,10.1, 10.3, 10.5, 10.7 Updated after QoSmeeting#7 BrusselsLK2.2.6 revF (25-Apr-05)3.1,4.1,5.1,6.3, 6.4,10.1, 10.3, 10.5, 10.6,10.7Edinburgh meeting TS+LK2.2.6revG (20-May-05)3.1, 5.1, 6.3, 6.4, 8.2 Changes according toBrussels meetingLK2.2.6revH (1-Sep-05) 4.1, 5.1, 6.3, 6.4, 7.2,10.3, 10.4, 10.5 Comments from SG andEEIGLK2.2.6revI (8-Sep-05) 5.1, 6.3, 6.4, 10.4 Zürich meeting PL+LK 2.3.0 (10-Oct-05) update for issue JH2. T ABLE OF C ONTENTS1.M ODIFICATION H ISTORY (2)2.T ABLE OF C ONTENTS (4)3.R EFERENCES (6)3.1Normative Documents (6)3.2Informative Documents (7)4.T ERMS AND DEFINITIONS (8)4.1Abbreviations (8)4.2Definitions (9)5.G ENERAL (10)5.1Scope of this document (10)5.2Introduction (10)6.E ND-TO-END SERVICE REQUIREMENTS TO GSM-R NETWORKS (12)6.1Data bearer service requirements (12)6.2Additional services (12)6.3Quality of Service requirements (13)6.3.1General (13)6.3.2Connection establishment delay (14)6.3.3Connection establishment error ratio (14)6.3.4Transfer delay (15)6.3.5Connection loss rate (15)6.3.6Transmission interference (15)6.3.7GSM-R network registration delay (16)6.4Summary of QoS requirements (16)7.R EQUIREMENTS TO FIXED NETWORK INTERFACE (17)7.1Foreword (17)7.2Interface definition (17)7.3Communication signalling procedures (17)8.R EQUIREMENTS TO MOBILE NETWORK INTERFACE (18)8.1Foreword (18)8.2Interface definition (18)9.A NNEX A(I NFORMATIVE) TRANSMISSION INTERFERENCE AND RECOVERY (19)9.1General (19)9.2Transmission interference in relation to HDLC (19)10.A NNEX B(INFORMATIVE)J USTIFICATION OF Q O S PARAMETER VALUES (22)10.1General (22)10.2Connection establishment delay (22)10.3Connection establishment error ratio (22)10.4Transfer delay (23)10.5Connection loss rate (23)10.5.1QoS targets (23)10.5.2Conclusions (24)10.6Transmission interference (24)10.7Network registration delay (26)3. R EFERENCESDocuments3.1 Normative3.1.1.1 This document list incorporates by dated or undated references, provisions from otherpublications. These normative references are cited at the appropriate place in the textand the publications are listed hereafter. For dated references, subsequentamendments to or revisions of any of these publications apply to this document onlywhen incorporated in it by amendment or revision. For undated references the latestedition of the publication referred to apply.Reference DateTitleU-SRS 02.02 ERTMS/ETCS Class 1; Subset 026; Unisig SRS, version 2.2.2 Subset 037 07.03 ERTMS/ETCS Class 1; Subset 037; EuroRadio FIS; Class1requirements, version 2.2.5EIRENE FRS 10.03 UIC Project EIRENE; Functional Requirements Specification.Version 6.0, CLA111D003EIRENE SRS 10.03 UIC Project EIRENE; System Requirements Specification.Version 14.0, CLA111D004ETS 300011 1992 ISDN; Primary rate user-network interface; Layer 1 specificationand test principlesETS 300102-1 1990 ISDN; User-network interface layer 3; Specification for basiccall controlETS 300125 1991 ISDN; User-network interface data link layer specificationsGSM04.21 12.00 Rate Adaptation on the MS-BSS Interface, v.8.3.0GSM 07.0711.98 ETSI TS 100916; Digital cellular telecommunications system(Phase 2+); AT command set for GSM Mobile Equipment (ME),GSM TS 07.07 version 6.5.0 Release 1997ITU-T V.24 02.00 List of definitions for interchange circuits between data terminalequipment (DTE) and data circuit-terminating equipment (DCE)ITU-T V.25ter 07/97 Serial asynchronous dialling and controlITU-T V.110 02.00 Support of data terminal equipments (DTEs) with V-series typeinterfaces by an integrated services digital network (ISDN) EuroRadio FFFIS 09.03 UIC ERTMS/GSM-R Unisig; Euroradio Interface Group; RadioTransmission FFFIS for Euroradio; A11T6001; version 12O-2475 09.03 UIC ERTMS/GSM-R Operators Group; ERTMS/GSM-R Qualityof Service Test Specification; O-2475; version 1.0Documents3.2 InformativeTitleReference DateEEIG 04E117 12.04 ETCS/GSM-R Quality of Service - Operational Analysis, v0.q(draft)ERQoS 08.04 GSM-R QoS Impact on EuroRadio and ETCS application,Unisig_ALS_ERQoS, v.0104. T ERMS AND DEFINITIONS4.1 AbbreviationsAT ATtention command setATD AT command DialB channel User channel of ISDNB m channel User channel of GSM PLMN on the air interfaceBRI Basic Rate InterfaceByte 1 start bit + 8 data bits + 1 stop bitDCE Data Circuit EquipmentDCD Data Carrier DetectD channel Control channel of ISDND m channel Control channel of GSM PLMN on the air interfaceDTE Data Terminal EquipmenteMLPP enhanced Multi-Level Precedence and Pre-emptionFIS Functional Interface SpecificationGPRS General Packet Radio Service (a phase 2+ GSM service) GSM-R Global System for Mobile communication/RailwayHDLC High level Data Link ControlISDN Integrated Services Digital NetworkMLPP Multi-Level Precedence and Pre-emption (ISDN service) MOC Mobile Originated CallMS Mobile Station (a GSM entity)Termination/Terminated MT MobileMTC Mobile Terminated CallMTBD Mean Time Between DisturbanceUnitOBU On-BoardPLMN Public Land Mobile NetworkPRI Primary Rate InterfaceQoS Quality of ServicesRBC Radio Block CentreT TI Duration of Transmission Interference periodT REC Duration of Recovery periodUDI Unrestricted Digital4.2 Definitions4.2.1.1 Definitions for the purpose of this specification are inserted in the respective sections.5. G ENERAL5.1 Scope of this document5.1.1.1 The scope of this document is to specify the Radio Communication Systemrequirements to the GSM-R network services (including fixed side access) andinterfaces and also the pre-requisites to be fulfilled by GSM-R networks and ETCSinfrastructures. Presently the requirements for high-speed lines are covered,requirements for conventional lines may be included in future versions of thisdocument.5.1.1.2 The data transmission part of the communication protocols is fully described in theEuroRadio FIS [Subset 037].5.1.1.3 The Radio Transmission FFFIS for EuroRadio [EuroRadio FFFIS] specifies thephysical, electrical and functional details related to the interfaces.5.1.1.4 All requirements apply to GSM-R unless indicated otherwise .5.2 Introduction5.2.1.1 The definition of the GSM services and associated physical and communicationsignalling protocols on the air interface are fully standardised in the specificationsproduced by the ETSI GSM Technical Committee for the public GSM implementationas well as for the GSM-R. Additionally, some railway specific services are alsospecified in the EIRENE SRS. However, in both cases, not all are required for ERTMSclass 1 system definition.5.2.1.2 The following ETSI GSM phases 1/2/2+ services are required:a) Transparent data bearer serviceb) Enhanced multi-level precedence and pre-emption (eMLPP).5.2.1.3 Other ETSI GSM phases 1/2/2+ services are not required for Class 1. These are thefollowing :a) GSM supplementary services:• Call forwardingb) General packet radio service (GPRS)5.2.1.4 Other ETSI GSM phases 1/2/2+ services are not required. Examples of these are thefollowing :a) Non-transparent data bearer serviceb) GSM supplementary services:• Line identification•Call waiting and hold• Multiparty•Closed User Group•Advice of charge• Call Barringc) Short message service point to point or cell broadcastd) Voice broadcast servicee) Voice group call service5.2.1.5 The following EIRENE railway specific service [EIRENE SRS] is required:a) Location dependent addressing5.2.1.6 The following EIRENE specific services [EIRENE SRS] are not required :a) Functional addressingb) Enhanced location dependent addressingc) Calling and connected line presentation of functional identitiesd) Emergency callse) Shunting modef) Multiple driver communications6. E ND-TO-END SERVICE REQUIREMENTS TO GSM-RNETWORKS6.1 Data bearer service requirements6.1.1.1 For the transmission of information between OBU and RBC, the EuroRadio protocoluses the bearer services of a GSM-R network. The service provider makes these databearer services available at defined interfaces.6.1.1.2 The data bearer services are described as data access and transfer in the GSMnetwork from Terminal Equipment (TE) on the mobile side (i.e. OBU) to a networkgateway interworking with Public Switched Telephonic Network (PSTN) or IntegratedServices Digital Network (ISDN) on the fixed side (i.e. RBC).6.1.1.3 The following features and attributes of the required bearer service shall be provided:a) Data transfer in circuit switched modeb) Data transfer allowing multiple rate data streams which are rate-adapted[GSM04.21] and [ITU-T V.110]c) Unrestricted Digital Information (UDI) – only supported through ISDN interworking(no analogue modem in the transmission path)d) Radio channel in full ratee) Transfer of data only (no alternate speech/data)f) Transfer in asynchronous transparent modeg) The required data rates are listed in the following table:Bearer service Requirement24. Asynchronous 2.4 kbps T O25. Asynchronous 4.8 kbps T M26. Asynchronous 9.6 kbps T MT: Transparent; M: Mandatory; O: OptionalTable1 GSM-R bearer servicesservices6.2 Additional6.2.1.1 The following supplementary services shall be provided:a) Enhanced multi-level precedence and pre-emption.b) The selection of a particular mobile network shall be possible on-demand.6.2.1.2 The priority value for command control (safety) shall be assigned to according to[EIRENE FRS §10.2] and [EIRENE SRS §10.2].6.2.1.3 The following railway specific service shall be provided by GSM-R networks:a) Location dependent addressing based on the use of short dialling codes inconjunction with cell dependent routing.6.3 Quality of Service requirements6.3.1 General6.3.1.1 As an end-to-end bearer service is used, a restriction of requirements on the servicequality placed on the air interface is not sufficient.6.3.1.2 End-to-end quality of service has to be considered at the service access points.6.3.1.3 The service access points are:•the service access points to the signalling stack for the establishment or release of a physical connection,•the service access points to the data channel.6.3.1.4 The network shall be able to support transparent train-to-trackside and trackside-to-train data communications at speeds up to 500 km/h e.g. in tunnels, cuttings, onelevated structures, at gradients, on bridges and stations.6.3.1.5 The network shall provide a Quality of Service for ETCS data transfer that is at least asgood as listed below1. The parameters are valid for one end-to-end connection for onetrain running under all operational conditions.6.3.1.6 The required QoS parameters shall not depend on network load.6.3.1.7 These performance figures reflect railway operational targets [EEIG 04E117].6.3.1.8 Note: A justification of the performance figures is given by Annex B.6.3.1.9 QoS requirements are specified independently of the method of measurement (refer to[O-2475] for specification of testing).6.3.1.10 Conventional line quality of service requirements may be included in future versions ofthis document. Also the values may not be applied at all locations and times (e.g.discontinuous radio coverage at some locations).6.3.1.11 Given the performance constraints of GSM-R, pre-conditions may be necessary tomeet the railway operational targets of [EEIG 04E117]. If different operational QoStargets are required, then other pre-conditions on ETCS application may be necessary.1 Early experience suggests that GSM-R performance can be better than these parameters suggest, after network optimisation and tuning.Such a case is not covered by this specification and this aspect of ETCS SystemPerformance becomes the responsibility of whoever specifies different operationaltargets.6.3.2 Connection establishment delay6.3.2.1 Connection establishment delay is defined as:Value of elapsed time between the connection establishment request and theindication of successful connection establishment.6.3.2.2 In case of mobile originated calls, the delay is defined between the request bycommand ATD and indication by the later of the two events response CONNECT ortransition of DCD to ON.6.3.2.3 The connection establishment delay of mobile originated calls shall be <8.5s (95%),≤10s (100%).6.3.2.4 Delays>10s shall be evaluated as connection establishment errors.6.3.2.5 The required connection establishment delay shall not depend on user data rate of theasynchronous bearer service.6.3.2.6 The required connection establishment delay is not valid for location dependentaddressing.6.3.3 Connection establishment error ratio6.3.3.1 The Connection establishment error ratio is defined as:Ratio of the number of unsuccessful connection establishment attempts to the totalnumber of connection establishment attempts.6.3.3.2 “Unsuccessful connection establishment attempt” covers all possible types ofconnection establishment errors caused by end-to-end bearer service.6.3.3.3 Connection establishment delays >10s shall be evaluated as connection establishmenterrors.6.3.3.4 The GSM-R networks should be designed in such a way, that at least two consecutiveconnection establishment attempts will be possible (pre-condition on GSM-Rnetworks), e.g. regarding GSM-R radio coverage related to maximal possible trainspeed.6.3.3.5 If the operational QoS targets of [EEIG 04E117] are wanted, then the ETCSinfrastructure should be designed in such a way, that at least two consecutiveconnection establishment attempts will be possible (Recommended pre-condition forETCS infrastructure).6.3.3.6 The connection establishment error ratio of mobile originated calls shall be <10-2 foreach attempt .6.3.3.7 Note: entry into Level 2 is of particular importance; commonly, a time of 40s may berequired in the case the GSM-R mobile station is already registered with the GSM-Rnetwork (see [ERQoS]).6.3.4 Transfer delay6.3.4.1 The end-to-end transfer delay of a user data block is defined as:Value of elapsed time between the request for transfer of a user data block and theindication of successfully transferred end-to-end user data block6.3.4.2 The delay is defined between the delivery of the first bit of the user data block at theservice access point of transmitting side and the receiving of the last bit of the sameuser data block at the service access point of the receiving side.6.3.4.3 The end-to-end transfer delay of a user data block of 30 bytes shall be ≤0.5s (99%).6.3.5 Connection loss rate6.3.5.1 The Connection loss rate is defined as:Number of connections released unintentionally per accumulated connection time.6.3.5.2 The requirements for connection loss rate varies depending on ETCS system variablessuch as T_NVCONTACT and the possible train reactions after connection loss (seesection 10.5).6.3.5.3 If the operational QoS-targets of [EEIG 04E117] are wanted, then the ETCSinfrastructure should be designed in such a way, that at least the following conditionsare fulfilled (Recommended pre-condition for ETCS infrastructure):• T_NVCONTACT ≥ 41s and• M_NVCONTACT different to train trip and• a new MA reach the OBU before standstill.6.3.5.4 If the connection establishment error ratio is <10-2, then the connection loss rate shallbe <10-2/h.6.3.6 Transmission interference6.3.6.1 A transmission interference period T TI is the period during the data transmission phaseof an existing connection in which, caused by the bearer service, no error-freetransmission of user data units of 30 bytes is possible.6.3.6.2 A transmission interference happens, if the received data units of 30 bytes deviatepartially or completely from the associated transmitted data units.6.3.6.3 The transmission interference period shall be < 0.8s (95%), <1s (99%).6.3.6.4 An error-free period T Rec shall follow every transmission interference period to re-transmit user data units in error (e.g. wrong or lost) and user data units waiting to beserved.6.3.6.5 The error-free period shall be >20s (95%), >7s(99%).6.3.7 GSM-R network registration delay6.3.7.1 The GSM-R network registration delay is defined as:Value of elapsed time from the request for registration to indication of successfulregistration by +CREG response.6.3.7.2 The GSM-R network registration delay shall be ≤30s (95%), ≤35s (99%).6.3.7.3 GSM-R network registration delays > 40 s are evaluated as registration errors.6.4 Summary of QoS requirements6.4.1.1 Table 2 contains the summary of QoS requirements at GSM-R interface.QoS Parameter Value (see 6.3) Connection establishment delay of mobile< 8.5s (95%), ≤10s (100%) originated callsConnection establishment error ratio <10-2≤ 0.5s (99%)Maximum end-to-end transfer delay (of 30 bytedata block)Connection loss rate ≤ 10-2 /hTransmission interference period < 0.8s (95%), <1s (99%)Error-free period >20s (95%), >7s(99%)Network registration delay ≤30s (95%), ≤35s (99%), ≤40s (100%)Table 2 Summary of QoS requirements7. R EQUIREMENTS TO FIXED NETWORK INTERFACE7.1 Foreword7.1.1.1 This part of the specification does not define mandatory requirements forinteroperability. It is a preferred solution, in case interchangeability between tracksideRBC and access point to the fixed network is required for a given implementation.7.1.1.2 This section gives only limited information. [EuroRadio FFFIS] must be used for fullcompliance.7.1.1.3 Note: The requirements to fixed network interface refer to a set of ETSI specifications[ETS 300011, ETS 300125, ETS 300102-1]. This set is the basis of conformancerequirements for network terminations. Instead of these specifications updatedspecifications can be referred, if they state that they are compatible with the followingrequirements.7.2 Interfacedefinition7.2.1.1 The ISDN Primary Rate Interface (PRI) shall be provided as specified by [ETS300011].7.2.1.2 The service access point on the fixed network side corresponds with the S2M interfaceat the T-reference point.7.2.1.3 The Basic Rate interface might also be used as an option in some particular cases likeradio infill unit.7.2.1.4 In addition to these interfaces, the V.110 rate adaptation scheme shall be applied tothe user data channel. The RA2, RA1 and RA0 steps are mandatory.7.2.1.5 End-to-end flow control in layer 1 shall not be used.7.3 Communication signalling procedures7.3.1.1 The signalling protocols shall be provided as specified by:a) Link Access Procedure on the D channel [ETS 300125]b) User-network interface layer 3 using Digital Subscriber Signalling [ETS 300102-1]7.3.1.2 ISDN multi-level precedence and pre-emption (MLPP) supplementary service shall beprovided according to the EIRENE specification [EIRENE SRS].7.3.1.3 The SETUP message contains Information Elements including the bearer capabilityand the low layer compatibility (refer to [EuroRadio FFFIS] specifying the Euroradiodata bearer service requirements.8. R EQUIREMENTS TO MOBILE NETWORK INTERFACE8.1 Foreword8.1.1.1 This part of the specification does not define mandatory requirements forinteroperability. It is a preferred solution, in case interchangeability between OBU andMobile Terminal is required for a given implementation.8.1.1.2 This section gives only limited information. [EuroRadio FFFIS] must be used for fullcompliance.definition8.2 Interface8.2.1.1 If an MT2 interface is used at the mobile side, the service access point at the mobilestation corresponds with the R-reference point of the MT2.8.2.1.2 [GSM 07.07] specifies a profile of AT commands and recommends that this profile beused for controlling Mobile Equipment functions and GSM network services through aTerminal Adapter.8.2.1.3 For the mobile termination type MT2 the signalling over the V interface has to be inaccordance with [GSM 07.07], using the V.25ter command set.8.2.1.4 The online command state shall not be used to guarantee interoperability. To avoiddifferent behaviour, it is recommended to enable/disable this escape sequence usingthe appropriate AT command usually referred as ATS2=<manufacturer defined value>.This particular command shall be sent to the mobile terminal as part of its initialisationstring.8.2.1.5 State control using physical circuits is mandatory.8.2.1.6 The V-interface shall conform to recommendation ITU-T V.24. The signals required arespecified in [EuroRadio FFFIS].8.2.1.7 Note that in the case of class 1 mobile originated calls, it is allowed to set the priorityvalue “command control (safety)” at subscription time.8.2.1.8 The call control commands, interface control commands and responses used on the V-interface at the R reference point are specified in [EuroRadio FFFIS].9. A NNEX A(I NFORMATIVE) TRANSMISSION INTERFERENCEAND RECOVERY9.1 General9.1.1.1 The usual QoS parameter used as measure of accuracy of data transmission viatransparent B/B m channels is the bit error rate.9.1.1.2 The QoS parameter relevant for layer 2 accuracy is the HDLC frame error rate.9.1.1.3 It is not possible to define relationships between both rates. The channel behaviour isnot known: error bursts and interruptions of data transmission during radio cellhandover can happen.9.1.1.4 Additionally, statistical distributions of values such as error rates do not accurately mapthe requirements from the ETCS point of view. Transfer of user data is requested inbursts; the transfer delay can be critical for the application. It has to be guaranteed forsome application messages that data can be transferred to the train in a defined timeinterval.9.1.1.5 A model of service behaviour is necessary reflecting all relevant features of GSM-Rnetworks.9.1.1.6 This model can be used as a normative reference for acceptance tests and for networkmaintenance during ETCS operation. It enables the ETCS supplier to demonstrate thecorrect operation of ETCS constituents during conformance testing without thevariations of real world GSM-R networks.9.1.1.7 Transmission interference and recovery is a first approximation of such a servicebehaviour model.9.2 Transmission interference in relation to HDLC9.2.1.1 Transmission interference is characterised by a period in the received data streamduring which the received data units deviate partially or completely from those of thetransmitted data stream. The service user cannot see the causes of transmissioninterference.9.2.1.2 The user data units erroneously transmitted or omitted during the transmissioninterference must be corrected by re-transmission. These re-transmissions result in atime delay and in higher load in the B/B m channel. Therefore, after transmissioninterference a period of error-free transmission, called the recovery period, must follow.9.2.1.3 In the normal data transfer phase after recovery, user data units are transmitted toprovide the data throughput requested by application messages.9.2.1.4 Figure 1 shows a simplified relationship of B/B m channel and HDLC errors: because ofthe selected options for the HDLC protocol (e.g. multi selective reject) the recoveryperiod and the normal data transfer phase are not strictly separated.error-free frameHDLC statecorrupted frameerror-freeChannel stateerroneousFigure 1 B/B m channel and HDLC errors9.2.1.5 Some special cases exist in Figure 1:A Beginning of HDLC frame (corrupted by transmission) is earlier than beginning oftransmission interferenceB Error-free time is not sufficient for transfer of HDLC frameC No HDLC frame is ready for transferD End of corrupted HDLC frame is later than end of transmission interference9.2.1.6 Figure 2 shows as an example the HDLC behaviour in case of transmissioninterference.Figure 2 Event "Transmission interference"9.2.1.7 The sender does not receive an acknowledgement in the case of a corrupted last Iframe of a sequence of I frames. The timer T1 expires and a RR (poll bit set) frame willbe sent.9.2.1.8 After receiving an RR frame with an indication of successful transmission of thepreceding I frame, the lost I frame will be re-transmitted.9.2.1.9 Again the sender does not receive an acknowledgement and requests for thesequence number. Eventually, the transmission is successful but the delivery of userdata will be delayed towards the receiver.9.2.1.10 The occurrence of the above defined event represents a QoS event “Transmissioninterference” at the sender side. The beginning and the end of the transmissioninterference are not exactly known. But the second repetition clearly indicates an event“Transmission interference”:a) The transmission interference time was too long orb) The recovery time was too short.。
李雅普诺夫稳定性自动化专业英语词汇表

.李雅普诺夫稳定性自动化专业英语词汇表公告记录成长的脚印,分享败绩、成功的智慧。
(大部门日记转自采集,如有侵权,即删。
) 日记总数: 47 品题数目: 42 访问次数: 15577 acceptance testing 验收测试 accumulated error积累误差 ac-dc-ac frequency converter 交-直-交变频器 ac(alternatingcurrent)electric drive交流电子传动 active attitude stabilization主动姿态稳定 actuator 驱动器,执行机构 adaline 线性适应元daptation layer适应层 adaptive telemeter system 适应遥测系统 adjoint operator 陪同算子 admissible error容许误差 aggregationmatrix结集矩阵ahp(analytic你好 erarchy process)条理分析法 amplifying element放大环节analog-digital conversion模数转换 ntenna pointing control接收天线指向控制anti-integral windup抗积分饱卷 aperiodic decomposition非周期分解 a posteriori estimate笱楣兰?approximate reasoning类似推理 a priori estimate 先验估计 articulated robot关节型机器人 assignment problem配置问题,分配问题 associative memory model遐想记忆模子 asymptotic stability渐进稳定性 attained pose drift现实位姿漂移 attitude acquisition姿态捕获aocs(attritude and orbit control system)姿态轨道控制系统 attitude angular velocity姿态角速度 attitude disturbance姿态扰动 attitude maneuver 姿态机动 augment ability可扩充性 augmented system增广系统 automatic manual station不用人力-手动操作器 autonomous system自治系统 backlash characteristics间隙特征 base coordinate system基座坐标系bayes classifier 贝叶斯分类器 bearing alignment 方位瞄准 bellows pressure gauge 波纹管压力表 benefit-cost analysis 收入成本分析 bilinear system 双线性系统 biocybernetics 生物控制论 biological feedback system 生物反馈系统black box testing approach 黑箱测试法 blind search 盲目搜索 block diagonalization 块对于角化 boltzman mac 你好 ne 玻耳兹曼机 bottom-up development 自下而上开辟 boundary value analysis 界限值分析 brainstorming method 头脑风暴法 breadth-first search 广度优先搜索 cae(computer aided engineering) 计较机匡助工程 cam(computer aided manufacturing) 计较机匡助创造 camflex valve 偏疼旋转阀 canonical state vari able 标准化状况变量capacitive displacementtransducer 电容式位移传感器 capsule pressure gauge 膜盒压力表 card 计较机匡助研究开辟 cartesian robot 直角坐标型机器人cascadecompensation 串联赔偿 catastrophe theory 突变论 chained aggregation 链式结集 characteristic locus 特征轨迹 chemical propulsion 化学推进classical information pattern 经典信息标准样式 clinical controlsystem 临床控制系统关上 d loop pole 闭环极点关上 d looptransfer function 闭环传递函数cluster analysis 聚类分析 coarse-finecontrol 粗- 精控制 cobweb model 蜘蛛网模子 coefficient matrix 凳?卣?cognitive science 认知科学 coherent system 枯燥关接洽统 combination decision 组合决定计划 combinatorial explosion 组合爆炸combined pressure and vacuum gauge 压力真空表 command pose 指令位姿companion matrix 相伴矩阵 compartmental model 房室模子 compatibility 相容性,兼容性 compensating network 赔偿采集 compensation 赔偿,矫正compliance 柔顺, 适应 composite control 组合控制 computable general equilibrium model 可计较普通均衡模子 conditionallyinstability 条件不稳定性connectionism 毗连机制 conservative system 守恒系统 constraint condition 约束条件 consumption function 消费函数 context-free grammar 上下文无关语法continuous discrete eventhybrid system simulation 连续离散事件混淆系统仿真continuous duty 连续事情制 control accuracy 控制精密度 control cabinet 控制柜controllability index 可控指数 controllable canonical form 可控标准型[control]plant 控制对于象,被控对于象 controlling instrument 控制仪表 control moment gyro 控制力矩捻捻转儿 control panel 控制屏,控制盘 control synchro 控制 [式]自整角机 control system synthesis 控制系统综合 control time horizon 控制时程 cooperativegame 互助对于策 coordinability condition 可协调条件coordinationstrategy 协调计谋 corner frequency 迁移转变频率 costate variable 蔡?淞?cost-effectiveness analysis 用度效益分析 coupling ofrbit and attitude 轨道以及姿态耦合 critical damping 临界阻尼 ritical stability 临界稳定性 cross-over frequency 穿越频率,交越频率 current source inverter 电流[源]型逆变器 cut-off frequency 截止频率 cyclic remote control 循环遥控 cylindrical robot 圆柱坐标型机器人 damped oscillation 阻尼振动 damping ratio 阻尼比 data acquisition 数值采集 data encryption 数值加密 data preprocessing 数值预处理 data processor 数值处理器 dc generator-motor set drive 直流发机电-电动机组传动 d controller 微分控制器 decentralizedstochastic control 分散 rand 控制 decision space 决定计划空间 decisionsupport system 决定计划支持系统 decomposition-aggregation approach 分解结集法 decoupling parameter 解耦参量 deductive-inductive hybrid modeling method 演绎与归纳混淆建模法 delayed telemetry 延时遥测derivation tree 导出树 derivative feedback 微分反馈 describingfunction 描写函数 desired value 希望值deterministic automaton 确定性不用人力机 deviation alarm 误差报警器 dfd 数值流图 diagnosticmodel 诊断模子 diagonally dominant matrix 对于角主导矩阵diaphragmpressure gauge 膜片压力表 difference equation model 差分方程模子differential dynamical system 微分动力学系统 differential game⒎侄圆differential pressure level meter 差压液位计 differentialpressure transmitter 差压变送器 differential transformer displacementtransducer 差动变压器式位移传感器 differentiation element 微分环节 digital filer 数码滤波器 digital signal processing 数码旌旗灯号处理 digitizer 数码化仪 dimension transducer 尺度传感器 direct coordination 直接协调 discrete event dynamic system 离散事件动态系统 discretesystem simulation language 离散系统仿真语言 discriminant function 判别函数 displacement vibration amplitude transducer 位移波幅传感器dissipative structure 耗扩散局 distributed parameter control system 漫衍参量控制系统 disturbance compensation 扰动赔偿 domain knowledge 范畴常识dominant pole 主导极点 dose-response model 剂量反映模子 dual modulation telemetering system 两重调制遥测系统 dualprinciple 对于偶原理 dual spin stabilization 双自旋稳定 duty ratio 负载比 dynamic braking 能耗制动 dynamic characteristics 动态特征 dynamic deviation 动态误差 dynamic error coefficient 动态误差系数 dynamic exactness 动它吻合性 dynamic input-outputmodel 动态投入产出模子 econometric model 计量经济模子 economiccybernetics 经济控制论 economic effectiveness 经济效益 economicvaluation 经济评价 economic index 经济指数 economic in dicator 经济指标 eddy current t 你好 ckness meter 电涡流厚度计 effectivenesstheory 效益意见 elasticity of demand 需求弹性 electric actuator 电动执行机构 electric conductancelevelmeter 电导液位计 electricdrive control gear 电动传动控制设备 electric hydraulic converter 电-液转换器 electric pneumatic converter 电-气转换器electrohydraulicservo vale 电液伺服阀 electromagnetic flow transducer 电磁流量传感器 electronic batc 你好 ng scale 电子配料秤 electronic belt conveyorscale 电子皮带秤 electronic hopper scale 电子料斗秤 emergencystop 异样住手empirical distribution 经验漫衍 endogenous variable 内发生变故量equilibrium growth 均衡增长 equilibrium point 平衡点 equivalence partitioning 等价类区分清晰 error-correction parsing 纠错剖析 estimation theory 估计意见 evaluation technique 评价技术 event chain 事件链evolutionary system 高级演化系统 exogenous variable 外发生变故量 expected characteristics 希望特征 failure diagnosis 妨碍诊断 fast mode 快变模态 feasibility study 可行性研究 feasiblecoordination 可行协调 feasible region 可行域 feature detection 特征检测 feature extraction 特征抽取 feedback compensation 反馈赔偿 feedforward path 前馈通路 field bus 现场总线 finite automaton 有限不用人力机 fip(factory information protocol) 工场信息以及谈 first order predicate logic 一阶谓词逻辑 fixed sequence manipulator 固定挨次机械手 fixed set point control 定值控制 fms(flexiblemanufacturing system) 柔性创造系统 flowsensor/transducer 流量传感器 flow transmitter 流量变送器 forced oscillation 强迫振动 formal language theory 情势语言意见 formal neuron 情势神经元forward path 正向通路 forward reasoning 正向推理 fractal 分形体,分维体frequency converter 变频器 frequency domain modelreduction method 频域模子降阶法 frequency response 频域相应 full order observer 全阶测候器 functional decomposition 功效分解 fes(functional electricalstimulation)功效电刺激 functionalsimularity 功效相仿 fuzzy logic 含糊逻辑 game tree 对于策树 general equilibrium theory 普通均衡意见 generalized least squaresestimation 意义广泛最小二乘估计 generation function 天生函数geomagnetictorque 地磁性矩 geometric similarity 几何相仿 gimbaled wheel 蚣苈global asymptotic stability 全局渐进稳定性 global optimum 全局最优 globe valve 球形阀 goal coordination method 目标协调法 grammatical inference 文法判断 grap 你好 c search 图搜索 gravitygradient torque 重力梯度力矩 group technology 成组技术 guidancesystem 制导系统 gyro drift rate 捻捻转儿漂移率 hall displacementtransducer 霍尔式位移传感器 hardware-in-the-loop simulation 半实物仿真 harmonious deviation 以及谐误差 harmonious strategy 以及谐计谋 heuristic inference 开导式推理你好 dden oscillation 隐蔽振动你好 erarc 你好 calchart 条理布局图你好 erarc 你好 cal planning 递阶规划你好 erarc你好 calontrol 递阶控制 homomorp 你好 c model 同态系统 horizontal decomposition 横向分解 hormonal control 内排泄控制 hydraulic step motor 液压步进马达 hypercycle theory 超循环意见 i controller 积分控制器 identifiability 可辨识性 idss(intelligent decision support system)智能决定计划支持系统 image recognition 图象辨认 impulse function 冲击函数,电子脉冲函数 incompatibility principle 不相容原理 incrementalmotion control 增量运动控制 index of merit 品质因数 inductiveforce transducer 电感式位移传感器 inductive modeling method 归纳建模法 industrial automation 工业不用人力化 inertial attitude sensor 惯性姿态敏锐器 inertial coordinate system 惯性坐标系 inertialwh eel 惯性轮 inference engine 推理机 infinite dimensional system 无限维系统information acquisition 信息采集 infrared gasanalyzer 红外线气体分析器 inherent nonlinearity 本来就有非线性 inherent regulation 本来就有调节 initial deviation 初始误差 injection attitude 入轨姿式input-output model 投入产出模子 instability 不稳定性 instructionlevel language 指令级语言 integral of absolute value of errorcriterion 绝对于误差积分准则integral of squared error criterion 平方误差积分准则 integral performance criterion 积分性能准则 integration instrument 积算摄谱仪 intelligent terminal 智能终端 interactedsystem 互接洽统,关接洽统 interactive prediction approach 互联预估法,关联预估法 intermittent duty 断续事情制ism(interpretivestructure modeling) 诠释布局建模法 invariant embedding principle 不变镶嵌原理 inventory theory 库伦论 inverse nyquist diagram 逆奈奎斯特图 investment decision 投资决定计划 isomorp 你好 c model 同构模子iterative coordination 迭代协调 jet propulsion 喷气推进 job-lot control 分批控制kalman-bucy filer 卡尔曼-布西滤波器 knowledgeaccomodation 常识适应knowledge acquisition 常识获取 knowledgessimilation 常识夹杂kbms(knowledge base management system) 常识库管理系统 knowledge representation 常识抒发 lad der diagram 菪瓮?lag-lead compensation 滞后超前赔偿 lagrange duality 拉格朗日对于偶性 laplace transform 拉普拉斯变换 large scale system 大系统 lateral in 你好 bition network 侧抑制采集 least cost input 最小成本投入 least squares criterion 最小二乘准则 level switch 物位开关 libration damping 天平动阻尼 limit cycle 极限环 linearizationtechnique 线性化要领 linear motion electric drive 直线运动电气传动 linear motion valve 直行程阀 linear programming 线性规划 lqr(linear quadratic regulator problem) 线性二次调节器问题 oad cell 称重传感器 local asymptotic stability 局部渐近稳定性 local optimum 局部最优 log magnitude-phase diagram 对于数幅相图long term memory 长期记忆 lumped parameter model 集总参量模子 lyapunov theorem of asymptotic stability 李雅普诺夫渐近稳定性定理 macro-economic system 宏观经济系统 magnetic dumping 磁卸载 magnetoelastic weig 你好ng cell 磁致弹性称重传感器 magnitude- frequencycharacteristic 幅频特征magnitude margin 幅值裕度 magnitudecale factor 幅值缩尺 man-mac 你好ne coordination 人机协调 manualstation 手动操作器 map(manufacturing automation protocol) 创造不用人力化以及谈 marginal effectiveness 边岸效益mason's gain formula 梅森增益公式 matc 你好 ng criterion 匹配准则 maximum likelihood estimation 最大似然估计 maximum ove rshoot 最大超调量maximum principle 极大值原理 mean-square error criterion 均方误差准则mechanismmodel 机理模子 meta-knowledge 元常识 metallurgical automation 冶金不用人力化 minimal realization 最小使成为事实 minimum phase system 最小相位系统 minimum variance estimation 最小方差估计 minor loop 副回路missile-target relative movement simulator 弹体- 目标相对于运动仿真器 modal aggregation 模态结集 modal transformation 模态变换 mb(model base)模子库model confidence 模子置信度 model fidelity 模子传神度 model reference adaptive control system 模子参考适应控制系统 model verification 模子证验mec(mostconomic control)最经济控制 motion space 可动空间 mtbf(mean time between failures) 均等妨碍距离时间 mttf(mean timeto failures)均等无妨碍时间 multi-attributive utility function 嗍粜孕в 煤??multicriteria 多重判据 multilevel 你好 erarc 你好 cal structure 多级递阶布局 multiloop control 多回路控制 multi- objective decision 多目标决定计划 multistate logic 多态逻辑multistratum 你好 erarc 你好 calcontrol 多段递阶控制 multivariable control system 多变量控制系统 myoelectric control 肌电控制 nash optimality 纳什最优性 naturallanguage generation 自然语言天生 nearest- neighbor 这段邻necessitymeasure 肯定是性侧度 negative feedback 负反馈 neural assembly 神经集合 neural network computer 神经采集计较机 nichols chart 尼科尔斯图noetic science 思维科学 noncoherent system 非枯燥关接洽统 noncooperative game 非互助博弈 nonequilibrium state 非平衡态 nonlinear element 非线性环节nonmonotonic logic 非枯燥逻辑 nonparametric training 非参量训练nonreversible electric drive 不成逆电气传动 nonsingular perturbation 非奇妙摄动 non-stationaryrandom process 非平稳 rand 历程 nuclear radiation levelmeter 核辐射物位计 nutation sensor 章动敏锐器 nyquist stability criterion 奈奎斯特稳定判据 objective function 目标函数 observability index 可测候指数observable canonical form 可测候标准型 on-line assistance 在线帮忙 on- off control 通断控制 open loop pole 开环极点 operational research model 运筹学模子 optic fiber tachometer 光纤式转速表 opt imal trajectory 最优轨迹optimization technique 最优化技术 orbital rendezvous 轨道交会 orbit gyrocompass 轨道捻捻转儿罗经 orbit perturbation 轨道摄动 order parameter 序参量 orientationcontrol 定向控制 oscillating period 振动周期 output predictionmethod 输出预估法 oval wheel flowmeter 椭圆齿轮流量计overalldesign 总体设计 overlapping decomposition 交叠分解 pade approximation 帕德类似 pareto optimality 帕雷托最优性 passive attitude stabilization 不主动姿态稳定 path repeatability 路径可重复性 pattern primitive 标准样式基元 pr(pattern recognition)标准样式辨认 p control 比例控制器 peak time 峰值时间penalty function method 罚函数法 periodic duty 周期事情制 perturbation theory 摄动意见 pessimisticvalue 悲观值 phase locus 相轨迹 phase trajectory 相轨迹hase lead 相位超前 photoelectric tachometric transducer 光电式转速传感器phrase-structure grammar 短句布局文法 physical symbol system 物理符号系统 piezoelectric force transducer 压电式力传感器 playbackrobot 示教再现式机器人 plc(programmable logic controller)可编步伐逻辑控制器 plug braking 反接制动 plug valve 旋塞阀 pneumaticactuator 气动执行机构 point-to-point control 点位控制 polar robot 极坐标型机器人 pole assignment 极点配置 pole-zero cancellation 零极点相消 polynom ial input 多项式输入 portfolio theory 投资配搭意见 pose overshoot 位姿过调量 position measuring instrument 位置丈量仪posentiometric displacement transducer 电位器式位移传感器 positive feedback 正反馈 power system automation 电力系统不用人力化 predicate logic 谓词逻辑pressure gauge with electric contact 电接点压力表 pressure transmitter 压力变送器 price coordination 价格协调 primal coordination 主协调 primary frequency zone 主频区 pca(principal component analysis)主成份分析法principlef turnpike 通途原理 process- oriented simulation 面向历程的仿真production budget 生产预算 production rule 孕育发生式法则 profitforecast 利润预测 pert(program evaluation and review technique) 计划评审技术program set station 步伐设定操作器 proportionalcontrol 比例控制 proportional plus derivative controller 比例微分控制器 protocol engineering 以及谈工程pseudo random sequence 伪 rand 序列 pseudo-rate-increment control 伪速度增量控制 pulse duration 电子脉冲持续时间 pulse frequency modulation control system 电子脉冲调频控制系统 pulse width modulation controlsystem 电子脉冲调宽控制系统 pwm inverter 脉宽调制逆变器 pushdown automaton 下推不用人力机 qc(quality control)质量管理 quadratic performance index 二次型性能指标 quali tative physical model 定性物理模子quantized noise 量化噪声 quasilinear characteristics 准线性特征 queuing theory 列队论 radio frequency sensor 射频敏锐器 ramp function 斜坡函数 random disturbance rand 扰动 random process rand 历程 rateintegrating gyro 速度积分捻捻转儿 ratio station 比率操作器 reactionwheel control 反效用轮控制realizability 可以使成为事实性,能使成为事实性 eal time telemetry 实时遥测receptive field 感受野 rectangularrobot 直角坐标型机器人 recursive estimation 递推估计 reducedorder observer 降阶测候器 redundant information 冗余信息 reentrycontrol 再入控制 regenerative braking 回馈制动,再生制动 regionalplanning model 地区范围规划模子 regulating device 调节装载 relationalalgebra 关系代数 relay characteristic 继电器特征 remote manipulator 遥控操作器 remote set point adjuster 远程设定点调整器 rendezvo 目前世界上最强大的国家 nd docking 交会以及对于接 resistance thermometer sensor 热电阻 esolution principle 归结原理 resource allocation 资源分配responsecurve 相应曲线 return difference matrix 回差矩阵 return ratiomatrix 回比矩阵 reversible electric drive 可逆电气传动 revoluterobot 关节型机器人revolution speed transducer 转速传感器 rewritingrule 重写法则 rigid spacecraft dynamics 刚性航天动力学 riskdecision 危害分析 robotics 机器人学 robot programming language 机器人编程语言 robust control 鲁棒控制 roll gap measuring instrument 辊缝丈量仪 root locus 根轨迹 roots flowmeter 腰轮流量计otameter 浮子流量计,转子流量计 rotary eccentric plug valve 偏疼旋转阀 rotary motionvalve 角行程阀 rotating transformer 旋转变压器 routh approximation method 劳思类似判据 routing problem 肪段侍?sampled-data control system 采样控制系统 sampling controlsystem 采样控制系统 saturation characteristics 饱以及特征 scalarlyapunov function 标量李雅普诺夫函数 scara(selective complianceassembly robot arm) 最简单的面关节型机器人 scenario analysis method 情景分析法 scene analysis 物景分析 self- operated controller 自力式控制器 self-organizing system 自组织系统 self-reproducing system 自繁殖系统self-tuning control 自校正控制 semantic network 语义采集 semi-physical simulation 半实物仿真 sensing element 敏锐元件 sensitivity analysis 活络度分析sensory control 觉得控制 sequentialdecomposition 挨次分解 sequential least squares estimation 序贯最小二乘估计 servo control 伺服控制,随动控制servomotor 伺服马达 settling time 过渡时间 short term planning 短期计划shorttime horizon coordination 短时程协调 signal detection and estimation 旌旗灯号检测以及估计 signal reconstruction 旌旗灯号重构 simulated interrupt 仿真中断 simulation block diagram 仿真框图 simulation experiment 仿真实验simulation velocity 仿真速度 single axle table 单轴转台 single degree of freedom gyro 单自由度捻捻转儿 single levelprocess 单级历程 single value nonlinearity 单值非线性 singularattractor 奇妙吸引子 singular perturbation 奇妙摄动 slave dsystem 受役系统 slower-than-real-time simulation 欠实时仿真slow subsystem 慢变子系统 socio-cybernetics 社会形态控制论 socioeconomic system 社会形态经济系统软体 psychology 软件生理学 solar array pointing control 日头帆板指向控制 solenoid valve 电磁阀 speed control system 魉傧低spin axis 自旋轴 stability criterion 稳定性判据 stabilitylimit 稳定极限 stabilization 镇定,稳定 stackelberg decision theory 施塔克尔贝格决定计划意见 state equation model 状况方程模子 state space description 状况空间描写 static characteristics curve 静态特征曲线 station accuracy 定点精密度stationary random process 平稳 rand 历程 statistical analysis 统计分析 statistic pattern recognition 统计标准样式辨认 steady state deviation 稳态误差steadystate error coefficient 稳态误差系数 step-by-step control 步进控制step function 阶跃函数 stepwise refinement 慢慢精化 stochasticfinite automaton rand 有限不用人力机 strain gauge load cell 应变式称重传感器 strategic function 计谋函数 strongly coupled system 狂詈舷低?subjective probability 主观频率 supervised training 喽窖??supervisory computer control system 计较机监控系统 sustainedoscillation 矜持振动 swirlmeter 旋进流量计 switc 你好 ng point 切换点 symbolic processing 符号处理 synaptic plasticity 突触可塑性syntactic analysis 句法分析 system assessment 系统评价 systemhomomorp 你好sm 系统同态 system isomorp 你好 sm 系统同构 system engineering 系统工程target flow transmitter 靶式流量变送器 task cycle 功课周期 teac 你好 ng programming 示教编程 telemetering system ofrequency division type 频分遥测系统 teleological system 目的系统 temperature transducer 温度传感器template base 模版库 theoremproving 定理证实 therapy model 治疗模子 t 你好ckness meter 厚度计 three-axis attitude stabilization 三轴姿态稳定 three state controller 三位控制器 thrust vector control system 推力矢量控制系统 time constant 时间常数 time-invariant system 定常系统,非时变系统 time schedule controller 时序控制器 time-sharing control 分时控制 time-varying parameter 时变参量 top-down testing 自上而下测试topological structure 拓扑布局 tqc(total quality control)全面质量管理 tracking error 跟踪误差 trade-off analysis 权衡分析 transfer function matrix 传递函数矩阵transformation grammar 转换文法 transient deviation 瞬态误差 transient process 过渡历程 transition diagram 转移图 transmissible pressure gauge 电远传压力表 trend analysis 趋向分析 triple modulation telemetering system 三重调制遥测系统 turbine flowmeter 涡轮流量计 turing mac 你好 ne 剂榛?two-time scale system 双时标系统 ultrasonic levelmeter??镂患?unadjustable speed electric drive 非调速电气传动 unbiasedestimation 无偏估计 uniformly asymptotic stability 一致渐近稳定性 uninterrupted duty 不间断事情制,长期事情制 unit circle 单位圆 unit testing 单位测试 unsupervised learing 非监视进修upperlevel problem 较高等级问题 urban planning 城市规划 utility function 效用函数 value engineering 价值工程 variable gain 可变增益,可变放大系数 variable structure control system 变布局控制 vectorlyapunov function 向量李雅普诺夫函数 velocity error coefficient 速度误差系数 velocity transducer 速度传感器vertical decomposition 纵向分解 vibrating wire force transducer 振弦式力传感器 viscousdamping 粘性阻尼 voltage source inverter 电压源型逆变器vortexprecession flowmeter 旋进流量计 vortex shedding flowmeter 涡街流量计 wb(way base) 要领库 weig 你好 ng cell 称重传感器 weightingfactor 权因数weighting method 加权法 w 你好 ttaker-shannon samplingtheorem 惠特克-喷鼻农采样定理 wiener filtering 维纳滤波 work stationfor computer aided design 计较机匡助设计事情站 w-plane w 最简单的面 zero-based budget 零基预算 zero-input response 零输入相应 zero-stateresponse 零状况相应 zero sum game model 零以及对于策模子2022 年 07 月 31 日历史上的今天:ipad2 怎么贴膜好吧,我还是入了 iPad2 2022-06-26 斗破苍穹快眼看书 2斗破苍穹 22 下载 20 11-06-26特殊声明:1:资料来源于互联网,版权归属原作者2:资料内容属于网络意见,与本账号立场无关3 :如有侵权,请告知,即将删除。
Interference Alignment and Cancellation

p1
Client
h12
AP
h21 h22
p2
y2
y1 = h11 p1 + h21 p2
y2 = h12 p1 + h22 p2
Figure 1: Throughput of current MIMO LANs is limited by the number
of antennas per AP. The hi j ’s are known channel coefficients, and the pi ’s are concurrent packets. The client transmits two concurrent packets. The AP receives a different linear combination of the transmitted packets on each antenna, which it solves to obtain the packets.
a second 2x2 client-AP pair on the same wireless channel and within interference range. Can the second client-AP pair concurrently upload a third packet? In existing MIMO LANs, the three concurrent packets interfere. As a result, each of the two APs gets two linear equations with three unknown packets, and hence cannot decode. In contrast, IAC allows these three concurrent packets to be decoded. To do so, IAC exploits two properties of MIMO LANs: 1) MIMO transmitters can control the alignment of their signals at a receiver, and 2) APs are typically connected to a backend Ethernet, which they can use for coordination. Thus, in IAC, the two clients encode their transmissions in a special way to align the second and the third packets at AP1 but not at AP2, as shown in Fig. 2. As a result, AP1 can treat the second and third packets as one unknown; i.e., AP1 has the equivalent of two equations with two unknowns, allowing it to decode the first packet, p1 . AP1 then sends the decoded packet on the Ethernet to AP2, which can now perform interference cancellation to subtract the effect of the known packet. As a result, AP2 is left with two linear equations over two unknown packets, p2 and p3 , which it can decode. The system delivers three packets per time unit. Hence, its throughput is not bounded by the number of antennas per AP. Note the synergy between interference alignment and interference cancellation. Interference alignment aligns a subset of the packets at the first AP, allowing it to locally decode one packet and hence bootstrap the decoding process. Interference cancellation enables other APs to use the decoded packet to cancel its interference, and hence decode more packets. Neither interference alignment nor cancellation would be sufficient on its own to decode the three packets in Fig. 2.
中英对照频谱效率

频谱效率频谱效率Spectral efficiency、Spectrum efficiency是指在数位通信系统中的限制下,可以传送的资料总量;在有限的波下,物理层通信协议可以达到的使用效率有一定的限度;➢链路频谱效率数字通信系统的链路频谱效率Link spectral efficiency的单位是. 1/4~~1/5 ~+ ~~最大8 最大1/5通常通常+最大通常8最大通常~ 11 8 ~1/5 ~+ ~ 11 8 ~光纤用数位电视TV38 6 1Spectral efficiencySpectral efficiency, spectrum efficiency or bandwidth efficiency refers to the that can be transmitted over a given in a specific communication system. It is a measure of how efficiently a limited frequency spectrum is utilized by the protocol, and sometimes by the the protocol.Link spectral efficiencyThe link spectral efficiency of a digital communication system is measured in It is the useful information rate excluding or divided by the in hertz of a or a . Alternatively, the spectral efficiency may be measured in in bit/symbol, which is equivalent to bits per bpcu, implying that the net bit rate is divided by the modulation rate or line code pulse rate.Link spectral efficiency is typically used to analyse the efficiency of a method or , sometimes in combination with a FEC code and other physical layer overhead. In the latter case, a "bit" refers to a user data bit; FEC overhead is always excluded.The modulation efficiency in bit/s is the including any error-correcting code divided by the bandwidth.Example 1: A transmission technique using one of bandwidth to transmit 1,000 bits per second has a modulation efficiency of 1 bit/s/Hz.Example 2: A modem for the telephone network can transfer 56,000 bit/s downstream and 48,000 bit/s upstream over an analog telephone network. Due to filtering in the telephone exchange, the frequency range is limited to between 300 hertz and 3,400 hertz, corresponding to a bandwidth of 3,400 300 = 3,100 hertz. The spectral efficiency or modulation efficiency is 56,000/3,100 = bit/s/Hz downstream, and 48,000/3,100 = bit/s/Hz upstream.An upper bound for the attainable modulation efficiency is given by the or as follows: For a signaling alphabet with M alternative symbols, each symbol represents N= log2M bits. N is the modulation efficiency measured in bit/symbol or bpcu. In the case of or with a baseband bandwidth or upper cut-off frequency B, the can not exceed 2B symbols/s in view to avoid . Thus, the spectral efficiency can not exceed 2N bit/s/Hz in the baseband transmission case. In the passband transmission case, a signal with passband bandwidth W can be converted to an equivalent baseband signal using or a , with upper cut-off frequency W/2. If double-sideband modulation schemes such as QAM, ASK, PSK or OFDM are used, this results in a maximum symbol rate of W symbols/s, and in that the modulation efficiency can not exceed N bit/s/Hz. If digital is used, the passband signal with bandwidth W corresponds to a baseband message signal with baseband bandwidth W, resulting in a maximum symbol rate of 2W and an attainable modulation efficiency of 2N bit/s/Hz.Example 3:An 16QAM modem has an alphabet size of M= 16 alternative symbols, with N = 4 bit/symbol or bpcu. Since QAM is a form of double sideband passband transmission, the spectral efficiency cannot exceed N = 4 bit/s/Hz.Example 4:The 8-level vestigial sideband modulation scheme used in the gives N=3 bit/symbol or bpcu. Since it can be described as nearly single-side band, the modulation efficiency is close to 2N= 6 bit/s/Hz. In practice, ATSC transfers a gross bit rate of 32 Mbit/s over a 6 MHz wide channel, resulting in a modulation efficiency of 32/6 = bit/s/Hz.Example 5:The downlink of a modem uses a pulse-amplitude modulation with 128 signal levels, resulting in N= 7 bit/symbol. Since the transmitted signal before passband filtering can be considered as baseband transmission, the spectral efficiency cannot exceed 2N = 14 bit/s/Hz over the full baseband channel 0 to 4 kHz. As seen above, a higher spectral efficiency is achieved if we consider the smaller passband bandwidth.If a code is used, the spectral efficiency is reduced from the uncoded modulation efficiency figure.Example 6:If a forward error correction FEC code with 1/2 is added, meaning that the encoder input bit rate is one half the encoder output rate, the spectral efficiency is 50% of the modulation efficiency. In exchange for this reduction in spectral efficiency, FEC usually reduces the , and typically enables operation at a lower SNR.An upper bound for the spectral efficiency possible without in a channel with a certain SNR, if ideal error coding and modulation is assumed, is given by the . Example 7:If the SNR is 1 times expressed as a ratio, corresponding to 0 , the link spectral efficiency can not exceed 1 bit/s/Hz for error-free detection assuming an ideal error-correcting code according to Shannon-Hartley regardless of the modulation and coding.Note that the the amount of application layer useful information is normally lower than the used in the above calculations, because of packet retransmissions, higher protocol layer overhead, flow control, congestion avoidance, etc. On the other hand, a data compression scheme, such as the or compression used in telephone modems, may however give higher goodput if the transferred data is not already efficiently compressed.The link spectral efficiency of a wireless telephony link may also be expressed as the maximum number of simultaneous calls over 1 MHz frequency spectrum in erlangs per megahertz, or /MHz. This measure is also affected by the source coding data compression scheme. It may be applied to analog as well asdigital transmission.In wireless networks, the link spectral efficiency can be somewhat misleading, as larger values are not necessarily more efficient in their overall use of radio spectrum. In a wireless network, high link spectral efficiency may result in high sensitivity to co-channel interference crosstalk, which affects the capacity. For example, in a network with frequency reuse, and reduce the spectral efficiency in bit/s/Hz but substantially lower the requiredsignal-to-noise ratio in comparison to non-spread spectrum techniques. This can allow for much denser geographical frequency reuse that compensates for the lower link spectral efficiency, resulting in approximately the same capacity the same number of simultaneous phone calls over the same bandwidth, using the same number of base station transmitters. As discussed below, a more relevant measure for wireless networks would be system spectral efficiency in bit/s/Hz per unit area. However, in closed communication links such as telephone lines and cable TV networks, and in noise-limited wireless communication system where co-channel interference is not a factor, the largest link spectral efficiency that can be supported by the available SNR is generally used.System spectral efficiency or area spectral efficiencyIn digital , the system spectral efficiency or area spectral efficiency is typically measured in bit/s/Hz per unit area, bit/s/Hz per , or bit/s/Hz per site. It is a measure of the quantity of users or services that can be simultaneously supported by a limited radio frequency bandwidth in a defined geographic area. It may for example be defined as the maximum or , summed over all users in the system, divided by the channel bandwidth. This measure is affected not only by the single user transmission technique, but also by schemes and techniques utilized. It can be substantially improved by dynamic . If it is defined as a measure of the maximum goodput, retransmissions due to co-channel interference and collisions are excluded. Higher-layer protocol overhead above the sublayer is normally neglected.Example 8:In a cellular system based on FDMA with a FCA cellplan using a of 4, each base station has access to 1/4 of the total available frequency spectrum. Thus, the maximum possible system spectral efficiency in bit/s/Hz per site is 1/4 of the link spectral efficiency. Each base station may be divided into 3 cells by means of 3 sector antennas, also known as a 4/12 reuse pattern. Then each cell has access to 1/12 of the available spectrum, and the system spectral efficiency in bit/s/Hz per cell or bit/s/Hz per sector is 1/12 of the link spectral efficiency.The system spectral efficiency of a may also be expressed as the maximum number of simultaneous phone calls per area unit over 1 MHz frequency spectrum in /MHz per cell, E/MHz per sector, E/MHz per site, or E/MHz/m2. This measure is also affected by the source coding data compression scheme. It may be used in analog cellular networks as well.Low link spectral efficiency in bit/s/Hz does not necessarily mean that an encoding scheme is inefficient from a system spectral efficiency point of view. As an example, consider , which is not a particularly spectral efficient encoding scheme when considering a single channel or single user. However, the fact that one can "layer" multiple channels on the same frequency band means that the system spectrum utilization for a multi-channel CDMA system can be very good. Example 9:In the 3G cellular system, every phone call is compressed to a maximum of 8,500 bit/s the useful bitrate, and spread out over a 5 MHz wide frequency channel. This corresponds to a link throughput of only 8,500/5,000,000 = bit/s/Hz. Let us assume that 100 simultaneous non-silent simultaneous calls are possible in the same cell. makes it possible to have as low a frequency reuse factor as 1, if each base station is divided into 3 cells by means of 3 directional sector antennas. This corresponds to a system spectrum efficiency of over 1 × 100 × = bit/s/Hz per cell or sector.The spectral efficiency can be improved by techniques such as efficient fixed or dynamic , , and .A combined and system spectral efficiency measure is the .Comparison tableExamples of numerical spectral efficiency values of some common communication systems can be found in the table below.Spectral efficiency of common communication systems.Service Standard LaunchedyearR percarrierMbit/sB percarrierMHzLinkspectralefficiencyR/Bbit/s/HzTypical1/KSystemspectralefficiencyApprox.R/B/Kbit/s/Hz persitecellular 198117cellular 198317cellular 1991× 8timeslots=1913in 1999cellular1991× 3timeslots=1913in 1999in1997 1× voice200Max. per per 1 fully0 mobilemobile loaded+2003 Max.: ; Typ.: ;Max.: ; Typ.: ; 13HS +Max.: ; Typ.: ;Max.: ; Typ.: ;13cellular FDD2001 Max.: per mobile; 5 Max.: permobile;1cellular 1x PD2002 Max.: per mobile;Max.: permobile;1fully loaded cellular 1×EV -DO 2002Max.:permobile;Max.: permobile;1averag e loaded sectorFixed2004 9620 , ,7, ...14cellular2007Max.: 21 per mobile; 5Max.: permobile;12005 Max.: per carrier; Max.: percarrier;12009 Max.: per mobile;20 Max.: permobile; 1Max.: ; 200Max.: 54; 20 Max.: ;133200 7 Max.: ; 20 Max.: ; 13199 8 4 timeslots =199 5 to to 15towith 1995to to 1 to 1997Max.: ;Typ.: ;8Max.: ;Typ.: ;15with 1996Max.: ;Typ.: ;8Max.: ;Typ.: ;1Max.:;Typ.:;2007to 11 8 to 15towith 2007to 11 8 to 1 tomode 38 6 N/A N/A downlink 12 N/A N/A 1999N/A 14。
IMPULSE NOISE CANCELLATION IN MULTICARRIER TRANSMISSION

IMPULSE NOISE CANCELLATION IN MULTICARRIER TRANSMISSION Fatma Abdelkefi,Abraham Gabay,Pierre DuhamelLSS SUPELEC,F-91192GIF sur YVETTE Cedex FranceENST,Dept.TSI,46rue Barrault,75634Paris Cedex13,FranceABSTRACTA parallel between Reed Solomon codes in the complexfield and multicarrier transmission using OFDM isfirst presented.This shows that when the signal is sent over some channel composed of Gaussian plus impulse noise,the impulse noise can be removed by a procedure similar to channel decoding,using information car-ried by the”syndrome”.These results arefirst derived in a simple situation(oversampled DMT,additive channel),which is merely of theoretical interest.Several extensions are then provided in or-der to increase the practical usefulness of the method.Simulations combining classical convolutive codes with the above mentioned approach are provided.1.INTRODUCTIONThe main idea behind OFDM is to split the transmitted data se-quence into parallel symbol sequences.This structure allows the use of a very simple equalization scheme when the signal is sent over multipath propagation channels.In fact,intersymbol in-terference(ISI)can be avoided when a guard interval(IG)is imple-mented between each block of time domain samples to be transmit-ted.However,some carriers can be strongly attenuated,then it is necessary to incorporate a powerful channel coder combined with frequency and time interleaving.In this way,close coded bits are not likely to fall simultaneously in a spectral null.Therefore,the coded orthogonal frequency division multiplex(COFDM)tech-nique has become extremely popular in many applications,such as broadcasting,ADSL modems,Local area Networks(HiperLAN2). However,in some of these applications,it is well known that chan-nel noise is not only made from measurement(Gaussian)noise,but also encompasses some large bursts of errors.In this case,we propose to use the OFDM modulator as some specific impulse noise canceller,the structure of which is well suited to the nature of the problem(i.e.a single impulse shows up as a single error),rather than counting on the classical chan-nel coder to solve the problem.Practically,of course,both type of codes will have to cooperate,in order to process both Gaussian and impulse noise.Note that the proposed approach makes use of techniques that are similar to previous papers by Wolf[1]and Redinbo[2].The contributions of this paper are:(i)RS decoding in the complex field is easily applied in OFDM system,(ii)they can be extended in the sense that the pilot tones can be seen as additional syndromes, (iii)the method still holds when ISI is present,(iv)a combination of classical and complex codes is efficient under the presence of Gaussian plus impulse noise.2.TRANSMISSION SCHEME AND CONNECTION WITHSPECTRAL CODES2.1.Discrete model of OFDM systemA binary message is coded and mapped to a sequence of complex data stream which belong to a given constellation.The OFDM system splits the initial data stream(to be transmitted at rate)into substreams,each one being transmitted over its own carrier.All symbols emitted during the same duration constitute an OFDM symbol[3].The orthogonality property between carriers ensures the perfect recon-struction of the emitted symbols at the receiver.A discrete model of the OFDM system is easily obtained by computing samples of the signal to be sent onto the channel during one OFDM symbol.i.e.,(the sampling period).Moreover,if one considers the simple multi-carrier system where the prototypefilter is a rectangular pulse of duration,modulated with spacing between carriers equal to ,these samples are computed as:which is exactly the inverse discrete Fourier Transform(IDFT)of the sequence enlarged by zeroes.In the following,we assume that,a positive integer.At the receiver the Analog to Digital Converter(ADC)sam-ples the signal,at rate and a DFT is performed.Therefore, the received signal is converted into the frequency domain, where is given by the following equation:where is the length Fourier transform of the noise sequence (see Fig.1)2.2.Channel model and capacityFirst assuming a memoryless channel,each emitted sample is mod-ified by the channel according towhere is additive white Gaussian noise(AWGN)with zero mean and variance and is the impulse noise.The impulse noise is an additive disturbance that arises pri-marly from the switching electric equipment[4].In the following, the impulse noise is modeled as in[5]as:where stands for a Bernoulli process,an i.i.d.sequence of ze-roes and ones with,and is a complex white Gaussian noise with zero mean and variance such as. Note that this model assumes the presence of a large interleaver, so that bursts of errors can be scattered along time,resulting in independent noise sequences.Under this model,the probability density of the channel noise can be expressed aswhere is the Gaussian density with mean and variance.This expression allows to compute the capacity of this chan-nel,in order to estimate the impact of a given impulse noise on the capacity of a Gaussian channel.Practically,this capacity has been computed by an iterative procedure proposed by Blahut and Arimoto[6]applicable to arbitrary discrete memoryless channels.Fig.2depicts the capacity of the“Gaussian plus Bernoulli Gaus-sian”channel in bits per second normalized by the bandwidth of the channel(W),as a function of P for several values of,, .We note that,even for somewhat large values of ,the capacity of the channel is approximately similar to that of the AWGN channel.For example,if,and P=1,then the capacity of the“Gaussian plus Bernoulli plus Bernoulli Gaussian”channel is,which is approximately the same value as for the AWGN channel.If then we transmit at most 3.3bits/s/Hz that means that we lost only0.7bit per second/Hz, this decrease of capacity being due to the impulse error.However, if no specific procedure is used in an OFDM system,it is unlikely that such similar performances can be obtained:consider the case of a64QAM constellation emitted over64subbands.Each im-pulse drastically impairs384bits at a time,and it can be stated that the OFDM demodulator acts as an impulsive noise ampli-fier...This is clearly in favor of a processing taking into account the specific nature of the impulsive noise and the OFDM system.2.3.Spectral codesWe have seen above that implementing an OFDM modulation is similar to adding consecutive null symbols at the input of the block to be modulated.Since the zeroes emitted through a“Gaussian plus Bernoulli Gaussian”channel are not recovered after demodu-lation,a question arises:to have performance similar to the ones of AWGN channel,is it possible to remove the impulse error with the sole knowledge that some of the demodulator input should be null?The similarity between OFDM modulator and RS codes can be used at that point,following the work by Blahut.It has been shown in[7],that the ideas of spectral coding theory can be translated in the frequency domain,i.e.over the complexfield.Reed Solomon codes can be defined[7]as follow:Definition1Let F contain an element of order M.The(M,M-2t) Reed Solomon block length M with symbols in F is the set of all vectors c whose spectrum(in F)satisfies:where.This is described briefly as an(M,M-2t) Reed Solomon code over F.The spectrum of a Reed Solomon codeword lives in the samefield as the code word.Then,to form a Reed Solomon code,a block of ()consecutive spectral components are chosen as parity frequen-cies,(to be set to zero)and the remaining are information symbols. Marshall[8]has shown that conventional decoding algorithm for finitefield cyclic codes could be employed for real and complex numbers.The basic remark that we have used in this work is that a dis-crete sequence of complex numbers containing()consecutive zeroes are transmitted over the OFDM system,therefore,the out-put of the OFDM modulator can be considered as a Reed Solomon codeword(their spectrum contains consecutive zeroes).After trans-mission over“Gaussian plus Bernoulli Gaussian”channel,the DFT of the received discrete time sequence no longer has()zeroes, and this is due only to the channel.Hence,the OFDM modulator can be seen as a complex-valued RS code,the correction capacity is given by:BCH Bound1if(2t consecutive frequencies belong to)then ().where is the set of the()zeroes.However,strictly speaking,there are more than er-rors if one uses our channel model:all samples are polluted by noise.Therefore,we concentrate on the removal of the sole im-pulse noise,considering the Gaussian component as background noise.The classical decoding techniques have to be adapted to the presence of this background noise.3.DECODING ALGORITHMThe procedure is as follows:choose a classical decoding algo-rithm,adapt it to the presence of the background noise,and correct the estimated errors.Redinbo[2]recently presented a decoding procedure for real number constructed in the discrete Fourier trans-form(DFT)domain.In our work,performed simultaneously in the context of joint source and channel coding[9],the basic algorithm was different,since we used a modified Peterson-Gorenstein-Zierler algorithm to locate and correct“impulse errors”,based only on a syndrome evaluation(the()consecutive zeroes that one should observe at the output of the OFDM modulator in the absence of noise).After transmission,the corresponding received components ofwill no longer be null(Fig.1)where if the DFT of the impulse noise,and that of the background noise.At the receiver,the correction of impulse noise must operate on the syndromes which are given by:.There are two contributions in these terms:one is the Fourier transform of the Gaussian background noise,hence is still Gaus-sian,and the other one is a sum of Fourier transforms of impulses, hence is a sum of complex sinusoids,the frequencies of which cor-respond to the localization of the errors.The decoding problem is thus the estimation of the number of sinusoids,together with their frequencies and amplitudes,polluted by Gaussian noise.The two main differences with classical signal processing situations are(i) that the number of samples is orders of magnitude smaller than usual,(ii)that one has the knowledge that the frequencies take in-teger values.The decoding algorithm works in three steps:(i)estimate the number of impulse errors(ii)seek the error locations and(iii) correct the errors.Classically,the procedure isfinished at this step. We have added a control step,which is able to carefully estimate whether the decoding procedure has worked correctly.In this way, we are able to begin a truncated enumeration of all possible er-ror localizations(the most sensitive part of the algorithm)among the most likely ones...This truncated enumeration is necessary be-cause of the presence of the background noise which introduces some fuzziness in the computations.4.EXTENSIONSThe procedure just described cannot be applied as such in OFDM system,since the zeroes do not correspond to a part of the spec-trum which is actually available(analog shapingfilters are here to limit the bandwidth).Only a small number of these zeroes can be practically used.However,in many cases,pilot tones are emitted, for synchronization or channel estimation purposes.These pilot tones consist in known symbols that are emitted,scattered among the information ones.We outline below that a procedure similar to that of the RS decoding can be used in this situation.This is easily understood by combining situations in which:(i)()consecutive symbols are known(and not null),(ii)the pilot symbols are uniformly dis-tributed,and(iii)when the pilot symbols are uniformly distributed and a channel is considered in addition to the“Gaussian plus Bernoulli Gaussian”channel.Two extensions are trivial,and will not be detailed due to lack of space:if the emitted symbols are known(rather than zero),theextension consists in subtracting the known value.The restof the algorithm remains unchanged.if the OFDM system goes through a channel with ISI,oneuses the classical cyclic prefix procedure,which transformsthe ISI channel to a set of parallel multiplicative constants.If this channel is known(which is assumed),divide by thecorrect constant,and the algorithm explained above applieswith minimal modifications.The only point which is more tricky is the extension when the pilot tones are scattered among the symbols.A special case when the pilot tones are regularly spaced can be deduced from the Hartmann-Tzeng theorem[10]:Theorem1Suppose that thefield F contains an element of order and locate the syndromes in blocks of size.Then the error correction capacity of the code is upper bounded by if.This theorem is easily used in a special case,whenand blocks have size.So no loss in error correction capacity occurs because then correction capacity is.Therefore, decoding can be performed in the same way as already explained.5.SIMULATIONSDue to short space,the simulations concentrate on the efficiency of the impulse noise cancellation.The BER curves,and the com-bination with classical coders will be presented in greater details in a forthcoming paper.Afirst simulation is concerned with the plain,initial algorithmusing only the consecutive null carriers,and the straightforwardanalogy between OFDM systems and BCH codes.The total num-ber of carriers is65,the number of zeroes is12,the probabilityof impulsive noise,and4QAM symbols are emitted.One can observe on Fig.3,where we plot1/EQM(dB),that the RS code in the complex domain has met the expectations, since after decoding,the EQM between the emitted and received symbols closely follows the curve containing the Gaussian noise only.The second simulation is reminiscent of the HiperLan2stan-dard,although we do not claim at present any practical usefulnessin this context.The number of carriers is and the guard interval has length samples.This second curve also plots the1/EQM(dB),but in a situation containing a mixture of all ex-tensions we have developed:Among the carriers,carri-ers are null-carriers.Among the remaining,,arefixed pilots carrying known4QAM symbols while subcarriers,convey the information.The zeroes and the pilot symbols are uniformly dis-tributed.Low-level Gaussian noise samples with variance are added to each position independently,modeling the background noise.We also included a channel C,which is a realization of the typical channel Model A specified by Hiperlan2.For this simula-tion,the parameter of the Bernoulli sequence is and the variance of the impulse noise.The algorithm also shows good behavior under these circum-stances,since curve after correction of the impulse noise is only marginally different from the curve obtained with Gaussian noise only(see Fig.4).Fig.5,shows the performances in terms of BER,under thesame conditions as those explained for Fig.4.The improvement interms of EQM clearly also shows in terms of BER.Note that thissimulation was not containing any classical channel coder.Thequestion which remains to be answered concerns the amount of re-dundancy which has to be assigned to the RS code in the complex field(if the inherent one using the pilot tones is not sufficient)com-pared to that which is devoted to the classical convolutive code.6.CONCLUSIONIn this paper we have described a procedure for removing impulse noise in OFDM system.Implementing a digital OFDM modulator often requires working with an oversampled version of the emit-ted analog signal,this is functionally similar to add null consec-utive symbols to the block to be transmitted.The impulse error-correcting procedure is based on the relationship between Fourier transform and Reed Solomon codes defined over thefield of com-plex numbers.A suitably modified Peterson-Gorenstein-Zierler was examined as an alternative for determining impulse error lo-cation.This procedure can also be applied when pilot symbol are uniformly distributed in the output of the OFDM modulator.Many extensions are under consideration,in order to increase the practi-cal usefulness of this approach.AcknowledgmentsContributions of O.Rioul,who introduced us to BCH codes in the reals,and F.Alberge,for help in the manuscript and numerous discussions are great fully acknowledged.Channel P/S S/PDAC ADCN-1I(n)c(n)r(n)Y(n)DFT IDFT Y 0Y SY M-1II 0N-1MMFig.1.OFDM systemFig.2.The “Gaussian plus Bernoulli Gaussian ”channelcapacityFig.3.Distortion performance when we consider a “Gaussian plus Bernoulli Gaussian ”channel,and consecutive syndrome locationsFig.4.Distortion performance when we consider a channel C,scattered null carriers and pilots tonesFig.5.BER performance when we consider a channel C,scattered null carriers and pilots tones7.REFERENCES[1]Jack Keil Wolf,“Redundancy,the discrete fourier transform,and impulse noise cancellation,”IEEE m.,vol.31,no.3,March 1983.[2]G.Robert Redinbo,“Decoding real block codes:Activitydetection,wiener estimation,”IEEE Trans.Inf.Theory ,vol.46,no.2,March 2000.[3]Heidi Steendam and Marc Moeneclaey,“Analysisand optimization of the performance of OFDM on frequency-selective time-selective fading channels,”IEEE ,vol.47,no.12,December 1999.[4]J.G.Proakis,Digital Communication ,New York,mcgraw-hill edition,1989.[5]Monisha Ghosh,“Analysis of the Effect of Impulse Noiseon Multicarrier and Single Carrier QAM Systems,”IEEE ,vol.44,February 1996.[6]Richard E.Blahut,“Computation of channel capacity andrate-distortion functions,”IEEE m.Theory ,vol.IT-18(4),pp.460–473,1972.[7]Richard.E.Blahut,Algebraic Methods for Signal Processingand Communications Coding ,Signal Processing and Digital Filtering ,C.S Burrus ed.Spring-Verlag:New York,1992.[8]T.G.Marshall,“Decoding of Real-Number Error-CorrectionCodes,”in Proc of GLOBECOM 83,San Diego,Nov 1983.[9]Abraham Gabay,“Spectral Interpolation Coder for ImpulseNoise Cancellation over a Binary Symmetric Channel,”EU-SIPCO ,2000.[10] C.R.P.Hartmann,“Generalizations of the BCH Bound,”In-form And Control ,,no.20,pp.489–498,1972.。
通信英语常用缩略语

BSIC Base Station Identification Code 基站标识码
CA Capacity Allocation 容量分配 CAA Capacity Allocation Acknowledgement 容量分配确 认 CC Call Control 呼叫控制 CCCH Common Control Channel 公共控制信道 CCF Conditional Call Forwarding 条件呼叫前转 CCF Call Control Function 呼叫控制功能 CCH Control Channel 控制信道 CD Capacity Deallocation 容量释放 CDA Capacity Deallocation Acknowledgement 容量释放 确认 CDMA Code Division Multiple Access 码分多址接入 CI Cell Identity 小区识别码
通信英语
--通信常见缩略语 --通信常见缩略语
A
AAA Authentication, Authorization, Accounting 鉴
On the Effect of Cancellation Order in Successive Interference Cancellation for CDMA System

On the Effect of Cancellation Order in Successive Interference Cancellation for CDMA SystemsKiran Puttegowda, Gautam Verma, Soshant Bali, R. Michael Buehrer Bradley Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State University Blacksburg, VA 24061-0111 {kiran, vgautam, sbali, buehrer}@AbstractIn this paper we study the effect of cancellation order on bit error rate (BER) performance of a Code Division Multiple Access (CDMA) system employing a linear Successive Interference Cancellation (SIC) receiver in both an Additive White Gaussian Noise (AWGN) channel and a Rayliegh fading channel. Four different ordering schemes are studied. We show that changing the cancellation order can lead to a significant change in the BER performance.1IntroductionIn the past decade code division multiple access (CDMA) has gained immense popularity as a multiple access scheme. One of the shortcomings of the conventional matched filter receiver is its inability to exploit the full potential of CDMA due to the fact that it treats Multiple Access Interference (MAI) as Gaussian noise [1]. Multi-user detection has been proposed as a technique to improve the capacity of CDMA systems [2] [3] [4]. Unlike conventional matched filter receivers, multi-user detectors use knowledge of MAI to reduce the effect of MAI before making bit decisions, thus leading to a better performance. Successive Interference Cancellation (SIC) is a multi-user detection technique in which signals are detected sequentially based on the perceived reliability of the signal [5] [6] [7] [8]. The most reliable signal is detected first, the signal is regenerated and cancelled from the aggregate received signal. The resulting signal is used to detect the next most reliable signal and this process is continued until all the signals have been detected. The order in which signals are detected is dependent on the perceived reliability of the signals. Themost common form of SIC receiver uses the average received signal power of the user as a measure of reliability of the signal [9] [10]. The strongest received signal is detected first followed by the next strongest signal and so on. Other schemes order the signals based on the output of the matched filters. The user with the largest matched filter output is considered to be the most reliable. In one of the schemes the received signal is passed through the matched filter once and the order is determined based on these outputs. This scheme performs ordering once each symbol. A third scheme performs ordering after each cancellation. In this scheme the received signal is passed through the matched filter after each signal is detected and cancelled to determine the next strongest user. This scheme is the most computationally complex scheme, followed by ordering after each bit, and average power ordering is the simplest of the schemes. For the sake of comparison we also consider random ordering. In this contribution we present a comparitive study of the performance of these ordering schemes in both an Additive White Gaussian Noise (AWGN) channel as well as a Rayleigh fading channel to determine the most effective ordering technique. The effect of the ordering schemes on multiple stages of cancellation is also presented.2System SchemesModelandOrderingThe system model consists of a CDMA system with K active transmitters communicating with a common base station. The signal received from user k can be expressed as Sk (t) = 2Pk bk (t)ak (t) cos(2πfc t + φk ) (1)where; Pk bk (t) ak (t) fc φk = = = = = Received power of k th user Data signal of k th user Spreading signature of k th user Carrier frequency Random phase of k th userKFor j = 1 to K { 1. determine Zj,m = τj ) cos(2πfc t + φj )dt 2. ˆj,m = sgn(Zj,m ) b ˆ 3. Sj (t) = ˆj,m aj (t) b ˆ 4. r(t) = r(t) − Sj (t) Sk (t − τk ) + n(t)k=1 1 T mT +τj (m−1)T +τjr(t)aj (t −The received signal can then be represented as r(t) = where; n(t) τk = Additive White Gaussian Noise = Delay of the k th user (2) }In a successive interference cancellation receiver, users are detected in succession and the detected user’s signal component is cancelled from the aggregate received signal. Thus, the received signal after k cancellations can be expressed as rk (t) = r(t) −∞ k−1ˆ Si (t − τi )i=1(3)ˆ Sk (t) =m=−∞ˆ b 2Pk ˆk,m pT (t−mT )ak (t) cos(2πfc t+φk ) (4)This scheme is effective because the signal with the highest power will usually be the most reliable signal and canceling it first means removing the most multiple-access interference, improving subsequent detection. Average power ordering is also relatively simple to implement. Under conditions of perfect power control this scheme will be less effective because the received powers of all the users will be equal. In this situation the signal detected first will have performance similar to the matched filter receiver while the signal detected last will have the best performance since most of the MAI will have been cancelled from it. Ordering can also be based on the short term average power. This is the same as long term average power in an AWGN channel, but in a fading channel ordering based on short term average power will provide significant performance advantages over long term averaging as we will see.and the decision statistic from signal k is2.2Zk,m = 1 TmT +τk (m−1)T +τkOrdering every symbolrk (t)ak (t−τk ) cos(2πfc t+φk )dt(5) Four ordering schemes for detection and cancellation in AWGN and Rayleigh fading channel are considered. For AWGN channel Pk = 1 and φk = 0 in the system model given in Equation 1. For rayleigh channel Pk is a raleigh random variable and φk is uniformly distributed. These schemes are described belowIn this scheme the order of detection will be recomputed every symbol. The order of detection is based upon decreasing matched filter outputs. The algorithm for this scheme is presented below. L = Set of users indexed from 1 to K • for all j ∈ L determine Zj,m = τj ) cos(2πfc t + φj )dt • while L = φ do { 1. find i ∈ L such that |Zi,m | > |Zl,m | for all l ∈ L, l = i ˜ 2. Zi,m = r(t)am (t − τj )dt ˜ 3. ˆi,m = sgn(Zi,m ) b ˆ b 4. Si (t) = ˆi,m ai (t) ˆ 5. r(t) = r(t) − Si (t)1 T mT +τj (m−1)T +τjr(t)aj (t −2.1Average power orderingIn average power ordering the users are cancelled in the order of decreasing average received signal power i.e., the user with the highest average power is detected first and so on. In perfect power control the long term average powers of all users are equal. In such a case the order is fixed but arbitrary. The algorithm for this scheme with users indexed in descending order of their signal powers is presented below:6. Remove i from set L } It is anticipated that this scheme will provide better performance than odering based on average power because additional information (MAI and noise) from the matched filter outputs is used. The drawback of this particular scheme is the increased computational complexity as compared to ordering based on average power since the order must be recomputed every symbol.2.4Random ordering2.3Ordering after each cancellationIn this scheme the order of decoding of the user bits is recomputed after each interference cancellation. The difference between this scheme and the previous scheme is that in the previous scheme once the order is computed for a bit sequence it does not change during that symbol, where as in this scheme the order is changed after each detection and cancellation. The algorithm for this scheme is presented below: L = Set of users indexed from 1 to K while L = φ do { 1. for all j ∈ L determine Zj,m = τj ) cos(2πfc t + φj )dt1 T mT +τj (m−1)T +τjAs the name suggests, in random ordering scheme user signal components are detected and cancelled in random order for each message bit. The order of decoding is different for every transmitted bit sequence. This odering scheme is considered for comparison purposes. This scheme should not be too effective under imperfect power control conditions where each user component contribute unequally to the received signal. However under perfect power control conditions this scheme should provide better performance for some users. In fixed ordering one user will get bad (equal to matched filter) performance. In random ordering, all users will achieve a performance equal to the average performance.3Simulation Resultsr(t)aj (t −2. find i ∈ L such that |Zi,m | > |Zl,m | for all l ∈ L, l = i 3. ˆi,m = sgn(Zi,m ) b ˆ 4. Si (t) = ˆi,m ai (t) b ˆ 5. r(t) = r(t) − Si (t) 6. remove i from set L } It is anticipated that this scheme will provide the best performance when compared to the schemes mentioned above. By detecting the highest matched filter output after each cancellation we determine the most reliable bit as we proceed through the cancellations. The most up-to-date information is used for reliability estimation. This gives better performance than reordering after each message bit which does not use that updated information. The drawback of this scheme is that the computational complexity is the highest among all the schemes.The performance of each of these interference cancellation schemes was simulated for an asynchronous system with the signals sampled one time per chip. Random spreading sequences with a processing gain of 31 for each user are used. Signals are assumed to be Binary Phase Shift Keying (BPSK) modulated. A single stage and multiple stages of cancellation is considered separately. These simulations are done assuming hard bit decisions i.e., the decoded bits are used to regenerate the transmitted signals for the purpose of cancellation rather than matched filter outputs. Hard decision performed better than linear cancellation scheme. But the relative performance of each of the ordering schemes remained the same in both the channels. Hence only hard decision based detector results are presented. The performance also degrades due to an increase in Multiple Access Interference by additional users. But the relative performance of each scheme was found to remain the same. So simulations were done for only 20 user system. For comparison the matched filter output is plotted as an upper bound and single user BPSK plotted as a lower bound for the performance curves. Figure 1 shows the bit error rate versus signal-tonoise ratio for all four schemes for 20 users in an Additive White Gaussian Noise (AWGN) channel. As discussed previously, the average power ordering schemes proves to be ineffective under perfect power control conditions. Random ordering scheme performs similar to average power ordering, although the distribution of BER is better in this case. This is because average power provides no basis for reliability since all have equal power. Reordering after each bit performsthe single stage cancellation.Figure 1: Average BER versus Eb /No for AWGN channel with perfect power control (one stage cancellation, 20 users, processing gain = 31)Figure 3: Average BER versus Eb /No for Rayleigh Fading with Perfect Channel Estimation (one stage cancellation, 20 users, processing gain = 31)better than the above two schemes because reliability information is contained in the matched filter outputs which determine the cancellation order. Reordering after each cancellation gives the best performance as expected since this scheme provides us with the most reliable ordering of bits. Cancellation changes the reliability and thus reordering provides updated information.Figure 2: Average BER versus Eb /No for AWGN channel with perfect power control (two stage cancellation, 20 users, processing gain = 31)Figure 2 shows the same set of curves for two stages of cancellation. The relative performance is the same. But the effect of ordering is not as pronounced as inFigure 3 presents the bit error rate versus signalto-noise ratio for all the four schemes for 20 users in a Rayleigh fading channel assuming perfect channel estimation. In the simulations for short term average power, the recieved signals are reordered based on average power in every 1000 symbols received. Long term average power considers all the symbols recieved. The plot for the matched filter performance is the upper bound and the single user BPSK performance curve provides a lower bound for the performance. Reordering after each cancellation again gives the best performance. As expected reordering after each bit gives an intermediate performance but its performance improves relative to long-term average power and random ordering. Short term average power is same as the long term average power in an AWGN channel. However in a fading channel with equal average power, long term and short term average powers are different. The plot for reordering based on short term channel power provides performance equivalent to reordering after each cancellation. Similar to the AWGN case, long term average power provides no means of discriminating between signals. On the contrary short term average power does. Additionally, it would seem that short term average power dominates reliability and since it does not change after cancellation, reordering after every cancellation provides no additional benefit. Note that reordering each symbol using matched filter outputs performs worse than short term average power ordering. The channel fading (short term average power) dominates performance and thus re-liability. Using this as the ordering metric with perfect channel estimation provides better reliability than matched filter outputs which also contain information on multiple access interference and noise.after each cancellation.References[1] M. B. Pursley, “Performance evaluation for phase-coded spread-spectrum multiple-access communication-Part I: System analysis,” IEEE Transactions on Communications., vol. COM-25, pp. 795–799, August 1997. [2] A. Duel-Hallen, J. Holtzman, and Z. Zvonar, “Multiuser detection for CDMA systems,” IEEE Pers. Commun., vol. 2, pp. 46–58, April 1995. [3] S. Moshavi, “Multi-user detection for DS-CDMA communications,” IEEE Commun. Mag., vol. 34, pp. 124–137, October 1996. [4] S. Verdu, Multiuser Detection. universal press, 1998.Figure 4: Average BER versus Eb /No for Rayleigh Fading with Perfect Channel Estimation (two stage cancellation, 20 users, processing gain = 31) Figure 4 shows the performance curves for two stages of cancellation for the schemes in a rayleigh fading channel. We find that ordering based on long term average power performed slightly worse than the other schemes. We can also observe that ordering scheme does not provide much improvements over additional stages of cancellation.[5] C. Y. Yoon, R. Kohno, and H. Imai, “A spread spectrum mutiaccess system with cochannel interference cancellation for multipath fading channels,” IEEE Journal on select Areas Communications, vol. 11, pp. 1067–1075, Sept 1993. [6] A. L. C. Hui and K. B. Letaief, “Successive Interference Cancellation for Multiuser Asynchronous DS/CDMA Detectors in Multipath Fading Links,” IEEE Transactions on Communications, vol. 46, pp. 380–391, March 1998. [7] A. Viterbi, “Very low rate convolutional codes for maximum theoretical performance of spreadspectrum multiple-access channels,” IEEE J. Select. Areas Commun, vol. 8, pp. 641–649, May 1990. [8] R. M. Buehrer, “Equal BER Performance in Linear Successive Interference Cancellation for CDMA Systems,” IEEE Transactions on Communications, vol. 35, January 2001. [9] P. Patel and J. Holtzman, “Analysis of a simple successive interference cancellation scheme in a DS/CDMA system,” IEEE J. Select. Areas Commun, vol. 12, pp. 796–807, June 1994. [10] Y.-N. Lin and D. W. Lin, “On optimal power distribution for successive interference cancellation (SIC) for wideband CDMA,” in Proceedings of IEEE Third Workshop on signal Processing advances in Wireless Communications., 2001.4ConclusionsThe effect of cancellation order in SIC receivers was studied. Four methods of determining cancellation order were investigated in both AWGN and Rayleigh fading channels. The effect of ordering was also studied in a multi stage cancellation system. Reordering the user components after each cancellation was found to provide the best performance in both channels and substantial gains in AWGN channels. However, short term average power ordering was just as effective as reordering each cancellation in a Rayleigh fading channel. Reordering each symbol with less computational complexity than reordering after each cancellation was found to perform better than ordering based on average power in AWGN channels. In a fading channel with perfect channel estimates, reordering based on short term average power was found to outperform ordering each symbol and was comparable to reordering。
完整LTE缩略语

TPC TPMI TSTD TTI TX U UCI UDP UDPAP UE UL UL-SCH UM UMB UMTS UpPTS URL USIM USSD UTC UTRA UTRAN V VLAN VMIMO VoIP VP VRB VSWR W WAP WAP GW WCDMA WiMAX WLAN WRR
COD CP CPC CPE CPRI CQI CRC C-RNTI CS CS CSFB CSG D DAI D-AMPS DBCH D-BCH DC DCCH DC-HSDPA DCI DCS DFT DHCP DiffServ DL DL-SCH DM DM RS DMRS DOA DOS DRB DRS DRX DSCP
X X2 ZC
英文全称(English) 16 Quadrature Amplitude Modulation The Second generation The Third generation 3rd Generation Partnership Project 3rd Generation Partnership Project 2 Multi-band,MIMO,Multi-Standard_Radio Remote RadioUnit The Fourth Generation 64 Quadrature Amplitude Modulation Authentication Authorzation and Accounting Adaptive Antenna System Acknowledgement Acknowledgement/Negative-Acknowledgement Access Control List Average Cell Stay Interval Application Header Assisted-GPS Authentication Header Access Description Data Acknowledged Mode Aggregate Maximum Bit Rate Adaptive Modulation and coding AMR Adaptive MultiRate Advanced Mobile Telephone System Adaptive MIMO switching Automatic Neighbour Relation average packet arrival interval access point name Allocation and retention priority Averrage revenue per user (Automatic Repeat Request) access stratum Advanced Wireless Services
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
Interference cancellation in multirate DS/CDMA systemsAnn-Louise Johansson and Arne SvenssonChalmers University of Technology, Dept. of Information Theory, S-412 96 Gothenburg, Swedene-mail: anne.johansson@it.chalmers.se, arne.svensson@it.chalmers.seAbstract : This paper presents multistage interference cancellation (IC) schemes for the uplink of multirate direct-sequence code division multiple access (DS/CDMA) systems.The performance is evaluated both analytically and via computer simulations for two multiple data rate schemes, mixed modulation and parallel channels, assuming flat Rayleigh fading and multipath environments.IntroductionIt is anticipated that an important feature of future mobile communication systems will be the ability to handle other services besides speech, e.g., facsimile, Hi-Fi audio and transmission of images; services that are not readily available today. To achieve this, a multiple-access method which is flexible, has the prospect of high sys-tem capacity, and the ability to handle variable data rates, is necessary. Direct-sequence code division multiple access (DS/CDMA) is believed to be a multiple-access method able to fulfil these requirements.The conventional multiuser detector is composed of a bank of matched filters, which is the optimal structure for a single user channel corrupted only by additive white Gaussian noise (AWGN) [1]. The presence of a num-ber of users in the system often introduces multiple-access interference (MAI), which may lead to an irreducible error probability [2]. Typically, MAI arise in an asynchronous system when the users’ signals are received with different time-lags, which usually increases the cross-correlation between the spreading sequences.Another important issue for CDMA systems, in addition to the MAI, is the near-far problem [3]. In the reverse link (mobile to base station), the signals are received with different powers. The current most referred solution to this problem is stringent power control [4], though over the last few years a lot of attention has been given to the area of multiuser detectors [2]. These have the prospect of both mitigating the near-far problem and cancelling the MAI. One subclass of multiuser detectors is the class of detectors that employ interference cancellation (IC)schemes. The structures of the IC schemes differ depending on how the users are detected and cancelled. In [5]-[7] the detection and cancellation is done in parallel for all the users and in [8]-[11] the detection and cancellation is done successively (or serially), one user at the time. There are also hybrid schemes where the detection and cancellation is done both successively and in parallel [13].In [11] and [14] two different methods to handle multiple data rates in DS/CDMA systems were analyzed. One way to do this is to allow different forms of modulation. The spreading factor is equal for the users in the system,hence, for transmission of a specific rate, the user chooses a modulation format, e.g., one of BPSK, QPSK, or 16-QAM. A second approach to implementing multiple data rates is to allow each user to transmit over one or sev-eral parallel channels. That is, the users employ several signature sequences and transmit the signals synchro-nously.For the flat Rayleigh fading channel we consider non-decision directed interference cancellation (NDDIC)[11] and for the multipath environment we consider a multistage hybrid IC scheme [12]. To take advantage of the diversity in the system we employ a RAKE receiver. The RAKE demands full knowledge of the channel parame-ters and therefore it seems natural to include decision directed (DD) IC, which also adopts this knowledge. How-ever, instead of employing a multistage DDIC scheme together with a RAKE [10], a less complex hybrid IC scheme with a combination of NDDIC and DDIC is presented.System ModelWe consider a model for a system with square lattice QAM signalling over slow, frequency-selective Rayleigh fading channels. The received signal is the sum of the reflections of all the signals embedded in AWGN with a two-sided power spectral density of . Assuming that there are users and paths per user, the received composite signal is(1)This work was supported by the Swedish National Board for Industrial Technical Development, NUTEK. Project 9303363-2.N 02⁄K P r t ()αk p ,p 1=P∑2E 0T---------d k I t τk p ,–()c k I t τk p ,–()ωc t φk p ,+()cos d k Q t τk p ,–()c k Q t τk p ,–()ωc t φk p ,+()sin +{}n t ()+k 1=K ∑=The information-bearing signal,, for all the users, is an infinite sequence of rectangular pulses of dura-tion T with amplitude. The amplitudes of the quadrature carriers for the user’s symbol element, and , generate together M equiprobable and independent symbols. The amplitudes are then affected by the channel gain of each path,, which are assumed to be i.i.d. random Rayleigh variables. Each user k hastwo signature sequences, and , which are used for spreading the signal in the in-phase (I) and the quadra-ture (Q) branch, respectively. They consist of sequences of antipodal, unit amplitude, rectangular pulses of dura-tion . The period of all the users’ signature sequences is , so there is one period per data symbol.The variable is the time delay and is the phase of the user’s path. These are, in the asynchro-nous case i.i.d. uniform random variables over and , respectively. Initially, the only parameters which are assumed to be known are the time delays of the various users.Multistage Interference CancellationThe multistage interference canceller (IC) for M-ary QAM and flat Rayleigh fading is composed of a bank of filters matched to the I and Q spreading sequences of each user. Initially the users are ranked in decreasing order of their respective received signal power. Then the output of the matched filter of the strongest user is used to estimate that particular user’s baseband signal, which is subsequently cancelled from the composite signal. In other words, the projection of the received signal in the direction of the spreading sequence of the strongest useris subtracted from the composite signal. This is illustrated in Fig. 1. Let denote the complex sum of and . The variable defines the composite baseband signal after cancellation of user and define the estimated signal of the user. The superscript defines the stage of the scheme. (In the first stage of the scheme,which is described above, is zero.) In this way we attempt to cancel the interference, which the remaining users are exposed to. We continue by cancelling the second strongest user, successively followed by all the other users. The cancellations are however not perfect. The filter output contains, besides the desired signal, also Gaus-sian noise and noise caused by MAI and hence, for each cancellation noise is projected in the directions of the other users in the system.If additional stages of the IC scheme is employed the MAI can be further reduced and, consequently, the esti-mates of the signals can be improved. In a multistage scheme we add the estimated signal from the previous stage(corresponding to in Fig. 1a) to the resulting composite signal and use the output of the matched filter to obtain a new estimate of the signal, which in turn is cancelled. The scheme is repeated for all the users for a desired number of stages. This is illustrated in Fig. 1b. The IC scheme reduces the MAI between the users but, on the other hand, the Gaussian noise is enhanced gradually through projection. However, it is shown in [10] that the multistage IC performs better than the decorrelator after a limited number of stages and that they are asymptoti-cally equivalent.Multistage Interference Cancellation in a Multipath EnvironmentIn a multipath environment we have to employ a RAKE receiver to take advantage of the diversity of the chan-nel. The RAKE receiver demands full knowledge of the channel parameters and it seems obvious that a DDIC scheme should be used instead of an NDDIC scheme. The complexity of the receiver can, however, be reduced by employing a combination of NDDIC and DDIC [12].The proposed RAKE receiver with a hybrid IC scheme works as follows. First we employ a few stages ofFig. 1. (a) Interference cancellation unit. (b) Multistage non-decision directed interference cancellation.d kI Q /t ()A k l,I Q /k th l th A k l ,I A k l,Q αk p ,c k I c kQ T c N T T c ⁄=τk p ,φk p ,k th p th 0T ),[02π),[τk p ,c k c kI c k Q r k 1–i k 1–d k i k th d k0d k i 1–++MF kr k 1–i d ki 1–+++–r ki c kd ki IC 1IC 2IC KIC 1IC 1IC 2IC 2IC KIC Kr 01r 11r K 1–1r K1r K2d K1r K 1–2d 21r 12d 11d 1i 1–d 1i d 2i 1–r 1i d 2i d Ki 1–r K 1–i d Ki r Ki (a)(b)NDDIC where, in contrast to [11], the demodulation of the signal is noncoherent [10]. This does not change any-thing for the IC scheme, since knowledge of the phase is only needed for the coherent detection. Besides that, the only difference in the case of multipaths is that all the paths of each user are treated as separate users. They are ordered independently and cancelled one by one according to received signal power, in the manner shown in Fig.1b. The receiver can therefore be visualized as a bank of matched filters, one filter for each path, which evi-dently is equivalent to sampling each of the original filters times. After a few NDDIC stages the MAI in each path has been reduced and we estimate the channel parameters of the paths using, e.g., pilot symbols. These estimates are used to rank the users according to their total received power.In the last stage of the hybrid IC a RAKE is combined with DDIC to benefit from both removal of the Gauss-ian noise and the diversity. A block diagram of a DDIC unit is shown in Fig. 2a, where the resulting baseband sig-nal before the DDIC unit is . Let denote the signal estimate of the user’s path. The variable is one of the signal estimates, which from the outputs of the NDDIC unit belong to the user.This is illustrated in Fig. 2b.For the DDIC scheme, in Fig. 2a, a similar procedure as described for the NDDIC is initially followed. First new estimates of the signals corresponding to the strongest user’s paths are obtained. This is done successively since, if the received multipath signal is regenerated and a conventional RAKE [1] is employed, the intersymbol interference (ISI), which is partly removed in the NDDIC stages, would be introduced again. Hence, in the mod-ified RAKE the signals are fed separately to the combiner. After the symbols have been detected, the estimated channel parameters are used to regenerate the signals corresponding to the user’s all paths, which are then can-celled from the composite baseband signal. The scheme is repeated successively for all the users. This is shown in the right part of Fig. 2b. If more than one stage of RAKE and DDIC is implemented the regenerated signals,corresponding to the various paths, are fed to the subsequent stage in the same manner as for the first stage.Performance Analysis and SimulationsThe graphs below contain, together with simulation results, analytical performance estimates. These estimates have been derived using a Gaussian approximation of the MAI. This approximation seems to be feasible for values up to at least 20 dB both for systems employing the NDDIC scheme and for systems employing the hybrid IC scheme, although it may be considered crude. Especially for the hybrid scheme, since we consider DDIC together with a RAKE in the last stage. In the analysis we have considered NDDIC for that stage too, with the difference that we have regarded known channel parameters and maximal ratio combining of the paths of the various users. Consequently, the pdf’s of the ordered sums of signals, belonging to each user, are used in the anal-ysis of the last stage. With that exception, the analysis is equivalent to the one presented in [11].We have considered asynchronous systems and slow, flat Rayleigh fading or frequency-selective Rayleigh fad-ing with two equally strong, independently fading paths per user. In all the simulations the different IC schemes operates block-wise on the data where two guard symbols have been employed in the beginning and the end of each block to avoid edge effects. It is assumed that the channel do not change over the time of the transmission of a block, which corresponds to slow vehicle speed. Pilot symbols are also employed in the simulations when esti-mation of the channel parameters is considered. In those cases, the estimate is obtained from the average of two pilot symbols in the beginning as well as in the end of each block of data. Known channel parameters have been used for the ranking in the simulations of the systems with only NDDIC. The ranking in the NDDIC part of the Fig. 2. Decision directed interference cancellation in combination with a modified RAKE.(b) Hybrid interferencecancellation scheme.P KP K P r 'k 1–d p k ,'k th p th d p k ,'P KP k th E b N 0⁄d j k,''∑d P k,''d 2k,''d 1k ,''IC 1IC 2IC P RAKE++Channeld 1k,'d 2k,'d P k,'r 'k 1–b kc kr 'kRAKE 1+ DDICRAKE 2+ DDICRAKE K + DDIC123KL12Ki Stages ofNDDIC Group the Paths &Orderr 01r KPi d KPi d 1i d 2i d 3i d 1'd 2'd K 'r 'Kr 'K 1–r '2r '1b 1b 2b K(a)(b)hybrid IC scheme is performed using the output of the matched filters, while the ranking before the stage with RAKE and DDIC is performed using known or estimated channel parameters.All the simulated systems are chip-rate sampled, which limits the possible time-lags between users to be mul-tiples of chip-times. This is a restriction that should be modified for simulations of more realistic scenarios. It should also be noted that because of long simulation runs, the confidence level for high values of is not sufficiently low to give completely accurate results.Mixed Modulation SystemOne way to handle multiple data rates is to allow different modulation formats. We refer to this as a mixed modulation system. The analytical and simulation results are presented in Fig. 3. The systems include BPSK,QPSK, and 16-QAM users and the average SNR/bit is equal for all the users independent of modulation format.The graphs depict the average bit error rate (BER) of a system with 20 BPSK, 10 QPSK and 5 16-QAM users.(We assume Gray encoding of the symbols.) Gold sequences of length 127 are used for the spreading. In Fig. 3a the results employing NDDIC schemes in flat fading is shown and in Fig. 3b the performance of a hybrid IC scheme in two-path Rayleigh fading is presented. The average BER for each kind of user derived from the simu-lations is also shown in the graphs. The graphs depict that the results of the simulations agree well with the ana-lytical results for up to about 20 dB except for the single stage NDDIC scheme. This can be explained by the difference in received power of the various users which makes the Gaussian approximation of the MAI less accurate. It can also be observed that the BER of the 16-QAM users dominates the average BER of the system.Parallel Channel SystemThe other multiple data rate scheme studied is parallel channels, which implies that each user transmits over one or several synchronous channels. We then know that the received signals will be affected by the same chan-nel parameters and we can also make use of spreading sequences with good cross-correlation properties. In Fig. 4the performance of a system with 15 QPSK users, transmitting over two channels each, are shown. Fig. 4a depicts analytical and simulation results for flat Rayleigh fading. The simulations support well the analytical esti-mates. In Fig. 4b the performance of the hybrid IC scheme is presented considering two equally strong multip-aths. The performance is simulated for both known and estimated channel parameters.The graphs show that the performance of the parallel channel system is close to single user performance in both flat and frequency-selective fading and the degradation due to estimated channel parameters is about 1 paring the performance of the two multirate schemes for the same throughput, it can be seen that the perfor-mance of the parallel channels surpasses that of the mixed modulation system.ConclusionsWe have presented non-decision directed IC schemes for flat Rayleigh fading channels and a novel multistage hybrid IC scheme for multipath environments, which is evaluated together with two different multiple data rate schemes, mixed modulations and parallel channels. The hybrid IC includes a combination of non-decisionFig. 3. (a) NDDIC in a mixed modulation system with 35 users. Analytical and simulation results for a flat Rayleigh fading channel. (b) Simulation of asynchronous mixed modulation system with 35 users, 2 paths per user and perfect channel estimates. The performance of the conventional detector and the hybrid IC is shown together with analytical results. The hybrid IC has 4 NDDIC stages and 1 DDIC stage with RAKE.E b N 0⁄E b N 0⁄E b /N 0 (dB)5101520253010−410−310−210−110A v e r a g eB i t E r r o r P r o b a b i l i t yProcessing Gain = 127Random Sequences Mix (20/10/5)Conventional Sim. 1, 2 & 5 St.Ave. BPSK Ave. QPSK Ave. 16−QAM Single BPSKE b /N 0 (dB)5101510−410−310−210−110A v e r a g eB i t E r r o r P r o b a b i l i t yProcessing Gain = 127Gold Sequences Mix (20/10/5)Conventional Hybrid Sim. (4+1) Ave. BPSK Ave. QPSK Ave. 16−QAM Hybrid Analysis Single BPSK, 2 raysdirected and decision directed IC combined with a modified RAKE receiver.Analytical results using the Gaussian approximation are presented and they agree relatively well with the results from computer simulations. Performance close to the single user bound is obtained for perfectly known channels. In the case of channel estimation, the degradation of the performance is relatively small ( dB).Comparing the performance of the two evaluated multirate schemes, parallel channels are preferable for high rate users.In future work the restriction to slow fading will be relaxed and other methods for channel estimation, besides pilot symbols, will be investigated.AcknowledgementThe authors would like to acknowledge Karim Jamal at Ericsson Radio Systems for stimulating discussions and for his invaluable assistance in obtaining the simulation results.References:[1]J.G. Proakis,Digital Communications , 3rd ed, McGraw-Hill, 1995.[2] A. Duel-Hallen, et al., “Multiuser detection for CDMA systems”IEEE Personal Communications , vol. 2, no. 2, pp. 46-58, 1995.[3]R. Lupas and S. Verdu, “Near-far resistance of multiuser detectors in asynchronous channels,”IEEE Trans. on Communications,vol.COM-38, pp. 497-507, April 1990.[4]K. S. Gilhousen, et al., “On the capacity of a cellular CDMA system,”IEEE Trans. on Vehicular Technology , vol. 40, pp. 303-311, May1991.[5]M. Varanasi and B. Aazhang, “Multistage detection in asynchronous code-division multiple access communications,”IEEE Trans. onCommunications,vol. COM-38, pp. 509-519, April 1990.[6]S. Striglis, et al., “A multistage RAKE receiver for improved capacity of CDMA systems,”Proceedings,VTC’94 (Stockholm, Sweden),June 1994, pp. 789-793.[7]Y .C. Yoon, et al., “A spread-spectrum multiaccess system with cochannel interference cancellation for multipath fading channels,”IEEEJournal on Sel. Areas in Communications,vol. 11, pp. 1067-1075, Sept. 1993.[8]P. Patel and J. Holtzman, “Analysis of a simple successive interference cancellation scheme in a DS/CDMA System,”IEEE Journal onSel. Areas in Communications,vol. 12, pp. 796-807, June 1994.[9]M. Ewerbring, et al., “CDMA with interference cancellation: A technique for high capacity wireless systems,”Proceedings,ICC’93(Geneva, Switzerland), May 1993, pp. 1901-1906.[10]K. Jamal and E. Dahlman, “Multi-stage serial interference cancellation for DS-CDMA,”Proceedings, VTC‘96 (Atlanta, Georgia),April1996.[11]A. Johansson and A. Svensson, “Multi-stage interference cancellation in multi-rate DS/CDMA systems,”Proceedings, PIMRC‘95 (Tor-onto, Canada),Sept. 1995, pp. 965-969.[12]A. Johansson and A. Svensson, “Multistage interference cancellation for multirate DS/CDMA on a mobile radio channel,”Proceedings,VTC‘96 (Atlanta, Georgia),April 1996.[13]Y . Li and R. Steel, “Serial interference cancellation method for CDMA,”Electronics Letters , vol. 30, pp. 1581-1583, Sept. 1994.[14]T. Ottosson and A. Svensson, “Multi-rate schemes in DS/CDMA systems,”Proceedings, VTC‘95(Chicago, Illinois), July 1995, pp.1006-1010.Fig. 4. (a) NDDIC in a system with parallel channels. Analytical and simulation results of asynchronous systems with 15 QPSK users, 2 paths per user, signalling over flat Rayleigh fading channels. (b) Simulations of asynchronous systems with 15 QPSK users, 2 parallel channels per user and 2 paths per channel. The performance of the conventional detector, the hybrid IC for known channel parameters, and the hybrid IC for estimated channel parameters, is shown. The hybrid IC has 4 NDDIC stages and 1 DDIC stage with RAKE.E b /N 0 (dB)5101520253010−410−310−210−110A v e r a g eB i t E r r o r P r o b a b i l i t yProcessing Gain = 128Orth. Gold Sequences QPSK, 15 users, P=2Conventional Sim. 1,2 & 5 St. Analysis 1 & 2 St. Single BPSKE b /N 0 (dB)510152010−410−310−210−110A v e r a g eB i t E r r o r P r o b a b i l i t yProcessing Gain = 128Orth. Gold SequencesQPSK, 15 users, P=2,Conventional Hybrid (known ch. 4+1)Hybrid (est. ch. 4+1) Single BPSK, 2 rays1≈。