downlink control processing and procedures -凯发k8网页登录
this example describes the blind search decoding of the physical downlink control channel (pdcch) for 5g new radio communications system. building on the tutorial modeling downlink control information, this example introduces the concepts of control resource set (coreset) and search spaces, their generic specification and shows how a pdcch instance is mapped to one of several candidates within a search space. to recover the transmitted control information at the receiver, the example performs a blind search over the set of candidates.
system parameters
set system parameters corresponding to the carrier, coreset, search space set, and pdcch instance respectively.
rng(111); % set rng state for repeatability % carrier configuration carrier = nrcarrierconfig; carrier.ncellid = 2; % cell identity carrier.subcarrierspacing = 30; % carrier/bwp subcarrier spacing carrier.cyclicprefix = 'normal'; % cyclic prefix carrier.nslot = 0; % slot counter carrier.nframe = 0; % frame counter carrier.nstartgrid = 10; % carrier offset carrier.nsizegrid = 48; % size of carrier in rb % coreset configuration coreset = nrcoresetconfig; coreset.coresetid = 1; % coreset id (0...11) coreset.frequencyresources = ones(1,4); % 6 rb sized coreset.duration = 1; % coreset symbol duration (1,2,3) coreset.cceregmapping = 'interleaved'; % coreset mapping coreset.regbundlesize = 2; % l (2,6) or (3,6) coreset.interleaversize = 2; % r (2,3,6) coreset.shiftindex = carrier.ncellid; % default to ncellid % search space configuration ss = nrsearchspaceconfig; ss.coresetid = 1; % associated coreset id (0...11) ss.searchspacetype = 'ue'; % 'ue', 'common' ss.startsymbolwithinslot = 0; % starting symbol in slot ss.slotperiodandoffset = [1 0]; % search space period and offset ss.duration = 1; % search space duration in slots ss.numcandidates = [4 2 1 0 0]; % for (1,2,4,8,16) levels respectively % pdcch configuration pdcch = nrpdcchconfig; pdcch.nstartbwp = 10; % bwp offset wrt crb 0 pdcch.nsizebwp = 48; % size of bwp in resource blocks pdcch.coreset = coreset; % associated coreset pdcch.searchspace = ss; % associated searchspace pdcch.rnti = 1; % c-rnti pdcch.dmrsscramblingid = []; % use carrier.ncellid instead pdcch.aggregationlevel = 4; % number of cces in pdcch (1,2,4,8,16) pdcch.allocatedcandidate = 1; % 1-based scalar
this example assumes single slot processing, using a single bandwidth part with a single pdcch transmission for an associated coreset and search space set.
for more information on waveform generation with multiple physical channels, see the 5g nr downlink vector waveform generation example.
pdcch bit capacity
the bit capacity for a pdcch instance is determined based on the number of control-channel elements (cce) configured for the pdcch. a cce consists of six resource-element groups (regs) where a reg equals one resource block (rb) during one ofdm symbol.
% number of bits for pdcch resources and actual indices
[ind,dmrs,dmrsind] = nrpdcchresources(carrier,pdcch);
e = 2*numel(ind);
dci encoding
the function encodes the dci message bits based on a downlink format. dci encoding includes the stages of crc attachment, polar encoding and rate matching the codeword to the pdcch bit capacity e
.
k = 64; % number of dci message bits dcibits = randi([0 1],k,1,'int8'); dcicw = nrdciencode(dcibits,pdcch.rnti,e);
pdcch symbol generation and mapping
the function maps the encoded dci bits onto the physical downlink control channel (pdcch). the function returns the scrambled, qpsk-modulated symbols. the scrambling accounts for the user-specific parameters.
if isempty(pdcch.dmrsscramblingid) nid = carrier.ncellid; else nid = pdcch.dmrsscramblingid; end sym = nrpdcch(dcicw,nid,pdcch.rnti);
the pdcch symbols are then mapped to the resource elements corresponding to the allocated candidate within an ofdm grid. the resource grid also contains pdsch and pbch symbols, and other reference signal elements. for simplicity, this example only additionally maps the pdcch dm-rs symbols to the grid.
carriergrid = nrresourcegrid(carrier); carriergrid(ind) = sym; % pdcch symbols carriergrid(dmrsind) = dmrs; % pdcch dm-rs
for a resource grid spanning the whole bandwidth part and a single slot, this figure shows some of the coreset, search space set and pdcch instance parameters for the selected example configuration.
ofdm modulation
ofdm modulate the carrier grid. specify no windowing for the slot-based processing.
[wave,winfo] = nrofdmmodulate(carrier,carriergrid,'windowing',0);
fading channel
transmit the generated waveform over a tdl fading channel with delay profile a and a delay spread of 30 ns.
channel = nrtdlchannel; channel.delayprofile = 'tdl-a'; channel.delayspread = 30e-9; channel.numtransmitantennas = 1; channel.numreceiveantennas = 1; channel.samplerate = winfo.samplerate; chinfo = info(channel); maxchdelay = ceil(max(chinfo.pathdelays*channel.samplerate)) ... chinfo.channelfilterdelay; txwave = [wave; zeros(maxchdelay, size(wave,2))]; rxwave = channel(txwave);
noise addition
add white gaussian noise with the specified level to the received signal, taking into account the coding rate, qpsk modulation, and sampling rate.
ebno = 6; % in db bps = 2; % bits per symbol, 2 for qpsk esno = ebno 10*log10(bps); snrdb = esno 10*log10(k/e); noisevar = 10.^(-snrdb/10); % assumes unit signal power n0 = sqrt(noisevar)/sqrt(2*winfo.nfft); noise = n0 * complex(randn(size(rxwave)),randn(size(rxwave))); rxwaven = rxwave noise;
blind pdcch and dci decoding
the ue does not have information about the detailed control channel structure. therefore, the ue decodes the received pdcch symbols blindly by monitoring a set of pdcch candidates for each slot using the ue's rnti to identify the right candidate (or instance).
monitoring a candidate implies attempting to decode a set of resource elements corresponding to the candidate by checking if the returned checksum is zero for the known rnti (ue). use the function to determine all candidates specified by the search space set in terms of the pdcch resource element indices, corresponding dm-rs symbols and indices.
for each candidate, the front-end recovery includes
timing offset estimation based on the dm-rs symbols using the function ,
ofdm demodulation using the function ,
channel estimation based on the dm-rs symbols using the function , and
mmse equalization using the function
to yield the equalized candidate pdcch symbols.
the equalized symbols per candidate are demodulated with known user-specific parameters and channel noise variance using the function.
for an instance of the received pdcch codeword, the function includes the stages of rate recovery, polar decoding, and crc decoding. if the output mask value is zero, the pdcch is decoded successfully and the ue can process the dci message.
in this example, the receiver assumes knowledge of the dci format and the dci payload size k
. in practice, even these would be searched for in an outer loop over all supported formats with respective bit lengths per format.
listlen = 8; % polar decoding list length % get all possible candidates [allind,alldmrs,alldmrsind] = nrpdcchspace(carrier,pdcch); % loop over all supported aggregation levels decoded = false; for alidx = 1:5 % loop over all candidates at each aggregation level for cidx = 1:pdcch.searchspace.numcandidates(alidx) % get candidate csymidx = allind{alidx}(:,cidx); cdmrs = alldmrs{alidx}(:,cidx); cdmrsind = alldmrsind{alidx}(:,cidx); % timing estimate offset = nrtimingestimate(carrier,rxwaven,cdmrsind,cdmrs); if offset > maxchdelay offset = 0; end rxwaves = rxwaven(1 offset:end,:); % ofdm demodulate the carrier rxcarrgrid = nrofdmdemodulate(carrier,rxwaves); % channel estimate [hest,nvar] = nrchannelestimate(carrier,rxcarrgrid,cdmrsind,cdmrs); [rxsym,pdcchhest] = nrextractresources(csymidx,rxcarrgrid,hest); % equalization [pdccheq,csi] = nrequalizemmse(rxsym,pdcchhest,nvar); % demodulate rxcw = nrpdcchdecode(pdccheq,nid,pdcch.rnti,nvar); % apply csi csirep = repmat(csi.',2,1); scalrxcw = rxcw.*csirep(:); % decode [decdcibits,errflag] = nrdcidecode(scalrxcw,k,listlen,pdcch.rnti); if isequal(errflag,0) disp(['decoded candidate #' num2str(cidx) ... ' at aggregation level ' num2str(2^(alidx-1)) ... ' in slot']) decoded = true; if isequal(decdcibits,dcibits) disp(' recovered dci bits with no errors'); else disp(' recovered dci bits with errors'); end break; end end % dont loop over other aggregation levels if rnti matched if decoded break; end end
decoded candidate #1 at aggregation level 4 in slot recovered dci bits with no errors
for the chosen system parameters, the decoded information matches the transmitted information bits.
the example searched over all candidates within a single search space set as specified by the ss
configuration parameter. search over multiple search space sets would require another external loop over all the sets defined.
selected references
3gpp ts 38.211. "nr; physical channels and modulation" 3rd generation partnership project; technical specification group radio access network.
3gpp ts 38.212. "nr; multiplexing and channel coding" 3rd generation partnership project; technical specification group radio access network.
3gpp ts 38.213. "nr; physical layer procedures for control" 3rd generation partnership project; technical specification group radio access network.
see also
functions
- | | | | |