Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
O
OpenXG-RAN
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
canghaiwuhen
OpenXG-RAN
Commits
eb18a90b
Commit
eb18a90b
authored
Feb 19, 2020
by
Cedric Roux
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
bugfix: correct X_u computation for both 839 and 139 cases
parent
669ba2fa
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
2 deletions
+2
-2
openair1/PHY/NR_TRANSPORT/nr_prach_common.c
openair1/PHY/NR_TRANSPORT/nr_prach_common.c
+2
-2
No files found.
openair1/PHY/NR_TRANSPORT/nr_prach_common.c
View file @
eb18a90b
...
@@ -157,8 +157,8 @@ void compute_nr_prach_seq(nfapi_nr_config_request_scf_t *config,
...
@@ -157,8 +157,8 @@ void compute_nr_prach_seq(nfapi_nr_config_request_scf_t *config,
// for the unrestricted case X_u[0] is the first root indicated by the rootSequenceIndex
// for the unrestricted case X_u[0] is the first root indicated by the rootSequenceIndex
for
(
k
=
0
;
k
<
N_ZC
;
k
++
)
{
for
(
k
=
0
;
k
<
N_ZC
;
k
++
)
{
//
420 is the multiplicative
inverse of 2 (required since ru is exp[j 2\pi n])
//
multiply by
inverse of 2 (required since ru is exp[j 2\pi n])
X_u
[
i
][
k
]
=
((
uint32_t
*
)
nr_ru
)[(((
k
*
(
1
+
(
inv_u
*
k
)))
%
N_ZC
)
*
420
)
%
N_ZC
];
X_u
[
i
][
k
]
=
((
uint32_t
*
)
nr_ru
)[(((
k
*
(
1
+
(
inv_u
*
k
)))
%
N_ZC
)
*
nr_ZC_inv
[
2
]
)
%
N_ZC
];
}
}
}
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment