LTE系统中Reed-Muller码的编译码算法(1)

224Vol．22No．420108JournalofChongqingUniversityofPostsandTelecommunicationsNaturalScienceEditionAug．2010LTEReed-Muller2010-01-202010-05-172009ZX03002-009FoundationItemTheMajorProjectofNationalScienceandTechnology2009ZX03002-0094000653GPPLTEchannelqualityindicatorCQIhybridautomaticrepeat-requestacknowledgementHARQ-ACKReed-Muller。TD-SCD-MATFCItransportformatcombinationindicator3GPPLTE。3GPPLTEfastHadamardtransformationFHT。LTE-TDD。LTEReed-MullerHARQCQITN929．5A1673-825X201004-0395-05Reed-MullercodinginlongtermevolutionCHENFa-tangHeJian-longSchoolofCommunicationandInformationEngineeringChongqingUniversityofPostsandTelecommunicationsChongqing400065P．R．ChinaAbstractIn3GPPLTElongtermevolutionphysicallayerprotocolBothCQIchannelqualityindicatorandHARQ-ACKhybridautomaticrepeat-requestacknowledgementadoptedamethodcalledsupercodebasedonReed-Muller．ItissimilartotheencodingofTFCItransportformatcombinationindicatorinTD-SCDMAphysicallayerprotocol．Butthecodingmatrixusedmorecomplexinterleavertechnologyandincreasedmoremasksin3GPPLTE．Itmadereceiver'sdeco-dingdifficult．AccordingtothecharacteristicsofcodingmatrixthispaperusedFHTfastHadamardtransformationandgaveaneffectivedecodingalgorithmofReed-Muller．SimulationresultsshowtheeffectivenessofthealgorithmwhichhasbeenappliedtoLTE-TDDwirelessintegratedtestinstrument．KeywordslongtermevolutionLTEReed-MullercodefastHadamardtransformationhybridautomaticrepeat-requestacknowledgementHARQchannelqualityindicatorCQI0Reed-MullerRM1。。。3GPP3rdgenerationpartnershipprojectLTElongtermevolutionchannelqualityindicatorCQI2hybridautomaticrepeatrequestacknowledgementHARQ-ACK2RMRM3GPPLTERM。3GPPTS36．2122RM3211RM2013RM。CQIphysi-caluplinksharedchannelPUSCH3211RMphysicaluplinkcontrolchannelPUCCH2013RMHARQ-ACKPUSCH3211RM。TD-SCDMA3210RM3。3GPPLTERM。4-6RM。4254/π6SISOsoft-inputsoft-output。3GPPLTERMRM4-6。3GPPTS36．212RM2fastHadamardtran-sformationFHT、2。FHTLTE-TDD。11．1PUSCHHARQ-ACKCQIPUSCH3211RM3GPPTS36．21232111。M01M1—M5WalshM6—M105。bi=∑10n=0on·Minmod211onbiMinn∈0…10i∈0…31。13211Tab．1Basissequencesfor3211codeMni∈0…31M011111111111111111111111111111111M111001100100101011010010111010010M201011010011100001000100110111110M300111001110011000110010010110110M400000111110000111110001110001110M500000000001111111111000001111110M600100110011100011011100011001110M700001101101011110010001011010110M800110111000110000100001110111110M901100010111011011000010110110010M10111111111111111100001111010000101．2PUCCHCQIPUCCH2013RM3GPPTS36．21220132。M01M1—M532Walsh12M6—M127。bi=∑12n=0an·Minmod222anbiMinn∈0…12i∈0…19。22013Tab．2Basissequencesfor2013codeMni∈0…19M011111111111111111111M111001100100101011010M201011010011100001000M300111001110011000110M400000111110000111110M500000000001111111111M600100110011100011011M700001101101011110010M800110111000110000100M901100010111011011000M1011111111111111110000M1111111111111111001100M120011111111111111110022FHT。01BPSK。BPSK01。FHT201－1。2．1。3GPPLTE2RM3211·693·22RM2013RM。1113211=2048213=819220488192111320488192。32112013RM204881921113204881923220204881920。。2DSP。。2．22．2．1Walsh7Rademacher。31Walsh2Paley3Hadamard。3GPPTS36．212M1—M5Reed-MullerWalsh32。-。HadamardH8+1－1。22H2=+1+1+1－[]1HN=HN/2H233N=2mkronecderproduct。HNNN=2mx=x0x1…xN－1N。x－y=HN×x44－discreteWalsh-HadamardtransformationDHT。NDHTN2。FHTHadamardN×lbN。9LDPCFHT。102in-versefastHadamardtransformationIFHTFHTIFHTFHTIFHT。FHT。18IF-HTFHT。18IFHTFHTFig．1Butterflydiagramof8-oderIFHTandFHT2．2．2PUSCHPUSCH3211RM2。bi01－1Hadamard1－1FHT。2biMRMbiM6—M105。FHTFHTM1—M5Walsh32Hadamard32·793·4LTEReed-Muller。23211Fig．2Structureof3211decoderFHTStep1b0b1．．．b30b31b31b0b20b1b2b21b3b4b22b5b6b23b7b8b9b24b19b25b10．．．b13b26b27b14b15b28b16b17b18b19b30FHT。Step25Step1。532。Step13232。Step3Step232HadamardFHT32×32。Step4Step32—67—11。Step5M01。Step4101。2．2．3PUCCHPUCCH2013RM3PUSCH3211RM。bi3bi3211RM32M3211RM2。FHT22013RM20321203211RMFHT。32013Fig．3Structureof2013decoderFHTStep1b0b1…b30b310…0b0b1…b18b1912032。Step23211Step220137128。Step112832。Step3Step232HadamardFHT128×32。Step4Step32—67—13。Step5101。3。4additivewhiteGaussiannoiseAWGNsignaltonoiseratioSNRbiterrorrateBER。0～8dB10。44。SNR4。4·893·222dB。4xFHT3211RMFHT3211RM3211RMFHT2013RMFHT2013RM2013RMFHT3213RMFHT3213RM。42Fig．4Performancecomparisonoftwoalgorithms。3211RMdmin=102013RMdmin=43213RMdmin=8。43211RM2013RMBER4dB2013RM3213RM11。13211RM3213RM1dB43211RM3213RM0．7dB。12PUCCHCQI203213RM12。42013RM3213RM3dB。3211RM2013RM4dB。4、3GPPLTE2Reed-Muller。32112013RM2013RM。3GPPLTETD-SCD-MA。FHT011－1。FHTDSPFHT。3GPPLTE。1LINShuJr．M．．2200770-75．23GPPTS36．212．3rdGenerationPartnershipProjectTechnicalSpecificationGroupRadioAccessNetworkE-volvedUniversalTerrestrialRadioAccessE-UTRAMultiplexingandchannelcodingRelease8EB/OL．2009-12-21．http//．quintillion．co．jp/3GPP/Specs/36212-900．pdf．3．FHTTFCIJ．20051771601-1603．4BRUNASHEVMaratVDUMERIlya．ErrorExponentsforTwoSoft-DecisionDecodingAlgorithmsofReed-Mull-erCodesJ．IEEETransactionsonInformationTheory20095594108-4118．5DUMERIlya．Soft-DecisionDecodingofReed-MullerCodesASimplifiedAlgorithmJ．IEEETransactionsonInformationTheory2006523956-963．6YANGF．Soft-dec