{"action":"created","issue":{"url":"https://api.github.com/repos/aff3ct/aff3ct/issues/29","repository_url":"https://api.github.com/repos/aff3ct/aff3ct","labels_url":"https://api.github.com/repos/aff3ct/aff3ct/issues/29/labels{/name}","comments_url":"https://api.github.com/repos/aff3ct/aff3ct/issues/29/comments","events_url":"https://api.github.com/repos/aff3ct/aff3ct/issues/29/events","html_url":"https://github.com/aff3ct/aff3ct/issues/29","id":362103949,"node_id":"MDU6SXNzdWUzNjIxMDM5NDk=","number":29,"title":"SCMA for arbitrary codebooks","user":{"login":"klimentyev","id":24813864,"node_id":"MDQ6VXNlcjI0ODEzODY0","avatar_url":"https://avatars3.githubusercontent.com/u/24813864?v=4","gravatar_id":"","url":"https://api.github.com/users/klimentyev","html_url":"https://github.com/klimentyev","followers_url":"https://api.github.com/users/klimentyev/followers","following_url":"https://api.github.com/users/klimentyev/following{/other_user}","gists_url":"https://api.github.com/users/klimentyev/gists{/gist_id}","starred_url":"https://api.github.com/users/klimentyev/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/klimentyev/subscriptions","organizations_url":"https://api.github.com/users/klimentyev/orgs","repos_url":"https://api.github.com/users/klimentyev/repos","events_url":"https://api.github.com/users/klimentyev/events{/privacy}","received_events_url":"https://api.github.com/users/klimentyev/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":9,"created_at":"2018-09-20T09:43:49Z","updated_at":"2018-11-26T18:44:36Z","closed_at":null,"author_association":"NONE","body":"I saw the implementation of the SCMA system in your project yesterday. It is very interesting for me. I wanna improve the system. First, use of arbitrary codebooks with size 4x6. In my C code, I calculate factor graph by codebooks: https://github.com/klimentyev/scma_mex/blob/master/src/scma_log_mpa.c#L13\r\nI think in the future we need to extend the code for any size of codebooks (e.g, 8x12, 5x10, etc.).\r\n\r\nP.S. In free time, I will try to implement here Log-MPA and Max-Log-MPA algorithms from my project: https://github.com/klimentyev/scma_mex/blob/master/src/scma_log_mpa.c"},"comment":{"url":"https://api.github.com/repos/aff3ct/aff3ct/issues/comments/441751185","html_url":"https://github.com/aff3ct/aff3ct/issues/29#issuecomment-441751185","issue_url":"https://api.github.com/repos/aff3ct/aff3ct/issues/29","id":441751185,"node_id":"MDEyOklzc3VlQ29tbWVudDQ0MTc1MTE4NQ==","user":{"login":"klimentyev","id":24813864,"node_id":"MDQ6VXNlcjI0ODEzODY0","avatar_url":"https://avatars3.githubusercontent.com/u/24813864?v=4","gravatar_id":"","url":"https://api.github.com/users/klimentyev","html_url":"https://github.com/klimentyev","followers_url":"https://api.github.com/users/klimentyev/followers","following_url":"https://api.github.com/users/klimentyev/following{/other_user}","gists_url":"https://api.github.com/users/klimentyev/gists{/gist_id}","starred_url":"https://api.github.com/users/klimentyev/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/klimentyev/subscriptions","organizations_url":"https://api.github.com/users/klimentyev/orgs","repos_url":"https://api.github.com/users/klimentyev/repos","events_url":"https://api.github.com/users/klimentyev/events{/privacy}","received_events_url":"https://api.github.com/users/klimentyev/received_events","type":"User","site_admin":false},"created_at":"2018-11-26T18:44:36Z","updated_at":"2018-11-26T18:44:36Z","author_association":"NONE","body":"> Um...... I'll try to think about it. Don't have so much time these days.\r\n\r\nOK. The example of large factor graph in eq. (25): https://ieeexplore.ieee.org/document/7248770\r\nThe usage of CS8 can help to reduce MPA complexity due to lower number of projection.\r\nSCMA with `number_of_users_per_resource > 6` isn't good system in practice due to very high complexity of MPA.\r\nThere are many different algorithms for large codebooks and factor graphs (sphere decoding, using FFT like as in LDPC decoding, etc.). I don't now details of implementation.\r\n\r\nCommon codebooks have (4, 6) factor graph and 4...16 codewords."}}
{"actor":{"display_login":"klimentyev"}}